{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:43:15Z","timestamp":1742960595030,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540428633"},{"type":"electronic","value":"9783540455783"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45578-7_54","type":"book-chapter","created":{"date-parts":[[2007,5,28]],"date-time":"2007-05-28T06:34:25Z","timestamp":1180334065000},"page":"655-669","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Interpreting Sloppy Stick Figures with Constraint-Based Subgraph Matching"],"prefix":"10.1007","author":[{"given":"Markus P. J.","family":"Fromherz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James V.","family":"Mahoney","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,11,19]]},"reference":[{"key":"54_CR1","unstructured":"D. Bainbridge and T. Bell, \u201cAn extensible optical music recognition system.\u201d In Proc. Nineteenth Australasian Computer Science Conf., 1996."},{"issue":"6","key":"54_CR2","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1109\/34.601245","volume":"19","author":"J. R. Beverdige","year":"1997","unstructured":"J. R. Beverdige and E. M. Riseman, \u201cHow easy is matching 2D line models using local search?\u201d In IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 19, no. 6, June 1997, pp. 564\u2013579.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"54_CR3","unstructured":"M. Carlsson et al., SICStus Prolog User\u2019s Manual. Swedish Institute of Computer Science, SICStus Prolog version 3.8.6, 2001."},{"key":"54_CR4","doi-asserted-by":"crossref","unstructured":"M. Carlsson, G. Ottosson, and B. Carlson, \u201cAn open-ended finite domain constraint solver\u201d. In Proc. Programming Languages: Implementations, Logics, and Programs, 1997.","DOI":"10.1007\/BFb0033845"},{"key":"54_CR5","unstructured":"S. S. Chok and K. Marriott, \u201cParsing visual languages.\u201d In Proc. Eighteenth Australasian Computer Science Conf., vol. 27, no. 1, 1995, pp. 90\u201398."},{"key":"54_CR6","unstructured":"B. Co\u00fcasnon, P. Brisset, and I. St\u00e9phan, \u201cUsing logic programming languages for optical music recognition.\u201d In Proc. Third Int. Conf. on the Practical Application of Prolog, Paris, April 1995."},{"issue":"3","key":"54_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.7155\/jgaa.00014","volume":"3","author":"D. Eppstein","year":"1999","unstructured":"D. Eppstein, \u201cSubgraph isomorphism in planar graphs and related problems.\u201d In Journal of Graph Algorithms and Applications, vol. 3, no. 3, 1999, pp. 1\u201327.","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"54_CR8","doi-asserted-by":"crossref","unstructured":"J. Larrosa and G. Valiente, \u201cConstraint satisfaction algorithms for graph pattern matching.\u201d Under consideration for publication in J. Math. Struct. in Computer Science, 2001.","DOI":"10.1017\/S0960129501003577"},{"key":"54_CR9","doi-asserted-by":"crossref","unstructured":"J. V. Mahoney and M. P.J. Fromherz, \u201cInterpreting sloppy stick figures by graph normalization and constraint-based matching.\u201d In Proc. Fourth IAPR Int. Workshop on Graphics Recognition, Kingston, Ontario, Canada, Sept. 2001.","DOI":"10.1007\/3-540-45868-9_19"},{"key":"54_CR10","unstructured":"J. V. Mahoney and M. P.J. Fromherz, \u201cPerceptual organization as graph rectification in a constraint-based scheme for interpreting sloppy stick figures.\u201d In Proc. Third Workshop on Perceptual Organization in Computer Vision, Vancouver, Canada, July 2001."},{"key":"54_CR11","volume-title":"Efficient graph matching algorithms for preprocessed model graphs","author":"B. Messmer","year":"1995","unstructured":"B. Messmer, Efficient graph matching algorithms for preprocessed model graphs. PhD Thesis, Univ. of Bern, Switzerland, 1995."},{"issue":"5","key":"54_CR12","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1109\/TPAMI.1981.4767144","volume":"PAMI-3","author":"L. G. Shapiro","year":"1981","unstructured":"L. G. Shapiro and R. M. Haralick, \u201cStructural descriptions and inexact matching.\u201d In IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. PAMI-3, no. 5, Sept. 1981, pp. 504\u2013519.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"54_CR13","unstructured":"P. van Hentenryck and Y. Deville, \u201cThe cardinality operator: A new logical connective and its application to constraint logic programming.\u201d In Proc. Int. Conf. on Logic Programming, 1991, pp. 745\u2013759."},{"key":"54_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/3-540-59155-9_15","volume-title":"Constraint Programming: Basic and Trends","author":"P. Hentenryck van","year":"1995","unstructured":"P. van Hentenryck, V. A. Saraswat, and Y. Deville, \u201cDesign, implementation, and evaluation of the constraint language cc(FD).\u201d In A. Podelski (ed.), Constraint Programming: Basic and Trends, LNCS 910, Springer Verlag, 1995, pp. 293\u2013316."},{"key":"54_CR15","unstructured":"D. Waltz, \u201cUnderstanding Line Drawings of Scenes with Shadows.\u201d In P. H. Winston (ed.), Psychology of Computer Vision, MIP Press, 1975, pp. 19\u201391."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2014 CP 2001"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45578-7_54","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T01:35:17Z","timestamp":1683855317000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45578-7_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540428633","9783540455783"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-45578-7_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"19 November 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}