-
rice
计算matlab自带米粒图像的米粒个数和面积的代码,适合图像处理的初学者(Calculate the matlab code number and area of its own grain of rice image of a grain of rice, for image processing beginners)
- 2012-12-05 15:41:38下载
- 积分:1
-
ColorMoments
提取图像RGB颜色空间内的颜色矩。颜色矩是图像重要的颜色特征,在图像检索、比对中具有重要作用。(Calculate the color moment of each color channel in RGB color space of an image)
- 2020-12-03 16:39:25下载
- 积分:1
-
Remote sensing
采用MFC,实现遥感图像的基本增强,滤波,变换等功能。还可以保存数据。(Using MFC, to achieve the basic enhancement of remote sensing images, filtering, transformation and other functions. You can also save data)
- 2020-12-21 14:29:08下载
- 积分:1
-
PCNN
说明: 一个pcnn方面的程序,比较原始,但是效果好(A PCNN procedures, more original, but effective)
- 2008-08-29 21:39:38下载
- 积分:1
-
LucasKanade
著名的LUCAS KANADE算法,用于图像匹配,跟踪,识别(LUCAS KANADE well-known algorithm for image matching, tracking, identification)
- 2007-09-28 20:05:18下载
- 积分:1
-
db97
DB97提升小波程序,实现任意偶数大小图像双正交97提升小波变换,比传统的CDF97卷积算法好(DB97 lifting wavelet procedures, arbitrary size images even biorthogonal wavelet transform 97 upgrade, than the traditional filter convolution algorithm good)
- 2006-08-11 11:31:18下载
- 积分:1
-
MRF-ICM
使用MRF进行SAR图像变化检测,能量最小化算法采用ICM(SAR image change detection uses MRF, energy minimization algorithm uses the ICM)
- 2020-10-18 10:27:26下载
- 积分:1
-
aa
说明: 小波模极大值用于边缘特征提取.很好的一个matlab算法,可以直接验证。(Wavelet modulus maxima for edge feature extraction algorithm matlab good one can be directly verified.)
- 2013-07-05 21:02:59下载
- 积分:1
-
一篇重要的角点检测文献的配套Matlab源码corner_detector_2004
这是2004年一篇重要的角点检测文献的配套Matlab源码。该算法的效果比SIFT、Harris、Susan等算法的检测效果更好。本压缩包中有从Matlab官方网站下载的源码,以及2004年那篇文献,对该算法做了详细解释。(This is 2004, an important corner detection literature supporting Matlab source code. Of the algorithm is better than SIFT, Harris, Susan, such as better detection algorithm. The compressed package from the official website to download the Matlab source code, and in 2004 came across the literature, the algorithm to do a detailed explanation.)
- 2021-01-09 17:48:51下载
- 积分:1
-
minimum-spanning-tree
在一个具有几个顶点的连通图G中,如果存在子图G 包含G中所有顶点和一部分边,且不形成回路,则称G 为图G的生成树,代价最小生成树则称为最小生成树。 (Has several vertices in a connected graph G, if there subgraph G ' contains all vertices of G and part of the side, and does not form a loop, called G' is a spanning tree of G, the minimum cost spanning tree is called minimum spanning tree.)
- 2013-08-23 23:06:57下载
- 积分:1