-
Photoshop
photoshop的各个效果的详细介绍,方便研究photoshop的各种算法,值得一看啊!!(photoshop detailed description of the various effects, photoshop various algorithms to facilitate research, worth ah! !)
- 2010-06-23 17:53:09下载
- 积分:1
-
color
简单图像颜色特征提取,用于自己使用,基本常规的那种(Simple Image Color Feature Extraction)
- 2019-05-12 21:48:25下载
- 积分:1
-
Canny_Improve
有关改良Canny算法的一些还算可以的文献(Improved Canny algorithm on some literature.)
- 2013-10-30 08:56:31下载
- 积分:1
-
Pilot
关于导频的算法,可以给一些新手提供一些帮助,但是不敢保证一定正确,请见谅(About pilots algorithm can give some newcomers to provide some help, but can not guarantee a certain right , please forgive me)
- 2014-06-05 18:41:38下载
- 积分:1
-
branch-cut
干涉合成孔径雷达成像的相位解缠的枝切法程序。(Interferometric synthetic aperture radar imaging of the phase unwrapping process of the branch-cut method.)
- 2008-01-15 16:00:59下载
- 积分:1
-
FaceDetect(mathworks)
Viola-Jones Fast Face Detection的matlab实现。(Viola-Jones Fast Face Detection Mex Implementation)
- 2009-07-06 14:00:49下载
- 积分:1
-
gaussianba
使用特征差别提取,通过特征差别相减,以去除高斯背景(Using the characteristics of different extraction, the characteristics of different background subtraction, to remove Gauss)
- 2014-01-07 17:31:17下载
- 积分: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
-
fus_segmentmain
图像分割源程序
通过融合处理,% image segmentation based on multispectral image fusion
% and morphology reconstruction watershed
% main program
(image segmentation source through fusion, % image segmentation based on multispectral im age fusion% and morphology reconstruction wat ershed% main program)
- 2007-05-31 16:38:07下载
- 积分:1
-
image_mosaicking_SURF
说明: 采用surf算法对两幅较低重叠度的图像进行拼接(Image mosaic using surf algorithm)
- 2019-01-04 17:38:29下载
- 积分:1