LSH_MATLAB

提取二值图像中的所有非零点坐标，进行矩阵标准化，最后进行二次曲线拟合(Extracting the binary image of all non-zero coordinates, matrix standardized last quadratic curve fitting)

k均值用于图像分割，对于相同颜色但深度不一样可以分割。(k-means for image segmentation, the same color depth can be split.)

根据D. Comaniciu, P. Meer: Mean Shift: A robust approach toward feature space analysis 以及 C. Christoudias, B. Georgescu, P. Meer: Synergism in low level vision.这两篇文献提供的方法编写的图像分割代码，作者是 Chris M. Christoudias, Bogdan Georgescu，代码经我看了后加了丰富的中文注释，希望可以给各位带来阅读上的方便。 基于meanshift的聚类分割方法包括滤波、区域融合等操作，通过调整sigma和sigmar来调整分割效果。(According to D. Comaniciu, P. Meer: Mean Shift: A robust approach toward feature space analysis, and C. Christoudias, B. Georgescu, P. Meer: Synergism in low level vision. These two documents prepared by the methods provided by image segmentation code , the author is Chris M. Christoudias, Bogdan Georgescu, after I read the code, add a rich Chinese notes, hoping to bring you the convenience of reading. Segmentation method based on clustering meanshift including filtering, regional integration and other operations, and by adjusting the sigma sigmar to adjust segmentation results.)

用于图像特征提取的基于gabor小波变换，进行各种特征提取(Gabor wavelet transform for image feature extraction for various feature extraction)

m_map使用方法详细介绍，采用matlab下载世界地图，可以获取海岸线等数据库(M_map uses the method to introduce in detail, uses the MATLAB to download the world map.)

给予偏微分方程的图像处理一书中的实验代码很全面 (Given partial differential equations of image processing of the experimental code book is very comprehensive)

快速检测复制粘贴图片，用于检测图像是否为复制粘贴伪造的(This program detect the copy-move forgery in images as described)

基于块的OMP算法，相对传统的OMP算法速度很快！(Batch-based OMP algorithm,execution quickly than the comman OMP algorithm.)

利用python和opencv拼接两张图片(Splicing two pictures using Python and opencv)

在一个具有几个顶点的连通图G中，如果存在子图G 包含G中所有顶点和一部分边，且不形成回路，则称G 为图G的生成树，代价最小生成树则称为最小生成树。 (Has several vertices in a connected graph G, if there subgraph G ' contains all vertices of G and part of the side, and does not form a loop, called G' is a spanning tree of G, the minimum cost spanning tree is called minimum spanning tree.)