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...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on image processing Vol. 33; pp. 2835 - 2850
Main Authors:	Qin, Wenjin, Wang, Hailin, Zhang, Feng, Ma, Weijun, Wang, Jianjun, Huang, Tingwen
Format:	Journal Article
Language:	English
Published:	United States IEEE 01.01.2024 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!