登录
首页 » matlab » sauvola

sauvola

于 2021-02-03 发布 文件大小:1KB
0 150
下载积分: 1 下载次数: 134

代码说明:

  用于对图像进行分割的算法的一种,对部分类型图像处理较好 (For the image segmentation algorithm a kind type of image processing on the part of good)

文件列表:

sauvola.m,2116,2010-08-27

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

发表评论

0 个回复

  • SVM
    说明:  自己编的SVM代码,适合初学者,多多关注,,(SVM learning, suitable for beginners, rich code, SVM code, suitable for beginners, more attention)
    2020-10-19 16:40:52下载
    积分:1
  • Stationary-wavelet-transform
    平稳小波变换的matlab程序 还包括去噪 什么的应用(Stationary wavelet transform denoising matlab program also includes the application of what)
    2011-04-24 18:22:06下载
    积分:1
  • 1122
    crimini算法对图形进行修复,您能够充分的利用空间信息,纹理信息(crimini graph algorithm to repair, you can take full advantage of the spatial information, texture information)
    2013-06-21 11:08:33下载
    积分:1
  • 配准校正
    利用matlab对已知多对控制点的情况下进行两张图像校正,该算法能够取得较好的结果(Using matlab to correct two images when multiple pairs of control points are known.The algorithm can get good results.)
    2020-12-30 21:59:00下载
    积分:1
  • zhang-s-method-master
    说明:  张正相机标定,用c++编程,亲证有用,里面有实际的图片,大家可以直接俄使用(Zhang zheng method it is very useful for camera detecting and it contains many pictures i hope you will get help from it)
    2020-04-27 23:34:47下载
    积分:1
  • svt
    利用 svt算法解决 Rpca算法的放缩问题,牛刀小试,大家见谅!(Solves the Robust PCA relaxation)
    2020-06-29 04:00:02下载
    积分:1
  • 卷积特征可视化
    说明:  利用卷积神经网络进行特征提取,并将卷积特征可视化(Feature extraction using convolutional neural networks and visualization of convolution features)
    2019-03-06 12:07:28下载
    积分:1
  • meng_cv
    chan-vese几何活动轮廓提取 讲物体的裂痕非常精准的提取出来 非常经典的并且最新的代码 可供参考 (chan-vese geometric active contour extraction rift speak very precise object extracted from a very classic and the latest code for reference)
    2013-09-15 15:09:47下载
    积分:1
  • pca_bp
    本程序采用pca提取人脸特征,采用人工神经网络识别人脸。(This procedure using pca face feature extraction, using artificial neural network recognition face. )
    2012-08-18 16:49:25下载
    积分:1
  • matlab 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资源总数
  • 104269会员总数
  • 31今日下载