csgl development of the examples. Includes nehe, red book

ADI BLACKFIN 与MICRON 的CMOS SENSOR 的IIC驱动程序

图表编辑程序，VB源代码。-charts editor, VB source code.

国外的一个图像K均值聚类的C++源代码，非常容易集成和使用，适合模式识别、图像处理等方面的开发！-an image abroad of K-means clustering of C source code, and is easy to integrate and use, suitable for pattern recognition, Image processing, and other aspects of development.

用VC实现了Parzen窗估计了两个均匀分布-VC achieved using Parzen window estimates of two uniformly distributed

Tsai标定算法的精度验证程序，用matlab编写，可以画出重建图像-Tsai calibration algorithm for the accuracy of the verification process, the preparation of matlab, you can draw the reconstructed image

Asuo二维绘图控件 V2.0-Asuo 2D graphics Control V2.0

人脸检测与识别vc++源代码，希望大家喜欢-face detection and recognition vc source code, hope you like

都是关于Glscene的实例，刚开始学习，希望有更多的朋友参与-are on Glscene example, the beginning of the study, hopes to have more friends in

采用最新方差的方法求阀值,对图象进行分割,非常发使用-Using the latest methods for variance threshold for image segmentation, the use of a very fat

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