The Viterbi Algorithm and Sign Language Recognition

Files
2015PerkoffE.pdf(2.2 MB)
2015PerkoffE_release.pdf(119.13 KB)
Date
2015
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Producer
Director
Performer
Choreographer
Costume Designer
Music
Videographer
Lighting Designer
Set Designer
Crew Member
Funder
Rehearsal Director
Concert Coordinator
Advisor
Dougherty, John P.
Moderator
Panelist
Alternative Title
Department
Haverford College. Department of Computer Science
Type
Thesis
Original Format
Running Time
File Format
Place of Publication
Date Span
Copyright Date
Award
Language
eng
Note
Table of Contents
Terms of Use
Rights Holder
Access Restrictions
Open Access
Terms of Use
http://creativecommons.org/licenses/by-nc/3.0/us/
Tripod URL
Identifier
Abstract
This paper analyzes the Viterbi algorithm and its application to Sign Language Recognition. The Viterbi algorithm is used as a maximum a posteriori approach to solving the decoding problem of Hidden Markov Models (HMM). This paper discusses the attributes of the HMM with an example. The theoretical time complexity of the algorithm is compared to the results of experiments on a Python implementation. The more general field of Gesture Recognition is briefly mentioned as foundation for the type of system necessary to facilitate Sign Language Recognition. Both word and subunit models for American Sign Language are detailed.
Description
Subjects
Gesture
American Sign Language
Pattern recognition systems
Hidden Markov models
Citation
Permanent URL
http://hdl.handle.net/10066/17660
Collections
Computer Science