A performance guarantee for orthogonal matching pursuit using mutual coherence

DOI10.1007/S00034-017-0602-XMaRDI QIDQ2003290zbMATH OpenOpenAlexFDO

Authors Mohammad Emadi, Ehsan Miandji, Jonas Unger

Publication date 16 July 2019

Published in Circuits, Systems, and Signal Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1608.00381, http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-147092

zbMATH Keywords

sparse recoverycompressed sensingsparse representationorthogonal matching pursuit

Mathematics Subject Classification ID

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

Abstract: In this paper we present a new coherence-based performance guarantee for the Orthogonal Matching Pursuit (OMP) algorithm. An upper bound for the probability of correctly identifying the support of a sparse signal with additive white Gaussian noise is derived. Compared to previous work, the new bound takes into account the signal parameters such as dynamic range, noise variance, and sparsity. Numerical simulations show significant improvements over previous work.

Recommendations

• Tight recovery guarantees for orthogonal matching pursuit under Gaussian noise
• The exact recovery of sparse signals via orthogonal matching pursuit
• Robustness of orthogonal matching pursuit under restricted isometry property
• Sparse signals recovery from noisy measurements by orthogonal matching pursuit
• Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit

Cites work

• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• A sparse signal reconstruction perspective for source localization with sensor arrays
• Atomic Decomposition by Basis Pursuit
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Coherence-Based Performance Guarantees for Estimating a Sparse Vector Under Random Noise
• Compressed sensing
• Direction-of-Arrival Estimation of Wideband Signals via Covariance Matrix Sparse Representation
• Greed is Good: Algorithmic Results for Sparse Approximation
• Image Super-Resolution Via Sparse Representation
• Just relax: convex programming methods for identifying sparse signals in noise
• Least angle regression. (With discussion)
• Matching pursuits with time-frequency dictionaries
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Probability Inequalities for the Sum of Independent Random Variables
• Probing the Pareto frontier for basis pursuit solutions
• Sparse Reconstruction by Separable Approximation
• Sparse and redundant representations. From theory to applications in signal and image processing.
• Stable recovery of sparse overcomplete representations in the presence of noise
• Stable signal recovery from incomplete and inaccurate measurements
• Uncertainty principles and ideal atomic decomposition
• Underdetermined blind source separation using sparse representations

Cited in

(2)

• Coherence-Based Performance Guarantees for Estimating a Sparse Vector Under Random Noise
• Iterative identification for multiple-input systems with time-delays based on greedy pursuit and auxiliary model

Describes a project that uses

Uses Software

• CoSaMP
• SPGL1
• PDCO

This page was built for publication: A performance guarantee for orthogonal matching pursuit using mutual coherence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2003290)