-
segEEtest
my_seg_for_post_filtering_it is used for segmentation
- 2008-01-19 16:20:22下载
- 积分:1
-
paper1000
用于压缩感知信号重建的正则化自适应匹配追踪算法.pdf(Regularized Adaptive Matching Pursuit Algorithm for
Signal Reconstruction Based on Compressive Sensing)
- 2012-07-29 13:10:29下载
- 积分:1
-
clc
一个MUSIC算法的MATLAB实例,大家可以在此基础上进行适应性修改(MUSIC algorithm MATLAB instance, we can adapt based on)
- 2013-03-31 23:50:14下载
- 积分:1
-
MatlabRidgeDetection
Matlab多种图像边缘检测方法
1、用Prewitt算子检测图像的边缘
2、用不同σ值的LoG算子检测图像的边缘
3、用Canny算子检测图像的边缘
4、图像的阈值分割
5、用水线阈值法分割图像
6、对矩阵进行四叉树分解
7、将图像分为文字和非文字的两个类别
8、形态学梯度检测二值图像的边缘
9、形态学实例——从PCB图像中删除所有电流线,仅保留芯片对象(Matlab a variety of image edge detection method 1, using Prewitt operator edge detection image 2, with different values of σ LoG operator edge detection image 3, the detection operator Canny edge image 4, image segmentation threshold 5, water line image segmentation threshold 6, on the matrix quadtree decomposition of 7, the image is divided into text and non-text for these two types of 8, detection of morphological gradient of the edge binary image 9, morphological examples- from the PCB images to remove all current lines, retaining only the target chip)
- 2009-05-25 17:49:48下载
- 积分:1
-
read_ncdata
matlab7.11b 读取netcdf格式文件(matlab7.11b read netcdf files)
- 2012-06-12 14:16:20下载
- 积分:1
-
multiple-acess-tech-in-matlab-CDMA
multiple acess technewues coded in matlab
- 2013-03-06 17:21:41下载
- 积分:1
-
industrial-strength
eBook - Industrial Strength C++ - Visual C++ guide
- 2014-02-02 13:03:09下载
- 积分:1
-
gray-uniformization
MATLAB数字图像处理灰度均匀化gray uniformization(gray uniformization)
- 2015-04-09 19:13:15下载
- 积分:1
-
icp_matlab-
基于matlab的实现ICP算法,可读性强, 适合初学者(ICP algorithm based on the realization of matlab, readable, and suitable for beginners)
- 2011-11-18 14:53:26下载
- 积分:1
-
k-means
说明: k均值聚类算法(k-means clustering algorithm)是一种迭代求解的聚类分析算法,其步骤是,预将数据分为K组,则随机选取K个对象作为初始的聚类中心,然后计算每个对象与各个种子聚类中心之间的距离,把每个对象分配给距离它最近的聚类中心。(The k-means clustering algorithm is an iteratively solved clustering algorithm in which the data is pre-divided into K groups, the K objects are randomly selected as the initial clustering center, and then the distance between each object and the seed clustering center is calculated, and each object is assigned to the clustering center closest to it.)
- 2020-11-08 10:47:08下载
- 积分:1