MEDeA: Multi-view Efficient Depth Adjustment

Mikhail Artemyev, Anna Vorontsova, Anna Sokolova, Alexander Limonov
6/17/2024
cs.CVcs.AI

No confident code implementation found for this paper.

Abstract

The majority of modern single-view depth estimation methods predict relative depth and thus cannot be directly applied in many real-world scenarios, despite impressive performance in the benchmarks. Moreover, single-view approaches cannot guarantee consistency across a sequence of frames. Consistency is typically addressed with test-time optimization of discrepancy across views; however, it takes hours to process a single scene. In this paper, we present MEDeA, an efficient multi-view test-time depth adjustment method, that is an order of magnitude faster than existing test-time approaches. Given RGB frames with camera parameters, MEDeA predicts initial depth maps, adjusts them by optimizing local scaling coefficients, and outputs temporally-consistent depth maps. Contrary to test-time methods requiring normals, optical flow, or semantics estimation, MEDeA produces high-quality predictions with a depth estimation network solely. Our method sets a new state-of-the-art on TUM RGB-D, 7Scenes, and ScanNet benchmarks and successfully handles smartphone-captured data from ARKitScenes dataset.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{artemyev2024medea,
  title  = {MEDeA: Multi-view Efficient Depth Adjustment},
  author = {Mikhail Artemyev and Anna Vorontsova and Anna Sokolova and Alexander Limonov},
  year   = {2024},
  eprint = {2406.12048},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2406.12048v1}
}

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/2406.12048.svg)](https://codeofpaper.com/paper/2406.12048)

Discussion