Robust sketched symbol fragmentation using templates

  • Authors:
  • Heloise Hse;Michael Shilman;A. Richard Newton

  • Affiliations:
  • University of California at Berkeley, Berkeley, CA;Microsoft Research, Redmond, WA;University of California at Berkeley, Berkeley, CA

  • Venue:
  • Proceedings of the 9th international conference on Intelligent user interfaces
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Analysis of sketched digital ink is often aided by the division of stroke points into perceptually-salient fragments based on geometric features. Fragmentation has many applications in intelligent interfaces for digital ink capture and manipulation, as well as higher-level symbolic and structural analyses. It is our intuitive belief that the most robust fragmentations closely match a user's natural perception of the ink, thus leading to more effective recognition and useful user feedback. We present two optimal fragmentation algorithms that fragment common geometries into a basis set of line segments and elliptical arcs. The first algorithm uses an explicit template in which the order and types of bases are specified. The other only requires the number of fragments of each basis type. For the set of symbols under test, both algorithms achieved 100% fragmentation accuracy rate for symbols with line bases, ›99% accuracy for symbols with elliptical bases, and ›90% accuracy for symbols with mixed line and elliptical bases.