Abstract
Machine systems for understanding hand-drawn sketches must reliably interpret common but sloppy curvilinear configurations. The task is commonly expressed as finding an image model in the image data, but few approaches exist for recognizing drawings with missing model parts and noisy data. In this paper, we propose a two-stage structural modeling approach that combines computer vision techniques with constraint-based recognition. The first stage produces a data graph through standard image analysis techniques augmented by rectification operations that account for common forms of drawing variability and noise. The second stage combines CLP(FD) with concurrent constraint programming for efficient and optimal matching of attributed model and data graphs. This approach offers considerable ease in stating model constraints and objectives, and also leads to an efficient algorithm that scales well with increasing image complexity.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
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.
J. R. Beverdige and E. M. Riseman, “How easy is matching 2D line models using local search?” In IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 19, no. 6, June 1997, pp. 564–579.
M. Carlsson et al., SICStus Prolog User’s Manual. Swedish Institute of Computer Science, SICStus Prolog version 3.8.6, 2001.
M. Carlsson, G. Ottosson, and B. Carlson, “An open-ended finite domain constraint solver”. In Proc. Programming Languages: Implementations, Logics, and Programs, 1997.
S. S. Chok and K. Marriott, “Parsing visual languages.” In Proc. Eighteenth Australasian Computer Science Conf., vol. 27, no. 1, 1995, pp. 90–98.
B. Coüasnon, P. Brisset, and I. Stéphan, “Using logic programming languages for optical music recognition.” In Proc. Third Int. Conf. on the Practical Application of Prolog, Paris, April 1995.
D. Eppstein, “Subgraph isomorphism in planar graphs and related problems.” In Journal of Graph Algorithms and Applications, vol. 3, no. 3, 1999, pp. 1–27.
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. V. Mahoney and M. P.J. Fromherz, “Interpreting sloppy stick figures by graph normalization and constraint-based matching.” In Proc. Fourth IAPR Int. Workshop on Graphics Recognition, Kingston, Ontario, Canada, Sept. 2001.
J. V. Mahoney and M. P.J. Fromherz, “Perceptual organization as graph rectification in a constraint-based scheme for interpreting sloppy stick figures.” In Proc. Third Workshop on Perceptual Organization in Computer Vision, Vancouver, Canada, July 2001.
B. Messmer, Efficient graph matching algorithms for preprocessed model graphs. PhD Thesis, Univ. of Bern, Switzerland, 1995.
L. G. Shapiro and R. M. Haralick, “Structural descriptions and inexact matching.” In IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. PAMI-3, no. 5, Sept. 1981, pp. 504–519.
P. van Hentenryck and Y. Deville, “The cardinality operator: A new logical connective and its application to constraint logic programming.” In Proc. Int. Conf. on Logic Programming, 1991, pp. 745–759.
P. van Hentenryck, V. A. Saraswat, and Y. Deville, “Design, implementation, and evaluation of the constraint language cc(FD).” In A. Podelski (ed.), Constraint Programming: Basic and Trends, LNCS 910, Springer Verlag, 1995, pp. 293–316.
D. Waltz, “Understanding Line Drawings of Scenes with Shadows.” In P. H. Winston (ed.), Psychology of Computer Vision, MIP Press, 1975, pp. 19–91.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fromherz, M.P.J., Mahoney, J.V. (2001). Interpreting Sloppy Stick Figures with Constraint-Based Subgraph Matching. In: Walsh, T. (eds) Principles and Practice of Constraint Programming — CP 2001. CP 2001. Lecture Notes in Computer Science, vol 2239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45578-7_54
Download citation
DOI: https://doi.org/10.1007/3-540-45578-7_54
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42863-3
Online ISBN: 978-3-540-45578-3
eBook Packages: Springer Book Archive