MoRe: Monocular Geometry Refinement via Graph Optimization for Cross-View Consistency

Dongki Jung, Jaehoon Choi, Yonghan Lee, Sungmin Eum, Heesung Kwon +1 more
10/8/2025
cs.CV

No confident code implementation found for this paper.

Abstract

Monocular 3D foundation models offer an extensible solution for perception tasks, making them attractive for broader 3D vision applications. In this paper, we propose MoRe, a training-free Monocular Geometry Refinement method designed to improve cross-view consistency and achieve scale alignment. To induce inter-frame relationships, our method employs feature matching between frames to establish correspondences. Rather than applying simple least squares optimization on these matched points, we formulate a graph-based optimization framework that performs local planar approximation using the estimated 3D points and surface normals estimated by monocular foundation models. This formulation addresses the scale ambiguity inherent in monocular geometric priors while preserving the underlying 3D structure. We further demonstrate that MoRe not only enhances 3D reconstruction but also improves novel view synthesis, particularly in sparse view rendering scenarios.

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{jung2025more,
  title  = {MoRe: Monocular Geometry Refinement via Graph Optimization for Cross-View Consistency},
  author = {Dongki Jung and Jaehoon Choi and Yonghan Lee and Sungmin Eum and Heesung Kwon and Dinesh Manocha},
  year   = {2025},
  eprint = {2510.07119},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2510.07119v2}
}

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

Discussion