Hyperspectral data dimensionality reduction based on non-negative sparse semi-supervised framework

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A non-negative sparse semi-supervised dimensionality reduction framework is proposed for hyperspectral data. The framework consists of two parts: 1) a discriminant item is designed to analyze the few labeled samples from the global viewpoint, which can assess the separability between each surface object; 2) a regularization term is used to build a non-negative sparse representation graph based on large scale unlabelled samples, which can adaptively find an adjacency graph for each sample and then find valuable samples from the original hyperspectral data. Based on the framework and the maximum margin criterion, a dimensionality reduction algorithm called non-negative sparse semi-supervised maximum margin criterion is proposed. Experimental results on the AVIRIS 92AV3C hyperspectral data show that the proposed algorithm can effectively utilize the unlabelled samples to obtain higher overall classification accuracy. © 2014 Springer International Publishing Switzerland.

Cite

CITATION STYLE

APA

Wang, X., Gao, Y., & Cheng, Y. (2014). Hyperspectral data dimensionality reduction based on non-negative sparse semi-supervised framework. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8588 LNCS, pp. 789–796). Springer Verlag. https://doi.org/10.1007/978-3-319-09333-8_86

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free