Self-dictionary sparse regression for hyperspectral unmixing: Greedy pursuit and pure pixel search are related
Publication in refereed journal

Times Cited
Altmetrics Information

Other information
AbstractThis paper considers a recently emerged hyperspectral unmixing formulation based on sparse regression of a self-dictionary multiple measurement vector (SD-MMV) model, wherein the measured hyperspectral pixels are used as the dictionary. Operating under the pure pixel assumption, this SD-MMV formalism is special in that it allows simultaneous identification of the endmember spectral signatures and the number of endmembers. Previous SD-MMV studies mainly focus on convex relaxations. In this study, we explore the alternative of greedy pursuit, which generally provides efficient and simple algorithms. In particular, we design a greedy SD-MMV algorithm using simultaneous orthogonal matching pursuit. Intriguingly, the proposed greedy algorithm is shown to be closely related to some existing pure pixel search algorithms, especially, the successive projection algorithm (SPA). Thus, a link between SD-MMV and pure pixel search is revealed. We then perform exact recovery analyses, and prove that the proposed greedy algorithm is robust to noise-including its identification of the (unknown) number of endmembers-under a sufficiently low noise level. The identification performance of the proposed greedy algorithm is demonstrated through both synthetic and real-data experiments.
All Author(s) ListFu X., Ma W.-K., Chan T.-H., Bioucas-Dias J.M.
Journal nameIEEE Journal of Selected Topics in Signal Processing
Volume Number9
Issue Number6
PublisherInstitute of Electrical and Electronics Engineers
Place of PublicationUnited States
Pages1128 - 1141
LanguagesEnglish-United Kingdom
KeywordsGreedy pursuit, hyperspectral unmixing, number of endmembers estimation, self-dictionary sparse regression

Last updated on 2020-21-11 at 01:30