Open AccessInternal‐to‐internal transition method for consecutive hierarchical template matching
Author(s) -
Jung Ho Gi
Publication year - 2014
Publication title -
iet computer vision
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.38
H-Index - 37
eISSN - 1751-9640
pISSN - 1751-9632
DOI - 10.1049/iet-cvi.2013.0125
Subject(s) - tree traversal , silhouette , computer science , tree (set theory) , template matching , matching (statistics) , node (physics) , artificial intelligence , pattern recognition (psychology) , tree structure , hierarchical database model , algorithm , data mining , image (mathematics) , binary tree , mathematics , mathematical analysis , statistics , structural engineering , engineering
This study proposes a method reducing the tree traversal cost by first investigating the most probable node instead of the root node when a hierarchical template matching is consecutively applied to the object. In particular, this study gives a novel viewpoint that a consecutive hierarchical template matching could be regarded as a transition of a hierarchical finite state machine, and then it proposes a novel method considering the transitions between the internal nodes of the hierarchical template tree. The proposed method is verified by applying it to pedestrian silhouette detection.