登录
首页 » matlab » tuxiang

tuxiang

于 2013-10-18 发布 文件大小:182KB
0 219
下载积分: 1 下载次数: 6

代码说明:

  图像分割关系到目标识别的精度,是目标检测的关键一步,其中提供了一些图像分割的代码,主要为otsu算法的分割方法,很实用(s related to the accuracy of target recognition, image segmentation is a critical step in target detection, provides some image segmentation code, very useful)

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

发表评论

0 个回复

  • 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编写 ,很好的实现了,希望 对大家学习 有用(GA,Image Fusion Based on Genetic Algorithms)
    2019-06-12 19:06:17下载
    积分:1
  • main
    burg距离方位分别外推超分辨算法,实现对稀疏数据的超分辨成像。(burg extrapolation distance and orientation were super-resolution algorithm to achieve the super-resolution imaging sparse data.)
    2013-08-19 21:44:32下载
    积分:1
  • 6180007mean_shift
    传统的超像素分割方法,亲测能用。可以进行后续的使用(The traditional super pixel segmentation method can be used for affinity measurement.)
    2020-11-17 14:59:40下载
    积分:1
  • hm2_2
    读取一幅图像,对其进行DCT高通、低通滤波,输出处理后图像(Read an image, do the DCT high-pass, low-pass filtering, output processed image .)
    2015-01-09 21:49:39下载
    积分:1
  • 515030910511 exercise1
    检测图片中的角点,将图片读入后转换为灰度图以便处理。 2.通过用Dx=[-1,0,1;-2,0,2;-1,0,1]和灰度图片的矩阵卷积得到灰度图片在x方向上的导数矩阵Ix,矩阵中(i,j)处的元素代表灰度图片矩阵(i,j)处在x方向的导数Ix(Detection of corners in a picture)
    2018-06-13 16:04:45下载
    积分:1
  • WPF动画实例 Animation
    WPF动画实例 Animation
    2015-07-03下载
    积分:1
  • raw2bmp
    读取RAW格式文件,将其转换为BMP格式文件并存储,主要实现灰度图像的转换(Read the RAW format, convert it to BMP format file and stored, mainly to achieve the conversion of grayscale images)
    2011-11-08 10:36:16下载
    积分:1
  • Brief
    说明:  python实现的运用brief算法提取特征点的图像拼接(The implementation of Python using brief algorithm to extract feature points of image mosaic)
    2020-04-25 18:33:43下载
    积分:1
  • Coloring-Problem
    图着色问题(Graph Coloring Problem, GCP)又称着色问题,是最著名的NP-完全问题之一。路线着色问题是图论中最著名的猜想之一。(Graph coloring problem (Graph Coloring Problem, GCP), also known as coloring problem, is the most famous NP-complete problems. Line graph coloring problem is one of the most famous conjecture.)
    2013-08-23 23:01:42下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载