OMNI-DC: Highly Robust Depth Completion with Multiresolution Depth Integration

• URL: http://arxiv.org/abs/2411.19278v1
• Date: Thu, 28 Nov 2024 17:20:04 GMT
• Title: OMNI-DC: Highly Robust Depth Completion with Multiresolution Depth Integration
• Authors: Yiming Zuo, Willow Yang, Zeyu Ma, Jia Deng,
• Abstract summary: Depth completion (DC) aims to predict a dense depth map from an RGB image and sparse depth observations.<n>Existing methods for DC generalize poorly on new datasets or unseen sparse depth patterns.<n>We propose OMNI-DC, a highly robust DC model that generalizes well across various scenarios.
• Score: 26.6801726990372
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Depth completion (DC) aims to predict a dense depth map from an RGB image and sparse depth observations. Existing methods for DC generalize poorly on new datasets or unseen sparse depth patterns, limiting their practical applications. We propose OMNI-DC, a highly robust DC model that generalizes well across various scenarios. Our method incorporates a novel multi-resolution depth integration layer and a probability-based loss, enabling it to deal with sparse depth maps of varying densities. Moreover, we train OMNI-DC on a mixture of synthetic datasets with a scale normalization technique. To evaluate our model, we establish a new evaluation protocol named Robust-DC for zero-shot testing under various sparse depth patterns. Experimental results on Robust-DC and conventional benchmarks show that OMNI-DC significantly outperforms the previous state of the art. The checkpoints, training code, and evaluations are available at https://github.com/princeton-vl/OMNI-DC.

Related papers

• Propagating Sparse Depth via Depth Foundation Model for Out-of-Distribution Depth Completion [33.854696587141355]
  We propose a novel depth completion framework that leverages depth foundation models to attain remarkable robustness without large-scale training.<n>Specifically, we leverage a depth foundation model to extract environmental cues, including structural and semantic context, from RGB images to guide the propagation of sparse depth information into missing regions.<n>Our framework performs remarkably well in the OOD scenarios and outperforms existing state-of-the-art depth completion methods.
  arXiv  Detail & Related papers  (2025-08-07T02:38:24Z)
• PacGDC: Label-Efficient Generalizable Depth Completion with Projection Ambiguity and Consistency [63.74016242995453]
  PacGDC is a label-efficient technique that enhances data diversity with minimal annotation effort for generalizable depth completion.<n>We propose a new data synthesis pipeline that uses multiple depth foundation models as scale manipulators.<n>Experiments show that PacGDC achieves remarkable generalizability across multiple benchmarks.
  arXiv  Detail & Related papers  (2025-07-10T01:56:30Z)
• Multi-view Reconstruction via SfM-guided Monocular Depth Estimation [92.89227629434316]
  We present a new method for multi-view geometric reconstruction. We incorporate SfM information, a strong multi-view prior, into the depth estimation process. Our method significantly improves the quality of depth estimation compared to previous monocular depth estimation works.
  arXiv  Detail & Related papers  (2025-03-18T17:54:06Z)
• DepthLab: From Partial to Complete [80.58276388743306]
  Missing values remain a common challenge for depth data across its wide range of applications.<n>This work bridges this gap with DepthLab, a foundation depth inpainting model powered by image diffusion priors.<n>Our approach proves its worth in various downstream tasks, including 3D scene inpainting, text-to-3D scene generation, sparse-view reconstruction with DUST3R, and LiDAR depth completion.
  arXiv  Detail & Related papers  (2024-12-24T04:16:38Z)
• Prompting Depth Anything for 4K Resolution Accurate Metric Depth Estimation [108.04354143020886]
  We introduce prompting into depth foundation models, creating a new paradigm for metric depth estimation termed Prompt Depth Anything.<n>We use a low-cost LiDAR as the prompt to guide the Depth Anything model for accurate metric depth output, achieving up to 4K resolution.
  arXiv  Detail & Related papers  (2024-12-18T16:32:12Z)
• OGNI-DC: Robust Depth Completion with Optimization-Guided Neural Iterations [23.0962036039182]
  "Optimization-Guided Neural Iterations" (OGNI) is a novel framework for depth completion. OGNI-DC exhibits strong generalization, outperforming baselines on unseen datasets and across various sparsity levels. It has high accuracy, achieving state-of-the-art performance on the NYUv2 and the KITTI benchmarks.
  arXiv  Detail & Related papers  (2024-06-17T16:30:29Z)
• Learning Feature Inversion for Multi-class Anomaly Detection under General-purpose COCO-AD Benchmark [101.23684938489413]
  Anomaly detection (AD) is often focused on detecting anomalies for industrial quality inspection and medical lesion examination. This work first constructs a large-scale and general-purpose COCO-AD dataset by extending COCO to the AD field. Inspired by the metrics in the segmentation field, we propose several more practical threshold-dependent AD-specific metrics.
  arXiv  Detail & Related papers  (2024-04-16T17:38:26Z)
