waveletTexture

canny算法分割，本算法通过canny对图像进行分割，并提取边缘。()

说明：  基于surf算法的复制移动检测，此方法适合图像伪造研究者初级实验(Replication mobile detection based on surf algorithm)

基于MATLAB图像处理的车辆检测与识别（可以看看）基于MATLAB图像处理的车辆检测与识别（可以看看(MATLAB image processing based vehicle detection and recognition (can see) MATLAB image processing based vehicle detection and recognition (can see)

天津工业大学课程设计，内容包含vs2010对图像的灰度化，二值化，边缘检测。包含单纯c语言编写的对图像的灰度化，二值化，边缘检测的一个.C文件，可以直接用vc6.0运行，也可以直接在DSP上运行，还包含一份详细的设计报告。(Tianjin Polytechnic University curriculum design, content includes vs2010 grayscale image binarization, edge detection. Contains pure c language for image graying, binarization, edge detection is one. C file that can be run with vc6.0 can also be run directly on a DSP, also contains a detailed design report.)

算法实现消除小面积的区域,保留面积大的区域.对去除小斑点很稳健.(Algorithm to achieve the elimination of small areas of the region to retain the large area of the region. For the removal of small spots very sound.)

图像修复是对图像中破损区域进行信息填充，以减少图像破损所带来的信息损失的过程。 传统的图像修复方法需要依赖图像的具体结构来制定相应的修复方法，压缩感知理论的提出，使得可以利 用信号的稀疏性来对图像进行修复。基于K 奇异值分解（KSVD）与形态学成分分析（MCA，Morphological Component Analysis）的图像修复方法首先采用形态学成分分析方法对破损图像进行特征分析，将其分解 为结构部分和纹理部分；然后基于学习型字典KSVD分别对这两部分进行过完备字典训练；最后利用训练得 到的字典实现对破损图像的修复。相比于传统的图像修复方法，该方法具有适应性强、修复效果好等优点(Image inpainting is to fill the missing data in corrupted images and thus to reduce the information loss of damaged image. Traditional inpainting algorithms are dependent on specific structure of target images compressive sensing theory makes is possible to realized image inpainting with signal sparsity. This paper proposes a novel inpainting algorithm based on KSVD and MCA algorithm, which first decomposes the image into texture part and structure part, and then trains the two dictionaries for these two parts with KSVD and reconstructs the original image with these two trained dictionaries. Experiment indicates that the proposed algorithm is of better adaptability and performance as compared with traditional algorithms.)

采用Graph Cut算法进行multiple-label的图像分割，算法很完整，非常适合初学者以及开发人员参考(multiple-label image segmentation using Graph Cut based algorithm, suitable for beginners and developers)

图着色问题（Graph Coloring Problem, GCP）又称着色问题，是最著名的NP-完全问题之一。路线着色问题是图论中最著名的猜想之一。(Graph coloring problem (Graph Coloring Problem, GCP), also known as coloring problem, is the most famous NP-complete problems. Line graph coloring problem is one of the most famous conjecture.)

均值、中值、维纳、TV、小波五种图像去噪方法（matlab）.均经过运行调试。包括对五种方法的研究报告（word）。 (Mean, median, Wiener, TV, xiaobo five kinds of Wavelet Image Denoising (Matlab). Have been run debug. including The study of five ways (word).)

说明：  利用matlab计算时间序列间的DTW距离(Using MATLAB to calculate DTW distance between time series)