登录
首页 » matlab » 3253befc9e5c

3253befc9e5c

于 2012-06-06 发布 文件大小:26KB
0 109
下载积分: 1 下载次数: 5

代码说明:

  This code cano use thining an image

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

发表评论

0 个回复

  • Li-Yi-Wei-Texture-Synthesis
    基于样本的纹理合成加速方法,MRF,基于Li-Yi Wei的论文。(Acceleration method based on texture synthesis samples, MRF, based on Li-Yi Wei of paper.)
    2021-03-11 15:09:25下载
    积分:1
  • VesselSegmentation
    医学图像分割是数字图像分析中的重要环节,是长期以来国内外研究的热点问题,本代码专注于血管图像领域的分割。(Medical image segmentation is an important part of digital image analysis, is a hot topic at home and abroad for a long time, this code is to focus on areas of blood vessel image segmentation method.)
    2020-12-15 15:59:13下载
    积分:1
  • docking_window_demo
    这是一段视频分割的源代码 效果比较好 希望对大家有帮助(This is a video segmentation of the source code for the effect we hope to help)
    2013-05-09 16:42:36下载
    积分:1
  • ImageDivision
    System Generator中图像分割算法建模(Image segmentation algorithm for modeling in the System Generator)
    2020-10-23 20:27:22下载
    积分:1
  • Watermarking-in-contourlet-domain
    图像经过Contourlet变换后,加水印(After Contourlet transform images, add watermark)
    2011-08-08 20:23:15下载
    积分:1
  • Harris
    Harris角点检测程序(内附示例图像),利用鼠标在图像上选择提取交点的区域,进行角点提取。程序语言简洁,利于初学者学习。(Harris corner detection procedures (with sample images), using the mouse in the image on the choice of extraction point of intersection of the region, for Corner Detection. Programming language is simple and conducive to learning for beginners.)
    2008-07-18 10:35:38下载
    积分:1
  • OpenCVFaceDetectDirectShow小波分割算法
    说明:  OpenCV FaceDetectDirectShow小波图像分割算法(Wavelet image segmentation algorithm)
    2020-06-17 05:20:01下载
    积分:1
  • ENVI下温度植被干旱指数(TVDI)
    IDL平台环境下,envi温度植被干旱指数计算TVDI(Calculation of envi temperature and Vegetation Drought Index under IDL platform TVDI)
    2020-11-23 20:49:33下载
    积分:1
  • 3dwatershed
    用分水岭算法对三维模型进行分割处理。可以实现对三维模型的有意义分割。(Using three-dimensional model of the watershed algorithm to be dealt with separately. Three-dimensional model can achieve meaningful partition.)
    2009-01-13 20:29:26下载
    积分:1
  • K-means
    按照最邻近原则把待分类样本点分到各个簇。然后按平均法重新计算各个簇的质心,从而确定新的簇心。一直迭代,直到簇心的移动距离小于某个给定的值。(According to the nearest neighbor principle, the sample points to be classified are divided into clusters. Then the centroid of each cluster is recalculated according to the average method to determine the new cluster center. Iterate until the moving distance of the cluster center is less than a given value)
    2020-06-19 03:00:01下载
    积分:1
  • 696518资源总数
  • 104384会员总数
  • 26今日下载