Matrix Completion Based on Non-Convex Low-Rank Approximation
From MaRDI portal
Publication:4631423
DOI10.1109/TIP.2018.2886712zbMath1411.94008WikidataQ90669405 ScholiaQ90669405MaRDI QIDQ4631423
Feiping Nie, Zhanxuan Hu, Xuelong Li
Publication date: 29 March 2019
Published in: IEEE Transactions on Image Processing (Search for Journal in Brave)
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Related Items (3)
Efficient low-rank quaternion matrix completion under the learnable transforms for color image recovery ⋮ Iterative rank-one matrix completion via singular value decomposition and nuclear norm regularization ⋮ Image inpainting using non-convex low rank decomposition and multidirectional search
This page was built for publication: Matrix Completion Based on Non-Convex Low-Rank Approximation
