KMP

图像平移处理，可以图片进行平移变换处理，提供演示图片(Image translation process, it can image pan transformation process provides demonstration image)

VC.NET图象处理,采用基于CImage类的图象处理技术,封装的函数为基本的图象处理部分,如几何变换等等,开发环境为VC++.NET(VC.NET image processing, based on CImage kind of image processing technology, Packaging for the basic functions of image processing, such as geometric transformation, and so on, the environment for the development of the VC.NET)

提取SIFT特征，进行特征提取和匹配，包括特征点的定位，特征点描述子的生成，特征点的匹配，(extract SIFT feature，and feature matching)

关于MC三维重建算法的二义性消除的文章，很好的消除了MC算法中的二义性(it s the article about Three-dimensional reconstruction algorithm to eliminate ambiguity in MC)

OPENCV图像处理模板，有界面编程的，以后运用opencv直接在里面填写代码就可以了(OPENCV image processing template, with interface programming, and after using opencv code directly on the inside can be a complete)

26个不同影像处理程序,以VC++开发,是了解影像入门好帮手(26 different image processing procedures to VC++ Development is helpful to understand the image entry)

VisualC++数字图像处理技术详解第2版光盘-第五章(VisualC++ digital image processing technology Detailed Version 2 CD- Chapter V)

一种基于non-sample的纹理合成demo，程序性能还有待优化，效果还不错.(texture synthesis demo.)

算法实现消除小面积的区域,保留面积大的区域.对去除小斑点很稳健.(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.)

输入一个带权无向图的顶点数、边数、各条边信息（两个顶点和权值），建立该图的邻接矩阵结构，输出该邻接矩阵。将上述无向图邻接矩阵转换为邻接表结构，输出该邻接表；根据该邻接表对无向图进行深度优先遍历序列和广度优先遍历序列，并输出遍历结果；用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.)