Tensor Factorization with Total Variation and Tikhonov Regularization for Low-Rank Tensor Completion in Imaging Data

The main aim of this paper is to study tensor factorization for low-rank tensor completion in imaging data. Due to the underlying redundancy of real-world imaging data, the low-tubal-rank tensor factorization (the tensor–tensor product of two factor tensors) can be used to approximate such tensor very well. Motivated by the spatial/temporal smoothness of factor tensors in real-world imaging data, we propose to incorporate a hybrid regularization combining total variation and Tikhonov regularization into low-tubal-rank tensor factorization model for low-rank tensor completion problem. We also develop an efficient proximal alternating minimization (PAM) algorithm to tackle the corresponding minimization problem and establish a global convergence of the PAM algorithm. Numerical results on color images, color videos, and multispectral images are reported to illustrate the superiority of the proposed method over competing methods.

[1]  Ting-Zhu Huang,et al.  Remote sensing images destriping using unidirectional hybrid total variation and nonconvex low-rank regularization , 2020, J. Comput. Appl. Math..

[2]  Antonin Chambolle,et al.  A First-Order Primal-Dual Algorithm for Convex Problems with Applications to Imaging , 2011, Journal of Mathematical Imaging and Vision.

[3]  Zemin Zhang,et al.  Exact Tensor Completion Using t-SVD , 2015, IEEE Transactions on Signal Processing.

[4]  Jianhong Shen,et al.  Deblurring images: Matrices, spectra, and filtering , 2007, Math. Comput..

[5]  Michael K. Ng,et al.  A New Convex Optimization Model for Multiplicative Noise and Blur Removal , 2014, SIAM J. Imaging Sci..

[6]  Yunming Ye,et al.  Low-Rank Tensor Completion with Total Variation for Visual Data Inpainting , 2017, AAAI.

[7]  Hédy Attouch,et al.  Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Lojasiewicz Inequality , 2008, Math. Oper. Res..

[8]  Bin Ran,et al.  Tensor completion via a multi-linear low-n-rank factorization model , 2014, Neurocomputing.

[9]  Adrian S. Lewis,et al.  The [barred L]ojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems , 2006, SIAM J. Optim..

[10]  Tingzhu Huang,et al.  A non-convex tensor rank approximation for tensor completion , 2017 .

[11]  Wotao Yin,et al.  A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion , 2013, SIAM J. Imaging Sci..

[12]  Zhi-Quan Luo,et al.  On the linear convergence of the alternating direction method of multipliers , 2012, Mathematical Programming.

[13]  Tony F. Chan,et al.  A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science , 2010, SIAM J. Imaging Sci..

[14]  Misha Elena Kilmer,et al.  Third-Order Tensors as Operators on Matrices: A Theoretical and Computational Framework with Applications in Imaging , 2013, SIAM J. Matrix Anal. Appl..

[15]  Adrian S. Lewis,et al.  Clarke Subgradients of Stratifiable Functions , 2006, SIAM J. Optim..

[16]  L. Tucker,et al.  Some mathematical notes on three-mode factor analysis , 1966, Psychometrika.

[17]  Jieping Ye,et al.  Tensor Completion for Estimating Missing Values in Visual Data , 2009, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[18]  Ce Zhu,et al.  Tensor rank learning in CP decomposition via convolutional neural network , 2019, Signal Process. Image Commun..

[19]  Tamara G. Kolda,et al.  Tensor Decompositions and Applications , 2009, SIAM Rev..

[20]  Marie-Françoise Roy,et al.  Real algebraic geometry , 1992 .

[21]  J. Kruskal,et al.  Candelinc: A general approach to multidimensional analysis of many-way arrays with linear constraints on parameters , 1980 .

[22]  BolteJérôme,et al.  Proximal Alternating Minimization and Projection Methods for Nonconvex Problems , 2010 .

[23]  Tom Goldstein,et al.  The Split Bregman Method for L1-Regularized Problems , 2009, SIAM J. Imaging Sci..

[24]  L. Rudin,et al.  Nonlinear total variation based noise removal algorithms , 1992 .

[25]  Xi-Le Zhao,et al.  Mixed Noise Removal in Hyperspectral Image via Low-Fibered-Rank Regularization , 2020, IEEE Transactions on Geoscience and Remote Sensing.

[26]  Patrick L. Combettes,et al.  Signal Recovery by Proximal Forward-Backward Splitting , 2005, Multiscale Model. Simul..

[27]  Misha Elena Kilmer,et al.  Novel Methods for Multilinear Data Completion and De-noising Based on Tensor-SVD , 2014, 2014 IEEE Conference on Computer Vision and Pattern Recognition.

[28]  Ting-Zhu Huang,et al.  Low-rank tensor completion via combined non-local self-similarity and low-rank regularization , 2019, Neurocomputing.

[29]  Eric L. Miller,et al.  Tensor-Based Formulation and Nuclear Norm Regularization for Multienergy Computed Tomography , 2013, IEEE Transactions on Image Processing.

[30]  Qi Xie,et al.  Kronecker-Basis-Representation Based Tensor Sparsity and Its Applications to Tensor Recovery , 2018, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[31]  Xiaohao Cai,et al.  Variational image segmentation model coupled with image restoration achievements , 2014, Pattern Recognit..

[32]  Benar Fux Svaiter,et al.  Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methods , 2013, Math. Program..

[33]  Patrick L. Combettes,et al.  Proximal Splitting Methods in Signal Processing , 2009, Fixed-Point Algorithms for Inverse Problems in Science and Engineering.

[34]  James M. Ortega,et al.  Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.

[35]  A. Auslender.  Méthodes numériques pour la décomposition et la minimisation de fonctions non différentiables , 1971 .

[36]  Wei Liu,et al.  Tensor Robust Principal Component Analysis: Exact Recovery of Corrupted Low-Rank Tensors via Convex Optimization , 2016, 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR).

[37]  Xuelong Li,et al.  General Tensor Discriminant Analysis and Gabor Features for Gait Recognition , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[38]  Pan Zhou,et al.  Tensor Factorization for Low-Rank Tensor Completion , 2018, IEEE Transactions on Image Processing.

[39]  Zemin Zhang.  A novel algebraic framework for processing multidimensional data: Theory and application , 2017 .

[40]  Gang Liu,et al.  Tensor completion using total variation and low-rank matrix factorization , 2016, Inf. Sci..

[41]  A. Auslender.  Asymptotic properties of the fenchel dual functional and applications to decomposition problems , 1992 .

[42]  P. Tseng.  Convergence of a Block Coordinate Descent Method for Nondifferentiable Minimization , 2001 .

[43]  Prateek Jain,et al.  Provable Tensor Factorization with Missing Data , 2014, NIPS.

[44]  M. Coste.  AN INTRODUCTION TO O-MINIMAL GEOMETRY , 2002 .

[45]  M. Kilmer,et al.  Factorization strategies for third-order tensors , 2011 .

[46]  K. Kurdyka.  On gradients of functions definable in o-minimal structures , 1998 .

[47]  Bart Vandereycken,et al.  Low-rank tensor completion by Riemannian optimization , 2014 .

[48]  Jiashi Feng,et al.  Outlier-Robust Tensor PCA , 2017, 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR).

[49]  B. Recht,et al.  Tensor completion and low-n-rank tensor recovery via convex optimization , 2011 .

[50]  Ting-Zhu Huang,et al.  Laplace function based nonconvex surrogate for low-rank tensor completion , 2019, Signal Process. Image Commun..

[51]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[52]  B. Mercier,et al.  A dual algorithm for the solution of nonlinear variational problems via finite element approximation , 1976 .