4.7 Article

Dimensionality Reduction of Hyperspectral Imagery Using Sparse Graph Learning

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/JSTARS.2016.2606578

Keywords

Classification; dimensionality reduction (DR); hyperspectral imagery; sparse graph

Funding

  1. National Basic Research Program (973 Program) of China [2013CB329402]
  2. National Natural Science Foundation of China [61573267, 61473215, 61501353]
  3. Fund for Foreign Scholars in University Research and Teaching Programs (the 111 Project) [B07048]
  4. Major Research Plan of the National Natural Science Foundation of China [91438201, 91438103]
  5. Program for Cheung Kong Scholars and Innovative Research Team in University [IRT1170]

Ask authors/readers for more resources

Combining with sparse representation, the sparse graph can adaptively capture the intrinsic structural information of the specified data. In this paper, an unsupervised sparse-graph-learning-based dimensionality reduction (SGL-DR) method is proposed for hyperspectral image. In SGL-DR, the sparse graph construction and projection learning are combined together in a unified framework and influence each other. During sparse graph learning, projected features are utilized to enhance the discriminant information in sparse graph. Likewise, in projection learning, the enhanced sparse graph could make projected features have high discriminant capacity. Besides, the spatial-spectral information in the original space combined with the structure information in the projected space is also exploited to learn the imprecise discriminant information. With the imprecise discriminant information, the projected space that is spanned by the projection matrix of the constructed sparse graph would contain abundant discriminant information, which is beneficial for hyperspectral image classification. Experimental results over two hyperspectral image datasets demonstrate that the proposed approach outperforms the other state-of-the-art unsupervised approacheswith a 10% improvement of the classification accuracy. Furthermore, it also outperforms those graph-based supervised methods with acceptable computational cost.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available