Efficient reconstruction of block-sparse signals
June 28, 2011
In many sparse reconstruction problems, M observations are used to estimate K components in an N dimensional basis, where N > M ¿ K. The exact basis vectors, however, are not known a priori and must be chosen from an M x N matrix. Such underdetermined problems can be solved using an l2 optimization with an l1 penalty on the sparsity of the solution. There are practical applications in which multiple measurements can be grouped together, so that K x P data must be estimated from M x P observations, where the l1 sparsity penalty is taken with respect to the vector formed using the l2 norms of the rows of the data matrix. In this paper we develop a computationally efficient block partitioned homotopy method for reconstructing K x P data from M x P observations using a grouped sparsity constraint, and compare its performance to other block reconstruction algorithms.