Low-Rank Matrix Recovery from Noisy via an MDL Framework-based Atomic Norm

09/17/2020
by   Anyong Qin, et al.
0

The recovery of the underlying low-rank structure of clean data corrupted with sparse noise/outliers is attracting increasing interest. However, in many low-level vision problems, the exact target rank of the underlying structure, the particular locations and values of the sparse outliers are not known. Thus, the conventional methods can not separate the low-rank and sparse components completely, especially gross outliers or deficient observations. Therefore, in this study, we employ the Minimum Description Length (MDL) principle and atomic norm for low-rank matrix recovery to overcome these limitations. First, we employ the atomic norm to find all the candidate atoms of low-rank and sparse terms, and then we minimize the description length of the model in order to select the appropriate atoms of low-rank and the sparse matrix, respectively. Our experimental analyses show that the proposed approach can obtain a higher success rate than the state-of-the-art methods even when the number of observations is limited or the corruption ratio is high. Experimental results about synthetic data and real sensing applications (high dynamic range imaging, background modeling, removing shadows and specularities) demonstrate the effectiveness, robustness and efficiency of the proposed method.

READ FULL TEXT

page 1

page 3

page 7

page 9

page 11

page 12

research
03/04/2015

Partial Sum Minimization of Singular Values in Robust PCA: Algorithm and Applications

Robust Principal Component Analysis (RPCA) via rank minimization is a po...
research
09/28/2011

Low-rank data modeling via the Minimum Description Length principle

Robust low-rank matrix estimation is a topic of increasing interest, wit...
research
10/02/2012

Robust PCA and subspace tracking from incomplete observations using L0-surrogates

Many applications in data analysis rely on the decomposition of a data m...
research
11/05/2010

Robust Matrix Decomposition with Outliers

Suppose a given observation matrix can be decomposed as the sum of a low...
research
05/29/2017

Learning the Sparse and Low Rank PARAFAC Decomposition via the Elastic Net

In this article, we derive a Bayesian model to learning the sparse and l...
research
12/08/2017

Maximum entropy low-rank matrix recovery

We propose a novel, information-theoretic method, called MaxEnt, for eff...
research
11/09/2018

Matrix Recovery with Implicitly Low-Rank Data

In this paper, we study the problem of matrix recovery, which aims to re...

Please sign up or login with your details

Forgot password? Click here to reset