实现BIG和GB间的转换

地质图像处理的源代码-geological image processing source code

dos下显示火焰特效,主要在dos下面的图像处理程序-display fire effect on DOS, a image processing program on DOS

一个进行图章识别的C＋＋类，主要采用图章图像的矩特征进行图章比对，涉及到图像特征提取与匹配。-identification seal for a C++ class, mainly stamp image features seal moment than right, relate to feature extraction and image matching.

NVIDIA SDK10 shadow map GLSL OpenGL

图形学的菜鸟，基本的画直线和圆的代码（我刚开始学习，请给个机会通过吧～！谢谢站长）-graphics guys, the basic linear and circular painting of the code (I have just started learning opportunities passage Qinggeigan ~! Thank you head)

VC的源程序，具体的大家看吧-VC source, the specific we mull

这是一个关于直方图的实验报告-This is a histogram of the experimental report

3D骨架提取的基本算法代码，将4种最常见的算法均包含在内。-3D skeleton extraction of the basic algorithm code, will be four kinds of the most common algorithms are included.

是耶鲁大学的人脸库，耶鲁大学的人脸库分为AB,这是A,B太大传不上来.-Yale University Face libraries, Yale University face database is divided into AB, which is A, B is not up too much mass.

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