Sciweavers

Share
ICCV
2011
IEEE

Optimal Landmark Detection using Shape Models and Branch and Bound

7 years 8 months ago
Optimal Landmark Detection using Shape Models and Branch and Bound
Fitting statistical 2D and 3D shape models to images is necessary for a variety of tasks, such as video editing and face recognition. Much progress has been made on local fitting from an initial guess, but determining a close enough initial guess is still an open problem. One approach is to detect distinct landmarks in the image and initalize the model fit from these correspondences. This is difficult, because detection of landmarks based only on the local appearance is inherently ambiguous. This makes it necessary to use global shape information for the detections. We propose a method to solve the combinatorial problem of selecting out of a large number of candidate landmark detections the configuration which is best supported by a shape model. Our method, as opposed to previous approaches, always finds the globally optimal configuration. The algorithm can be applied to a very general class of shape models and is independent of the underlying feature point detector. Its theoret...
Brian Amberg, Thomas Vetter
Added 12 Dec 2011
Updated 12 Dec 2011
Type Journal
Year 2011
Where ICCV
Authors Brian Amberg, Thomas Vetter
Comments (0)
books