skip to main content
10.1145/2388676.2388732acmconferencesArticle/Chapter ViewAbstractPublication Pagesicmi-mlmiConference Proceedingsconference-collections
research-article

Gestures as point clouds: a $P recognizer for user interface prototypes

Published:22 October 2012Publication History

ABSTRACT

Rapid prototyping of gesture interaction for emerging touch platforms requires that developers have access to fast, simple, and accurate gesture recognition approaches. The $-family of recognizers ($1, $N) addresses this need, but the current most advanced of these, $N-Protractor, has significant memory and execution costs due to its combinatoric gesture representation approach. We present $P, a new member of the $-family, that remedies this limitation by considering gestures as clouds of points. $P performs similarly to $1 on unistrokes and is superior to $N on multistrokes. Specifically, $P delivers >99% accuracy in user-dependent testing with 5+ training samples per gesture type and stays above 99% for user-independent tests when using data from 10 participants. We provide a pseudocode listing of $P to assist developers in porting it to their specific platform and a "cheat sheet" to aid developers in selecting the best member of the $-family for their specific application needs.

References

  1. Agarwal, P., and Varadarajan, K. A near-linear constant-factor approximation for euclidean bipartite matching? In SCG '04 (2004), 247--252. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Anthony, L., and Wobbrock, J. O. A lightweight multistroke recognizer for user interface prototypes. In GI '10 (2010), 245--252. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Anthony, L., and Wobbrock, J. O. $N-Protractor: A fast and accurate multistroke recognizer. In GI'2012 (2012), 117--120. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Avis, D. A survey of heuristics for the weighted matching problem. Networks 13 (1983), 475--493.Google ScholarGoogle ScholarCross RefCross Ref
  5. Besl, P. J., and McKay, N. D. A method for registration of 3-d shapes. IEEE TPAMI 14, 2 (Feb. 1992), 239--256. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Burkard, R., Dell'Amico, M., and Martello, S. Assignment Problems. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Cormen, T. H., Leiserson, C. E., Rivest, R. L., and Stein, C. Introduction to algorithms. MIT Press, Cambridge, MA, USA, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Dubuisson, M.-P., and Jain, A. A modified Hausdorff distance for object matching. In IAPR'94 (1994), 566--568.Google ScholarGoogle ScholarCross RefCross Ref
  9. Edmonds, J. Paths, trees, and flowers. Canad. J. Math. 17 (1965), 449--467.Google ScholarGoogle Scholar
  10. Friedman, M. The use of ranks to avoid the assumption of normality implicit in the analysis of variance. J. Am. Statist. Assoc. 32, 200 (1937), 675--701.Google ScholarGoogle ScholarCross RefCross Ref
  11. Hammond, T., and Paulson, B. Recognizing sketched multistroke primitives. ACM TIIS 1, 1 (2011), 4:1--4:34. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Kara, L. B., and Stahovich, T. F. Hierarchical parsing and recognition of hand-sketched diagrams. In UIST '04 (2004), 13--22. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Kristensson, P.-O., and Zhai, S. SHARK2: a large vocabulary shorthand writing system for pen-based computers. In UIST '04 (2004), 43--52. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Li, Y. Protractor: a fast and accurate gesture recognizer. In CHI '10 (2010), 2169--2172. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Papadimitriou, C. H., and Steiglitz, K. Combinatorial optimization: algorithms and complexity. Dover Publications, Mineola, New York, USA, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Plamondon, R., and Srihari, S. N. On-line and off-line handwriting recognition: A comprehensive survey. IEEE TPAMI 22, 1 (Jan. 2000), 63--84. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Rubine, D. Specifying gestures by example. In SIGGRAPH '91 (1991), 329--337. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Rucklidge, W. Efficient Visual Recognition Using the Hausdorff Distance. Springer-Verlag New York, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Sezgin, T. M., and Davis, R. HMM-based efficient sketch recognition. In IUI '05 (2005), 281--283. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Vatavu, R.-D. The effect of sampling rate on the performance of template-based gesture recognizers. In ICMI '11 (2011), 271--278. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Vatavu, R.-D. Small gestures go a long way: how many bits per gesture do recognizers actually need? In DIS '12 (2012), 328--337. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Willems, D., Niels, R., Gerven, M. v., and Vuurpijl, L. Iconic and multi-stroke gesture recognition. Pattern Recognition 42, 12, 3303--3312. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Wobbrock, J. O., Wilson, A. D., and Li, Y. Gestures without libraries, toolkits or training: a $1 recognizer for user interface prototypes. In UIST '07 (2007), 159--168. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Gestures as point clouds: a $P recognizer for user interface prototypes

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          ICMI '12: Proceedings of the 14th ACM international conference on Multimodal interaction
          October 2012
          636 pages
          ISBN:9781450314671
          DOI:10.1145/2388676

          Copyright © 2012 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 22 October 2012

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article

          Acceptance Rates

          Overall Acceptance Rate453of1,080submissions,42%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader