数字图像处理中用到的几乎所有的源代码!!!完全用Delphi实现.

一个五层楼的电梯模拟程序，用C语言实现，只能在TC2.0里面运行-floor of a five-story elevator simulation program with C language, which can only be run in the TC

计算三维数据的法矢量并进行调整，里面包括了自己做的实验数据和结果-Three-dimensional data, vector calculation method and make adjustments, which includes the make their own experimental data and results

一套水印源程序，做这个的朋友可以参考-a watermark source, so the friend can reference

验证码识别-Verification Code Recognition

通过重复使用一小块顶点缓冲来减少对内存的需求，将CPU从逐帧的顶点缓冲更新中释放出来-Through the repeated use of a small vertex buffer to reduce the demand for memory will be the culmination of CPU from the frame buffer update released

对于联系vc算法很有帮助的-linked vc algorithm helpful

ArcGIS E00格式数据读写VC代码-ArcGIS E00 format for reading and writing data VC code

程序里包含有一个读取DXF文件的动态库DXF.DLL,代码演示了如何利用该动态库实现对DXF文件夹的读取!-procedures Lane contains a read DXF file of the DXF.DLL. Demonstration of the code on how to use the dynamic for achieving the DXF file folders to read!

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

gaussian filter for image in c