Low-rank tensor completion via combined non-local self-similarity and low-rank regularization

被引:39
作者
Li, Xiao-Tong [1 ]
Zhao, Xi-Le [1 ]
Jiang, Tai-Xiang [1 ]
Zheng, Yu-Bang [1 ]
Ji, Teng-Yu [2 ]
Huang, Ting-Zhu [1 ]
机构
[1] Univ Elect Sci & Technol China, Res Ctr Image & Vis Comp, Sch Math Sci, Chengdu 611731, Sichuan, Peoples R China
[2] Northwestern Polytech Univ, Sch Sci, Xian 710072, Shaanxi, Peoples R China
关键词
Low-rank tensor completion; Parallel low-rank matrix factorization; Non-local self-similarity; Plug and Play; Block successive upper-bound minimization; THRESHOLDING ALGORITHM; MATRIX FACTORIZATION; MODEL; PENALIZATION; SPARSITY; IMAGES;
D O I
10.1016/j.neucom.2019.07.092
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Global low-rank methods have achieved great successes in tensor completion. However, these methods neglected the abundant non-local self-similarities, which exist in a wide range of multi-dimensional imaging data. To integrate the global and non-local property of the underlying tensor, we propose a novel low-rank tensor completion model via combined non-local self-similarity and low-rank regularization, which is named as NLS-LR. We adopt the parallel low-rank matrix factorization to guarantee the global low-rankness while plugging in non-local based denoisers to promote the non-local self-similarity instead of tailoring regularizers. To tackle the proposed model, we develop an efficient block successive upper-bound minimization (BSUM) based algorithm. Numerical experiment results demonstrate that the proposed method outperforms many state-of-the-art tensor completion methods in terms of quality metrics and visual effects. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页码:1 / 12
页数:12
相关论文
共 50 条
[41]   Low-Rank Hankel Tensor Completion for Traffic Speed Estimation [J].
Wang, Xudong ;
Wu, Yuankai ;
Zhuang, Dingyi ;
Sun, Lijun .
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2023, 24 (05) :4862-4871
[42]   Enhanced Sparsity Prior Model for Low-Rank Tensor Completion [J].
Xue, Jize ;
Zhao, Yongqiang ;
Liao, Wenzhi ;
Chan, Jonathan Cheung-Wai ;
Kong, Seong G. .
IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2020, 31 (11) :4567-4581
[43]   Learning amore compact representation for low-rank tensor completion [J].
Li, Xi-Zhuo ;
Jiang, Tai-Xiang ;
Yang, Liqiao ;
Liu, Guisong .
NEUROCOMPUTING, 2025, 617
[44]   Riemannian conjugate gradient method for low-rank tensor completion [J].
Duan, Shan-Qi ;
Duan, Xue-Feng ;
Li, Chun-Mei ;
Li, Jiao-Fen .
ADVANCES IN COMPUTATIONAL MATHEMATICS, 2023, 49 (03)
[45]   LRTCFPan: Low-Rank Tensor Completion Based Framework for Pansharpening [J].
Wu, Zhong-Cheng ;
Huang, Ting-Zhu ;
Deng, Liang-Jian ;
Huang, Jie ;
Chanussot, Jocelyn ;
Vivone, Gemine .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2023, 32 :1640-1655
[46]   Riemannian conjugate gradient method for low-rank tensor completion [J].
Shan-Qi Duan ;
Xue-Feng Duan ;
Chun-Mei Li ;
Jiao-Fen Li .
Advances in Computational Mathematics, 2023, 49
[47]   An Efficient Non-convex Mixture Method for Low-rank Tensor Completion [J].
Shi Chengfei ;
Wan Li ;
Huang Zhengdong ;
Xiong Tifan .
PROCEEDINGS OF 2018 THE 2ND INTERNATIONAL CONFERENCE ON VIDEO AND IMAGE PROCESSING (ICVIP 2018), 2018, :112-117
[48]   Low-Rank Tensor Completion Based on Log-Det Rank Approximation and Matrix Factorization [J].
Shi, Chengfei ;
Huang, Zhengdong ;
Wan, Li ;
Xiong, Tifan .
JOURNAL OF SCIENTIFIC COMPUTING, 2019, 80 (03) :1888-1912
[49]   Low-Rank Tensor Completion Based on Log-Det Rank Approximation and Matrix Factorization [J].
Chengfei Shi ;
Zhengdong Huang ;
Li Wan ;
Tifan Xiong .
Journal of Scientific Computing, 2019, 80 :1888-1912
[50]   Graph Matching with Low-rank Regularization [J].
Yu, Tianshu ;
Wang, Ruisheng .
2016 IEEE WINTER CONFERENCE ON APPLICATIONS OF COMPUTER VISION (WACV 2016), 2016,