Fast stroke matching by angle quantization

Determining similarity of two point sequences (strokes) is a fundamental task in gestural interfaces. Because the length of each stroke is arbitrary, mapping to a fixed-dimension feature space is often done to allow for direct comparison. In this paper, we propose a new feature space based on angle quantization. For each adjacent pair of points in a stroke, the vector between them defines an angle relative to a fixed axis. The sequence of these angles can be mapped to a k-dimensional feature space by quantizing the unit circle into k ranges, and taking a normalized count of the number of stroke angles in each range. The Euclidean distance between strokes in this feature space gives a measure of stroke similarity. The measure is scale invariant, and some degree of rotational invariance can be achieved with slight modification. Our method is shown to offer efficient and accurate gestural matching performance compared to traditional signal-processing and image-based methods.

[1]  Shehzad Khalid,et al.  Motion Trajectory Learning in the DFT-Coefficient Feature Space , 2006, Fourth IEEE International Conference on Computer Vision Systems (ICVS'06).

[2]  Ching Y. Suen,et al.  Historical review of OCR research and development , 1992, Proc. IEEE.

[3]  Nello Cristianini,et al.  An Introduction to Support Vector Machines and Other Kernel-based Learning Methods , 2000 .

[4]  Duane Szafron,et al.  Modeling of moving objects in a video database , 1997, Proceedings of IEEE International Conference on Multimedia Computing and Systems.

[5]  Michiel van de Panne,et al.  Constellation models for sketch recognition , 2006, SBM'06.

[6]  Alan V. Oppenheim,et al.  Digital Signal Processing , 1978, IEEE Transactions on Systems, Man, and Cybernetics.

[7]  Nei Kato,et al.  A Handwritten Character Recognition System Using Directional Element Feature and Asymmetric Mahalanobis Distance , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

[8]  Arnold L. Knoll,et al.  Experiments with "Characteristic Loci" for Recognition of Handprinted Characters , 1969, IEEE Transactions on Computers.

[9]  Dit-Yan Yeung,et al.  A Bayesian Framework for Deformable Pattern Recognition With Application to Handwritten Character Recognition , 1998, IEEE Trans. Pattern Anal. Mach. Intell..

[10]  Christoph Neukirchen,et al.  A comparison between continuous and discrete density hidden Markov models for cursive handwriting recognition , 1996, Proceedings of 13th International Conference on Pattern Recognition.

[11]  Levent Burak Kara,et al.  An image-based, trainable symbol recognizer for hand-drawn sketches , 2005, Comput. Graph..

[12]  William T. Freeman,et al.  Orientation Histograms for Hand Gesture Recognition , 1995 .

[13]  Jieping Ye,et al.  Adaptive Distance Metric Learning for Clustering , 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition.

[14]  Christos Faloutsos,et al.  Efficient Similarity Search In Sequence Databases , 1993, FODO.

[15]  Ada Wai-Chee Fu,et al.  Efficient time series matching by wavelets , 1999, Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337).

[16]  Levent Burak Kara,et al.  An efficient graph-based symbol recognizer , 2006, SBM'06.

[17]  Takeo Igarashi,et al.  Freeform User Interfaces for Graphical Computing , 2003, Smart Graphics.

[18]  Nello Cristianini,et al.  An introduction to Support Vector Machines , 2000 .

[19]  Dean Rubine,et al.  Specifying gestures by example , 1991, SIGGRAPH.

[20]  Jae-Woo Chang,et al.  Spatio-temporal representation and retrieval using moving object's trajectories , 2000, MULTIMEDIA '00.