<；Visual C ldwordtuandtuangei >；配套光盘

朱丽娅图的绘制程序-Julia Map procedures

使用D3D从OBJ读取模型，代码由VC写成 读取后通过MESH建模-Use D3D read from the OBJ model, code written by the VC after reading through the MESH Modeling

A voxel example in C

基于ti5000系列dsp的无限冲击响应函数很实用-Ti5000 series based on the infinite impulse response functions dsp very practical

这是能实现水纹的程序，还有一些效果不错的特效-This is watermarked to achieve the procedure, there are some good effects results

一个关于超级链接控件的程序．-on a hyperlink control procedures.

基于OPENCV的人脸识别程序，已生成MFC界面，识别精度高

实现缺角立方体的旋转，VC实现，在WINXP上运行，缺角正方体可以绕X,Y,Z和中心进行旋转，画面清晰-realize na corner cube rotation, VC, in WINXP run, and none could be around the corner cube X, Y, Z and the center rotation, clear picture

利用图形的填充，字符可改-use graphics to fill the characters can be changed

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