Fast Dichotomic Multiple Search Algorithm for Shortest Cirular Path

Circular shortest path algorithms for polar objects segmentation have been proposed in [1, 11, 10] to address discrete case and extended in [2] to the continuous domain for closed global optimal geodesic calculation. The best method up to date relies on a branch and bound approach

• Type: Conference
• Year: 2006
• Where: ICPR
• Authors: Martin de La Gorce, Nikos Paragios
• Keywords: Circular Shortest Path, Computer Vision, ICPR 2006, Optimal Geodesic Calculation, Polar Objects Segmentation