-
dakai
实现彩色图像的N*N 中值滤波器，可选择滤波系数。(To achieve the N* N color image median filter, selectable filter coefficients.)
- 2011-06-27 11:20:06下载
- 积分：1
-
MultiSqureArea
计算多边形面积的算法(polygon area calculation algorithm)
- 2005-02-02 15:07:08下载
- 积分：1
-
ImageProcess
26个不同影像处理程序,以VC++开发,是了解影像入门好帮手(26 different image processing procedures to VC++ Development is helpful to understand the image entry)
- 2007-12-19 10:28:27下载
- 积分：1
-
halcon
一个选择模板的匹配方式，附带视觉标定,可以自由的选择模板进行匹配(A matching pattern of selected templates with visual calibration)
- 2018-03-21 17:09:41下载
- 积分：1
-
efotoSource
摄影测量的一个开源代码，内部含有后方交会、前方交会、相对定向、立体量测、像点匹配等功能源代码。(An Photogrametry open source project, including intersection, relative oriention, stereo measure, image matching source code.)
- 2016-10-04 18:16:47下载
- 积分：1
-
visual-cPP-image-process
数字图像处理诸多算法源代码，图像处理的同学可以下载下来看看，适合初学者。(c++ code of digital image process )
- 2012-03-16 16:52:53下载
- 积分：1
-
平台基于visual studio2015 bilateralFilter
平台基于visual studio2015，使用opencv函数实现双边滤波，进行图像处理(bilateral Filter based on opencv)
- 2020-06-20 05:00:01下载
- 积分：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
-
Quadtree
完成对视频帧的四叉树分割，在纹理复杂处分割块较小，在纹理平坦处分割较大(Complete quadtree segmentation of video frames, complex area in texture segmentation smaller, flat larger regional segmentation block in texture)
- 2021-01-28 16:58:34下载
- 积分：1
-
CannycPP
c 实现 canny算子(c realize canny )
- 2016-04-11 15:44:07下载
- 积分：1
