View source for Part-based models

'''Part-based models''' refers to a broad class of detection algorithms used on images, in which various parts of the image are used separately in order to determine if and where an object of interest exists.  Amongst these methods a very popular one is the [[Constellation model|constellation model]] which refers to those schemes which seek to detect a small number of features and their relative positions to then determine whether or not the object of interest is present.
These models build on the original idea of Fischler and Elschlager<ref>{{cite journal|volume=C-22| doi=10.1109/T-C.1973.223602|title=The Representation and Matching of Pictorial Structures|year=1973|last1=Fischler|first1=M.A.|last2=Elschlager|first2=R.A.|journal=IEEE Transactions on Computers|pages=67–92 }}</ref> of using the relative position of a few template matches and evolve in complexity in the work of Perona and others.<ref>{{Cite conference|doi=10.1109/CVPR.2003.1211479|title=Object class recognition by unsupervised scale-invariant learning|conference=IEEE Computer Society Conference on Computer Vision and Pattern Recognition|year=2003|last1=Fergus|first1=R.|last2=Perona|first2=P.|last3=Zisserman|first3=A.|isbn=0-7695-1900-8|volume=2|pages=II–264}}</ref>  These models will be covered in the constellation models section.  To get a better idea of what is meant by constellation model an example may be more illustrative.  Say we are trying to [[Face detection|detect faces]].  A constellation model would use smaller part detectors, for instance mouth, nose and eye detectors and make a judgment about whether an image has a face based on the relative positions in which the components fire.

== Non-constellation models ==
	Many overlapping ideas are included under the title part-based models even after having excluded those models of the constellation variety.  The uniting thread is the use of small parts to build up to an algorithm that can detect/recognize an item (face, car, etc.)
	Early efforts, such as those by Yuille, Hallinan and Cohen<ref>{{Cite journal|doi=10.1007/BF00127169|title=Feature extraction from faces using deformable templates|year=1992|last1=Yuille|first1=Alan L.|last2=Hallinan|first2=Peter W.|last3=Cohen|first3=David S.|journal=International Journal of Computer Vision|volume=8|issue=2|pages=99}}</ref> sought to detect facial features and fit deformable templates to them.  These templates were mathematically defined outlines which sought to capture the position and shape of the feature.  Yuille, Hallinan and Cohen's algorithm does have trouble finding the [[Maxima and minima|global minimum]] fit for a given model and so templates did occasionally become mismatched.

Later efforts such as those by Poggio and Brunelli<ref>{{Cite journal|doi=10.1109/34.254061|title=Face recognition: Features versus templates|year=1993|last1=Brunelli|first1=R.|last2=Poggio|first2=T.|journal=IEEE Transactions on Pattern Analysis and Machine Intelligence|volume=15|issue=10|pages=1042}}</ref> focus on building specific detectors for each feature.  They use successive detectors to estimate scale, position, etc. and narrow the search field to be used by the next detector.  As such it is a part-based model, however, they seek more to recognize specific faces rather than to detect the presence of a face.  They do so by using each detector to build a 35 element vector of characteristics of a given face.  These characteristic can then be compared to recognize specific faces, however cut-offs can also be used to detect whether a face is present at all.<ref>{{Cite news |last=Simonite |first=Tom |title=Photo Algorithms ID White Men Fine—Black Women, Not So Much |language=en-US |work=Wired |url=https://www.wired.com/story/photo-algorithms-id-white-men-fineblack-women-not-so-much/ |access-date=2023-04-17 |issn=1059-1028}}</ref>

Cootes, Lanitis and Taylor<ref>{{cite conference|doi=10.1109/ICCV.1995.466919|title=A unified approach to coding and interpreting face images|conference=IEEE International Conference on Computer Vision|year=1995|last1=Lanitis|first1=A.|last2=Taylor|first2=C.J.|last3=Cootes|first3=T.F.|isbn=0-8186-7042-8|pages=368}}</ref> build on this work in constructing a 100 element representation of the primary features of a face.  The model is more detailed and robust however, given the additional complexity (100 elements compared to 35) this might be expected.  The model essentially computes deviations from a mean face in terms of shape, orientation and gray level.  The model is matched by the minimization of an [[Error function|error function]]. These three classes of algorithms naturally fall within the scope of [[Template matching|template matching]]<ref>{{Cite book|first=R.|last= Brunelli|title=Template Matching Techniques in Computer Vision: Theory and Practice|publisher= Wiley|isbn= 978-0-470-51706-2|year= 2009 |url=http://eu.wiley.com/WileyCDA/WileyTitle/productCd-0470517069.html}}</ref>

Of the non-constellation perhaps the most successful is that of Leibe and Schiele.<ref>{{Cite journal|doi=10.1007/s11263-007-0095-3|citeseerx = 10.1.1.111.464|title=Robust Object Detection with Interleaved Categorization and Segmentation|year=2007|last1=Leibe|first1=Bastian|last2=Leonardis|first2=Aleš|last3=Schiele|first3=Bernt|journal=International Journal of Computer Vision|volume=77|issue = 1–3|pages=259–289}}</ref><ref>{{Cite book|  doi=10.1007/11957959_26|citeseerx = 10.1.1.5.6272|  chapter=An Implicit Shape Model for Combined Object Categorization and Segmentation|  title=Toward Category-Level Object Recognition|  series=Lecture Notes in Computer Science|  year=2006|  last1=Leibe|  first1=Bastian|  last2=Leonardis|  first2=Ales|  last3=Schiele|  first3=Bernt|  isbn=978-3-540-68794-8|  volume=4170|  pages=508}}</ref> Their algorithm finds templates associated with positive examples and records both the template (an average of the feature in all positive examples where it is present) and the position of the center of the item (a face for instance) relative to the template.  The algorithm then takes a test image and runs an interest point locater (hopefully one of the [[Scale invariance|scale invariant]] variety).  These interest points are then compared to each template and the probability of a match is computed.  All templates then cast votes for the center of the detected object proportional to the probability of the match, and the probability the template predicts the center.   These votes are all summed and if there are enough of them, well enough clustered, the presence of the object in question (i.e. a face or car) is predicted.

The algorithm is effective because it imposes much less constellational rigidity the way the constellation model does.  Admittedly the constellation model can be modified to allow for occlusions and other large abnormalities but this model is naturally suited to it.  Also it must be said that sometimes the more rigid structure of the constellation is desired.

== See also ==
* [[Computer vision]]
* [[Template matching]]

==References==
<references/>

[[Category:Object recognition and categorization]]

{{Sourceattribution|Part-based models}}