Weighted truncated nuclear norm regularization for low-rank quaternion matrix completion
نویسندگان
چکیده
In recent years, quaternion matrix completion (QMC) based on low-rank regularization has been gradually used in image processing. Unlike (LRMC) which handles RGB images by recovering each color channel separately, QMC models retain the connection of three channels and process them as a whole. Most existing quaternion-based methods formulate (LRQMC) nuclear norm (a convex relaxation rank) minimization problem. The main limitation these approaches is that they minimize singular values simultaneously such cannot approximate attributes efficiently. To achieve more accurate approximation, we introduce truncated (QTNN) for LRQMC utilize alternating direction method multipliers (ADMM) to get optimization this paper. Further, propose weights residual error during update accelerating convergence QTNN with admissible performance. weighted utilizes concise gradient descent strategy theoretical guarantee optimization. effectiveness our illustrated experiments real visual data sets. • A novel proposed An efficient developed solve method. add matrices optimization, guarantee.
منابع مشابه
Low-Rank Tensor Completion by Truncated Nuclear Norm Regularization
Currently, low-rank tensor completion has gained cumulative attention in recovering incomplete visual data whose partial elements are missing. By taking a color image or video as a three-dimensional (3D) tensor, previous studies have suggested several definitions of tensor nuclear norm. However, they have limitations and may not properly approximate the real rank of a tensor. Besides, they do n...
متن کاملLow-Rank Matrix Completion using Nuclear Norm
5 Minimization of the nuclear norm is often used as a surrogate, convex relaxation, for finding 6 the minimum rank completion (recovery) of a partial matrix. The minimum nuclear norm 7 problem can be solved as a trace minimization semidefinite programming problem (SDP ). 8 The SDP and its dual are regular in the sense that they both satisfy strict feasibility. Interior 9 point algorithms are th...
متن کاملAnalysis of Nuclear Norm Regularization for Full-rank Matrix Completion
In this paper, we provide a theoretical analysis of the nuclear-norm regularized least squares for full-rank matrix completion. Although similar formulations have been examined by previous studies, their results are unsatisfactory because only additive upper bounds are provided. Under the assumption that the top eigenspaces of the target matrix are incoherent, we derive a relative upper bound f...
متن کاملFactor Matrix Nuclear Norm Minimization for Low-Rank Tensor Completion
Most existing low-n-rank minimization algorithms for tensor completion suffer from high computational cost due to involving multiple singular value decompositions (SVDs) at each iteration. To address this issue, we propose a novel factor matrix rank minimization method for tensor completion problems. Based on the CANDECOMP/PARAFAC (CP) decomposition, we first formulate a factor matrix rank mini...
متن کاملScaled Nuclear Norm Minimization for Low-Rank Tensor Completion
Minimizing the nuclear norm of a matrix has been shown to be very efficient in reconstructing a low-rank sampled matrix. Furthermore, minimizing the sum of nuclear norms of matricizations of a tensor has been shown to be very efficient in recovering a low-Tucker-rank sampled tensor. In this paper, we propose to recover a low-TT-rank sampled tensor by minimizing a weighted sum of nuclear norms o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Visual Communication and Image Representation
سال: 2021
ISSN: ['1095-9076', '1047-3203']
DOI: https://doi.org/10.1016/j.jvcir.2021.103335