登录
首页 » matlab » duochidushang

duochidushang

于 2010-04-19 发布 文件大小:126KB
0 224
下载积分: 1 下载次数: 1

代码说明:

说明:  提出了一种基于数学形态学的多尺度熵权边缘检测方法。信息熵为图像的内在特性,由它来决定不同结构元 素所提取的边缘在最终合成边缘中所占的比重,是自适应的和客观的(A multi-scale based on mathematical morphology edge detection method of entropy. Information entropy inherent characteristics of the image, from which different structural elements to determine the edge of the extracted edge in the final synthesis of proportion, is adaptive and objective)

文件列表:

基于数学形态学的多尺度熵权边缘检测方法.pdf

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

发表评论

0 个回复

  • image
    简单的图形处理程序 传上来提供给更多人学习 欢迎大家交流代码(Simple graphics program available to more people pass up study welcome to share code)
    2011-10-27 16:49:42下载
    积分:1
  • Digital_watermark_processing
    基于matlab仿真的数字水印源程序以及仿真结果,可用于毕业设计论文以及课题设计参考学习!(Matlab simulation based on digital watermarking, as well as simulation results source, can be used for graduate thesis and design subject design study!)
    2008-05-13 14:10:08下载
    积分:1
  • demoBagSVM
    一种基于半监督的svm的图像分类方法。该方法通过聚类核的方法利用无标记样本局部正则化训练核的表达式。这种方法通过图像直接学习一个自适应的核。该程序仿真的是文章:Semi-supervised Remote Sensing Image Classification with Cluster Kernels。大家可以参考下。(A semi-supervised SVM is presented for the classification of remote sensing images. The method exploits the wealth of unlabeled samples for regularizing the training kernel representation locally by means of cluster kernels. The method learns a suitable kernel directly from the image, and thus avoids assuming a priori signal relations by using a predefined kernel structure. Good results are obtained in image classification examples when few labeled samples are available. The method scales almost linearly with the number of unlabeled samples and provides out-of-sample predictionsds)
    2013-09-03 10:44:56下载
    积分:1
  • CV-model-source-code
    CV模型源代码, 用水平集进行图像分割。一个经典的算法。(matlab source code of CV model)
    2011-06-30 22:06:21下载
    积分:1
  • GaborVessel
    利用gabor滤波器方法提取视网膜血管,在提取之前进行预处理。gabor滤波器参数选择的是3个角度,12个方向(Gabor filter method is utilized to extract the retinal blood vessels, preprocessing before extraction. Gabor filter parameter selection are three angles, 12 direction )
    2015-12-23 15:23:17下载
    积分:1
  • matlab-basic-insar
    源程序为MATLAB代码,主要功能是对干涉SAR数据的基本处理。(The source code for the MATLAB code, the main function is to interferometric SAR data processing.)
    2020-12-06 22:49:21下载
    积分:1
  • RVM-hyperspectral
    基于相关向量机的高光谱图像分类算法,functions中是用到的函数,另一个文件夹是主程序。(RVM hyperspectral image classification algorithm, functions are functions used, another folder is the main program.)
    2017-02-16 12:53:51下载
    积分:1
  • halcon-添加畸变及畸变矫正
    用halcon给实际采集的图像进行畸变矫正,然后可以再人为添加一定程度的畸变,以便于定量研究,可运行已调试,可作为学习参考(Halcon is used to correct the distortion of the image collected, and then the human can add some degree of distortion to facilitate quantitative research. It can be run and debugged, and can be used as a reference for study)
    2017-11-01 14:42:02下载
    积分:1
  • 平台基于visual studio2015 medianBlur
    平台基于visual studio2015,使用opencv函数实现中值滤波,进行图像处理(median blur 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
  • 696516资源总数
  • 106914会员总数
  • 0今日下载