ML Anthology

Syntactic Pattern Classification by Branch and Bound Search

Alan Y. Commike, Jonathan J. Hull
CVPR 1991 pp. 432-437
doi:10.1109/CVPR.1991.139729 /cvpr/1991/commike1991cvpr-syntactic/

Abstract

A methodology for classifying syntactic patterns that performs a branch-and-bound search over a set of prototypes is proposed. The prototypes are first clustered hierarchically and the search is performed over the hierarchy. The proposed technique is applied to a pattern recognition system in which images are described by the sequence of features extracted from the chain codes of their contours. A rotationally invariant string distance measure is defined that compares two feature strings. The methodology discussed is compared to a nearest neighbor classifier that uses 12000 prototypes. The proposed technique decreases the time required to recognize a pattern by 93% and maintains a recognition rate of greater than 90%.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

PDF CVPR Semantic Scholar

Cite

Text

Commike and Hull. "Syntactic Pattern Classification by Branch and Bound Search." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1991. doi:10.1109/CVPR.1991.139729

Markdown

[Commike and Hull. "Syntactic Pattern Classification by Branch and Bound Search." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1991.](https://mlanthology.org/cvpr/1991/commike1991cvpr-syntactic/) doi:10.1109/CVPR.1991.139729

BibTeX

@inproceedings{commike1991cvpr-syntactic,
  title     = {{Syntactic Pattern Classification by Branch and Bound Search}},
  author    = {Commike, Alan Y. and Hull, Jonathan J.},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {1991},
  pages     = {432-437},
  doi       = {10.1109/CVPR.1991.139729},
  url       = {https://mlanthology.org/cvpr/1991/commike1991cvpr-syntactic/}
}