Optimal landmark detection using shape models and branch and bound.
Brian AmbergThomas VetterPublished in: ICCV (2011)
Keyphrases
- branch and bound
- shape model
- landmark detection
- optimal solution
- branch and bound algorithm
- search algorithm
- lower bound
- upper bound
- search space
- column generation
- branch and bound procedure
- combinatorial optimization
- branch and bound method
- randomly generated problems
- shape prior
- beam search
- integer programming problems
- implicit enumeration
- dynamic programming
- tree search
- worst case
- network design problem
- deformable shapes
- shape variations
- shape modeling
- objective function
- energy function
- max sat
- branch and bound search
- search tree
- knapsack problem
- feasible solution
- tree search algorithm
- linear programming relaxation