DeepAI AI Chat
Log In Sign Up

A New Analysis for Support Recovery with Block Orthogonal Matching Pursuit

by   Haifeng Li, et al.
McGill University

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.


page 1

page 2

page 3

page 4


A Sharp Condition for Exact Support Recovery of Sparse Signals With Orthogonal Matching Pursuit

Support recovery of sparse signals from noisy measurements with orthogon...

Recovery of Binary Sparse Signals from Structured Biased Measurements

In this paper we study the reconstruction of binary sparse signals from ...

Optimality Analysis and Block Sparse Algorithm for Complex Compressed Sensing

Recently, many new challenges in Compressed Sensing (CS), such as block ...

Exact Sparse Recovery with L0 Projections

Many applications concern sparse signals, for example, detecting anomali...

Matching Pursuit LASSO Part II: Applications and Sparse Recovery over Batch Signals

Matching Pursuit LASSIn Part I TanPMLPart1, a Matching Pursuit LASSO (MP...

Exact Sparse Signal Recovery via Orthogonal Matching Pursuit with Prior Information

The orthogonal matching pursuit (OMP) algorithm is a commonly used algor...

Sparse Recovery of Fusion Frame Structured Signals

Fusion frames are collection of subspaces which provide a redundant repr...