Skip to Main content Skip to Navigation
Journal articles

Linear Total Variation Approximate Regularized Nuclear Norm Optimization for Matrix Completion

Abstract : Matrix completion that estimates missing values in visual data is an important topic in computer vision. Most of the recent studies focused on the low rank matrix approximation via the nuclear norm. However, the visual data, such as images, is rich in texture which may not be well approximated by low rank constraint. In this paper, we propose a novel matrix completion method, which combines the nuclear norm with the local geometric regularizer to solve the problem of matrix completion for redundant texture images. And in this paper we mainly consider one of the most commonly graph regularized parameters: the total variation norm which is a widely used measure for enforcing intensity continuity and recovering a piecewise smooth image. The experimental results show that the encouraging results can be obtained by the proposed method on real texture images compared to the state-of-the-art methods.
Document type :
Journal articles
Complete list of metadata
Contributor : Laurent Jonchère Connect in order to contact the contributor
Submitted on : Tuesday, May 26, 2015 - 1:24:19 PM
Last modification on : Wednesday, March 9, 2022 - 9:16:03 AM
Long-term archiving on: : Tuesday, September 15, 2015 - 6:53:31 AM


Linear Total Variation Approxi...
Publisher files allowed on an open archive



Xu Han, Jiasong Wu, Lu Wang, yang Chen, Lotfi Senhadji, et al.. Linear Total Variation Approximate Regularized Nuclear Norm Optimization for Matrix Completion. Abstract and Applied Analysis, Hindawi Publishing Corporation, 2014, 2014, pp.765782. ⟨10.1155/2014/765782⟩. ⟨inserm-01101215⟩



Record views


Files downloads