用vc++编写的人脸识别系统软件，用于人脸图像的识别

这个应用程序可以改变鼠标光标的形状，您可以设置它为您喜欢的形状，使用起来会更加得心应手一点◎！-the application can change the shape of the mouse cursor, you can set it to the shape you like, and it would be more handy 1:00 Scholar!

将照片通过扫描仪将其录入到计算机中，通过程序处理，能很好的实现多幅图像的无缝拼合-photos through scanners to input to the computer, through procedures that will achieve a number of very good image of a seamless mosaic

计算机图形学中种子填充方法用visual C++实现，实现四边形填充 -Computer Graphics in the seed filling Methods visual C++ Realize, realize quadrilateral filling

一个dos下的c语言仿windows界面，用在一个pII+128MRAM+dos+640*480*8+pc104总线工控机上，主要用了自己写的几个画图函数,技术上很简单。因为一些原因，很多东西删掉了。可以拿去参考-a dos c language of imitation windows interface used in a Arrears 128MRAM dos 640* 480* 8 Module Bus Computer, the principal used their written several drawing function, technically very simple. For some reason, many things deleted. Reference can be found

图像识别程序,数字图像处理,源代码及资料-image identification procedures, digital image processing, and information source

图像处理技术已经渗透到人类生活的各个领域并得到越来越多的应用，图像处理所涉及的图像格式有很多种，如TIF、JEMP、BMP等等，工程应用中经常要处理256级的灰度BMP图像，如通过黑白采集卡采集得到的图像-image processing technology has been integrated into all areas of life and to be more and more applications, image processing involved in the format images can take many forms, such as TIF, JEMP, BMP, etc., engineering applications often have to deal with 256 Gray BMP images, such as through black-and-white collection in acquisition card The images

三维自由形状变形，在计算机图形学和动画中应用很多。-3D Free Form Deformaiton

opengl 例2 本例源自OpenGL 应用程序开发 2-opengl samples-2

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

atically delete the directory of debug and release, so please do not put