A Dictionary-Based Generalization of Robust PCA Part II: Applications to Hyperspectral Demixing

Abstract

We consider the task of localizing targets of interest in a hyperspectral (HS) image based on their spectral signature(s), by posing the problem as two distinct convex demixing task(s). With applications ranging from remote sensing to surveillance, this task of target detection leverages the fact that each material/object possesses its own characteristic spectral response, depending upon its composition. However, since $\text{signatures}$ of different materials are often correlated, matched filtering-based approaches may not be apply here. To this end, we model a HS image as a superposition of a low-rank component and a dictionary sparse component, wherein the dictionary consists of the $\text{a priori}$ known characteristic spectral responses of the target we wish to localize, and develop techniques for two different sparsity structures, resulting from different model assumptions. We also present the corresponding recovery guarantees, leveraging our recent theoretical results from a companion paper. Finally, we analyze the performance of the proposed approach via experimental evaluations on real HS datasets for a classification task, and compare its performance with related techniques.

arXiv comment13 pages; Index Terms - Hyperspectral imaging, Robust-PCA, Dictionary Sparse, Matrix Demixing, Target Localization, and Remote Sensing

References in corpus (14)

• Rank-Sparsity Incoherence for Matrix Decomposition
• Fast low-rank estimation by projected gradient descent: General statistical and algorithmic guarantees
• Compressive Hyperspectral Imaging with Side Information
• Robust PCA via Outlier Pursuit
• Simultaneously sparse and low-rank abundance matrix estimation for hyperspectral image unmixing
• Low-rank Solutions of Linear Matrix Equations via Procrustes Flow
• An Overview of Robust Subspace Recovery
• Recovery of Low-Rank Plus Compressed Sparse Matrices with Application to Unveiling Traffic Anomalies
• Randomized Robust Subspace Recovery for High Dimensional Data Matrices
• Identifying Outliers in Large Matrices via Randomized Adaptive Compressive Sampling
• NOODL: Provable Online Dictionary Learning and Sparse Coding
• Semi-blind Source Separation via Sparse Representations and Online Dictionary Learning
• A Dictionary Based Generalization of Robust PCA
• Target-based Hyperspectral Demixing via Generalized Robust PCA

Cited by in corpus (1)

• An iterative coordinate descent algorithm to compute sparse low-rank approximations