The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Parallel hidden Markov models for American sign language recognition
Abstract
The major challenge that faces American Sign Language (ASL) recognition now is to develop methods that will scale well with increasing vocabulary size. Unlike in spoken languages, phonemes can occur simultaneously in ASL. The number of possible combinations of phonemes after enforcing linguistic constraints is approximately 5.5/spl times/10/sup 8/. Gesture recognition, which is less constrained than ASL recognition, suffers from the same problem. Thus, it is not feasible to train conventional hidden Markov models (HMMs) for large-scab ASL applications. Factorial HMMs and coupled HMMs are two extensions to HMMs that explicitly attempt to model several processes occuring in parallel. Unfortunately, they still require consideration of the combinations at training time. In this paper we present a novel approach to ASL recognition that aspires to being a solution to the scalability problems. It is based on parallel HMMs (PaHMMs), which model the parallel processes independently. Thus, they can also be trained independently, and do not require consideration of the different combinations at training time. We develop the recognition algorithm for PaHMMs and show that it runs in time polynomial in the number of states, and in time linear in the number of parallel processes. We run several experiments with a 22 sign vocabulary and demonstrate that PaHMMs can improve the robustness of HMM-based recognition even on a small scale. Thus, PaHMMs are a very promising general recognition scheme with applications in both gesture and ASL recognition.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A tutorial on hidden Markov models and selected applications in speech recognition
Rabiner, L. R. (1989) · Proceedings of the IEEE · doi:10.1109/5.18626 · Cited by 22,743
Hand and mind: what gestures reveal about thought
(1993) · Choice Reviews Online · doi:10.5860/choice.30-2492 · Cited by 5,094
Factorial Hidden Markov Models
Ghahramani, Z., & Jordan, M. I. (1997) · Machine Learning · doi:10.1023/a:1007425814087 · Cited by 1,157
Coupled hidden Markov models for complex action recognition
Brand, M., Oliver, N., & Pentland, A. (2002) · Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.1997.609450 · Cited by 1,052
American Sign Language: The Phonological Base
Liddell, S. K., & Johnson, R. E. (1989) · Sign Language Studies · doi:10.1353/sls.1989.0027 · Cited by 845
A real-time continuous gesture recognition system for sign language
Liang, R.-H., & Ouhyoung, M. (2002) · Proceedings Third IEEE International Conference on Automatic Face and Gesture Recognition · doi:10.1109/afgr.1998.671007 · Cited by 435
Model-based estimation of 3D human motion with occlusion based on active multi-viewpoint selection
Kakadiaris, I. A., & Metaxas, D. (1996) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.1996.517057 · Cited by 220
Self-citationAdapting hidden Markov models for ASL recognition by using three-dimensional computer vision methods
Vogler, C., & Metaxas, D. (2002) · 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation · doi:10.1109/icsmc.1997.625741 · Cited by 176
Self-citationToward Scalability in ASL Recognition: Breaking Down Signs into Phonemes
Vogler, C., & Metaxas, D. (1999) · Lecture notes in computer science · doi:10.1007/3-540-46616-9_19 · Cited by 128
Self-citationSubband-based speech recognition
Bourlard, H., & Dupont, S. (2002) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1997.596172 · Cited by 114
HMM-Based Continuous Sign Language Recognition Using Stochastic Grammars
Hienz, H., Bauer, B., & Kraiss, K. (1999) · Lecture notes in computer science · doi:10.1007/3-540-46616-9_17 · Cited by 34
(1995) · DSpace@MIT (Massachusetts Institute of Technology)
Cited by
A review of hand gesture and sign language recognition techniques
Cheok, M. J., Omar, Z., & Jaward, M. H. (2019) · International Journal of Machine Learning and Cybernetics · doi:10.1007/s13042-017-0705-5 · Cited by 600
Koller, O., Forster, J., & Ney, H. (2015) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2015.09.013 · Cited by 533
A survey on activity recognition and behavior understanding in video surveillance
Vishwakarma, S., & Agrawal, A. (2013) · The Visual Computer · doi:10.1007/s00371-012-0752-6 · Cited by 418
A Unified Framework for Gesture Recognition and Spatiotemporal Gesture Segmentation
Alon, J., Athitsos, V., Yuan, Q., & Sclaroff, S. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.203 · Cited by 363
Koller, O., Camgoz, N. C., Ney, H., & Bowden, R. (2020) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2019.2911077 · Cited by 342
Metadata
- Authors
- Vogler, C., & Metaxas, D.
- Venue
- Proceedings of the Seventh IEEE International Conference on Computer Vision
- Publisher
- IEEE
- Published
- 1999
- Pages
- 116-122 vol.1
- OpenAlex
- W2097501508
- Cited by
- 258
- References
- 12
- FWCI
- 6.60
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.