otsu

按照最邻近原则把待分类样本点分到各个簇。然后按平均法重新计算各个簇的质心，从而确定新的簇心。一直迭代，直到簇心的移动距离小于某个给定的值。(According to the nearest neighbor principle, the sample points to be classified are divided into clusters. Then the centroid of each cluster is recalculated according to the average method to determine the new cluster center. Iterate until the moving distance of the cluster center is less than a given value)

说明：  图像分割的MATLAB实现，效果很好，对光照有一定的适应性(Image Segmentation of MATLAB to achieve good effect on the light a certain degree of adaptability)

用MATLAB产生高斯白噪声，并画出其时域波形、自相关函数和功率谱。(MATLAB white noise)

读取dxf文件，并利用opencv画出2D形状(Read the DXF file, and draw a 2D shape using OpenCV)

给予matlab的JPEG压缩程序，包含原始压缩图片，程序对灰度bmp图片进行JEPG编码，压缩成以0101形式的编码。JPEG编码先把图象色彩RBG变成亮度Y和色度Cr、Cb，它利用人的视觉对色度不敏感的特点，减少一部分色度数据，以达到压缩。 JPEG采取多种编码方式，包含有行程编码(Run Length Coding)和哈夫曼(Huffman)编码，有很高的压缩比。在编码前，先对数据进行分块，离散余弦变换（DCT）及量化，保留能量大的低频信号，丢弃高频信号以达到压缩。(Given to the JPEG compression matlab program, contains the original compressed image, the program of the grayscale bmp picture JEPG encoded, compressed into a 0101 form of encoding. RBG color coded JPEG image into a first luminance Y and chrominance Cr, Cb, which uses the human visual characteristics is not sensitive to the color, reduce the number of color data to achieve compression. Take a variety of JPEG encoding, includes length coding (Run Length Coding) and Huffman (Huffman) coding, a high compression ratio. In the code before the data block, discrete cosine transform (DCT) and quantization, to retain a large low-frequency signal energy, discarding high-frequency signals in order to achieve compression.)

this code is for the paper of image segmentation based on level set methods. in this paper improves Tony Chan s paper and improves the speed.

图像处理基础程序,主要针对遥感影像处理。内含各种基础处理源码(matlab ,imagine analisy)

基于OTSU算法的图像分割工具，有原汁原味的OTSU和改进，可以作比较 (OTSU algorithm based on image segmentation tool, there is authentic OTSU and improvements can be compared)

KSVD算法的工具包，安装在matlab的相关路径下，可以直接调用。(KSVD algorithm Kit installed in the path of matlab can be called directly.)

说明：  使用硬/软阈值算法，求解各种不同范数约束问题，算法主要有三种(Contains three matrix completion algorithms and a demo script for running them. Also compares against other matrix completion algorithms - Singular Value Thresholding and Fixed Point Iteration.)