Sedighin Farnaz, Cichocki Andrzej
Medical Image and Signal Processing Research Center, School of Advanced Technologies in Medicine, Isfahan University of Medical Sciences, Isfahan, Iran.
Computational and Data Intensive Science and Engineering Department, Skolkovo Institute of Science and Technology (SKOLTECH), Moscow, Russia.
Front Artif Intell. 2021 Aug 13;4:687176. doi: 10.3389/frai.2021.687176. eCollection 2021.
Tensor Completion is an important problem in big data processing. Usually, data acquired from different aspects of a multimodal phenomenon or different sensors are incomplete due to different reasons such as noise, low sampling rate or human mistake. In this situation, recovering the missing or uncertain elements of the incomplete dataset is an important step for efficient data processing. In this paper, a new completion approach using Tensor Ring (TR) decomposition in the embedded space has been proposed. In the proposed approach, the incomplete data tensor is first transformed into a higher order tensor using the block Hankelization method. Then the higher order tensor is completed using TR decomposition with rank incremental and multistage strategy. Simulation results show the effectiveness of the proposed approach compared to the state of the art completion algorithms, especially for very high missing ratios and noisy cases.
张量补全是大数据处理中的一个重要问题。通常,从多模态现象的不同方面或不同传感器获取的数据由于噪声、低采样率或人为错误等不同原因而不完整。在这种情况下,恢复不完整数据集的缺失或不确定元素是高效数据处理的重要一步。本文提出了一种在嵌入空间中使用张量环(TR)分解的新补全方法。在所提出的方法中,首先使用块汉克尔化方法将不完整数据张量转换为高阶张量。然后使用具有秩增量和多阶段策略的TR分解来完成高阶张量。仿真结果表明,与现有补全算法相比,所提出的方法是有效的,特别是对于非常高的缺失率和噪声情况。