Skip to content
DraconiticResearch
Search Sources API
203,948 studies31 sourcesUpdated 33 min ago
PreprintCC BY 4.0arXiv

XM4D: 4D Reconstruction through Certifiable Geometric Optimization

Abstract

Accurate 4D reconstruction remains challenging: jointly estimating camera motion, scene geometry, and non-rigid deformation entails highly nonconvex optimization, making global optimality difficult to guarantee. We present XM4D, a framework for accurate and efficient 4D reconstruction built upon certifiably globally optimal geometric optimization. By separating the estimation of camera motion from non-rigid deformation, we formulate both stages as structured quadratically constrained quadratic programs (QCQP) that admit semidefinite programming (SDP) relaxations and verifiable global optimality certificates. For camera motion estimation, we lift static point tracks into 3D using foundational depth prediction models and formulate a scaled bundle adjustment problem that jointly estimates camera poses, depth scales, and static landmarks. By analytically eliminating translations and landmarks, we reduce the problem to a QCQP over scaled rotations. For non-rigid reconstruction, we represent dynamic motion using an embedded deformation graph (EDG) and show that its tracking, rigidity, and temporal regularization objectives similarly reduce to a rotation-only QCQP. Both problems admit SDP relaxations that we solve efficiently with a GPU-accelerated Burer-Monteiro solver based on Riemannian optimization. The recovered geometry further initializes dynamic Gaussian splatting for photometric refinement. Extensive experiments across seven benchmarks demonstrate accurate camera motion estimation on both static and dynamic scenes, efficient optimization that scales to thousands of frames, and state-of-the-art novel-view rendering quality.

Related

  1. TinySDP: Real Time Semidefinite Optimization for Certifiable and Agile Edge Robotics
    Ishaan Mahajan, Jon Arrizabalaga, Andrea Grillo +4
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
  2. Congruence spectra and geometric reconstruction of T-algebras
    JuAe Song
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  3. Reconstruction of Geometric and Structural Aspects of Undeciphered Messages by Information-theoretic Methods
    Hector Zenil, Abicumaran Uthamacumaran
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  4. PnP*: A certifiable solver for Perspective-n-Point
    Bang-Shien Chen, Caitrin E. Eaton, David M. Rosen
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  5. Pointwise boundary observation in geometric optimization problems associated to variational inequalities
    Livia Betz, Cornel Marius Murea, Dan Tiba
    Evolution Equations and Control TheoryPeer-reviewedCC BYFull textGeneral mathematicsHAL
BibTeX
@misc{han2026xm4d,
  title = {{XM4D: 4D Reconstruction through Certifiable Geometric Optimization}},
  author = {Haoyu Han and Jack Benarroch Jedlicki and Jiahui Lei and Heng Yang},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2611.07902},
  eprint = {2611.07902},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.07902},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - XM4D: 4D Reconstruction through Certifiable Geometric Optimization
AU  - Haoyu Han
AU  - Jack Benarroch Jedlicki
AU  - Jiahui Lei
AU  - Heng Yang
PY  - 2026
DA  - 2026/11/05
PB  - arXiv
DO  - 10.48550/arxiv.2611.07902
UR  - https://arxiv.org/abs/2611.07902
AB  - Accurate 4D reconstruction remains challenging: jointly estimating camera motion, scene geometry, and non-rigid deformation entails highly nonconvex optimization, making global optimality difficult to guarantee. We present XM4D, a framework for accurate and efficient 4D reconstruction built upon certifiably globally optimal geometric optimization. By separating the estimation of camera motion from non-rigid deformation, we formulate both stages as structured quadratically constrained quadratic programs (QCQP) that admit semidefinite programming (SDP) relaxations and verifiable global optimality certificates. For camera motion estimation, we lift static point tracks into 3D using foundational depth prediction models and formulate a scaled bundle adjustment problem that jointly estimates camera poses, depth scales, and static landmarks. By analytically eliminating translations and landmarks, we reduce the problem to a QCQP over scaled rotations. For non-rigid reconstruction, we represent dynamic motion using an embedded deformation graph (EDG) and show that its tracking, rigidity, and temporal regularization objectives similarly reduce to a rotation-only QCQP. Both problems admit SDP relaxations that we solve efficiently with a GPU-accelerated Burer-Monteiro solver based on Riemannian optimization. The recovered geometry further initializes dynamic Gaussian splatting for photometric refinement. Extensive experiments across seven benchmarks demonstrate accurate camera motion estimation on both static and dynamic scenes, efficient optimization that scales to thousands of frames, and state-of-the-art novel-view rendering quality.
ER  -