An Efficient Primitive-Based Method to Recognize Online Sketched Symbols with Autocompletion
We present a new structural method of sketched symbol recognition, which aims to recognize a hand-drawn symbol before it is fully completed. It is invariant to scale, stroke number, and order. We also present two novel descriptors to represent the spatial distribution between two primitives. One is...
Main Authors: | Wei Deng, Lingda Wu, Yougen Zhang, Chao Yang |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2015-01-01
|
Series: | Mathematical Problems in Engineering |
Online Access: | http://dx.doi.org/10.1155/2015/536192 |
Similar Items
-
Autocompletion Without Static Typing
by: Shelley, Nicholas McKay
Published: (2014) -
Exploiting Query’s Temporal Patterns for Query Autocompletion
by: Danyang Jiang, et al.
Published: (2017-01-01) -
AutoFritz: Autocomplete for Prototyping Virtual Breadboard Circuits
by: Chen-Kuo Sun, et al.
Published: (2019) -
Basic primitives for molecular diagram sketching
by: Clark Alex M
Published: (2010-10-01) -
Recognizing Interspersed sketches quickly
by: Hammond, Tracy A., et al.
Published: (2012)