Research map / Learning theory and algorithms / Sample complexity
Linearly Converging Quasi Branch and Bound Algorithms for Global Rigid Registration
Nadav Dym, Shahar Ziv Kovalsky
Read the paperCheck 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 changed | Where | Measured | Effect |
|---|---|---|---|
| replace linear BnB lower bounds with quadratic quasi-lower bounds | Go-ICP BnB for rigid-CP · Synthetic rigid-CP, high accuracy or noise | function evaluations: Go-ICP grows rapidly; qBnB stabilizes at almost constant 10^6 evaluations | Improved |
| use qBnB instead of Go-ICP at low noise and low accuracy | rigid-CP · Synthetic rigid-CP | function evaluations | No clear effect |
| use qBnB instead of Go-ICP on noisy bunny registration | rigid-CP · Stanford bunny, sigma=0.1 | run time: over 6 hours -> under 7 minutes | Improved |
| use qBnB instead of BFS BnB on 2D frog silhouettes | rigid bijective · 2D frog silhouettes, 50 points | run time (seconds): 11 -> 0.5 | Improved |
| use qBnB instead of BFS BnB on 3D chairs | rigid bijective · 3D chair meshes, 50 points | convergence: over 1 hour, not converged -> 6.5 seconds | Improved |
| use qBnB instead of Auto3dgm pairwise matching | morphology alignment · Ateles teeth, 200 points | alignment energy and run time: ~ 3 seconds -> 2-5 minutes | Mixed |
Closest papers by meaning
- Globally Optimal Rigid Intensity Based Registration: A Fast Fourier Domain Approach (CVPR 2016 · similarity 0.87)
- An Efficient Globally Optimal Algorithm for Asymmetric Point Matching (TPAMI 2016 · similarity 0.87)
- Fast Rotation Search with Stereographic Projections for 3D Registration (TPAMI 2016 · similarity 0.86)
- Quasi-Newton Solver for Robust Non-Rigid Registration (CVPR 2020 · similarity 0.86)
- Fast and Robust Non-Rigid Registration Using Accelerated Majorization-Minimization (TPAMI 2023 · similarity 0.86)
- Accelerating Globally Optimal Consensus Maximization in Geometric Vision (TPAMI 2024 · similarity 0.86)
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.
