A Fast Algorithm for Recovery of Jointly Sparse Vectors based on the Alternating Direction Methods
published: May 6, 2011, recorded: April 2011, views: 3827
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
The standard compressive sensing (CS) aims to recover sparse signal from single measurement vector which is known as SMV model. By contrast, recovery of sparse signals from multiple measurement vectors is called MMV model. In this paper, we consider the recovery of jointly sparse signals in the MMV model where multiple signal measurements are represented as a matrix and the sparsity of signal occurs in common locations. The sparse MMV model can be formulated as a matrix (2; 1)-norm minimization problem, which is much more difficult to solve than the l1-norm minimization in standard CS. In this paper, we propose a very fast algorithm, called MMV-ADM, to solve the jointly sparse signal recovery problem in MMV settings based on the alternating direction method (ADM). The MMV-ADM alternately updates the recovered signal matrix, the Lagrangian multiplier and the residue, and all update rules only involve matrix or vector multiplications and summations, so it is simple, easy to implement and much faster than the state-of-the-art method MMVprox. Numerical simulations show that MMV-ADM is at least dozens of times faster than MMVprox with comparable recovery accuracy.
Download slides: aistats2011_lu_algorithm_01.pdf (1.3 MB)
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !
Write your own review or comment: