Exact Recovery of Sparse Signals Using Orthogonal Matching Pursuit: How Many Iterations Do We Need?

DOI10.1109/TSP.2016.2568162zbMath1414.94660arXiv1211.4293MaRDI QIDQ4620869

Byonghyo Shim, Jian Wang

Publication date: 8 February 2019

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1211.4293

Mathematics Subject Classification ID

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

Related Items (6)

A new result on recovery sparse signals using orthogonal matching pursuit ⋮ Required Number of Iterations for Sparse Signal Recovery via Orthogonal Least Squares ⋮ A new sufficient condition for sparse recovery with multiple orthogonal least squares ⋮ Orthogonal matching pursuit under the restricted isometry property ⋮ Measurement matrix optimization via mutual coherence minimization for compressively sensed signals reconstruction ⋮ Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit

This page was built for publication: Exact Recovery of Sparse Signals Using Orthogonal Matching Pursuit: How Many Iterations Do We Need?