CVSep 17, 2020

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

arXiv:2009.08297v2
Originality Incremental advance
AI Analysis

This addresses a domain-specific problem in low-level vision for applications like imaging and background modeling, offering incremental improvements over existing methods.

The paper tackles the problem of recovering low-rank structure from data corrupted by sparse noise when the target rank and outlier locations are unknown, proposing a method based on the minimum description length principle and atomic norm that achieves a higher success rate than state-of-the-art methods, especially with limited observations or high corruption ratios.

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.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes