Tensor completion via total curvature variation and low-rank matrix factorization
Curvature-based regularization has attracted growing concern in the field of image restoration, benefiting from its favorable geometric properties, such as preserving sharp edges, corners and contrast. Total variation regularization has the ability to promote piecewise smooth property and preserve e...
Gespeichert in:
| Veröffentlicht in: | Applied mathematical modelling Jg. 150; S. 116368 |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier Inc
01.02.2026
|
| Schlagworte: | |
| ISSN: | 0307-904X |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | Curvature-based regularization has attracted growing concern in the field of image restoration, benefiting from its favorable geometric properties, such as preserving sharp edges, corners and contrast. Total variation regularization has the ability to promote piecewise smooth property and preserve edges in image processing. Inspired by the advantages of curvature regularization and total variation, in the paper, we first develop a regularization that combines curvature and total variation to explore the geometric characteristics inside high-dimensional data, called total curvature variation (TCV) regularization, which can better preserve local information of the underlying data. We present a new low-rank tensor completion model via TCV and low-rank matrix factorization, which can simultaneously exploits the global low-rank prior and local structure information of data. We solve the proposed minimization problem by using the effective proximal alternating minimization algorithm with guaranteed convergence. Results from experiments on color images, videos, and magnetic resonance images show the superior performance of the proposed method over the compared methods in terms of quantitative and qualitative evaluations.
•Design a total curvature variation (TCV) regularization to capture the geometric properties.•Present a LRTC model by incorporating TCV into low-rank matrix factorization.•Employ a proximal alternating minimization (PAM) algorithm to solve the proposed minimization problem. |
|---|---|
| ISSN: | 0307-904X |
| DOI: | 10.1016/j.apm.2025.116368 |