ACM Home Page
Please provide us with feedback. Feedback
Robust sketched symbol fragmentation using templates
Full text PdfPdf (221 KB)
Source International Conference on Intelligent User Interfaces archive
Proceedings of the 9th international conference on Intelligent user interfaces table of contents
Funchal, Madeira, Portugal
SESSION: Novel interaction modalities I table of contents
Pages: 156 - 160  
Year of Publication: 2004
ISBN:1-58113-815-6
Authors
Heloise Hse  University of California at Berkeley, Berkeley, CA
Michael Shilman  Microsoft Research, Redmond, WA
A. Richard Newton  University of California at Berkeley, Berkeley, CA
Sponsors
SIGCHI: ACM Special Interest Group on Computer-Human Interaction
ACM: Association for Computing Machinery
SIGART: ACM Special Interest Group on Artificial Intelligence
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 47,   Citation Count: 8
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/964442.964472
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Alvarado, C., Oltmans, M. and Davis, R., A Framework for Multi-domain Sketch Recognition. in 2002 AAAI Spring Symposium - Sketch Understanding, (Palo Alto CA, 2002), AAAI Press, 1--8.
2
3
 
4
Calhoun, C., Stahovich, T.F., Kurtoglu, T. and Kara, L.B., Recognizing Multi-Stroke Symbols. in 2002 AAAI Spring Symposium - Sketch Understanding, (Palo Alto CA, 2002), AAAI Press, 15--23.
 
5
Chang, H. and Yan, H. Vectorization of Hand-drawn Image using Piecewise Cubic Bezier Curves Fitting. Pattern Recognition, 31 (11). 1747--1755.
 
6
 
7
 
8
Fonseca, M.J., Pimentel, C. and Jorge, J.A., CALI: An Online Scribble Recognizer for Calligraphic Interfaces. in 2002 AAAI Spring Symposium - Sketch Understanding, (Palo Alto CA, 2002), AAAI Press, 51--58.
 
9
10
11
 
12
13
 
14
15
16
 
17
Pavlidis, T. Structural Pattern Recognition. Springer-Verlag Press, Berlin, 1977.
 
18
Perez, J. and Vidal, E., An Algorithm for the Optimum Piecewise Linear Approximation of Digitized Curves. in 11th IAPR International Conference on Pattern Recognition, (1992), 167--170.
 
19
20
 
21
22
23
 
24
Shilman, M., Pasula, H., Russell, S. and Newton, A.R., Statistical Visual Language Models for Ink Parsing. in 2002 AAAI Spring Symposium - Sketch Understanding, (Palo Alto CA, 2002), AAAI Press, 126--132.
 
25
Ulgen, F., Flavell, A. and Akamatsu, N., Recognition of On-Line Handdrawn Geometric Shapes by Fuzzy Filtering and Neural Network Classification. in HCI International '95, (Yokohama, Japan, 1995), 567--572.
 
26
27

CITED BY  8

Collaborative Colleagues:
Heloise Hse: colleagues
Michael Shilman: colleagues
A. Richard Newton: colleagues