Abstract
Programs for understanding hand-drawn sketches and diagrams must interpret curvilinear configurations that are sloppily drawn and highly variable in form. We propose a two-stage subgraph matching framework for sketch recognition that can accommodate great variability in form and yet provide efficient matching and easy extensibility to new configurations. First, a rectification stage corrects the initial data graph for the common deviations of each kind of constituent local configuration from its ideal form. The model graph is then matched directly to the data by a constraint-based subgraph matching process, without the need for complex error-tolerance. We explore the approach in the domain of human stick figures in diverse poses.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
D. Bainbridge and T. Bell. An extensible optical music recognition system. In Proc. Nineteenth Australasian Computer Science Conf., 1996.
M. Carlsson, G. Ottosson, B. Carlson. An open-ended finite domain constraint solver. Proc. Programming Languages: Implementations, Logics, and Programs, 1997.
S. Chok, K. Marriot. Parsing visual languages. Proc. 18th Australasian Computer Science Conf., 27(1), 1995: 90–98.
T. Cormen, C. Leiserson, R. Rivest. Introduction to Algorithms. Cambridge, MA: M.I.T. Press, 1990.
B. Couasnon, P. Brisset, I. Stephan. Using logic programming languages for optical music recognition. Proc. 3rd Int. Conf. on Practical Application of Prolog, Paris, 1995.
H. Fahmy and D. Blostein. A graph-rewriting paradigm for discrete relaxation: application to sheet music recognition. Int. Journal of Pattern Recognition and Artificial Intelligence, Vol. 12, No. 6, Sept. 1998,pp. 763–799.
M. Fromherz and J. Mahoney. Interpreting sloppy stick figures with constraint-based subgraph matching. 7th Int. Conf. on Principles and Practice of Constraint Programming. Paphos, Cyprus: 2001.
D. Isenor and S. Zaky. Fingerprint identification using graph matching. Pattern Recognition, vol. 19, no. 2, 1986, pp. 113–122.
J. Larrosa and G. Valiente, Constraint satisfaction algorithms for graph pattern matching. Under consideration for publication in J. Math. Struct. in Computer Science, 2001.
J. Mahoney and M. Fromherz. Interpreting sloppy stick figures by graph rectification and constraint-based matching. 4th IAPR Int. Workshop on Graphics Recognition: Kingston, Ontario: Sept., 2001
B. Messmer. Efficient graph matching algorithms for preprocessed model graphs. PhD thesis. Bern Univ., Switzerland, 1995.
E. Saund. Perceptual organization in an interactive sketch editor. 5th Int. Conf. on Computer Vision. Cambridge, MA: 1995: 597–604.
E. Saund. Perceptually closed paths in sketches and drawings. Submitted for publication.
L. G. Shapiro and R. M. Haralick. Structural descriptions and inexact matching. In IEEE PAMI, vol. 3, no. 5, Sept. 1981, pp. 504–519.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mahoney, J.V., Fromherz, M.P.J. (2002). Interpreting Sloppy Stick Figures by Graph Rectification and Constraint-Based Matching. In: Blostein, D., Kwon, YB. (eds) Graphics Recognition Algorithms and Applications. GREC 2001. Lecture Notes in Computer Science, vol 2390. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45868-9_19
Download citation
DOI: https://doi.org/10.1007/3-540-45868-9_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44066-6
Online ISBN: 978-3-540-45868-5
eBook Packages: Springer Book Archive