Hyperspectral image segmentation with low-rank representation and spectral clustering

Hyperspectral image segmentation is considered in this paper. A low-rank representation method is applied first to extract major data information, followed by a spectral clustering method based on data graph. Segmentation accuracy can be further improved by a post-processing step using non-local majority voting. Experimental results demonstrate that the proposed method can improve segmentation accuracy for complicated image scenes.

[1]  Jitendra Malik,et al.  Normalized Cuts and Image Segmentation , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  Michael I. Jordan,et al.  On Spectral Clustering: Analysis and an algorithm , 2001, NIPS.

[3]  Jean-Michel Morel,et al.  A non-local algorithm for image denoising , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).

[4]  Jon Atli Benediktsson,et al.  Spectral–Spatial Classification of Hyperspectral Imagery Based on Partitional Clustering Techniques , 2009, IEEE Transactions on Geoscience and Remote Sensing.

[5]  G. Sapiro,et al.  A collaborative framework for 3D alignment and classification of heterogeneous subvolumes in cryo-electron tomography. , 2013, Journal of structural biology.

[6]  Yong Yu,et al.  Robust Recovery of Subspace Structures by Low-Rank Representation , 2010, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  José V. Manjón,et al.  MRI denoising using Non-Local Means , 2008, Medical Image Anal..

[8]  Yi Ma,et al.  Robust principal component analysis? , 2009, JACM.

[9]  Qian Du,et al.  Decision Fusion on Supervised and Unsupervised Classifiers for Hyperspectral Imagery , 2010, IEEE Geoscience and Remote Sensing Letters.