Low-Rank Tensor Ring Model for Completing Missing Visual Data

Low rank tensor factorization can be viewed as a higher order generalization of low-rank matrix factorization, both of which have been used for image and video representation and reconstruction from compressive measurements. In this paper, we present an algorithm for recovering low-rank tensors from massively under-sampled or missing data. We use low-rank tensor ring (TR) factorization to model images and videos. We observed that TR factorization models are robust to random missing entries but they fail in the cases when large blocks or slices of data are missing. We developed the following two types of algorithms to fill large missing blocks: An algorithm that incrementally updates the tensor rank and implicitly enforces correlations among different modes of the tensor. A framework to incorporate information about similarities between different modes of the tensor to enforce explicit similarity constraints between the missing and known parts of the tensors. We present simulation experiments on YaleB dataset to demonstrate the performance of our methods.

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

[2]  M. Salman Asif,et al.  Multilinear Compressive Sensing With Tensor Ring Factorization , 2019, 2019 IEEE International Conference on Image Processing (ICIP).

[3]  J R Fienup,et al.  Phase retrieval algorithms: a comparison. , 1982, Applied optics.

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

[5]  Ashok Veeraraghavan,et al.  Toward Long-Distance Subdiffraction Imaging Using Coherent Camera Arrays , 2015, IEEE Transactions on Computational Imaging.

[6]  Stéphane Mallat,et al.  A Wavelet Tour of Signal Processing - The Sparse Way, 3rd Edition , 2008 .

[7]  V. Aggarwal,et al.  Efficient Low Rank Tensor Ring Completion , 2017, 2017 IEEE International Conference on Computer Vision (ICCV).

[8]  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.

[9]  Andrzej Cichocki,et al.  Tensor Networks for Dimensionality Reduction and Large-scale Optimization: Part 1 Low-Rank Tensor Decompositions , 2016, Found. Trends Mach. Learn..

[10]  Yonina C. Eldar,et al.  Phase Retrieval via Matrix Completion , 2011, SIAM Rev..

[11]  Andrzej Cichocki,et al.  Stable, Robust, and Super Fast Reconstruction of Tensors Using Multi-Way Projections , 2014, IEEE Transactions on Signal Processing.

[12]  Andrzej Cichocki,et al.  Tensor Decompositions for Signal Processing Applications: From two-way to multiway component analysis , 2014, IEEE Signal Processing Magazine.

[13]  Richard G. Baraniuk,et al.  Kronecker Compressive Sensing , 2012, IEEE Transactions on Image Processing.

[14]  Reinhold Schneider,et al.  Low rank tensor recovery via iterative hard thresholding , 2016, ArXiv.

[15]  René Vidal,et al.  Sparse Subspace Clustering: Algorithm, Theory, and Applications , 2012, IEEE transactions on pattern analysis and machine intelligence.

[16]  Anastasios Kyrillidis,et al.  Multi-Way Compressed Sensing for Sparse Low-Rank Tensors , 2012, IEEE Signal Processing Letters.

[17]  M. Salman Asif,et al.  Random channel coding and blind deconvolution , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[18]  Justin K. Romberg,et al.  Blind Deconvolution Using Convex Programming , 2012, IEEE Transactions on Information Theory.

[19]  Prateek Jain,et al.  Low-rank matrix completion using alternating minimization , 2012, STOC '13.

[20]  Dan Schonfeld,et al.  Compressive Sensing of Sparse Tensors , 2013, IEEE Transactions on Image Processing.

[21]  Ivan Oseledets,et al.  Tensor-Train Decomposition , 2011, SIAM J. Sci. Comput..

[22]  Pablo A. Parrilo,et al.  Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization , 2007, SIAM Rev..