BMP ASC

图像处理的几个常用小函数-several image processing functions commonly used small

Canny边检测算法的实现-Canny edge detection algorithm to achieve

计算机图形学之多边形绘制的源码及其程序。-Computer graphics rendering of the source polygon and its procedures.

计算机图形学――立方体旋转-computer graphics-- rotating cube

数字图像处理（朱志刚）-Digital Image Processing (Zhu Zhigang)

中点画圆，直线，bresenham画圆以及直线-midpoint Circle, Line, Circle and straight bresenham

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

应用背景                                                                                                                                                                                                                  恩。关键技术主要用数组加数学函数编写了高斯函数矩阵，效果图可用3d显示界面看，中可控变量为方便调用，暂时编写为常量，使用者可以适当根据自己的使用范围做调整。

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

在WINDOWS中编程任意旋转位图-in WINDOWS programming arbitrary rotating bitmap