A depth-lifted bundle adjustment reformulated as a convex SDP can be solved globally on GPU, yielding a fast and scalable SfM pipeline.
Optimization algorithms on matrix manifolds
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.RO 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Building Rome with Convex Optimization
A depth-lifted bundle adjustment reformulated as a convex SDP can be solved globally on GPU, yielding a fast and scalable SfM pipeline.