期刊
INTERNATIONAL JOURNAL OF REMOTE SENSING
卷 36, 期 11, 页码 2816-2830出版社
TAYLOR & FRANCIS LTD
DOI: 10.1080/01431161.2015.1043759
关键词
-
资金
- National Key Basic Research and Development Program of China [2013CB733404]
- Chinese National Natural Science Foundation [61271401, 61331016]
Spectral clustering is a very popular approach which has been successfully used in unsupervised classification of polarimetric synthetic aperture radar (PolSAR) imagery. However, due to its high computational complexity, spectral clustering can only be applied to small data sets. This article provides a framework for spectral clustering of large-scale PolSAR data. As computing and processing the pairwise-based affinity matrix is the bottleneck of the spectral clustering approach, we first introduce a representative points-based scheme in which a memory-saving and computationally tractable affinity matrix is designed. The subsequent spectral analysis can be solved efficiently. Second, a simple one-parameter superpixel algorithm is introduced to generate representative points. Through these superpixels, spatial constraints are also naturally integrated into the classification framework. We test the proposed approach on both airborne and space-borne PolSAR images. Experimental results demonstrate its effectiveness.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据