Matrix Completion via Schatten Capped $p$ p Norm

IEEE Transactions on Knowledge and Data Engineering(2022)

Cited 18|Views89
No score
Abstract
The low-rank matrix completion problem is fundamental in both machine learning and computer vision fields with many important applications, such as recommendation system, motion capture, face recognition, and image inpainting. In order to avoid solving the rank minimization problem which is NP-hard, several surrogate functions of the rank have been proposed in the literature. However, the matrix r...
More
Translated text
Key words
Minimization,Optimization,Heuristic algorithms,Computer vision,Machine learning,Face recognition,Image restoration
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined