DepthFM: Fast Generative Monocular Depth Estimation with Flow Matching

Current discriminative depth estimation methods often produce blurry artifacts, while generative approaches suffer from slow sampling due to curvatures in the noise-to-depth transport. Our method addresses these challenges by framing depth estimation as a direct transport between image and depth distributions. We are the first to explore flow matching in this field, and we demonstrate that its interpolation trajectories enhance both training and sampling efficiency while preserving high performance. While generative models typically require extensive training data, we mitigate this dependency by integrating external knowledge from a pre-trained image diffusion model, enabling effective transfer even across differing objectives. To further boost our model performance, we employ synthetic data and utilize image-depth pairs generated by a discriminative model on an in-the-wild image dataset. As a generative model, our model can reliably estimate depth confidence, which provides an additional advantage. Our approach achieves competitive zero-shot performance on standard benchmarks of complex natural scenes while improving sampling efficiency and only requiring minimal synthetic data for training.

Authors

Institutions

Publication Details

Journal
Proceedings of the AAAI Conference on Artificial Intelligence
Published
2025-04-11
DOI
https://doi.org/10.1609/aaai.v39i3.32330
Citations
13
Primary Topic
Advanced Vision and Imaging
Type
article
Field-Weighted Citation Impact
5.61

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

DepthFM: Fast Generative Monocular Depth Estimation with Flow Matching

Pingchuan Ma, Vincent Tao Hu, Ming Gui, Dmytro Kotovenko et al.
13 citations
Proceedings of the AAAI Conference on Artificial Intelligence
Advanced Vision and Imaging
5.61
article

DepthFM: Fast Generative Monocular Depth Estimation with Flow Matching

Pingchuan Ma, Vincent Tao Hu, Ming Gui, Dmytro Kotovenko, Olga Grebenkova, Björn Ommer, Stefan Andreas Baumann, Ulrich Prestel, Johannes Schusterbauer
article en
13 citations

Abstract

Current discriminative depth estimation methods often produce blurry artifacts, while generative approaches suffer from slow sampling due to curvatures in the noise-to-depth transport. Our method addresses these challenges by framing depth estimation as a direct transport between image and depth distributions. We are the first to explore flow matching in this field, and we demonstrate that its interpolation trajectories enhance both training and sampling efficiency while preserving high performance. While generative models typically require extensive training data, we mitigate this dependency by integrating external knowledge from a pre-trained image diffusion model, enabling effective transfer even across differing objectives. To further boost our model performance, we employ synthetic data and utilize image-depth pairs generated by a discriminative model on an in-the-wild image dataset. As a generative model, our model can reliably estimate depth confidence, which provides an additional advantage. Our approach achieves competitive zero-shot performance on standard benchmarks of complex natural scenes while improving sampling efficiency and only requiring minimal synthetic data for training.

Proceedings of the AAAI Conference on Artificial IntelligenceVol. 39(3)
LMU Klinikum (DE), Ludwig-Maximilians-Universität München (DE)
Bayer, Deutsche Forschungsgemeinschaft, Gauss Centre for Supercomputing
Openalex Percentile: Top 3%
Advanced Vision and Imaging
5.61
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.