A New Analysis for Support Recovery with Block Orthogonal Matching Pursuit

Abstract

Compressed Sensing (CS) is a signal processing technique which can accurately recover sparse signals from linear measurements with far fewer number of measurements than those required by the classical Shannon-Nyquist theorem. Block sparse signals, i.e., the sparse signals whose nonzero coefficients occur in few blocks, arise from many fields. Block orthogonal matching pursuit (BOMP) is a popular greedy algorithm for recovering block sparse signals due to its high efficiency and effectiveness. By fully using the block sparsity of block sparse signals, BOMP can achieve very good recovery performance. This paper proposes a sufficient condition to ensure that BOMP can exactly recover the support of block $K$-sparse signals under the noisy case. This condition is better than existing ones.

References in corpus (7)

• Compressed Sensing of Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
• A Sharp Condition for Exact Support Recovery of with Orthogonal Matching Pursuit
• Nearly Optimal Bounds for Orthogonal Least Squares
• A New Analysis for Support Recovery with Block Orthogonal Matching Pursuit
• Improved Analyses for SP and CoSaMP Algorithms in Terms of Restricted Isometry Constants
• A sharp recovery condition for block sparse signals by block orthogonal multi-matching pursuit
• Stable Recovery of Sparse Signals via $l_p-$Minimization

Cited by in corpus (4)

• A New Analysis for Support Recovery with Block Orthogonal Matching Pursuit
• Deep Neural Network-Based Blind Multiple User Detection for Grant-free Multi-User Shared Access
• Deep Learning-Based Active User Detection for Grant-free SCMA Systems
• The high-order block RIP for non-convex block-sparse compressed sensing