direct3D technology in the 3ds document loading exaggerating category. Easy to u...

图像的预处理，读入彩色图像将其灰度化matlab 代码-matlab code

利用OpenCV进行轮廓提取，很好用！对于初学openCv的人来说是个很好的入门例程-Use OpenCV for contour extraction, very good use! OpenCv for the beginner who is a good entry-routine

XP界面画函数工具。-XP interface function painting tools.

java编写的关于图形的简单的粒子系统-prepared on the simple graphical particle system

用OpenCV实现图像灰度值调整-using OpenCV Image gray value adjustment

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

基于matlab的简易OCR程序。可通过MATLAB直接查看各子部分，-A simple OCR prorg

资源描述C#解析和生成二维码,这个可以方便地生成二维码和解析它，不可多得的资源，你值得拥有！！！！！！！！！！！！！！！！！！！！！！！！！！！！！！！

模范photoshop Filter的一个-model of a

用vc编写的手写字体识别程序，识别效率较高，可是识别数字和英文字母-Vc prepared with hand-written font identification procedures, to identify more efficient, but the identification numbers and letters of the alphabet