登录
首页 » matlab » xibaojiancehelunkuofaxian

xibaojiancehelunkuofaxian

于 2021-01-31 发布 文件大小:44KB
0 201
下载积分: 1 下载次数: 24

代码说明:

  这是细胞边缘检测和找出细胞轮廓线的功能代码,可以很好的对细胞进行分割(This is the cell edge detection and contour lines to identify cell function code, a good division of cells)

文件列表:

细胞边缘检测新
..............\AreaLabel.m,1961,2011-06-21
..............\data_2_001.tif,63182,2008-06-03
..............\imoverlay.m,2441,2009-04-07
..............\segmentation.m,1007,2011-06-21
..............\the best .m,1207,2011-06-21

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

发表评论

0 个回复

  • Projects
    Restrccuturacion de suburvia y etc
    2014-11-12 21:52:10下载
    积分:1
  • watershed
    图像分割中的分水岭算法实现--图像灰度变化--图像增强--多维图像(Watershed image segmentation algorithm image change image enhancement multi-dimensional image)
    2008-06-03 00:05:55下载
    积分:1
  • rationAM45
    利用图像二值化方法对图像进行调幅加网,本程序实现了45度角度的调幅加网算法。(Use of the image binarization method of images in AM screening, the program achieved a 45 degrees angle of AM screening algorithm.)
    2021-04-28 13:08:43下载
    积分:1
  • LayerDrawable
    A Drawable that manages an array of other Drawables. These are drawn in array order, so the element with the largest index will be drawn on top.
    2014-02-25 11:22:22下载
    积分:1
  • FAST-ICA
    1、对观测数据进行中心化,; 2、使它的均值为0,对数据进行白化—>Z; 3、选择需要估计的分量的个数m,设置迭代次数p<-1 4、选择一个初始权矢量(随机的W,使其维数为Z的行向量个数); 5、利用迭代W(i,p)=mean(z(i,:).*(tanh((temp) *z)))-(mean(1-(tanh((temp)) *z).^2)).*temp(i,1)来学习W (这个公式是用来逼近负熵的) 6、用对称正交法处理下W 7、归一化W(:,p)=W(:,p)/norm(W(:,p)) 8、若W不收敛,返回第5步 9、令p=p+1,若p小于等于m,返回第4步 剩下的应该都能看懂了 基本就是基于负熵最大的快速独立分量分析算法(1, on the center of the observation data, 2, making a mean of 0, the data to whitening-> Z 3, select the number of components to be estimated m, setting the number of iterations p < -1 4, select an initial weight vector (random W, so that the Z dimension of the row vectors of numbers) 5, the use of iteration W (i, p) = mean (z (i, :).* (tanh ((temp) ' * z)))- (mean (1- (tanh ((temp)) ' * z). ^ 2)).* temp (i, 1) to learn W (This formula is used to approximate the negative entropy) 6 with symmetric orthogonal treatments W 7, normalized W (:, p) = W (:, p)/norm (W (:, p)) 8, if W does not converge, return to step 5 9 , so that p = p+1, if p less than or equal m, return to step 4 should be able to read the rest of the basic is based on negative entropy of the largest fast independent component analysis algorithm)
    2013-06-27 15:39:00下载
    积分:1
  • imageReadAndShow2
    imageReadAndShow2.cpp,读取asc文件,并在VTK中渲染显示...(read ASC File,using VTK)
    2011-05-26 15:38:29下载
    积分:1
  • Fusiello_epipolarrectification
    对立体视觉的双目图像进行极线校正,以实现双目致密匹配(Of three-dimensional visual image of the binocular epipolar rectification to realize dense binocular matching)
    2008-05-22 19:38:57下载
    积分:1
  • MaxAndMinCluster
    最大最小距离 聚类算法,可以对一维或者二维信号进行聚类分析。尤其是两类化情况较好时。(maxmum and minimum Cluster Algorithm)
    2010-03-10 15:33:16下载
    积分:1
  • 椭圆拟合
    二值化处理图像,自动拟合椭圆并得到长短轴的大小。(Automatically fit the ellipse and get the size of the long and short axes)
    2021-04-20 15:28:50下载
    积分:1
  • 3476562
    源码PonyProg2000-2 07a tar gz()
    2018-01-07 22:34:52下载
    积分:1
  • 696518资源总数
  • 106235会员总数
  • 12今日下载