Backtracking-based simultaneous orthogonal matching pursuit for sparse unmixing of hyperspectral data

DOI10.1155/2015/842017zbMath1395.94127OpenAlexW1591002963WikidataQ59119643 ScholiaQ59119643MaRDI QIDQ1666730

Fanqiang Kong, Wenjun Guo, Yunsong Li, Xin Liu, Qiu Shen

Publication date: 27 August 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2015/842017

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (1)

An overview on linear unmixing of hyperspectral data

Uses Software

• USGS Spectral Library

Cites Work

• Algorithms for simultaneous sparse approximation. I: Greedy pursuit
• Nonnegative matrix factorization for spectral data analysis
• Greed is Good: Algorithmic Results for Sparse Approximation
• Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
• Sparse and Redundant Representations
• A Convex Analysis-Based Minimum-Volume Enclosing Simplex Algorithm for Hyperspectral Unmixing
• Theoretical Results on Sparse Representations of Multiple-Measurement Vectors
• Subspace Pursuit for Compressive Sensing Signal Reconstruction
• An Augmented Lagrangian Approach to the Constrained Optimization Formulation of Imaging Inverse Problems
• Sparse Demixing of Hyperspectral Images
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Adaptive greedy approximations

This page was built for publication: Backtracking-based simultaneous orthogonal matching pursuit for sparse unmixing of hyperspectral data