Globally Optimal Registration based on Fast Branch and Bound.
Luca ConsoliniMattia LauriniMarco LocatelliDario Lodi RizziniPublished in: CoRR (2019)
Keyphrases
- globally optimal
- branch and bound
- lower bound
- branch and bound algorithm
- search algorithm
- search space
- optimal solution
- upper bound
- graph cuts
- column generation
- combinatorial optimization
- surface segmentation
- locally optimal
- randomly generated problems
- branch and bound procedure
- network design problem
- tree search algorithm
- branch and bound search
- branch and bound method
- optimal decisions
- global optimality
- lagrangian heuristic
- integer programming problems
- beam search
- tree search
- depth first search
- convex relaxation
- window search
- partial solutions
- combinatorial optimization problems
- constraint satisfaction problems
- computer vision