-
ImageProcess
用mfc编程实现数字图像处理的一些简单操作，只能处理bmp格式图片。调节对比度、亮度、边缘检测等。(Mfc programming with some simple digital image processing operations, can only deal with bmp format images. Adjust contrast, brightness, edge detection.)
- 2011-06-28 01:22:34下载
- 积分：1
-
smooth
图像的平滑函数，对指定区域的图像，并有门限值和魔板大小限制。(the smooth of a bmp image)
- 2013-09-19 21:16:46下载
- 积分：1
-
polygon
一个计算多边形面积和周长的程序, 同时可以把多边形显示出来, 直观展现多边形形状.(A polygon area and perimeter calculation procedures, the polygons can be displayed simultaneously, intuitive show polygonal shape.)
- 2020-06-28 18:20:01下载
- 积分：1
-
histogrameq
VC做的图像处理方面的一些代码，仅供参考(VC do image processing of some code, only supplies the reference
)
- 2012-03-15 10:09:25下载
- 积分：1
-
opencv
基于opencv 实现毛衣的瑕疵检测 属于毕业设计 功能完整(it is perfect)
- 2012-04-02 19:06:07下载
- 积分：1
-
利用C++实现了BMP图像的读入和显示 BMPCode
利用C++实现了BMP图像的读入和显示利用C++实现了BMP图像的读入和显示利用C++实现了BMP图像的读入和显示(Use C++ achieve the BMP image to read and display BMP images using the C++ achieve to read and display BMP images using the C++ achieve to read and display)
- 2013-06-25 09:30:57下载
- 积分：1
-
Edge-Detection
边缘检测 Edge Detection Edge Detection(Edge Detection)
- 2014-05-08 13:49:15下载
- 积分：1
-
graphic
里面涉及了线宽线型的设置，各种图形，还有画笔画刷设置选择，颜色设置等，代码非常齐全，还有编程的每一步都有截图和说明(Which involves the linewidth linear settings, a variety of graphics, and brush brush settings selection, color settings, the code is very complete, and programming of every step have screenshots and description)
- 2014-12-14 20:30:20下载
- 积分：1
-
LMD
自己编写的数字图像处理程序，包括打开bmp图像，直方图，阈值分割，形态学处理等功能。(digital image processing procedures, including open bmp image, histogram, threshold segmentation, morphological processing and other functions.)
- 2013-11-14 22:17:45下载
- 积分：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
