登录
首页 » matlab » geometric_transformation

geometric_transformation

于 2018-05-22 发布 文件大小:69KB
0 75
下载积分: 1 下载次数: 4

代码说明:

  在空间域上进行特征提取,用于局部或全局的特征检测,结合广义高斯分布,实现图像的质量评价(Feature extraction is carried out on the spatial domain, which is used for local or global feature detection, and the image quality evaluation is realized by combining the generalized gaussian distribution.)

文件列表:

geometric transformation\1.jpg, 71644 , 2017-10-23
geometric transformation\mirroring.m, 1193 , 2018-05-10
geometric transformation\scale.m, 1551 , 2018-05-10
geometric transformation\translation.m, 1408 , 2018-05-10
geometric transformation\verticalmirror.m, 1221 , 2018-05-10
geometric transformation, 0 , 2018-05-15

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • Signal-Detection-in-NonGaussian-Noise-Kassam
    这是一部关于非高斯噪声中信号检测与估计的经典书籍,springer出版社出版,作者是S Kassam(This is a classical book about signal detection in non-Gaussian noise, by S Kassam)
    2021-05-13 23:30:02下载
    积分:1
  • Binarization-Transformation
    图像处理源程序,实现二值化变换,经一幅图像灰度化后,变成二值化图像,包括大津法、最大类间方差法、一般阈值法、及文本识别最有用的Niblack法(Image processing program and realized binarization transformation, after by a gray-scale image into binary image, including the Otsu method, Otsu method, the general threshold, and text to identify the most useful Niblack method)
    2011-11-19 09:53:11下载
    积分:1
  • denoising
    在matlab环境下基于数学形态学的图像去噪,传统去噪只选用一种结构元素,去噪效果并不理想,这种去噪方法实现简单,功能强大,无论对于高斯、椒盐、维纳等噪声都去有很强的去噪效果,且算法简单。(In the matlab environment based on mathematical morphology image denoising, denoising only use traditional elements of a structure, de-noising effect is not ideal, this denoising method is simple and powerful, both for the Gaussian, salt and pepper, Wiener such noise are to have a strong denoising effect, and the algorithm is simple.)
    2011-08-10 14:55:14下载
    积分:1
  • liangduzhengjia
    注意:本程序中,每点击一次“增加亮度”,图像灰度提升16;每点击一次“降低亮度”,图像灰度降低16。(Note : This procedure, every click an "increase in brightness," gray upgrade 16; Click on each of a "lower brightness," gray lower 16.)
    2006-12-05 09:50:59下载
    积分:1
  • siftp28pE7p94pA8pE4p
    说明:  SIFT用于图像全景拼接的源码,内附算法描述,很好用。(SIFT source code for image panorama stitching, containing algorithm descriptions, easy to use.)
    2011-04-01 22:02:31下载
    积分:1
  • Myimagesegemention
    VC图像处理中阈值变换,计算图像面积等适合初学者,有一定的指导意义(VC image processing threshold transform, calculating image size suitable for beginners, must have guiding significance)
    2009-03-27 15:39:06下载
    积分:1
  • ostu
    图象分割中应用较多的ostu大津阈值法,matlab源代码(Application of image segmentation ostu more Otsu threshold method, matlab source code)
    2021-03-01 11:19:35下载
    积分:1
  • edge-extraction
    亚像素提取边缘源代码,可以进行准确的边缘检测(Subpixel edge source code)
    2013-08-21 09:44:12下载
    积分:1
  • Kernel-Entropy-Component-Analysis
    这篇文章是一种特征降维的方法,不过跟一般的计较离散度的方法不同,这个特征变换的准则是:尽可能地保留原始样本的熵(Kernel Entropy Component Analysis Jenssen, R Pattern Analysis and Machine Intelligence, IEEE Transactions on Volume: PP , Issue: 99 )
    2015-12-01 19:27:42下载
    积分: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
  • 696521资源总数
  • 104062会员总数
  • 3今日下载