Cartoon–texture image decomposition via non-convex low-rank texture regularization

• Published in: Journal of the Franklin Institute 2017-05, Vol.354 (7), p.3170-3187
• Main Authors: Fan, Ya-Ru, Huang, Ting-Zhu, Ma, Tian-Hui, Zhao, Xi-Le
• Format: Article
• Language: English
• ISSN: 0016-0032; 1879-2693
• DOI: 10.1016/j.jfranklin.2017.01.037

Methods based on low-rank regularization have been successfully used to decompose an image into its cartoon and texture components. However, most of the existing low-rank regularized methods are formulated as a convex nuclear norm minimization, which is in practice suboptimal due to equally punishing each singular value. Recent works have shown that non-convex low-rank approximations adaptively treating the singular values at different scales yield better results than those convex ones. In this paper, we consider a non-convex log det function as the low-rank regularization to characterize the texture component in image decomposition, which treats singular values with varying degrees to facilitate a better characterization of the texture component. Then we obtain a non-convex cartoon–texture image decomposition model, where the cartoon and texture components are characterized simultaneously by minimizing the total variation norm and log det function. We integrate the self-similarity of texture component and the piecewise smooth of cartoon component into one model. The model can handle various types of image degradations, including blur, missing pixels and noise. Moreover, we develop an efficient alternating direction method of multiplier to solve the proposed model. The proposed method gives both a decomposition of cartoon and texture components and the restored image. Results of numerical experiments demonstrate the outstanding performance of the proposed method in image decomposition.