晕线填充，线段交点计算，矩形，圆，椭圆，像素点的绘制，利用屏幕底色填充当前图元一达到删除图形的目的...

描述了如何在win开发环境下安装vtk图形开发包-Describes how to win the development environment installed vtk Graphic Development Kit

阵列式摄像头产生的立体视觉图像，彩色的-array camera produced a three-dimensional visual images, color

用VC＋＋编的计算机图形算法-with VC++ series of the computer graphics algorithms

xvid1.1.3最新的发布版本 修正了一些1.1.2 Release的BUG.-xvid1.1.3 the latest release version 1.1.2 Release amendments to a number of the BUG.

虚线填充五边形试验 ，用到了bresenham划线算法-dotted filled test uses bresenham crossed Algorithm

Visual C++图象处理程序.可以识别人的脸部.速度快.不过要用响应的库文件.-Visual C++ Image processing procedures. Can identify people in the face. Faster. But in response to the library file to use.

这是一个使用EBGfx库快速处理图象数据的程序，有需要的可以-It is a EBGfx for rapid image data processing procedures, it is necessary to look at the

MIT人工智能实验室的目标识别的源码，MATLAB版本的，非常适合计算机视觉方面的研究使用。-MIT artificial intelligence laboratory identification of the target source code, version of the MATLAB, very suitable for computer vision of study.

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

介绍如何在Linux下使用OpenCV的文章及附件了一些基本的源程序。-how to use Linux in OpenCV articles and annex some basic source.