Tensor completion via nonconvex tensor ring rank minimization with guaranteed convergence

05/14/2020
by   Meng Ding, et al.
0

In recent studies, the tensor ring (TR) rank has shown high effectiveness in tensor completion due to its ability of capturing the intrinsic structure within high-order tensors. A recently proposed TR rank minimization method is based on the convex relaxation by penalizing the weighted sum of nuclear norm of TR unfolding matrices. However, this method treats each singular value equally and neglects their physical meanings, which usually leads to suboptimal solutions in practice. In this paper, we propose to use the logdet-based function as a nonconvex smooth relaxation of the TR rank for tensor completion, which can more accurately approximate the TR rank and better promote the low-rankness of the solution. To solve the proposed nonconvex model efficiently, we develop an alternating direction method of multipliers algorithm and theoretically prove that, under some mild assumptions, our algorithm converges to a stationary point. Extensive experiments on color images, multispectral images, and color videos demonstrate that the proposed method outperforms several state-of-the-art competitors in both visual and quantitative comparison. Key words: nonconvex optimization, tensor ring rank, logdet function, tensor completion, alternating direction method of multipliers.

READ FULL TEXT

page 3

page 12

page 16

page 17

page 18

page 19

page 20

research
04/22/2020

Hierarchical Tensor Ring Completion

Tensor completion can estimate missing values of a high-order data from ...
research
03/21/2019

Tensor-Ring Nuclear Norm Minimization and Application for Visual Data Completion

Tensor ring (TR) decomposition has been successfully used to obtain the ...
research
04/29/2020

Tensor train rank minimization with nonlocal self-similarity for tensor completion

The tensor train (TT) rank has received increasing attention in tensor c...
research
06/29/2021

Asymptotic Log-Det Sum-of-Ranks Minimization via Tensor (Alternating) Iteratively Reweighted Least Squares

Affine sum-of-ranks minimization (ASRM) generalizes the affine rank mini...
research
03/08/2019

Low-Rank Tensor Completion via Tensor Ring with Balanced Unfolding

Tensor completion aims to recover a multi-dimensional array from its inc...
research
05/24/2012

Linearized Alternating Direction Method with Adaptive Penalty and Warm Starts for Fast Solving Transform Invariant Low-Rank Textures

Transform Invariant Low-rank Textures (TILT) is a novel and powerful too...
research
03/08/2019

Tensor Completion using Balanced Unfolding of Low-Rank Tensor Ring

Tensor completion aims to recover a multi-dimensional array from its inc...

Please sign up or login with your details

Forgot password? Click here to reset