Concatenated image completion via tensor augmentation and completion

被引:13
作者
Bengua, Johann A. [1 ]
Tuan, Hoang D. [1 ]
Phien, Ho N. [1 ]
Do, Minh N. [2 ,3 ]
机构
[1] Univ Technol Sydney, Fac Engn & Informat Technol, Ultimo, Australia
[2] Univ Illinois, Dept Elect & Comp Engn, Urbana, IL USA
[3] Univ Illinois, Coordinated Sci Lab, Urbana, IL USA
来源
2016 10TH INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING AND COMMUNICATION SYSTEMS (ICSPCS) | 2016年
关键词
Color image recovery; tensor completion; ket augmentation; tensor train rank; image concatenation; MATRIX COMPLETION; FACTORIZATION;
D O I
10.1109/ICSPCS.2016.7843326
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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.
引用
收藏
页数:7
相关论文
共 28 条
[1]  
[Anonymous], 2003, PROC CVPR IEEE
[2]   Efficient Tensor Completion for Color Image and Video Recovery: Low-Rank Tensor Train [J].
Bengua, Johann A. ;
Phien, Ho N. ;
Hoang Duong Tuan ;
Do, Minh N. .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2017, 26 (05) :2466-2479
[3]   Optimal Feature Extraction and Classification of Tensors via Matrix Product State Decomposition [J].
Bengua, Johann A. ;
Phien, Ho N. ;
Tuan, Hoang D. .
2015 IEEE INTERNATIONAL CONGRESS ON BIG DATA - BIGDATA CONGRESS 2015, 2015, :669-672
[4]   A SINGULAR VALUE THRESHOLDING ALGORITHM FOR MATRIX COMPLETION [J].
Cai, Jian-Feng ;
Candes, Emmanuel J. ;
Shen, Zuowei .
SIAM JOURNAL ON OPTIMIZATION, 2010, 20 (04) :1956-1982
[5]   Exact Matrix Completion via Convex Optimization [J].
Candes, Emmanuel J. ;
Recht, Benjamin .
FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 2009, 9 (06) :717-772
[6]   Simultaneous Tensor Decomposition and Completion Using Factor Priors [J].
Chen, Yi-Lei ;
Hsu, Chiou-Ting ;
Liao, Hong-Yuan Mark .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2014, 36 (03) :577-591
[7]   Robust Spectral Compressed Sensing via Structured Matrix Completion [J].
Chen, Yuxin ;
Chi, Yuejie .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2014, 60 (10) :6576-6601
[8]  
Franz T, 2009, LECT NOTES COMPUT SC, V5823, P213, DOI 10.1007/978-3-642-04930-9_14
[9]   Tensor completion and low-n-rank tensor recovery via convex optimization [J].
Gandy, Silvia ;
Recht, Benjamin ;
Yamada, Isao .
INVERSE PROBLEMS, 2011, 27 (02)
[10]   VARIANTS OF ALTERNATING LEAST SQUARES TENSOR COMPLETION IN THE TENSOR TRAIN FORMAT [J].
Grasedyck, Lars ;
Kluge, Melanie ;
Kraemer, Sebastian .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2015, 37 (05) :A2424-A2450