| Popis: |
The multiple measurement vector (MMV) problem with jointly sparse signals has been of recent interest across many fields and can be solved via l 2,1 minimization. In such applications, prior information is typically available and utilizing weights to incorporate the prior information has only been empirically shown to be advantageous. In this work, we prove theoretical guarantees for a weighted l 2,1 minimization approach to solving the MMV problem where the underlying signals admit a jointly sparse structure. Our theoretical findings are complemented with empirical results on simulated and real world video data. |
