Orthogonal Matching Pursuit With Thresholding and its Application in Compressive Sensing
From MaRDI portal
Publication:4580862
DOI10.1109/TSP.2015.2453137zbMATH Open1394.94661arXiv1307.1949OpenAlexW2962861956MaRDI QIDQ4580862FDOQ4580862
Authors: Mingrui Yang, F. R. De Hoog 
Publication date: 22 August 2018
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Abstract: Greed is good. However, the tighter you squeeze, the less you have. In this paper, a less greedy algorithm for sparse signal reconstruction in compressive sensing, named orthogonal matching pursuit with thresholding is studied. Using the global 2-coherence , which provides a "bridge" between the well known mutual coherence and the restricted isometry constant, the performance of orthogonal matching pursuit with thresholding is analyzed and more general results for sparse signal reconstruction are obtained. It is also shown that given the same assumption on the coherence index and the restricted isometry constant as required for orthogonal matching pursuit, the thresholding variation gives exactly the same reconstruction performance with significantly less complexity.
Full work available at URL: https://arxiv.org/abs/1307.1949
Cited In (6)
- On the efficiency of the orthogonal matching pursuit in compressed sensing
- Thresholded Basis Pursuit: LP Algorithm for Order-Wise Optimal Support Recovery for Sparse and Approximately Sparse Signals From Noisy Random Measurements
- Generalized Orthogonal Matching Pursuit
- Distribution agnostic Bayesian compressive sensing with incremental support estimation
- The Orthogonal Super Greedy Algorithm and Applications in Compressed Sensing
- On a simple derivation of the complementary matching pursuit
This page was built for publication: Orthogonal Matching Pursuit With Thresholding and its Application in Compressive Sensing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580862)
