AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

Bundle Adjustment on a Graph Processor

Joseph Ortiz, Mark Pupilli, Stefan Leutenegger, Andrew J. Davison

CVPR 2020 · Graph learning › Graph algorithms and clustering · approach: Neural combinatorial optimization on graphs · 36 citations (OpenAlex)

Check your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use GBP on the IPU instead of Ceres for bundle adjustmentBundle adjustment · 10 TUM sequencestime to ARE < 1.5 pixels: 24x faster on averageImproved
Use GBP on the IPU instead of Ceres after each new keyframeIncremental SLAM · First 30 keyframes of three TUM sequencestime to ARE < 1.5 pixels: 36x faster on averageImproved
Add a Huber loss to GBP (ablation)GBP · fr1desk with incorrect data associationsconverged reprojection errorImproved
Remove the Huber loss (ablation)GBP · fr1desk with more than 3% bad associationsconvergenceHurt
Add a Huber loss (ablation)Ceres · fr1desk with incorrect data associationsconvergenceMixed
Use GBP instead of Ceres for convergence from noisy keyframe initializationsBundle adjustment · fr1desk and fr3teddysuccessful convergence rateNo clear effect

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy