116 research outputs found
Extension of SBL Algorithms for the Recovery of Block Sparse Signals with Intra-Block Correlation
We examine the recovery of block sparse signals and extend the framework in
two important directions; one by exploiting signals' intra-block correlation
and the other by generalizing signals' block structure. We propose two families
of algorithms based on the framework of block sparse Bayesian learning (BSBL).
One family, directly derived from the BSBL framework, requires knowledge of the
block structure. Another family, derived from an expanded BSBL framework, is
based on a weaker assumption on the block structure, and can be used when the
block structure is completely unknown. Using these algorithms we show that
exploiting intra-block correlation is very helpful in improving recovery
performance. These algorithms also shed light on how to modify existing
algorithms or design new ones to exploit such correlation and improve
performance.Comment: Matlab codes can be downloaded at:
https://sites.google.com/site/researchbyzhang/bsbl, or
http://dsp.ucsd.edu/~zhilin/BSBL.htm
Enhancing Sparsity by Reweighted â„“(1) Minimization
It is now well understood that (1) it is possible to reconstruct sparse signals exactly from what appear to be highly incomplete sets of linear measurements and (2) that this can be done by constrained ℓ1 minimization. In this paper, we study a novel method for sparse signal recovery that in many situations outperforms ℓ1 minimization in the sense that substantially fewer measurements are needed for exact recovery. The algorithm consists of solving a sequence of weighted ℓ1-minimization problems where the weights used for the next iteration are computed from the value of the current solution. We present a series of experiments demonstrating the remarkable performance and broad applicability of this algorithm in the areas of sparse signal recovery, statistical estimation, error correction and image processing. Interestingly, superior gains are also achieved when our method is applied to recover signals with assumed near-sparsity in overcomplete representations—not by reweighting the ℓ1 norm of the coefficient sequence as is common, but by reweighting the ℓ1 norm of the transformed object. An immediate consequence is the possibility of highly efficient data acquisition protocols by improving on a technique known as Compressive Sensing
- …