Deakin University
Browse

File(s) under permanent embargo

Blind Spectral Unmixing Based on Sparse Nonnegative Matrix Factorization

journal contribution
posted on 2011-01-01, 00:00 authored by Zuyuan Yang, G Zhou, S Xie, S Ding, J M Yang, Jun Zhang
Nonnegative matrix factorization (NMF) is a widely used method for blind spectral unmixing (SU), which aims at obtaining the endmembers and corresponding fractional abundances, knowing only the collected mixing spectral data. It is noted that the abundance may be sparse (i.e., the endmembers may be with sparse distributions) and sparse NMF tends to lead to a unique result, so it is intuitive and meaningful to constrain NMF with sparseness for solving SU. However, due to the abundance sum-to-one constraint in SU, the traditional sparseness measured by L0/L1-norm is not an effective constraint any more. A novel measure (termed as S-measure) of sparseness using higher order norms of the signal vector is proposed in this paper. It features the physical significance. By using the S-measure constraint (SMC), a gradient-based sparse NMF algorithm (termed as NMF-SMC) is proposed for solving the SU problem, where the learning rate is adaptively selected, and the endmembers and abundances are simultaneously estimated. In the proposed NMF-SMC, there is no pure index assumption and no need to know the exact sparseness degree of the abundance in prior. Yet, it does not require the preprocessing of dimension reduction in which some useful information may be lost. Experiments based on synthetic mixtures and real-world images collected by AVIRIS and HYDICE sensors are performed to evaluate the validity of the proposed method.

History

Journal

IEEE Transactions on Image Processing

Volume

20

Issue

4

Pagination

1112 - 1125

Publisher

IEEE

Location

Piscataway, N. J.

ISSN

1057-7149

eISSN

1941-0042

Language

eng

Publication classification

C1.1 Refereed article in a scholarly journal

Copyright notice

2011, IEEE