-
Matching-neighborhood-difference-
采用相邻一定距离的邻域图像差，提高了抗干扰能力，对亮度变化不敏感(Matching based on neighborhood difference feature)
- 2012-09-21 20:19:26下载
- 积分：1
-
hungarian-rvm
一种基于匈牙利算法和相关向量机的点模式匹配算法，可以有效解决点集的刚性和非刚性变换的参数求解问题。(A point set registration method based on Hungarian Algorithm and RVM which can well solve the parameters of rigid and non-rigid transform.)
- 2015-05-23 21:41:48下载
- 积分：1
-
src
SIFT代码，多用于图像拼接，匹配精度高(sciences code used for image stitching, matching high accuracy)
- 2021-04-11 22:08:57下载
- 积分：1
-
niqe_release
用于无参考帧图像质量评价的MATLAB程序，运行程序为example，输出图像的客观分值。(This is the matlab code of no-reference image qualituy assessment in space domain, th result ofthe program is the object acore of the image.)
- 2021-01-05 15:48:54下载
- 积分：1
-
yansejiansuo
基于颜色特征的图像检索系统，，做 了GUI节目，直观(Color-based Image Retrieval System, made a GUI program, intuitive)
- 2011-05-21 18:28:10下载
- 积分：1
-
CCD-principle
CCD工作原理教程
图像传感器原理介绍（CCD和CMOS介绍）(CCD image sensor principle works tutorial introduction (CCD and CMOS description))
- 2011-01-18 21:06:05下载
- 积分：1
-
第6次课程序
说明： 将两张图像进行图像相减或相处，使两张图片叠加。(The two images are subtracted or coexisted, so that the two images are superimposed.)
- 2019-04-10 21:44:48下载
- 积分：1
-
cvogelTV
大牛人的图象恢复代码．全变分离散化的方法．经典中的经典．(Daniudi people to restore the image code. BCH-wide variable separation method. Classic classic.)
- 2008-05-11 22:18:26下载
- 积分：1
-
object_tracking
对变化的视频序列进行对象追踪,检测边缘图象,对感兴趣的图象进行颜色约束.(Video sequences on the object change tracking, edge detection image, the color of images of interest bound)
- 2010-07-06 10:12:04下载
- 积分：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
