Compressed sensing of low-rank plus sparse matrices

by   Jared Tanner, et al.

Expressing a matrix as the sum of a low-rank matrix plus a sparse matrix is a flexible model capturing global and local features in data. This model is the foundation of robust principle component analysis (Candes et al., 2011) (Chandrasekaran et al., 2009), and popularized by dynamic-foreground/static-background separation (Bouwmans et al., 2016) amongst other applications. Compressed sensing, matrix completion, and their variants (Eldar and Kutyniok, 2012) (Foucart and Rauhut, 2013) have established that data satisfying low complexity models can be efficiently measured and recovered from a number of measurements proportional to the model complexity rather than the ambient dimension. This manuscript develops similar guarantees showing that m× n matrices that can be expressed as the sum of a rank-r matrix and a s-sparse matrix can be recovered by computationally tractable methods from 𝒪(r(m+n-r)+s)log(mn/s) linear measurements. More specifically, we establish that the restricted isometry constants for the aforementioned matrices remain bounded independent of problem size provided p/mn, s/p, and r(m+n-r)/p reman fixed. Additionally, we show that semidefinite programming and two hard threshold gradient descent algorithms, NIHT and NAHT, converge to the measured matrix provided the measurement operator's RIC's are sufficiently small. Numerical experiments illustrating these results are shown for synthetic problems, dynamic-foreground/static-background separation, and multispectral imaging.



There are no comments yet.


page 22

page 23

∙ 10/25/2020

Adversarial Robust Low Rank Matrix Estimation: Compressed Sensing and Matrix Completion

We consider robust low rank matrix estimation when random noise is heavy...
∙ 11/14/2018

Matrix rigidity and the ill-posedness of Robust PCA and matrix completion

Robust Principal Component Analysis (PCA) (Candes et al., 2011) and low-...
∙ 04/06/2011

Compressed Sensing and Matrix Completion with Constant Proportion of Corruptions

We improve existing results in the field of compressed sensing and matri...
∙ 04/30/2012

Recovery of Low-Rank Plus Compressed Sparse Matrices with Application to Unveiling Traffic Anomalies

Given the superposition of a low-rank matrix plus the product of a known...
∙ 03/19/2018

Lossless Analog Compression

We establish the fundamental limits of lossless analog compression by co...
∙ 02/11/2018

TARM: A Turbo-type Algorithm for Affine Rank Minimization

The affine rank minimization (ARM) problem arises in many real-world app...
∙ 03/14/2011

Universal low-rank matrix recovery from Pauli measurements

We study the problem of reconstructing an unknown matrix M of rank r and...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.