Linear Hyperspectral Unmixing Using L0-norm Approximations and Nonnegative Matrix Factorization


Autoria(s): Esmaeili Salehani, Yaser
Contribuinte(s)

Queen's University (Kingston, Ont.). Theses (Queen's University (Kingston, Ont.))

Data(s)

05/10/2016

05/10/2016

05/10/2016

05/10/2016

Resumo

Spectral unmixing (SU) is a technique to characterize mixed pixels of the hyperspectral images measured by remote sensors. Most of the existing spectral unmixing algorithms are developed using the linear mixing models. Since the number of endmembers/materials present at each mixed pixel is normally scanty compared with the number of total endmembers (the dimension of spectral library), the problem becomes sparse. This thesis introduces sparse hyperspectral unmixing methods for the linear mixing model through two different scenarios. In the first scenario, the library of spectral signatures is assumed to be known and the main problem is to find the minimum number of endmembers under a reasonable small approximation error. Mathematically, the corresponding problem is called the $\ell_0$-norm problem which is NP-hard problem. Our main study for the first part of thesis is to find more accurate and reliable approximations of $\ell_0$-norm term and propose sparse unmixing methods via such approximations. The resulting methods are shown considerable improvements to reconstruct the fractional abundances of endmembers in comparison with state-of-the-art methods such as having lower reconstruction errors. In the second part of the thesis, the first scenario (i.e., dictionary-aided semiblind unmixing scheme) will be generalized as the blind unmixing scenario that the library of spectral signatures is also estimated. We apply the nonnegative matrix factorization (NMF) method for proposing new unmixing methods due to its noticeable supports such as considering the nonnegativity constraints of two decomposed matrices. Furthermore, we introduce new cost functions through some statistical and physical features of spectral signatures of materials (SSoM) and hyperspectral pixels such as the collaborative property of hyperspectral pixels and the mathematical representation of the concentrated energy of SSoM for the first few subbands. Finally, we introduce sparse unmixing methods for the blind scenario and evaluate the efficiency of the proposed methods via simulations over synthetic and real hyperspectral data sets. The results illustrate considerable enhancements to estimate the spectral library of materials and their fractional abundances such as smaller values of spectral angle distance (SAD) and abundance angle distance (AAD) as well.

Thesis (Ph.D, Electrical & Computer Engineering) -- Queen's University, 2016-10-05 09:34:35.463

Identificador

http://hdl.handle.net/1974/15072

Idioma(s)

en

en

Relação

Canadian theses

Direitos

Queen's University's Thesis/Dissertation Non-Exclusive License for Deposit to QSpace and Library and Archives Canada

ProQuest PhD and Master's Theses International Dissemination Agreement

Intellectual Property Guidelines at Queen's University

Copying and Preserving Your Thesis

This publication is made available by the authority of the copyright owner solely for the purpose of private study and research and may not be copied or reproduced except as permitted by the copyright laws without written authority from the copyright owner.

Palavras-Chave #Non-negative matrix factorization #linear mixing model #sparse spectral unmixing #Lp-norm #Hyperspectral imaging #Arctan function #L0-norm
Tipo

Thesis