Classification of Hyperspectral image based on superpixel segmentation and DPC algorithm

In this paper, we propose an algorithm named SS_DPC for hyperspectral image classification. First, the image is segmented into hyperpixels according to spatial and spectral information, which are used as basic units for clustering instead of pixels. Computing the inner product of the local density and the minimum inter_cluster distance for each unit, Density peaks clustering (DPC) algorithm sorts products in descending order and selects the globally optimal solutions as cluster centers. The following conclusions have been verified through experiments:(1)Proper quantity of superpixel (K value) can improve the consistency between clustering results and actual values effectively.(2)Image segmentation can weaken the interference of abnormal data, so the ARI values of SS_DPC, SS_K_Means are higher than that of K_Means significantly.(3)SS_DPC algorithm is much better than other clustering algorithms in precision and robustness.

[1]  Yongzhao Zhan,et al.  Hyperspectral image classification using multilayer superpixel graph and loopy belief propagation , 2015, 2015 IEEE International Geoscience and Remote Sensing Symposium (IGARSS).

[2]  A. Aydin Alatan,et al.  Efficient graph-based image segmentation via speeded-up turbo pixels , 2010, 2010 IEEE International Conference on Image Processing.

[3]  Delbert Dueck,et al.  Clustering by Passing Messages Between Data Points , 2007, Science.

[4]  Mario Parente,et al.  Uniformity-Based Superpixel Segmentation of Hyperspectral Images , 2016, IEEE Transactions on Geoscience and Remote Sensing.

[5]  Umar Mohammed,et al.  Superpixel lattices , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[6]  Rama Chellappa,et al.  Entropy-Rate Clustering: Cluster Analysis via Maximizing a Submodular Function Subject to a Matroid Constraint , 2014, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  Kang Sun,et al.  Exemplar Component Analysis: A Fast Band Selection Method for Hyperspectral Imagery , 2015, IEEE Geoscience and Remote Sensing Letters.

[8]  Adolfo Martínez Usó,et al.  Clustering-Based Hyperspectral Band Selection Using Information Measures , 2007, IEEE Transactions on Geoscience and Remote Sensing.

[9]  Dorin Comaniciu,et al.  Mean Shift: A Robust Approach Toward Feature Space Analysis , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  Qian Du,et al.  A joint band prioritization and band-decorrelation approach to band selection for hyperspectral image classification , 1999, IEEE Trans. Geosci. Remote. Sens..

[11]  Sean Hughes,et al.  Clustering by Fast Search and Find of Density Peaks , 2016 .

[12]  Luc Vincent,et al.  Watersheds in Digital Spaces: An Efficient Algorithm Based on Immersion Simulations , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[13]  Pascal Fua,et al.  SLIC Superpixels Compared to State-of-the-Art Superpixel Methods , 2012, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[14]  Chein-I Chang,et al.  Constrained band selection for hyperspectral imagery , 2006, IEEE Transactions on Geoscience and Remote Sensing.