Coarse to Fine Two-Stage Approach to Robust Tensor Completion of Visual Data
Tensor completion is the problem of estimating the missing values of high-order data from partially observed entries. Data corruption due to prevailing outliers poses major challenges to traditional tensor completion algorithms, which catalyzed the development of robust algorithms that alleviate the effect of outliers. However, existing robust methods largely presume that the corruption is sparse, which may not hold in practice. In this paper, we develop a two-stage robust tensor completion approach to deal with tensor completion of visual data with a large amount of gross corruption. A novel coarse-to-fine framework is proposed which uses a global coarse completion result to guide a local patch refinement process. To efficiently mitigate the effect of a large number of outliers on tensor recovery, we develop a new M-estimator-based robust tensor ring recovery method which can adaptively identify the outliers and alleviate their negative effect in the optimization. The experimental results demonstrate the superior performance of the proposed approach over state-of-the-art robust algorithms for tensor completion.
Code (0)
등록된 구현이 없습니다.
Tasks
Missing ValuesSimilar Papers 제목 키워드 기반
Coarse-To-Fine Tensor Trains for Compact Visual Representations
The ability to learn compact, high-quality, and easy-to-optimize representations for visual data is paramount to many applications such as novel view synthesis and 3D reconstruction. Recent work has shown substantial suc…
3D ReconstructionDenoisingNovel View SynthesisTensor NetworksMTC: Multiresolution Tensor Completion from Partial and Coarse Observations
Existing tensor completion formulation mostly relies on partial observations from a single tensor. However, tensors extracted from real-world data are often more complex due to: (i) Partial observation: Only a small subs…
Coarse to Fine: Image Restoration Boosted by Multi-Scale Low-Rank Tensor Completion
Existing low-rank tensor completion (LRTC) approaches aim at restoring a partially observed tensor by imposing a global low-rank constraint on the underlying completed tensor. However, such a global rank assumption suffe…
Image RestorationFCFR-Net: Feature Fusion based Coarse-to-Fine Residual Learning for Depth Completion
Depth completion aims to recover a dense depth map from a sparse depth map with the corresponding color image as input. Recent approaches mainly formulate depth completion as a one-stage end-to-end learning task, which o…
Depth CompletionDigging into Intrinsic Contextual Information for High-fidelity 3D Point Cloud Completion
The common occurrence of occlusion-induced incompleteness in point clouds has made point cloud completion (PCC) a highly-concerned task in the field of geometric processing. Existing PCC methods typically produce complet…
Point Cloud Completion