SIFT Flow 源码

直方图修正和彩色变换的源程序-and color histogram that transform source

简单的opengl绘制一个小车，虽然不好看，但是象征性地满足键盘控制。供初学者学习交流，大家都可以进行完善。

基于定时器的实时曲线的绘制，动态产生三角波-Timer-based real-time Curve, dynamically generated triangular wave

人脸识别论文：《采用Adaboost算法进行面部表情识别》《动态权值预划分实值Adaboost人脸检测算法》《改进的AdaBoost分类器在视频中的体育场景检测》-Face recognition thesis: the use of Adaboost algorithm to identify facial expressions, dynamic weight pre-classified real Adaboost face detection algorithm, Improved AdaBoost classifier of sports in the video scene detection

一个动画源代码，可以通过调节X、Y轴速度-an animation source code can be adjusted by X, Y-axis velocity

利用C#与MapX结合，完成加载地图，并从数据库取出数据加载到地图上。-The use of C# With MapX combination of the completion of loading maps and retrieve data from the database to load into the map.

这是一个在windows中显示一个沿正弦曲线运动的圆的程序，是用VC＋＋编写的-This is a display in the windows along a sinusoidal curve campaign Yuan procedures, VC++ prepared

基于机器视觉的字符识别系统的设计和实现，毕业论文，希望能有所帮助-design and inplication of OCR system based on machine vision, may help you

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

图像的拉伸与点变换-image with the tensile point transformation