Recognition of signed expressions using symbolic aggregate approximation

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Complexity of sign language recognition system grows with growing word vocabulary. Therefore it is advisable to use units smaller than words. Such elements, called subunits, resemble phonemes in spoken language. They are concatenated to form word models. We propose a data-driven procedure for finding subunits in time series representing signed expressions. The procedure consists in: (i) transformation of video material to time series describing hand movements, (ii) using Piecewise Aggregate Approximation (PAA) coefficients to represent subunits, and (iii) applying Symbolic Aggregate Approximation (SAX), which is based on PAA, to obtain appropriate symbolic description. Signed words represented by strings of SAX symbols are classified using nearest neighbour method with Dynamic Time Warping (DTW) technique. We compare the approach with whole-word recognition by presenting ten-fold cross-validation tests on a Polish sign language (PSL) corpus of 30 words. Recognition of new words using small number of examples is also considered. The experiments show superiority of the SAX based approach. © 2014 Springer International Publishing.

Cite

CITATION STYLE

APA

Oszust, M., & Wysocki, M. (2014). Recognition of signed expressions using symbolic aggregate approximation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8467 LNAI, pp. 745–756). Springer Verlag. https://doi.org/10.1007/978-3-319-07173-2_64

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free