TY - GEN
T1 - Deep Unfolding Low-Rank Tensor Completion for Large-Scale High-Dimensional Data Recovery
AU - Zhong, Zhirong
AU - Hua, Xuanhao
AU - Zhang, Zhongyi
AU - Zhai, Zhi
AU - Ma, Meng
AU - Liu, Jinxin
N1 - Publisher Copyright:
© 2026 IEEE.
PY - 2026
Y1 - 2026
N2 - Accurate anomaly detection in monitoring videos from Liquid Rocket Engine (LRE) hot-fire tests critically relies on effective removal of complex interferences, including mist occlusion, distortion, and jitter. Low-Rank Tensor Completion (LRTC) have been widely applied in aeras such as video background modeling, which provides a powerful framework for recovering clean data from high-dimensional, corrupted observations. However, extensive missing entries and severe noise contamination hinder its practical deployment. To address these issues, we propose a scalable and learnable non-convex algorithm termed Deep Unfolded Low-Rank Tensor Completion (DUL-RTC). DULRTC integrates tensor factorization with algorithmic unfolding, achieving low computational complexity. We further develop a hybrid infinite-recurrent unfolding architecture, which generalizes conventional deep unfolding from a fixed number of iterations to a potentially infinite sequence, enabling flexible trade-offs between accuracy and efficiency. Extensive experiments on both synthetic and real-world datasets demonstrate that DULRTC consistently outperforms state-of-the-art baselines. In particular, DULRTC achieves robust tensor recovery under Gaussian noise and random missing patterns, and effectively suppresses complex interferences in monitoring videos from LRE hot-fire tests.
AB - Accurate anomaly detection in monitoring videos from Liquid Rocket Engine (LRE) hot-fire tests critically relies on effective removal of complex interferences, including mist occlusion, distortion, and jitter. Low-Rank Tensor Completion (LRTC) have been widely applied in aeras such as video background modeling, which provides a powerful framework for recovering clean data from high-dimensional, corrupted observations. However, extensive missing entries and severe noise contamination hinder its practical deployment. To address these issues, we propose a scalable and learnable non-convex algorithm termed Deep Unfolded Low-Rank Tensor Completion (DUL-RTC). DULRTC integrates tensor factorization with algorithmic unfolding, achieving low computational complexity. We further develop a hybrid infinite-recurrent unfolding architecture, which generalizes conventional deep unfolding from a fixed number of iterations to a potentially infinite sequence, enabling flexible trade-offs between accuracy and efficiency. Extensive experiments on both synthetic and real-world datasets demonstrate that DULRTC consistently outperforms state-of-the-art baselines. In particular, DULRTC achieves robust tensor recovery under Gaussian noise and random missing patterns, and effectively suppresses complex interferences in monitoring videos from LRE hot-fire tests.
KW - Deep unfolding
KW - High-dimensional data recovery
KW - Liquid rocket engine anomaly detection
KW - Lowrank tensor completion
UR - https://www.scopus.com/pages/publications/105048458508
U2 - 10.1109/ICMERR70056.2026.11643102
DO - 10.1109/ICMERR70056.2026.11643102
M3 - 会议稿件
AN - SCOPUS:105048458508
T3 - 2026 10th International Conference on Mechanical Engineering and Robotics Research, ICMERR 2026
SP - 170
EP - 174
BT - 2026 10th International Conference on Mechanical Engineering and Robotics Research, ICMERR 2026
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 10th International Conference onMechanical Engineering and Robotics Research, ICMERR 2026
Y2 - 20 May 2026 through 22 May 2026
ER -