Linear total variation approximate regularized nuclear norm optimization for matrix completion

DOI10.1155/2014/765782MaRDI QIDQ1724931zbMATH OpenOpenAlexWikidataFDO

Authors Jiasong Wu, Lu Wang, Yang Chen, Lotfi Senhadji, Huazhong Shu, X. Han

Publication date 14 February 2019

Published in Abstract and Applied Analysis (Search for Journal in Brave)

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.1155/2014/765782

Mathematics Subject Classification ID

Matrix completion problems (15A83) Numerical mathematical programming methods (65K05) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Review text

Summary: 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.

Recommendations

• scientific article; zbMATH DE number 7112877
• The application of non-convex rank approximation based on TV and gamma norm in matrix completion
• Enhancing matrix completion using a modified second-order total variation
• Majorized proximal alternating imputation for regularized rank constrained matrix completion
• Tensor completion using total variation and low-rank matrix factorization

Cites work

• A Singular Value Thresholding Algorithm for Matrix Completion
• Compressed sensing
• Exact matrix completion via convex optimization
• Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
• Matrix Completion From a Few Entries
• Nonlinear total variation based noise removal algorithms
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Stable signal recovery from incomplete and inaccurate measurements
• The Power of Convex Relaxation: Near-Optimal Matrix Completion

Cited in

(9)

• Enhancing matrix completion using a modified second-order total variation
• Rank estimation in missing data matrix problems
• Matrix completion methods for the total electron content video reconstruction
• The application of non-convex rank approximation based on TV and gamma norm in matrix completion
• A Truncated Nuclear Norm Regularization Method Based on Weighted Residual Error for Matrix Completion
• scientific article; zbMATH DE number 7164697 (Why is no real title available?)
• Nuclear Norm Optimization and Its Application to Observation Model Specification
• Misclassification excess risk bounds for 1-bit matrix completion
• Concentration properties of fractional posterior in 1-bit matrix completion

This page was built for publication: Linear total variation approximate regularized nuclear norm optimization for matrix completion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1724931)