{"title":"基于多线性张量环分解的有效张量补全方法","authors":"Jinshi Yu, Guoxu Zhou, Qibin Zhao, Kan Xie","doi":"10.23919/APSIPA.2018.8659492","DOIUrl":null,"url":null,"abstract":"By considering the balance unfolding scheme does help to catch the global information for tensor completion and the recently proposed tensor ring decomposition, in this paper a weighted multilinear tensor ring decomposition model is proposed for tensor completion and called MTRD. Utilizing the circular dimensional permutation invariance of tensor ring decomposition, a very balance matricization scheme $< k, d >$-unfolding is employed in MTRD. In order to evaluate MTRD, it is applied on both synthetic data and image tensor data, and the experiment results show that MTRD are able to achieve the desired relative square error by spending much less time than its compared methods, i.e. TMac-TT and TR-ALS. The results of image completion also show that MTRD outperforms its compared methods in relative square error. Specifically, TMac-TT and TR-ALS fails to get the same relative square error as MTRD and TR-ALS prevails TMac-TT but requiring a large amount of running time. To sum up, MTRD is more applicable than its compared methods.","PeriodicalId":287799,"journal":{"name":"2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA ASC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"An Effective Tensor Completion Method Based on Multi-linear Tensor Ring Decomposition\",\"authors\":\"Jinshi Yu, Guoxu Zhou, Qibin Zhao, Kan Xie\",\"doi\":\"10.23919/APSIPA.2018.8659492\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"By considering the balance unfolding scheme does help to catch the global information for tensor completion and the recently proposed tensor ring decomposition, in this paper a weighted multilinear tensor ring decomposition model is proposed for tensor completion and called MTRD. Utilizing the circular dimensional permutation invariance of tensor ring decomposition, a very balance matricization scheme $< k, d >$-unfolding is employed in MTRD. In order to evaluate MTRD, it is applied on both synthetic data and image tensor data, and the experiment results show that MTRD are able to achieve the desired relative square error by spending much less time than its compared methods, i.e. TMac-TT and TR-ALS. The results of image completion also show that MTRD outperforms its compared methods in relative square error. Specifically, TMac-TT and TR-ALS fails to get the same relative square error as MTRD and TR-ALS prevails TMac-TT but requiring a large amount of running time. To sum up, MTRD is more applicable than its compared methods.\",\"PeriodicalId\":287799,\"journal\":{\"name\":\"2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA ASC)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA ASC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23919/APSIPA.2018.8659492\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA ASC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/APSIPA.2018.8659492","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12
摘要
考虑到平衡展开方案有助于捕捉张量补全的全局信息,以及最近提出的张量环分解,本文提出了一种张量补全的加权多线性张量环分解模型,称为MTRD。利用张量环分解的圆维置换不变性,在MTRD中采用了一种非常平衡的矩阵化方案$< k, d >$-展开。为了对MTRD进行评价,将其应用于合成数据和图像张量数据,实验结果表明,与TMac-TT和TR-ALS方法相比,MTRD能够以更少的时间获得期望的相对平方误差。图像补全的结果也表明,MTRD在相对平方误差上优于其比较方法。具体而言,TMac-TT和TR-ALS无法获得与MTRD和TR-ALS相同的相对平方误差,但需要大量的运行时间。综上所述,MTRD比其比较方法更适用。
An Effective Tensor Completion Method Based on Multi-linear Tensor Ring Decomposition
By considering the balance unfolding scheme does help to catch the global information for tensor completion and the recently proposed tensor ring decomposition, in this paper a weighted multilinear tensor ring decomposition model is proposed for tensor completion and called MTRD. Utilizing the circular dimensional permutation invariance of tensor ring decomposition, a very balance matricization scheme $< k, d >$-unfolding is employed in MTRD. In order to evaluate MTRD, it is applied on both synthetic data and image tensor data, and the experiment results show that MTRD are able to achieve the desired relative square error by spending much less time than its compared methods, i.e. TMac-TT and TR-ALS. The results of image completion also show that MTRD outperforms its compared methods in relative square error. Specifically, TMac-TT and TR-ALS fails to get the same relative square error as MTRD and TR-ALS prevails TMac-TT but requiring a large amount of running time. To sum up, MTRD is more applicable than its compared methods.