Robust low-rank matrix completion via sparsity-inducing regularizer
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
Original language | English |
---|---|
Article number | 109666 |
Journal / Publication | Signal Processing |
Volume | 226 |
Online published | 21 Aug 2024 |
Publication status | Published - Jan 2025 |
Link(s)
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.
Research Area(s)
- Low-rank matrix recovery, Outlier, Proximity operator, Robust matrix completion, Sparsity
Citation Format(s)
Robust low-rank matrix completion via sparsity-inducing regularizer. / Wang, Zhi-Yong; So, Hing Cheung; Zoubir, Abdelhak M.
In: Signal Processing, Vol. 226, 109666, 01.2025.
In: Signal Processing, Vol. 226, 109666, 01.2025.
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review