TY - GEN
T1 - Large vocabulary sign language recognition based on hierarchical decision trees
AU - Fang, Gaolin
AU - Gao, Wen
AU - Zhao, Debin
PY - 2003
Y1 - 2003
N2 - The major difficulty for large vocabulary sign language or gesture recognition lies in the huge search space due to a variety of recognized classes. How to reduce the recognition time without loss of accuracy is a challenge issue. In this paper, a hierarchical decision tree is first presented for large vocabulary sign language recognition based on the divide-and-conquer principle. As each sign feature has the different importance to gestures, the corresponding classifiers are proposed for the hierarchical decision to gesture attributes. One- or two- handed classifier with little computational cost is first used to eliminate many impossible candidates. The subsequent hand shape classifier is performed on the possible candidate space. SOFM/HMM classifier is employed to get the final results at the last non-leaf nodes that only include few candidates. Experimental results on a large vocabulary of 5113-signs show that the proposed method drastically reduces the recognition time by 11 times and also improves the recognition rate about 0.95% over single SOFM/HMM.
AB - The major difficulty for large vocabulary sign language or gesture recognition lies in the huge search space due to a variety of recognized classes. How to reduce the recognition time without loss of accuracy is a challenge issue. In this paper, a hierarchical decision tree is first presented for large vocabulary sign language recognition based on the divide-and-conquer principle. As each sign feature has the different importance to gestures, the corresponding classifiers are proposed for the hierarchical decision to gesture attributes. One- or two- handed classifier with little computational cost is first used to eliminate many impossible candidates. The subsequent hand shape classifier is performed on the possible candidate space. SOFM/HMM classifier is employed to get the final results at the last non-leaf nodes that only include few candidates. Experimental results on a large vocabulary of 5113-signs show that the proposed method drastically reduces the recognition time by 11 times and also improves the recognition rate about 0.95% over single SOFM/HMM.
KW - Finite state machine
KW - Gaussian mixture model
KW - Gesture recognition
KW - Hierarchical decision tree
KW - Sign language recognition
UR - https://www.scopus.com/pages/publications/18844375067
U2 - 10.1145/958456.958458
DO - 10.1145/958456.958458
M3 - 会议稿件
AN - SCOPUS:18844375067
SN - 1581136218
SN - 9781581136210
T3 - ICMI'03: Fifth International Conference on Multimodal Interfaces
SP - 125
EP - 131
BT - ICMI'03
PB - Association for Computing Machinery (ACM)
T2 - ICMI'03: Fifth International Conference on Multimodal Interfaces
Y2 - 5 November 2003 through 7 November 2003
ER -