Nonconvex Robust High-Order Tensor Completion Using Randomized Low-Rank Approximation

Within the tensor singular value decomposition (T-SVD) framework, existing robust low-rank tensor completion approaches have made great achievements in various areas of science and engineering. Nevertheless, these methods involve the T-SVD based low-rank approximation, which suffers from high comput...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on image processing Jg. 33; S. 2835 - 2850
Hauptverfasser:	Qin, Wenjin, Wang, Hailin, Zhang, Feng, Ma, Weijun, Wang, Jianjun, Huang, Tingwen
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	United States IEEE 01.01.2024 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	ADMM algorithm Algorithms Approximation Approximation algorithms Computational modeling Computing costs High-order T-SVD framework Image reconstruction Indexes Mathematical analysis nonconvex regularizers Optimization randomized low-rank tensor approximation robust high-order tensor completion Robustness Singular value decomposition Tensors
ISSN:	1057-7149, 1941-0042, 1941-0042
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!