分形图形的vc实现

任意多边形面积计算源代码-arbitrary polygon area of the source code

寻找图象中图钉的中心点,文件中包含两个原文件和一个图象文件.-image pushpin find the focal point, the document contains two original documents and an image file.

压入区段端点的扫描线填充算法，vc编写，编译通过，希望对大家有用！-Pressure into the section of the scan line endpoint filling algorithm, vc prepared, the compiler is passed, everyone would like to be useful!

用C语言编写的电子时钟！-C language electronic clock!

ＯＣＲ文字识别程序，必须安装ｏｆｆｉｃｅ２００３　，安装的时候选择ｄｏｕｍｅｎｃｔ-OCR text recognition program, you must install office2003, when choosing to install doumenct

本程序主要介绍了碰撞检测算法及基于物理的建模方法-This procedure introduces a collision detection algorithm and physics-based modeling method

指纹识别程序-Fingerprint identification procedure

自己写的Bresenham画线算法，很简单但是很实用-Wrote it myself Bresenham line drawing algorithm, very simple but very practical

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

指纹识别的matlab源代码，希望对大家有用，欢迎下载。-Fingerprint recognition matlab source code, in the hope that useful to everybody, welcome to download.