A Survey on Matrix Completion: Perspective of Signal Processing
Not on the map. Why?
Abstract (arXiv)
Matrix completion (MC) is a promising technique which is able to recover an intact matrix with low-rank property from sub-sampled/incomplete data. Its application varies from computer vision, signal processing to wireless network, and thereby receives much attention in the past several years. There are plenty of works addressing the behaviors and applications of MC methodologies. This work provides a comprehensive review for MC approaches from the perspective of signal processing. In particular, the MC problem is first grouped into six optimization problems to help readers understand MC algorithms. Next, four representative types of optimization algorithms solving the MC problem are reviewed. Ultimately, three different application fields of MC are described and evaluated.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 25 Jan 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 2; 2023: 0; 2024: 1; 2025: 2.
5 papers.
- 2022Matrix Completion via Non-Convex Relaxation and Adaptive Correlation Learningcited by 4
- 2025An extrapolated and provably convergent algorithm for nonlinear matrix decomposition with the ReLU functioncited by 4
- 2022SparGE: Sparse Coding-based Patient Similarity Learning via Low-rank Constraints and Graph Embeddingcited by 0
- 2024Matrix Completion via Residual Spectral Matchingcited by 0
- 2025Fast exact recovery of noisy matrix from few entries: the infinity norm approachcited by 0
- 2025An extrapolated and provably convergent algorithm for nonlinear matrix decomposition with the ReLU function31 Mar 2025
- 2025Fast exact recovery of noisy matrix from few entries: the infinity norm approach31 Jan 2025
- 2024Matrix Completion via Residual Spectral Matching13 Dec 2024
- 2022Matrix Completion via Non-Convex Relaxation and Adaptive Correlation Learning4 Mar 2022
- 2022SparGE: Sparse Coding-based Patient Similarity Learning via Low-rank Constraints and Graph Embedding3 Feb 2022