Large vocabulary sign language recognition based on fuzzy decision trees

被引:68
作者
Fang, GL
Gao, W
Zhao, DB
机构
[1] Comp Technol Inst, Beijing 100080, Peoples R China
[2] Harbin Inst Technol, Dept Comp Sci, Harbin 150001, Peoples R China
来源
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS | 2004年 / 34卷 / 03期
基金
中国国家自然科学基金;
关键词
finite state machine; fuzzy decision trees; hidden Markov models (HMM); self-organizing feature maps (SOFM); sign language recognition;
D O I
10.1109/TSMCA.2004.824852
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The major difficulty for large vocabulary sign 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 challenging issue. In this paper, a fuzzy decision tree with heterogeneous classifiers is proposed for large vocabulary sign language recognition. As each sign feature has the different discrimination to gestures, the corresponding classifiers are presented for the hierarchical decision to sign language attributes. A one- or two- handed classifier and a hand-shaped classifier with little computational cost are first used to progressively eliminate many impossible candidates, and then, a self-organizing feature maps/hidden Markov model (SOFM/HMM) classifier in which SOFM being as an implicit different signers' feature extractor for continuous HMM, is proposed as a special component of a fuzzy decision tree to get the final results at the last nonleaf nodes that only include a few candidates. Experimental results on a large vocabulary of 5113-signs show that the proposed method dramatically reduces the recognition time by 11 times and also improves the recognition rate about 0.95% over single SOFM/HMM.
引用
收藏
页码:305 / 314
页数:10
相关论文
共 31 条
[1]  
[Anonymous], STUDIES LINGUISTICS
[2]  
[Anonymous], P 4 IEEE INT C
[3]  
Bauer B., 2000, Proceedings Fourth IEEE International Conference on Automatic Face and Gesture Recognition (Cat. No. PR00580), P440, DOI 10.1109/AFGR.2000.840672
[4]  
Breiman L., 1998, CLASSIFICATION REGRE
[5]  
Corrivetti G, 2000, CONFIN CEPHALALGICA, V9, P177
[6]   MAXIMUM LIKELIHOOD FROM INCOMPLETE DATA VIA EM ALGORITHM [J].
DEMPSTER, AP ;
LAIRD, NM ;
RUBIN, DB .
JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-METHODOLOGICAL, 1977, 39 (01) :1-38
[7]   GLOVE-TALK - A NEURAL NETWORK INTERFACE BETWEEN A DATA-GLOVE AND A SPEECH SYNTHESIZER [J].
FELS, SS ;
HINTON, GE .
IEEE TRANSACTIONS ON NEURAL NETWORKS, 1993, 4 (01) :2-8
[8]   Maximum likelihood linear transformations for HMM-based speech recognition [J].
Gales, MJF .
COMPUTER SPEECH AND LANGUAGE, 1998, 12 (02) :75-98
[9]   Sign language recognition based on HMM/ANN/DP [J].
Gao, W ;
Ma, JY ;
Wu, JQ ;
Wang, CL .
INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, 2000, 14 (05) :587-602
[10]  
GAO W, 2000, P 3 INT C MULT INT, P564