.png){kind=icon}
.png){kind=icon}
Return
Efficient Quaternion Tensor Completion via $$L_{2,1}$$ -Norm and QR Decomposition
.png){kind=icon}
PRE
AI
J
X
肖
L
Y
DOI：10.1007/s10915-026-03279-8.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Tensor completion is a fundamental task in computer vision and image processing, with wide-ranging applications from recommendation systems to medical imaging. Prevailing methods, predominantly based on the singular value decomposition (SVD) of real-valued tensors and nuclear norm minimization, face significant challenges: they often fail to preserve the intrinsic correlation among color channels and lack robustness against variations across video frames. Moreover, their reliance on computationally intensive SVD operations limits their scalability and practical utility for large-scale data. To address these limitations, we design the accelerated SVD decomposition algorithm: QTSVD-QR, and propose a novel quaternion tensor (matrix) completion method that utilizes QR decomposition and $$L_{2,1}$$ -norm minimization (QTLNM-TQR), which can effectively balance model generalization ability with computational efficiency, resulting in a notable enhancement in completion performance. Numerical experiments conducted on color images, videos, and PET-CT provide compelling evidence of the proposed method’s effectiveness.
Keywords:
Quaternion tensor completion
Qatar Riyal (QR) decomposition
\(L_{2,1}\)-norm
Video inpainting
Journal
IF:
3.3
Papers:
652
Citations:
9.6K
Organization
Cited Papers