-
median
一维中值滤波方法去噪和二维中值滤波方法去噪!(denoise by median,can remove noise of 1D&2D!)
- 2011-08-06 13:06:51下载
- 积分:1
-
imagesegmentation
压缩文件里有四种图像分割的算法源代码,即阈值法、区域增长法、分裂合并法和K均值法。图片可用于检验。(The rar folder includes four source code of image segmentation,ie.thresholding, region growing, splitting and merging, kmeans. The images are able to be used for evaluation and verification. )
- 2010-06-24 07:10:57下载
- 积分:1
-
kmeans-image-segmentation
K-meansK均值聚类在无监督的情况下选择图像特征的算法(K-meansK means clustering in the case of unsupervised image feature selection algorithm)
- 2020-10-17 21:27:27下载
- 积分:1
-
watershed
风水岭图像分割
Image Segmentation by Watershed(Image Segmentation by Watershed)
- 2021-02-18 17:59:44下载
- 积分:1
-
chayingfa
说明: 根据差影法采取视频中两帧进行对比,得出差别的地方进行目标特征提取(Comparison of two frames in video based on difference method,And get the difference to extract the target features)
- 2020-04-29 12:38:59下载
- 积分:1
-
PhaseCongruency
提取图像相位一致性特征,进行图像配准,内附实验图片(Image feature extraction phase coherence)
- 2013-05-30 20:38:17下载
- 积分:1
-
5
直方图调整并显示对比,直方图调整后都需要对比一下调整前与调整后的区别,并显示。此程序适合初学者学习。(Histogram and adjust the display contrast)
- 2013-08-21 08:25:38下载
- 积分:1
-
soble-edge
matlab实现的soble算法,自己输入阈值,然后得到边缘提取图像(matlab achieved soble algorithm, input their own threshold, and then get the image edge detection)
- 2009-05-30 22:57:31下载
- 积分: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
-
DCTJPEG
blkproc.m,DCHuffmanEncoding.m,ACHuffmanEncoding.m,zigzag.m,PSNR.m,
对灰度图像进行DCT变换,量化,ZigZag扫描,Huffman编解码,反量化,反DCT变换而重建图像。
其中,blkproc.m为分块DCT变换函数;
DCHuffmanEncoding.m,ACHuffmanEncoding.m分别为DC和AC变换系数的Huffman码表函数;
zigzag.m为ZigZag扫描函数;PSNR.m为求图像峰值信噪比函数。
Copyright 2008 Reserved @ Wang Chengyou @ Tianjin University, P.R.China. (This function tests the DCTJPEG codec)
- 2013-03-24 12:06:34下载
- 积分:1