FDCT: Fast Depth Completion for Transparent Objects

Tianan Li, Zhehan Chen, Huan Liu, Chen Wang
7/23/2023
cs.CV

Official code: Nonmy/FDCT (27 stars, last commit 2023-08-28).

Abstract

Depth completion is crucial for many robotic tasks such as autonomous driving, 3-D reconstruction, and manipulation. Despite the significant progress, existing methods remain computationally intensive and often fail to meet the real-time requirements of low-power robotic platforms. Additionally, most methods are designed for opaque objects and struggle with transparent objects due to the special properties of reflection and refraction. To address these challenges, we propose a Fast Depth Completion framework for Transparent objects (FDCT), which also benefits downstream tasks like object pose estimation. To leverage local information and avoid overfitting issues when integrating it with global information, we design a new fusion branch and shortcuts to exploit low-level features and a loss function to suppress overfitting. This results in an accurate and user-friendly depth rectification framework which can recover dense depth estimation from RGB-D images alone. Extensive experiments demonstrate that FDCT can run about 70 FPS with a higher accuracy than the state-of-the-art methods. We also demonstrate that FDCT can improve pose estimation in object grasping tasks. The source code is available at https://github.com/Nonmy/FDCT

View on arXivView PDF

Code Implementations(1)

Nonmy/FDCTOfficial100%

Experiment and Code of papper FDCT: A Fast Depth Completion Network for Transparent Objects

271PythonOct 4, 20223 years ago

Similar Papers

Cite this paper

@article{li2023fdct,
  title  = {FDCT: Fast Depth Completion for Transparent Objects},
  author = {Tianan Li and Zhehan Chen and Huan Liu and Chen Wang},
  year   = {2023},
  eprint = {2307.12274},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2307.12274v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2307.12274.svg)](https://codeofpaper.com/paper/2307.12274)

Discussion