Research map / Image generation / Image restoration
Multiresolution Search of the Rigid Motion Space for Intensity-Based Registration
Behrooz Nasihatkon, Fredrik Kahl
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 |
|---|---|---|---|
| add multiresolution search to Lipschitz optimization | Lipschitz branch and bound registration · 2D registration (starfish) | runtime: 3 hours and 13 minutes -> 44 seconds (speedup of order 263) | Improved |
| add multiresolution search to Lipschitz optimization | Lipschitz branch and bound registration · 2D registration (brain MRI slices) | runtime: 534 seconds -> 119 seconds (4.5 times speedup) | Improved |
| add multiresolution search to Lipschitz optimization | rotation-only 3D registration · 3D registration (vertebra) | runtime: 19 minutes and 47 seconds -> 29.8 seconds (40-fold) | Improved |
| add multiresolution search to symmetry plane detection | Lipschitz optimization · 3D reflective symmetry (vertebra) | runtime: 2 hours and 51 minutes -> 29.2 seconds (about 350 times) | Improved |
| add multiresolution search to 2D symmetry axis detection | Lipschitz optimization · 2D reflective symmetry (butterfly, face, brain MRI) | runtime: faster by a factor of more than 4 | Improved |
| prune grid at lowest resolution (decimation 32) | basic multiresolution grid search · rotation grid search | grid points ruled out: 99.25 % ruled out at m=32 | Improved |
| add translation to the searched parameters | basic multiresolution grid search · rotation plus translation grid search | grid points ruled out at m=32: 99.25 % -> 99.97 % | Improved |
| image with less energy compaction in low frequencies (butterfly sharper edges) | multiresolution Lipschitz · 2D symmetry detection | runtime | Hurt |
Closest papers by meaning
- Globally Optimal Rigid Intensity Based Registration: A Fast Fourier Domain Approach (CVPR 2016 · similarity 0.91)
- An Efficient Globally Optimal Algorithm for Asymmetric Point Matching (TPAMI 2016 · similarity 0.84)
- Efficient and Robust Registration on the 3D Special Euclidean Group (ICCV 2019 · similarity 0.84)
- Fast and Robust Non-Rigid Registration Using Accelerated Majorization-Minimization (TPAMI 2023 · similarity 0.84)
- A Stochastic Approach to Diffeomorphic Point Set Registration with Landmark Constraints (TPAMI 2016 · similarity 0.83)
- Linearly Converging Quasi Branch and Bound Algorithms for Global Rigid Registration (ICCV 2019 · similarity 0.83)
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.
