Most probable longest common subsequence for recognition of gesture character input

Darya Frolova, Helman Stern, Sigal Berman

Research output: Contribution to journalArticlepeer-review

40 Scopus citations

Abstract

This paper presents a technique for trajectory classification with applications to dynamic free-air hand gesture recognition. Such gestures are unencumbered and drawn in free air. Our approach is an extension to the longest common subsequence (LCS) classification algorithm. A learning preprocessing stage is performed to create a probabilistic 2-D template for each gesture, which allows taking into account different trajectory distortions with different probabilities. The modified LCS, termed the most probable LCS (MPLCS), is developed to measure the similarity between the probabilistic template and the hand gesture sample. The final decision is based on the length and probability of the extracted subsequence. Validation tests using a cohort of gesture digits from video-based capture show that the approach is promising with a recognition rate of more than 98% for video stream preisolated digits. The MPLCS algorithm can be integrated into a gesture recognition interface to facilitate gesture character input. This can greatly enhance the usability of such interfaces.

Original languageEnglish
Pages (from-to)871-880
Number of pages10
JournalIEEE Transactions on Cybernetics
Volume43
Issue number3
DOIs
StatePublished - 1 Jun 2013

Keywords

  • Classification
  • Dynamic gestures
  • Gesture recognition
  • Longest common subsequence (LCS)

Fingerprint

Dive into the research topics of 'Most probable longest common subsequence for recognition of gesture character input'. Together they form a unique fingerprint.

Cite this