Segmentation of Partially Overlapping Convex Objects Using Branch and Bound Algorithm.
Sahar ZafariTuomas EerolaJouni SampoHeikki KälviäinenHeikki HaarioPublished in: ACCV Workshops (3) (2016)
Keyphrases
- branch and bound algorithm
- partially overlapping
- lower bound
- deformable shapes
- branch and bound
- object segmentation
- upper bound
- multiple objects
- combinatorial optimization
- optimal solution
- np hard
- range images
- single machine scheduling problem
- upper bounding
- image segmentation
- image regions
- segmentation algorithm
- medical images
- cluttered scenes
- bounding box
- segmentation method
- convex hull
- d objects
- complex background
- object recognition