segmen

基于matlab的区域生长算法，可以对图像进行分割处理。 (Matlab-based region growing algorithm to the image segmentation.)

the code focus interest kernel decomposition

雷达/红外跟踪扩展卡尔曼滤波，望交流。(Radar infrared tracking extended Kalman filter)

非线性格兰杰granger因果关系检验，直接点击c-code文件夹下的hjt2_tval.exe即可(non-linear granger tests)

A suitable algorithm suggested with wavelet compression for gray scale images based on one- and two-dimension combined hierarchical structure, in the sub-band which has been generated by the aid of several types of wavelet functions. It is shown that the using of combined based hierarchical structures allows us to reduce the calculations complexity of compression and decompression at constant values of compression coefficients

非常有用的kalman滤波工具箱，含有很多matlab程序(Useful kalman filtering toolbox, containing a lot of matlab program)

说明：  数学实验matlab的好程序，给matlab的初学者(Good mathematical experiment matlab program to matlab for beginners)

RLS和LMS算法仿真，学通信的基础算法，已经运行过～()

最新的tesseract的vs2012平台下的源代码(The latest source code tesseract of vs2012)

传统的K-medoids聚类算法的聚类结果随初始中心点的 不同而波动，且计算复杂度较高不适宜处理大规模数据集； 快速K-medoids聚类算法通过选择合适的初始聚类中心改进 了传统K-medoids聚类算法，但是快速K-medoids聚类算法 的初始聚类中心有可能位于同一类簇。为了克服传统的K- medoids聚类算法和快速K-medoids聚类算法的缺陷，提出 一种基于粒计算的K-medoids聚类算法。(The traditional K-medoids clustering algorithm clustering results with different initial center points and volatility, and high computational complexity is not suitable for processing large data sets; K-medoids clustering algorithm by choosing proper initial cluster centers to improve the traditional K-medoids clustering algorithm, but the initial cluster center of K-medoids clustering algorithm can be located in the same cluster. In order to overcome the shortcomings of the traditional K- medoids clustering algorithm and the fast K-medoids clustering algorithm, a K-medoids clustering algorithm based on granular computing is proposed.)