A kernel spatial complexity-based nonlinear unmixing method of hyperspectral imagery

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

Abstract

In the hyperspectral analysis, the spatial correlation information is potentially valuable for hyperspectral unmixing. In this paper, we propose a new model, denoted "kernel spatial complexity-based nonnegative matrix factorization" (KSCNMF), to unmix the nonlinear mixed data. The method is derived in the feature space, which is kernelized in terms of the kernel functions in order to avoid explicit computation in the high-dimension feature space. In the algorithm, input data are implicitly mapped into a high-dimensional feature space by a nonlinear mapping, which is associated with a kernel function. As a result the high order relationships and more useful features between the spectral data can be exploited. Experimental results based on a set of simulated data and a real hyperspectral image demonstrate that the proposed method for decomposition of nonlinear mixed pixels has excellent performance. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Wu, X., Li, X., & Zhao, L. (2010). A kernel spatial complexity-based nonlinear unmixing method of hyperspectral imagery. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6330 LNBI, pp. 451–458). https://doi.org/10.1007/978-3-642-15615-1_53

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