.png){kind=icon}
返回
A context-sensitive clustering technique based on graph-cut initialization and expectation-maximization algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/LGRS.2007.905119.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This letter presents a multistage clustering technique for unsupervised classification that is based on the following: 1) a graph-cut procedure to produce initial segments that are made up of pixels with similar spatial and spectral properties; 2) a fuzzy c-means algorithm to group these segments into a fixed number of classes; 3) a proper implementation of the expectation-maximization (EM) algorithm to estimate the statistical parameters of classes on the basis of the initial seeds that are achieved at convergence by the fuzzy c-means algorithm; and 4) the Bayes rule for minimum error to perform the final classification on the basis of the distributions that are estimated with the EM algorithm. Experimental results confirm the effectiveness of the proposed technique.
Keyword:
clustering
expectation-maximization (EM) algorithm
remote sensing
segmentation
unsupervised classification
期刊
IF:
16.4
论文数:
1.0W
被引数:
5.1K
机构
引用论文
Evaluation of Captured Rainwater and Irrigation Runoff for Greenhouse Foliage and Bedding Plant Production.png)
HortScience
OAAI
HortScienceIF0
OAAI分享收藏分享收藏 没有更多内容
没有更多内容