The application of non-convex rank approximation based on TV and gamma norm in matrix completion

DOI10.19603/J.CNKI.1000-1190.2019.06.005MaRDI QIDQ3306441zbMATH OpenFDO

Authors Shuqin Wang, Zhipeng Sun, Zixuan Hu, Xinxin Bian, Yongli Wang, Guoping He

Publication date 12 August 2020

Full work available at URL https://doi.org/10.19603/J.CNKI.1000-1190.2019.06.005

zbMATH Keywords

augmented Lagrangian methodmatrix completionnon-convex functionnuclear normtotal variation

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Recommendations

• A new nonconvex approach to low-rank matrix completion with application to image inpainting
• Linear total variation approximate regularized nuclear norm optimization for matrix completion
• scientific article; zbMATH DE number 7112877
• Matrix completion via minimizing an approximate rank
• Rank minimization with applications to image noise removal

Cited in

(4)

• A new nonconvex approach to low-rank matrix completion with application to image inpainting
• Linear total variation approximate regularized nuclear norm optimization for matrix completion
• A novel nonconvex relaxation approach to low-rank matrix completion of inexact observed data
• Rank minimization with applications to image noise removal

This page was built for publication: The application of non-convex rank approximation based on TV and gamma norm in matrix completion

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