A family of globally optimal branch-and-bound algorithms for 2D-3D correspondence-free registration.
Mark BrownDavid WindridgeJean-Yves GuillemautPublished in: Pattern Recognit. (2019)
Keyphrases
- globally optimal
- branch and bound algorithm
- image registration
- intensity based registration
- branch and bound
- lower bound
- transformation parameters
- ct and mr images
- randomly generated
- upper bound
- graph cuts
- np hard
- locally optimal
- surface segmentation
- registration process
- set covering problem
- optimal solution
- combinatorial optimization
- search tree
- haplotype inference
- boolean satisfiability
- finding an optimal solution
- global optimality
- registration errors
- optimal decisions
- point cloud
- thin plate spline
- search algorithm
- variable ordering
- column generation
- pose estimation
- special case
- image segmentation
- registration accuracy
- search space
- evolutionary algorithm
- set covering
- approximation algorithms