首页 | 本学科首页   官方微博 | 高级检索  
     

基于张量链分解的低秩张量补全研究
引用本文:豆 蔻,吴云韬,黄龙庭,陈 里.基于张量链分解的低秩张量补全研究[J].武汉工程大学学报,2021,43(4):442-447.
作者姓名:豆 蔻  吴云韬  黄龙庭  陈 里
作者单位:1. 武汉工程大学计算机科学与工程学院,湖北 武汉 430205; 2. 武汉理工大学信息学院,湖北 武汉 430070;3. 武汉工程大学邮电与信息工程学院,湖北 武汉 430074
摘    要:为了进一步提高低秩张量补全性能,针对基于传统张量分解方法的张量补全问题研究中的计算复杂问题,根据张量链分解能够将高阶张量分解成一组三阶核心张量进行有效降维的特点,本文基于张量链分解的核心张量模型,采用核范数最小化方法求解,对缺失张量的低秩补全问题进行了研究,并且分别在实际图像以及合成数据上进行了算法对比实验,实验结果证明了本文方法的有效性,与目前流行的方法相比,运行速度更快、收敛性更好、补全结果也较优。

关 键 词:张量补全  张量链分解  核范数  张量分解

Low-Rank Tensor Completion Based on Tensor Train Decomposition
Authors:DOU Kou  WU Yuntao  HUANG Longting  CHEN Li
Affiliation:1. School of Computer Science and Engineering, Wuhan Institute of Technology, Wuhan 430205, China;2. School of Information Engineering, Wuhan University of Technology, Wuhan 430070, China;3. The College of Post and Telecommunication of WIT, Wuhan 430074, China
Abstract:To further improve the performance of low-rank tensor completion, for the current computational complexity in the study of tensor completion based on traditional tensor decomposition methods, high-order tensors can be decomposed into a set of third-order core tensors according to tensor train decomposition. Based on the core tensor model of tensor train decomposition, this paper uses the nuclear norm minimization method to study the problem of low-rank completion of missing tensors, and algorithm comparison experiments were carried out respectively based on images and synthetic data. The experimental results prove the effectiveness of the proposed method, and compared with the current popular methods, it runs faster, has better convergence and completion results.
Keywords:tensor completion  tensor train decomposition  nuclear norm  tensor decomposition
本文献已被 CNKI 等数据库收录!
点击此处可从《武汉工程大学学报》浏览原始摘要信息
点击此处可从《武汉工程大学学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号