Adaptive algorithms for low-rank and sparse matrix recovery with truncated nuclear norm

摘要

Recent studies have shown that the use of the truncated nuclear norm (TNN) in low-rank and sparse matrix decomposition (LRSD) can realize a better approximation to rank function of matrix, and achieve effectively recovery effects. This paper addresses the algorithms for LRSD with adaptive TNN (LRSD-ATNN), and designs an efficient algorithmic frame inspired by the alternating direction method of multiple (ADMM) and the accelerated proximal gradient approach (APG). To establish the adaptive algorithms, the method of singular value estimate is utilized to find adaptively the number of truncated singular value. Experimental results on synthetic data as well as real visual data show the superiority of the proposed algorithm in effectiveness in comparison with the state-of-the-art methods.