Research map / Point clouds / Registration and matching
Convex Global 3D Registration With Lagrangian Duality
Check your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (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 |
|---|---|---|---|
| Use the strengthened Lagrangian dual relaxation with additional valid quadratic rotational constraints instead of the Olsson relaxation | 3D registration · Synthetic 3D registration | optimality rate | Helped |
| Use the strengthened Lagrangian dual relaxation with additional valid quadratic rotational constraints instead of the Olsson relaxation | 3D registration · Real 3D registration | optimality rate | Helped |
| Use the proposed relaxation instead of Branch and Bound | 3D registration · Synthetic and real 3D registration | runtime: two orders of magnitude | Helped |
Closest papers by meaning
- Rotation Averaging and Strong Duality (CVPR 2018 · similarity 0.89)
- Global Optimality for Point Set Registration Using Semidefinite Programming (CVPR 2020 · similarity 0.88)
- Adaptive Annealing for Robust Geometric Estimation (CVPR 2023 · similarity 0.87)
- CARL: A Framework for Equivariant Image Registration (CVPR 2025 · similarity 0.85)
- Scalable 3D Registration via Truncated Entry-wise Absolute Residuals (CVPR 2024 · similarity 0.84)
- Convex Relaxation for Robust Vanishing Point Estimation in Manhattan World (CVPR 2025 · similarity 0.84)
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.