Next Article in Journal
Species Richness (of Insects) Drives the Use of Acoustic Space in the Tropics
Next Article in Special Issue
A Hyperspectral Imaging Approach to White Matter Hyperintensities Detection in Brain Magnetic Resonance Images
Previous Article in Journal
A GIS-Based Procedure for Landslide Intensity Evaluation and Specific risk Analysis Supported by Persistent Scatterers Interferometry (PSI)
Previous Article in Special Issue
Nonnegative Matrix Factorization With Data-Guided Constraints For Hyperspectral Unmixing
Article Menu
Issue 11 (November) cover image

Export Article

Open AccessArticle
Remote Sens. 2017, 9(11), 1094;

Hashing Based Hierarchical Feature Representation for Hyperspectral Imagery Classification

1,2,3,* , 1,2,3
Image Processing Center, School of Astronautics, Beihang University, Beijing 100191, China
Beijing Key Laboratory of Digital Media, Beihang University, Beijing 100191, China
State Key Laboratory of Virtual Reality Technology and Systems, School of Astronautics, Beihang University, Beijing 100191, China
Mathematics Department, Mellon College of Science, Carnegie Mellon University, Pittsburgh, PA 15213, USA
Author to whom correspondence should be addressed.
Received: 24 September 2017 / Revised: 19 October 2017 / Accepted: 24 October 2017 / Published: 27 October 2017
(This article belongs to the Special Issue Hyperspectral Imaging and Applications)
Full-Text   |   PDF [2853 KB, uploaded 27 October 2017]   |  


Integrating spectral and spatial information is proved effective in improving the accuracy of hyperspectral imagery classification. In recent studies, two kinds of approaches are widely investigated: (1) developing a multiple feature fusion (MFF) strategy; and (2) designing a powerful spectral-spatial feature extraction (FE) algorithm. In this paper, we combine the advantages of MFF and FE, and propose an ensemble based feature representation method for hyperspectral imagery classification, which aims at generating a hierarchical feature representation for the original hyperspectral data. The proposed method is composed of three cascaded layers: firstly, multiple features, including local, global and spectral, are extracted from the hyperspectral data. Next, a new hashing based feature representation method is proposed and conducted on the features obtained in the first layer. Finally, a simple but efficient extreme learning machine classifier is employed to get the classification results. To some extent, the proposed method is a combination of MFF and FE: instead of feature fusion or single feature extraction, we use an ensemble strategy to provide a hierarchical feature representation for the hyperspectral data. In the experiments, we select two popular and one challenging hyperspectral data sets for evaluation, and six recently proposed methods are compared. The proposed method achieves respectively 89.55%, 99.36% and 77.90% overall accuracies in the three data sets with 20 training samples per class. The results prove that the performance of the proposed method is superior to some MFF and FE based ones. View Full-Text
Keywords: hashing ensemble; hierarchical feature; hyperspectral classification hashing ensemble; hierarchical feature; hyperspectral classification

Graphical abstract

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Share & Cite This Article

MDPI and ACS Style

Pan, B.; Shi, Z.; Xu, X.; Yang, Y. Hashing Based Hierarchical Feature Representation for Hyperspectral Imagery Classification. Remote Sens. 2017, 9, 1094.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Remote Sens. EISSN 2072-4292 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top