华清远见LCD接口培训资料 ,PDF格式

OCR软件的源码-OCR software source code

形状分割的源代码-shape of the source code division

用纯c语言写的俄罗斯方块的游戏。功能强大，可以变更速度。-Pure c language game of Tetris. Powerful, can change the speed.

这是计算机图形学中对二位曲线进行旋转变换的源代码-This is the computer graphics of the two curves rotation transform the source code. .

VB 画三次参数样条曲线的小程序，比较精致:-)-VB painting three parameters- spline curves of small procedures, more refined :-)

彩色图像分割的图片-color photo image segmentation

泰勒展开NURBS曲线插补算法,图文并茂。-nurbs

一篇关于图像扭曲恢复的算法思想,主要用于高级验证码的识别分割部分-A distorted image restoration algorithms on the idea, mainly for high-level segmentation part of the identification code

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

基于ti5000系列dsp的无限冲击响应函数很实用-Ti5000 series based on the infinite impulse response functions dsp very practical