OPENGL开发的一个小例子程序,对于初学者有很重要的帮助.

一个图形处理的小程序的源代码，非常小，没有图形界面-a small graphics program"s source code is very small, no graphical interface

凸显边缘检测与提取及轮廓跟踪，Hough变换，种子填充-Highlight the edge detection and contour extraction and tracking, Hough transform, seed filling

图像抖动,有多种算法可以选择-image jitter, a variety of algorithms can choose

精细绘图及动画 制个程序是本人自己编写，所以这里能后做出详细解释。程序运行后会在屏幕上用triplex_font显示“press any key for set off”，下方是用基本的线条画出的发射架（有点粗糙），即程序中的DrawGun()函数，当按下任意键后，将在发射架上方出现一个用横线填充的飞机，同时背景被繁星填充，此时必须按住任意键不放，否则飞机将不会发射。发射完成后，即飞机坐标小于0，将出现一句话："successfully!!!,press ESC to quit",若中途按ESC退出，则飞机Y坐标不小于0，将出现"failue,..."这句话。-sophisticated graphics and animation system procedure is the preparation of my own, here is an ability to make a detailed explanation. After running on the screen with triplex_font shows that the "press any key for set off", is the bottom line with the basic head of the launcher (somewhat rough), that the procedures DrawGun () function, when pressed any button, will be on the launch pad tower side there with a hyphen Filled with the aircraft, while the background was filled with stars, this time to be arbitrary button is pressed it, it will not launch aircraft. Fired Upon completion, the coordinates of the aircraft is less than 0, there will be one sentence : "successfully! ! ! , Press ESC to

对任意多边形进行切割，求其相交部分,相交部分用红色线段标出。-draw two polygon and then they can cut each other.The color of intersected parts are red.

如何获取屏幕上各颜色的红、绿、蓝值-how to access the colors on the screen in red, green and blue values

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

Landscape rendering using Voxels in C

图像线性增强-Linear image enhancement

简单的人物脸部特征检测,采用OPENCV库-Simple characters facial features detection, the use of OPENCV library