• SM4Depth: Seamless Monocular Metric Depth Estimation across Multiple Cameras and Scenes by One Model [72.0795843450604]
  Current approaches face challenges in maintaining consistent accuracy across diverse scenes. These methods rely on extensive datasets comprising millions, if not tens of millions, of data for training. This paper presents SM$4$Depth, a model that seamlessly works for both indoor and outdoor scenes.
  arXiv  Detail & Related papers  (2024-03-13T14:08:25Z)
• SparseDC: Depth Completion from sparse and non-uniform inputs [18.20396821395775]
  We propose SparseDC, a model for Depth Completion of Sparse and non-uniform depth inputs. The key contributions of SparseDC are two-fold. First, we design a simple strategy, called SFFM, to improve the robustness under sparse input. Second, we propose a two-branch feature embedder to predict both the precise local geometry of regions with available depth values and accurate structures in regions with no depth.
  arXiv  Detail & Related papers  (2023-11-30T13:36:27Z)
• Small Object Detection via Coarse-to-fine Proposal Generation and Imitation Learning [52.06176253457522]
  We propose a two-stage framework tailored for small object detection based on the Coarse-to-fine pipeline and Feature Imitation learning. CFINet achieves state-of-the-art performance on the large-scale small object detection benchmarks, SODA-D and SODA-A.
  arXiv  Detail & Related papers  (2023-08-18T13:13:09Z)
• Revisiting Deformable Convolution for Depth Completion [40.45231083385708]
  Depth completion aims to generate high-quality dense depth maps from sparse depth maps. Previous work usually employs RGB images as guidance, and introduces iterative spatial propagation to refine estimated coarse depth maps. We propose an effective architecture that leverages deformable kernel convolution as a single-pass refinement module.
  arXiv  Detail & Related papers  (2023-08-03T17:59:06Z)
• One at a Time: Progressive Multi-step Volumetric Probability Learning for Reliable 3D Scene Perception [59.37727312705997]
  This paper proposes to decompose the complicated 3D volume representation learning into a sequence of generative steps. Considering the recent advances achieved by strong generative diffusion models, we introduce a multi-step learning framework, dubbed as VPD. For the SSC task, our work stands out as the first to surpass LiDAR-based methods on the Semantic KITTI dataset.
  arXiv  Detail & Related papers  (2023-06-22T05:55:53Z)
• Monocular Visual-Inertial Depth Estimation [66.71452943981558]
  We present a visual-inertial depth estimation pipeline that integrates monocular depth estimation and visual-inertial odometry. Our approach performs global scale and shift alignment against sparse metric depth, followed by learning-based dense alignment. We evaluate on the TartanAir and VOID datasets, observing up to 30% reduction in RMSE with dense scale alignment.
  arXiv  Detail & Related papers  (2023-03-21T18:47:34Z)
• Deep Combinatorial Aggregation [58.78692706974121]
  Deep ensemble is a simple and effective method that achieves state-of-the-art results for uncertainty-aware learning tasks. In this work, we explore a generalization of deep ensemble called deep aggregation (DCA) DCA creates multiple instances of network components and aggregates their combinations to produce diversified model proposals and predictions.
  arXiv  Detail & Related papers  (2022-10-12T17:35:03Z)
• Towards Domain-agnostic Depth Completion [28.25756709062647]
  Existing depth completion methods are often targeted at a specific sparse depth type and generalize poorly across task domains. We present a method to complete sparse/semi-dense, noisy, and potentially low-resolution depth maps obtained by various range sensors. Our method shows superior cross-domain generalization ability against state-of-the-art depth completion methods.
  arXiv  Detail & Related papers  (2022-07-29T04:10:22Z)
• RGB-D Saliency Detection via Cascaded Mutual Information Minimization [122.8879596830581]
  Existing RGB-D saliency detection models do not explicitly encourage RGB and depth to achieve effective multi-modal learning. We introduce a novel multi-stage cascaded learning framework via mutual information minimization to "explicitly" model the multi-modal information between RGB image and depth data.
  arXiv  Detail & Related papers  (2021-09-15T12:31:27Z)
• Densely Nested Top-Down Flows for Salient Object Detection [137.74130900326833]
  This paper revisits the role of top-down modeling in salient object detection. It designs a novel densely nested top-down flows (DNTDF)-based framework. In every stage of DNTDF, features from higher levels are read in via the progressive compression shortcut paths (PCSP)
  arXiv  Detail & Related papers  (2021-02-18T03:14:02Z)
• Efficient Depth Completion Using Learned Bases [94.0808155168311]
  We propose a new global geometry constraint for depth completion. By assuming depth maps often lay on low dimensional subspaces, a dense depth map can be approximated by a weighted sum of full-resolution principal depth bases.
  arXiv  Detail & Related papers  (2020-12-02T11:57:37Z)
• AdaBins: Depth Estimation using Adaptive Bins [43.07310038858445]
  We propose a transformer-based architecture block that divides the depth range into bins whose center value is estimated adaptively per image. Our results show a decisive improvement over the state-of-the-art on several popular depth datasets.
  arXiv  Detail & Related papers  (2020-11-28T14:40:45Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.