极化sar处理

该函数用于简单背景下运动目标检测和轮廓提取，虽为简易实现，但效果不错，可根据个人需要添加代码(This function for a simple moving object detection and contour extraction, although it is easy to achieve, but good results can be based on individual need to add code)

去模糊的算法，有MIT做的，参考文献是siggraph06的文章，效果很好(Go fuzzy algorithms, MIT has to do the references are siggraph06 the article, very good)

对视频序列图像的压缩编码，采用了运动预测以增大压缩率(video image sequence coding used to forecast the movement increased compression rate)

hog 特征 基于matlab的 RGB提取(realize the hog feature)

2015年最新国外算法，基于加权视觉词典的人群密度估计(crowd entimatin by a weighted bag of visual word model)

基于椒盐噪声滤波的改进加权中值滤波算法,目的在于处理高浓度椒盐噪声，并且有效的保护边缘细节(salt and pepper noise filter and weighted)

基于matlab的加窗傅里叶，使用了hanning窗(Matlab-based windowed Fourier, using the hanning window)

一个基于帧间差分的目标跟踪matlab源代码，解压后可直接运行，对学习跟踪有重大帮助(Frame difference of a target tracking based on matlab source code, extract can be directly run a major help in learning track)

一种基于匈牙利算法和相关向量机的点模式匹配算法，可以有效解决点集的刚性和非刚性变换的参数求解问题。(A point set registration method based on Hungarian Algorithm and RVM which can well solve the parameters of rigid and non-rigid transform.)

输入一个带权无向图的顶点数、边数、各条边信息（两个顶点和权值），建立该图的邻接矩阵结构，输出该邻接矩阵。将上述无向图邻接矩阵转换为邻接表结构，输出该邻接表；根据该邻接表对无向图进行深度优先遍历序列和广度优先遍历序列，并输出遍历结果；用prim算法实现构造该带权无向图的最小生成树，并将该最小生成树的各条边信息输出。(Enter a weighted undirected graph with vertices, edges, each of the side information (two vertices and weights), the establishment of the adjacency matrix structure, the output of the adjacency matrix. The above undirected graph adjacency matrix into adjacency list structure, the output of the adjacency list according to the adjacency table undirected graph depth-first traversal sequence and breadth-first traversal sequence, and outputs through the results using prim algorithm construct the weighted undirected graph minimum spanning tree, and the minimum spanning tree information on respective sides of the output.)