交互式切割图像中指定区域，可用于图像拼接及合成

三维汉字显示，通过OPENGL技术显示汉字-Three-dimensional display of Chinese characters, Chinese characters through OPENGL technology show

这是图形学中关于圆生成算法的源程序，是结合了老师的意见后编写的。-This is the graphics on the circle of the source code generation algorithm is a combination of the views of teachers prepared.

Graph matching (GM) is a fundamental problem in computer science, and it plays a central role to solve correspondence problems in computer vision. GM problems that incorporate pairwise constraints can be formulated as a quadratic assignment problem (QAP). Although widely used, solving the correspondence problem through GM has two main limitations: (1) the QAP is NP-hard and difficult to approximate; (2) GM algorithms do not incorporate geometric constraints between nodes that are natural in computer vision problems. To address aforementioned problems, this paper proposes factorized graph matching (FGM). FGM factorizes the large pairwise affinity matrix into smaller matrices that encode the local structure of each graph and the pairwise affinity between edges. Four are the benefits that follow from this factorization: (1) There is no need to compute the costly (in space and time) pairwise affinity matrix; (2) The factorization allows the

利用C++编写，在MFC对话框中添加图像控件，利用opencv 获取摄像机并在控件中显示摄像机视频或图像，并且保存视频或图像。

供大家参考，如果可以可给我发电子邮件 kaximoduo2003@yahoo.com.cn 谢谢！-for your reference, if I can e-mail to kaximoduo2003@yahoo.com.cn Thank you!

数学3d的变换程序-mathematical transformation process

非常方便的光线测试追踪源代码,能够方便的较快的生成bmp图形.-very convenient light source code tracking test, to facilitate the rapid generation bmp graphic.

是一个很优秀的同名点匹配软件，对于要处理摄影测量左右相片的任务，此程序具有非常好的借鉴意义！-Is a very good point matching software of the same name, for Photogrammetry deal about photo mission, this program has a very good reference!

几何变换，能实现二维图像的平移，旋转和放缩功能。-geometric transformation, 2D images to achieve the translation, rotation and scaling functions.

在加权的有向图中，可以求出最大流路径，即求出从起点到终点权值之和最大的路径。-In weighted directed graph, we can derive maximum flow path, that is derived from the point of origin to their destination and the largest weight of the path.