Unsupervised Feature Extraction for Hyperspectral Imagery Using Collaboration-Competition Graph

被引:29
作者
Liu, Na [1 ]
Li, Wei [1 ]
Du, Qian [2 ]
机构
[1] Beijing Univ Chem Technol, Coll Informat Sci & Technol, Beijing 100029, Peoples R China
[2] Mississippi State Univ, Dept Elect & Comp Engn, Starkville, MS 39762 USA
基金
北京市自然科学基金; 中国国家自然科学基金;
关键词
Collaborative-competitive representation; feature extraction; hyperspectral imagery; manifold learning; signal processing on graph; DISCRIMINANT-ANALYSIS; DIMENSIONALITY REDUCTION; SPARSE; REGULARIZATION; CLASSIFICATION; REPRESENTATION; FRAMEWORK; ALGORITHM;
D O I
10.1109/JSTSP.2018.2877474
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Signal processing on graph offers the ability to define relationships of high-dimensional data on graph. In this paper, an unsupervised feature extraction method using graph for hyperspectral imagery is proposed, which incorporates collaborative representation using l(2)- norm regularization with locality constrained property into graph construction, named collaboration-competition preserving graph embedding. First, an undirected and weighted graph is constructed to exploit the data structure. Then, a weight matrix of edge in graph is built by formulating the combined collaborative-competitive representation into a convex optimization problem. The constructed graph is expected to reveal local intrinsic manifold and global geometry information of hyperspectral data. The superiority of the proposed graph-based unsupervised feature extraction method, compared with other traditional and state-of-the-art methods, is demonstrated by verifying the classification accuracy on four typical hyperspectral datasets.
引用
收藏
页码:1491 / 1503
页数:13
相关论文
共 44 条
[1]  
[Anonymous], 2003, Advances in Neural Informaiton Processing Systems
[2]   Laplacian eigenmaps for dimensionality reduction and data representation [J].
Belkin, M ;
Niyogi, P .
NEURAL COMPUTATION, 2003, 15 (06) :1373-1396
[3]  
Belkin M, 2006, J MACH LEARN RES, V7, P2399
[4]   Hyperspectral Image Classification via JCR and SVM Models With Decision Fusion [J].
Bo, Chunjuan ;
Lu, Huchuan ;
Wang, Dong .
IEEE GEOSCIENCE AND REMOTE SENSING LETTERS, 2016, 13 (02) :177-181
[5]   Atomic decomposition by basis pursuit [J].
Chen, SSB ;
Donoho, DL ;
Saunders, MA .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 1998, 20 (01) :33-61
[6]   Supervised Feature Extraction of Hyperspectral Images Using Partitioned Maximum Margin Criterion [J].
Datta, Aloke ;
Ghosh, Susmita ;
Ghosh, Ashish .
IEEE GEOSCIENCE AND REMOTE SENSING LETTERS, 2017, 14 (01) :82-86
[7]   Dimensionality Reduction and Classification of Hyperspectral Images Using Ensemble Discriminative Local Metric Learning [J].
Dong, Yanni ;
Du, Bo ;
Zhang, Liangpei ;
Zhang, Lefei .
IEEE TRANSACTIONS ON GEOSCIENCE AND REMOTE SENSING, 2017, 55 (05) :2509-2524
[8]   Fast Solution of l1-Norm Minimization Problems When the Solution May Be Sparse [J].
Donoho, David L. ;
Tsaig, Yaakov .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (11) :4789-4812
[9]   Sparse Subspace Clustering: Algorithm, Theory, and Applications [J].
Elhamifar, Ehsan ;
Vidal, Rene .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2013, 35 (11) :2765-2781
[10]   Kernel Principal Component Analysis for the Classification of Hyperspectral Remote Sensing Data over Urban Areas [J].
Fauvel, Mathieu ;
Chanussot, Jocelyn ;
Benediktsson, Jon Atli .
EURASIP JOURNAL ON ADVANCES IN SIGNAL PROCESSING, 2009,