Sparse Branch-and-Bound 2D-3D Registration Based on Prior Correspondences of Dense Points.
Jin PanZhe MinYutian ShenTingting LiuMax Q.-H. MengPublished in: ICARM (2022)
Keyphrases
- branch and bound
- point to point correspondences
- transformation parameters
- branch and bound algorithm
- image registration
- registration of range images
- lower bound
- search algorithm
- upper bound
- search space
- closest point
- branch and bound procedure
- optimal solution
- column generation
- intensity based registration
- combinatorial optimization
- registration process
- branch and bound method
- thin plate spline
- registration errors
- tree search
- point sets
- branch and bound search
- tree search algorithm
- planar scenes
- randomly generated problems
- ct and mr images
- beam search
- network design problem
- displacement field
- stereo correspondence
- max sat
- search tree
- point correspondences
- pose estimation
- feature points
- neural network
- partial solutions
- integer programming problems
- lagrangian heuristic
- registration accuracy
- dense correspondence
- camera pose
- genetic algorithm