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

Abstract

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 and the particular locations and values of the sparse outliers are not known. Thus, the conventional methods cannot separate the low-rank and sparse components completely, especially in the case of 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 matrices, 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 utilizing synthetic data and real sensing applications (high dynamic range imaging, background modeling, removing noise and shadows) demonstrate the effectiveness, robustness and efficiency of the proposed method.

arXiv comment14 pages, 13 figures

References in corpus (8)

• The Augmented Lagrange Multiplier Method for Exact Recovery of Corrupted Low-Rank Matrices
• The Convex Geometry of Linear Inverse Problems
• Model Selection Techniques -- An Overview
• Constructing a Non-Negative Low Rank and Sparse Graph with Data-Adaptive Features
• Model Order Selection Based on Information Theoretic Criteria: Design of the Penalty
• Forward - Backward Greedy Algorithms for Atomic Norm Regularization
• An MDL framework for sparse coding and dictionary learning
• Factor Group-Sparse Regularization for Efficient Low-Rank Matrix Recovery