Concatenated image completion via tensor augmentation and completion

Preprint English OPEN
Bengua, Johann A. ; Tuan, Hoang D. ; Phien, Ho N. ; Do, Minh N. (2016)
  • Subject: Computer Science - Computer Vision and Pattern Recognition | Computer Science - Data Structures and Algorithms | Computer Science - Learning
    acm: ComputingMethodologies_COMPUTERGRAPHICS | MathematicsofComputing_NUMERICALANALYSIS | ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION

This paper proposes a novel framework called concatenated image completion via tensor augmentation and completion (ICTAC), which recovers missing entries of color images with high accuracy. Typical images are second- or third-order tensors (2D/3D) depending if they are grayscale or color, hence tensor completion algorithms are ideal for their recovery. The proposed framework performs image completion by concatenating copies of a single image that has missing entries into a third-order tensor, applying a dimensionality augmentation technique to the tensor, utilizing a tensor completion algorithm for recovering its missing entries, and finally extracting the recovered image from the tensor. The solution relies on two key components that have been recently proposed to take advantage of the tensor train (TT) rank: A tensor augmentation tool called ket augmentation (KA) that represents a low-order tensor by a higher-order tensor, and the algorithm tensor completion by parallel matrix factorization via tensor train (TMac-TT), which has been demonstrated to outperform state-of-the-art tensor completion algorithms. Simulation results for color image recovery show the clear advantage of our framework against current state-of-the-art tensor completion algorithms.
  • References (19)
    19 references, page 1 of 2

    [1] E. Candès and B. Recht, “Exact matrix completion via convex optimization,” Found. Comput. Math., vol. 9, no. 6, pp. 717-772, 2009.

    [2] Z. Wen, W. Yin, and Y. Zhang, “Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm,” Mathematical Programming Computation, vol. 4, no. 4, pp. 333-361, 2012.

    [3] J.-F. Cai, E. J. Candès, and Z. Shen, “A singular value thresholding algorithm for matrix completion,” SIAM Journal on Optimization, vol. 20, no. 4, pp. 1956-1982, 2010.

    [4] Y. Chen and Y. Chi, “Robust spectral compressed sensing via structured matrix completion,” IEEE Transactions on Information Theory, vol. 60, no. 10, pp. 6576-6601, Oct 2014.

    [5] P. J. Shin, P. E. Z. Larson, M. A. Ohliger, M. Elad, J. M. Pauly, D. B. Vigneron, and M. Lustig, “Calibrationless parallel imaging reconstruction based on structured low-rank matrix completion,” Magnetic Resonance in Medicine, vol. 72, no. 4, pp. 959-970, 2014.

    [6] A. Kapur, K. Marwah, and G. Alterovitz, “Gene expression prediction using low-rank matrix completion,” BMC Bioinformatics, vol. 17, no. 1, pp. 1-13, 2016.

    [7] Y. Luo, T. Liu, D. Tao, and C. Xu, “Multiview matrix completion for multilabel image classification,” IEEE Transactions on Image Processing, vol. 24, no. 8, pp. 2355-2368, Aug 2015.

    [8] T. G. Kolda and B. W. Bader, “Tensor decompositions and applications,” SIAM Review, vol. 51, no. 3, pp. 455-500, 2009.

    [9] M. Vasilescu and D. Terzopoulos, “Multilinear subspace analysis of image ensembles,” in Proc. IEEE Conf. Computer Vision and Pattern Recognition, vol. 2, June 2003, pp. 93-99.

    [10] J.-T. Sun, H.-J. Zeng, H. Liu, Y. Lu, and Z. Chen, “Cubesvd: A novel approach to personalized web search,” in Proc. 14th Int'l World Wide Web Conf. (WWW ', 05), 2005, pp. 382-390.

  • Related Research Results (1)
  • Metrics
    No metrics available
Share - Bookmark