In many applications of compressed sensing the signal is block sparse, i.e., the non-zero elements of the sparse signal are clustered in blocks. Here, we propose a family of iterative algorithms for the recovery of block sparse signals. These algorithms, referred to as iterative reweighted ℓ<inf>2</inf>/ℓ<inf>1</inf> minimization algorithms IR 702Dℓ<inf>2</inf>/ℓ<inf>1</inf> , solve a weighted ℓ<inf>2</inf>/ℓ<inf>1</inf> minimization in each iteration. Our simulation and analytical results on the recovery of both ideally and approximately block sparse signals show that the proposed iterative algorithms have significant advantages in terms of accuracy and the number of required measurements over non-iterative approaches as well as existing iterative methods. In particular, we demonstrate that, by increasing the block length, the performance of the proposed algorithms approaches the Wu-Verdú theoretical limit. The improvement in performance comes at a rather small cost in complexity increase. Further improvement in performance is achieved by using a priori information about the location of non-zero blocks, even if such a priori information is not perfectly reliable.

Block sparsity, compressed sensing, iterative recovery algorithms, iterative reweighted ℓ<inf>2</inf>/ℓ<inf>1</inf> minimization, ℓ<inf>2</inf>/ℓ<inf>1</inf> minimization
dx.doi.org/10.1109/TSP.2015.2441032
IEEE Transactions on Signal Processing
Department of Systems and Computer Engineering

Zeinalkhani, Z. (Zeinab), & Banihashemi, A. (2015). Iterative reweighted ℓ2/ℓ1 recovery algorithms for compressed sensing of block sparse signals. In IEEE Transactions on Signal Processing (Vol. 63, pp. 4516–4531). doi:10.1109/TSP.2015.2441032