地质图像处理的源代码

jpeg2000中的熵解码中MQ解码器，在H.264.MPEG4都有所应用，这是在ADI blackfin535平台下的-JPEG2000 Entropy decoding MQ decoder, both in H.264.MPEG4 applications, this is the ADI blackfin535 platform

VB写的用来控制各种摄像头的代码-VB was used to control the various camera code

face & serial & tracking

一个简单的画图程序-This is a simple programme for drawing.

单幅图像基础上的交通事故现场三维重建的硕士论文-3d

vega prime 中将屏幕中心点的屏幕坐标转化为世界坐标并且将其值实时显示在屏幕左下角-vega prime focal point of the screen will be the screen coordinates into world coordinates and its value in real-time displayed in the lower-left corner of the screen

vtk中关于vtkImagePlaneWidget的使用，有很大的参考价值-VTK on vtkImagePlaneWidget use, has great reference value

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

Canny边缘检测，在人脸识别是一个比较经典的计算方法，写论文可以参考一下。-Canny edge detection, in the face recognition is a more classic method of calculating and writing papers for reference.

数字图像处理中用到的几乎所有的源代码!!!完全用Delphi实现.-digital image processing used in almost all of the source code! ! ! Complete with Delphi.