-
wtcl1
应用Intel® JPEG Library v1.5处理图像的例子(Using Intel® JPEG Library v1.5 to process image.)
- 2009-06-02 21:23:23下载
- 积分：1
-
Normal_estimation
基于PCL的估算散乱点云的法矢量，并进行颜色渲染显示(estimation of normal vectors for point clouds and color rendering display based on PCL)
- 2018-03-16 21:10:32下载
- 积分：1
-
VisualCDigitalImageProcessing
这本是用VC++来实现图像处理的书藉,对于学习图像处理的来说是非常有用的.(This is VC++ to realize image processing books, for learning image processing is very useful.)
- 2009-04-18 10:44:05下载
- 积分：1
-
Mirror_DImageProcess
这个实例就像一个魔镜一样，能把原始图像照出各种变换效果,是基于MFC的多文档应用程序(This example is like a mirror,which can convert original image according to a variety of effects)
- 2013-11-29 16:23:24下载
- 积分：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
-
bgslibrary_x86_v1.9.2
bgslibrary_x86_v1.9.2,是MFC的实现文件，包含37种背景减除算法，对于做目标提取的研究非常有用。(The BGSLibrary was developed by Andrews Sobral and provides an easy-to-use C++ framework based on OpenCV to perform background subtraction (BGS) in videos. )
- 2015-12-22 20:33:52下载
- 积分：1
-
Canny
用Canny算子提取边缘 用Canny算子提取边缘(Using Canny edge extraction Using Canny edge extraction Using Canny edge extraction Using Canny edge extraction Using Canny edge extraction)
- 2013-07-12 18:17:10下载
- 积分：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
-
MyFFT1
VC和MATLAB混合编程实现快速傅立叶变换(VC and MATLAB programming Fast Fourier Transform Mixed)
- 2021-03-04 19:09:32下载
- 积分：1
-
algorithm-of-findpath
绣花问题是连续型的填充，在不同区域的缝制过程中，缝针不能提针，因此不能用一般的离散型区
域填充方法处理。本文运用几何计算和图论理论提出了一个绣花缝针轨迹自动生成算法：先对轮廓走向进行
定义，通过轮廓铅垂方向的局部极值点的分割线将图案从上向下进行分割，采用交点的特征值比较彻底的解
决了分割时的重点问题，将图案区域准确的划分成缝针能一次完成的若干个节点。在此基础上根据节点的邻
接关系建立节点的邻接“图”，通过图论中半哈密尔顿路径或深度遍历方法找到节点的遍历（缝制）序列和每
个节点的缝制方向，最后可对设定的起点、终点和缝针间隔的条件自动提供缝针的走向轨迹。(In the process of embroidering, needle can not hang up for changing to a different area. Therefore, Embroider
problem could be abstract as a continuous area-filling work. Considering disperse area-filling methods can not process this
problem well. Based on geometry computing and graph theory, an algorithm of finding path of embroidering needle are
proposed in this paper. First, outline orientations are defined, and finding all local extreme points of inner outline on their
gravitational orientation to build sectioning lines so as to divide the picture. By using intersection point character the
overlap point problem was solved perfectly. Therefore, the picture is divided into some nodes which can be finished alone.
Then, based on connections of these nodes, an adjacency graph of nodes was built. Using half-Hamilton path or depth-first
search method, both embroidering sequence and direction of these nodes could be got from the graph. Finally, from a
defined start-point, end-point)
- 2012-12-09 23:26:22下载
- 积分：1
