sift算法资料大全，包括论文和代码，中文和英文全有，还有两个实现代码...

给用ObjectARX开发AutoCAD初学者的一个例子,说明如何定义自定义实体-to use AutoCAD beginners ObjectARX an example on how to define custom entities

用VC编写的，可以实现平移和旋转-prepared by the VC, can achieve translation and rotation

图像处理方法的基本框架（可实现基本的图像处理功能，包括图像增强、图像点等）

a research about cloud detection

三维地形实时显示的核心技术研究，用vc++编写-Real-time display of three-dimensional topography of the core technology research, with vc++ Prepared

1.源程序中有些工程是使用的GB18030编码，有些用的是UTF-8编码，如果有汉字不能识别的情况，请切换编码。 2.源程序有些使用的是KDevelop编辑，有些是eclipse或Visual Studio 2008编辑，所以目录结构可能有些不同。 3.所有工程只保留了源代码，没有执行文件，请自行编译。

二维平面多边形布尔运算，高速，有效，可用于平面字体处理，矢量图处理等-Two-dimensional polygon Boolean operations, high-speed, effective treatment can be used to print fonts, vector processing

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

动态绘图，并将结果保存在数据表格中。从CODEPROJECT上下载的。-Dynamic graphics, and the results stored in the data table. Downloaded from the CODEPROJECT.

intel jpeg library内含document和vc samples-document library containing samples and vc