Paper
11 April 2008 A full algorithm to compute the constrained positive matrix factorization and its application in unsupervised unmixing of hyperspectral imagery
Author Affiliations +
Abstract
This paper presents a full algorithm to compute the solution for the unsupervised unmixing problem based on the positive matrix factorization. The algorithm estimates the number of endmembers as the rank of the matrix. The algorithm has an initialization stage using the SVD subset selection algorithm. Testing and validation with real and simulated data show the effectiveness of the method. Application of the approach to environmental remote sensing is shown.
© (2008) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Yahya M. Masalmah and Miguel Veléz-Reyes "A full algorithm to compute the constrained positive matrix factorization and its application in unsupervised unmixing of hyperspectral imagery", Proc. SPIE 6966, Algorithms and Technologies for Multispectral, Hyperspectral, and Ultraspectral Imagery XIV, 69661C (11 April 2008); https://doi.org/10.1117/12.779444
Lens.org Logo
CITATIONS
Cited by 18 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Data modeling

Error analysis

Hyperspectral imaging

Data analysis

Computer simulations

Image processing

Remote sensing

Back to Top