Depth Image Inpainting: Improving Low Rank Matrix Completion with Low Gradient Regularization
원문 초록
We consider the case of inpainting single depth images. Without corresponding color images, previous or next frames, depth image inpainting is quite challenging. One natural solution is to regard the image as a matrix and adopt the low rank regularization just as inpainting color images. However, the low rank assumption does not make full use of the properties of depth images. A shallow observation may inspire us to penalize the non-zero gradients by sparse gradient regularization. However, statistics show that though most pixels have zero gradients, there is still a non-ignorable part of pixels whose gradients are equal to 1. Based on this specific property of depth images , we propose a low gradient regularization method in which we reduce the penalty for gradient 1 while penalizing the non-zero gradients to allow for gradual depth changes. The proposed low gradient regularization is integrated with the low rank regularization into the low rank low gradient approach for depth image inpainting. We compare our proposed low gradient regularization with sparse gradient regularization. The experimental results show the effectiveness of our proposed approach.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Randomized Approach to Matrix Completion: Applications in Collaborative Filtering and Image Inpainting
Efficient and Robust Freeway Traffic Speed Estimation under Oblique Grid using Vehicle Trajectory Data
Compressible Dynamics in Deep Overparameterized Low-Rank Learning & Adaptation
Linear Recursive Feature Machines provably recover low-rank matrices
New Hardness Results for Low-Rank Matrix Completion
AltGDmin: Alternating GD and Minimization for Partly-Decoupled (Federated) Optimization
토론
이 논문과 연결된 포럼 글이 아직 없습니다.