Fast and Accurate Tensor Completion With Total Variation Regularized Tensor Trains
- 21 May 2020
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 29 (10577149) , 6918-6931
Abstract
We propose a new tensor completion method based on tensor trains. The to-be-completed tensor is modeled as a low-rank tensor train, where we use the known tensor entries and their coordinates to update the tensor train. A novel tensor train initialization procedure is proposed specifically for image and video completion, which is demonstrated to ensure fast convergence of the completion algorithm. The tensor train framework is also shown to easily accommodate Total Variation and Tikhonov regularization due to their low-rank tensor train representations. Image and video inpainting experiments verify the superiority of the proposed scheme in terms of both speed and scalability, where a speedup of up to 155× is observed compared to state-of-the-art tensor completion methods at a similar accuracy. Moreover, we demonstrate the proposed scheme is especially advantageous over existing algorithms when only tiny portions (say, 1%) of the to-be-completed images/videos are known.Keywords
All Related Versions
Funding Information
- General Research Fund of the Hong Kong Research Grants Council (17246416)
- MIT-IBM Watson AI Lab
- MIT Quest Programs
- NSF (R01 EB006847)
- Tsinghua University Initiative Scientific Research Program
- NSFC (61872206)
This publication has 30 references indexed in Scilit:
- On Local Convergence of Alternating Schemes for Optimization of Convex Problems in the Tensor Train FormatSIAM Journal on Numerical Analysis, 2013
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithmMathematical Programming Computation, 2012
- The Alternating Linear Scheme for Tensor Optimization in the Tensor Train FormatSIAM Journal on Scientific Computing, 2012
- Dictionary Learning for Noisy and Incomplete Hyperspectral ImagesSIAM Journal on Imaging Sciences, 2012
- Tensor completion and low-n-rank tensor recovery via convex optimizationInverse Problems, 2011
- Tensor-Train DecompositionSIAM Journal on Scientific Computing, 2011
- The density-matrix renormalization group in the age of matrix product statesAnnals of Physics, 2011
- Approximation of $2^d\times2^d$ Matrices Using Tensor DecompositionSIAM Journal on Matrix Analysis and Applications, 2010
- Tensor Decompositions and ApplicationsSIAM Review, 2009
- Exact Matrix Completion via Convex OptimizationFoundations of Computational Mathematics, 2009