Robust low-rank matrix completion via sparsity-inducing regularizer

Zhi-Yong Wang*, Hing Cheung So, Abdelhak M. Zoubir

*Corresponding author for this work

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

1 Citation (Scopus)

Abstract

This paper proposes a sparsity-inducing regularizer associated with the Welsch function. We theoretically show that the regularizer is quasiconvex and the corresponding Moreau envelope is convex. Moreover, the closed-form solution to its Moreau envelope, namely, the proximity operator, is derived. Unlike conventional nonconvex regularizers like the p-norm with 0 < p < 1 that generally needs iterations to obtain the corresponding proximity operator, the developed regularizer has a closed-form proximity operator. We utilize our regularizer to penalize the singular values as well as sparse outliers of the distorted data, and develop an efficient algorithm for robust matrix completion. Convergence of the suggested method is analyzed and we prove that any accumulation point is a stationary point. Finally, experimental results demonstrate that our algorithm is superior to the competing techniques in terms of restoration performance. MATALB codes are available at https://github.com/bestzywang/RMC-NNSR. © 2024 Elsevier B.V.
Original languageEnglish
Article number109666
JournalSignal Processing
Volume226
Online published21 Aug 2024
DOIs
Publication statusPublished - Jan 2025

Funding

The work described in this paper was supported in part by a grant from City University of Hong Kong (Project No. 7006084), and in part by the Research Grants Council of the Hong Kong Special Administrative Region, China [Project No. CityU 11207922].

Research Keywords

  • Low-rank matrix recovery
  • Outlier
  • Proximity operator
  • Robust matrix completion
  • Sparsity

Fingerprint

Dive into the research topics of 'Robust low-rank matrix completion via sparsity-inducing regularizer'. Together they form a unique fingerprint.

Cite this