Feature extraction by linear spectral unmixing

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

Abstract

Linear Spectral Unmixing (LSU) has been proposed for the analysis of hyperspectral images, to compute the fractional contribution of the detected endmembers to each pixel in the image. In this paper we propose that the fractional abundance coefficients to be used as features for the supervised classification of the pixels. Thus we compare them with two well-known linear feature extraction algorithms: Principal Component Analysis (ICA) and Independent Component Analysis (ICA). A specific problem of LSU is the determination of the endmembers, to this end we employ two approaches, the Convex Cone Analysis and another one based on the detection of morphological independence. © Springer-Verlag 2001.

Cite

CITATION STYLE

APA

Graña, M., & D’Anjou, A. (2004). Feature extraction by linear spectral unmixing. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3213, 692–698. https://doi.org/10.1007/978-3-540-30132-5_95

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