Tensor-Ring Nuclear Norm Minimization and Application for Visual Data Completion
원문 초록
Tensor ring (TR) decomposition has been successfully used to obtain the state-of-the-art performance in the visual data completion problem. However, the existing TR-based completion methods are severely non-convex and computationally demanding. In addition, the determination of the optimal TR rank is a tough work in practice. To overcome these drawbacks, we first introduce a class of new tensor nuclear norms by using tensor circular unfolding. Then we theoretically establish connection between the rank of the circularly-unfolded matrices and the TR ranks. We also develop an efficient tensor completion algorithm by minimizing the proposed tensor nuclear norm. Extensive experimental results demonstrate that our proposed tensor completion method outperforms the conventional tensor completion methods in the image/video in-painting problem with striped missing values.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Leveraging Predictive Equivalence in Decision Trees
Cross-Domain Conditional Diffusion Models for Time Series Imputation
RADAR: Benchmarking Language Models on Imperfect Tabular Data
IMTS is Worth Time $\times$ Channel Patches: Visual Masked Autoencoders for Irregular Multivariate Time Series Prediction
Integrative Analysis and Imputation of Multiple Data Streams via Deep Gaussian Processes
ImputeINR: Time Series Imputation via Implicit Neural Representations for Disease Diagnosis with Missing Data
토론
이 논문과 연결된 포럼 글이 아직 없습니다.