DocumentCode
2954486
Title
Optimal landmark detection using shape models and branch and bound
Author
Amberg, Brian ; Vetter, Thomas
Author_Institution
Univ. of Basel, Basel, Switzerland
fYear
2011
fDate
6-13 Nov. 2011
Firstpage
455
Lastpage
462
Abstract
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 theoretic optimality is shown, and it is evaluated on a large face dataset.
Keywords
face recognition; object detection; shape recognition; solid modelling; tree searching; 3D shape model; branch and bound detection; candidate landmark detection; face recognition; feature point detector; large face dataset; optimal landmark detection; shape information; video editing; Cost function; Detectors; Face; Feature extraction; Shape; Solid modeling; Three dimensional displays;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Vision (ICCV), 2011 IEEE International Conference on
Conference_Location
Barcelona
ISSN
1550-5499
Print_ISBN
978-1-4577-1101-5
Type
conf
DOI
10.1109/ICCV.2011.6126275
Filename
6126275
Link To Document