Share Email Print

Proceedings Paper

Fast algorithm for searching endmember set per pixel
Author(s): Nareenart Raksuntorn; Qian Du
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Linear mixture model (LMM) is widely used in remote sensing image analysis. In the original LMM, it is assumed that each pixel is a linear combination of all the endmember signatures. For an image scene covering a large geospatial area, the number of endmembers is quite large but only a small subset of these endmembers may actually participate in the composition of a specific pixel. If all the endmembers are used in the spectral unmixing process, the result may contain additional estimation error. The Multiple Endmember Spectral Mixture Analysis (MESMA) approach has been proposed which allows the endmember subset to be varied from pixel to pixel. We have developed approaches that can automatically search for an endmember subset for each pixel from a large number of endmembers for the entire image scene, without the limitation on the number of endmembers to be included. Due to high computational complexity, in this paper, we will develop a fast searching algorithm by considering the neighborhood relationship among pixels. We will show that the resulting endmember sets can reduce pixel reconstruction error and improve the quality of estimated abundances (i.e., all the pixels have nonnegative abundances and most of pixels have sum-to-one abundances).

Paper Details

Date Published: 12 May 2010
PDF: 8 pages
Proc. SPIE 7695, Algorithms and Technologies for Multispectral, Hyperspectral, and Ultraspectral Imagery XVI, 76951P (12 May 2010); doi: 10.1117/12.850339
Show Author Affiliations
Nareenart Raksuntorn, Mississippi State Univ. (United States)
Qian Du, Mississippi State Univ. (United States)

Published in SPIE Proceedings Vol. 7695:
Algorithms and Technologies for Multispectral, Hyperspectral, and Ultraspectral Imagery XVI
Sylvia S. Shen; Paul E. Lewis, Editor(s)

© SPIE. Terms of Use
Back to Top