Soft Recovery Through ℓ1,2\ell_{1,2} Minimization with Applications in Recovery of Simultaneously Sparse and Low-Rank Matrice

preprint2016arXivOpen access

Abstract

This article provides a new type of analysis of a compressed-sensing based technique for recovering column-sparse matrices, namely minimization of the ℓ1,2\ell_{1,2}-norm. Rather than providing conditions on the measurement matrix which guarantees the solution of the program to be exactly equal to the ground truth signal (which already has been thoroughly investigated), it presents a condition which guarantees that the solution is approximately equal to the ground truth. Soft recovery statements of this kind are to the best knowledge of the author a novelty in Compressed Sensing. Apart from the theoretical analysis, we present two heuristic proposes how this property of the ℓ1,2\ell_{1,2}-program can be utilized to design algorithms for recovery of matrices which are sparse and have low rank at the same time.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.