Hierarchical Tensor Ring Completion

by   Abdul Ahad, et al.

Tensor completion can estimate missing values of a high-order data from its partially observed entries. Recent works show that low rank tensor ring approximation is one of the most powerful tools to solve tensor completion problem. However, existing algorithms need predefined tensor ring rank which may be hard to determine in practice. To address the issue, we propose a hierarchical tensor ring decomposition for more compact representation. We use the standard tensor ring to decompose a tensor into several 3-order sub-tensors in the first layer, and each sub-tensor is further factorized by tensor singular value decomposition (t-SVD) in the second layer. In the low rank tensor completion based on the proposed decomposition, the zero elements in the 3-order core tensor are pruned in the second layer, which helps to automatically determinate the tensor ring rank. To further enhance the recovery performance, we use total variation to exploit the locally piece-wise smoothness data structure. The alternating direction method of multiplier can divide the optimization model into several subproblems, and each one can be solved efficiently. Numerical experiments on color images and hyperspectral images demonstrate that the proposed algorithm outperforms state-of-the-arts ones in terms of recovery accuracy.


page 8

page 10

page 12

page 13


Bayesian Low Rank Tensor Ring Model for Image Completion

Low rank tensor ring model is powerful for image completion which recove...

Tensor completion via nonconvex tensor ring rank minimization with guaranteed convergence

In recent studies, the tensor ring (TR) rank has shown high effectivenes...

Quaternion tensor ring decomposition and application for color image inpainting

In recent years, tensor networks have emerged as powerful tools for solv...

Heuristic Rank Selection with Progressively Searching Tensor Ring Network

Recently, Tensor Ring Networks (TRNs) have been applied in deep networks...

One-dimensional Tensor Network Recovery

We study the recovery of the underlying graphs or permutations for tenso...

Tensor Grid Decomposition with Application to Tensor Completion

The recently prevalent tensor train (TT) and tensor ring (TR) decomposit...

Robust M-estimation-based Tensor Ring Completion: a Half-quadratic Minimization Approach

Tensor completion is the problem of estimating the missing values of hig...

Please sign up or login with your details

Forgot password? Click here to reset