-
DyBMPMovie
实现“动态”的位图动画，VC++经典编程学习源码，很好的参考资料。(The realization of "dynamic" bitmap animation, VC++ classic learning programming source code, a good reference.)
- 2013-11-25 12:37:28下载
- 积分：1
-
Canny
Canny边缘检测算法,已经试过，可以用。能较好的检测边缘。(Canny edge detection algorithm, has been tried, you can use. To better edge detection.)
- 2010-09-28 14:42:46下载
- 积分：1
-
IPLib
基于VC++的RGB-IHS 变换实现过程和主成分分析 PCA 实现过程 .(The implementation process based on VC++ RGB-the IHS transform and principal component analysis PCA implementation process.)
- 2021-01-07 22:58:53下载
- 积分：1
-
image-matching-using-surf-and-ransac
对两幅图像进行配准，分别提取两幅图像的surf特征点以及描述子，得到粗匹配结果，然后根据粗匹配结果，采用ransac方法计算基础矩阵，并去除误匹配点，得到较准确匹配结果(Two image registration, surf was extracted from the feature points in two images to get the coarse matching and descriptor, then according to the results, the coarse matching results, using RANSAC method to calculate the fundamental matrix, and eliminate the error matching, gain a more accurate matching results)
- 2020-11-13 13:59:43下载
- 积分：1
-
Saolei
一个扫雷应用程序，在VC下开发，用来提高编程水平(A de-mining applications, developed in the VC used to improve the programming level)
- 2007-11-23 11:11:51下载
- 积分：1
-
TMyPolyStockh
实现凸多边形排样，使用临界多边形NFP判断两个凸多边形形是否相交,使用启发式算法提高效率，
(Convex polygon nesting, polygon NFP to determine whether two convex polygon-shaped intersection, the use of heuristic algorithms to improve efficiency,)
- 2021-03-30 22:59:09下载
- 积分：1
-
GraphCut
图像分割经典算法GraphCut的实现代码，亲测可用。(An implementation of GraphCut Algorithm, which is a classical method in image segmentation field.)
- 2020-09-29 17:27:43下载
- 积分：1
-
Coltransfer
一个vc编的图像处理的程序，处理不同颜色图像(a series of image processing procedures for handling images in different colors)
- 2007-04-01 07:34:09下载
- 积分：1
-
DebugDemo
设置位置断点跟踪程序，VC++精选编程源码，很好的参考资料。(Set breakpoint location tracking procedures, VC++ programming source code, a good reference.)
- 2013-11-26 09:57:15下载
- 积分：1
-
Graph
输入一个带权无向图的顶点数、边数、各条边信息（两个顶点和权值），建立该图的邻接矩阵结构，输出该邻接矩阵。将上述无向图邻接矩阵转换为邻接表结构，输出该邻接表；根据该邻接表对无向图进行深度优先遍历序列和广度优先遍历序列，并输出遍历结果；用prim算法实现构造该带权无向图的最小生成树，并将该最小生成树的各条边信息输出。(Enter a weighted undirected graph with vertices, edges, each of the side information (two vertices and weights), the establishment of the adjacency matrix structure, the output of the adjacency matrix. The above undirected graph adjacency matrix into adjacency list structure, the output of the adjacency list according to the adjacency table undirected graph depth-first traversal sequence and breadth-first traversal sequence, and outputs through the results using prim algorithm construct the weighted undirected graph minimum spanning tree, and the minimum spanning tree information on respective sides of the output.)
- 2020-12-13 15:29:15下载
- 积分：1
