{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T05:18:36Z","timestamp":1737091116544,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540440666"},{"type":"electronic","value":"9783540458685"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45868-9_19","type":"book-chapter","created":{"date-parts":[[2007,5,19]],"date-time":"2007-05-19T14:54:57Z","timestamp":1179586497000},"page":"222-235","source":"Crossref","is-referenced-by-count":4,"title":["Interpreting Sloppy Stick Figures by Graph Rectification and Constraint-Based Matching"],"prefix":"10.1007","author":[{"given":"James V.","family":"Mahoney","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus P. J.","family":"Fromherz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,10,4]]},"reference":[{"key":"19_CR1","unstructured":"D. Bainbridge and T. Bell. An extensible optical music recognition system. In Proc. Nineteenth Australasian Computer Science Conf., 1996."},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"M. Carlsson, G. Ottosson, B. Carlson. An open-ended finite domain constraint solver. Proc. Programming Languages: Implementations, Logics, and Programs, 1997.","DOI":"10.1007\/BFb0033845"},{"issue":"1","key":"19_CR3","first-page":"90","volume":"27","author":"S. Chok","year":"1995","unstructured":"S. Chok, K. Marriot. Parsing visual languages. Proc. 18th Australasian Computer Science Conf., 27(1), 1995: 90\u201398.","journal-title":"Proc. 18th Australasian Computer Science Conf."},{"key":"19_CR4","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"1990","unstructured":"T. Cormen, C. Leiserson, R. Rivest. Introduction to Algorithms. Cambridge, MA: M.I.T. Press, 1990."},{"key":"19_CR5","unstructured":"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."},{"issue":"6","key":"19_CR6","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1142\/S0218001498000439","volume":"12","author":"H. Fahmy","year":"1998","unstructured":"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\u2013799.","journal-title":"Int. Journal of Pattern Recognition and Artificial Intelligence"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1007\/3-540-45578-7_54"},{"issue":"2","key":"19_CR8","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0031-3203(86)90017-8","volume":"19","author":"D. Isenor","year":"1986","unstructured":"D. Isenor and S. Zaky. Fingerprint identification using graph matching. Pattern Recognition, vol. 19, no. 2, 1986, pp. 113\u2013122.","journal-title":"Pattern Recognition"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"J. Larrosa and G. Valiente, Constraint satisfaction algorithms for graph pattern matching. Under consideration for publication in J. Math. Struct. in Computer Science, 2001.","DOI":"10.1017\/S0960129501003577"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1007\/3-540-45868-9_19"},{"key":"19_CR11","unstructured":"B. Messmer. Efficient graph matching algorithms for preprocessed model graphs. PhD thesis. Bern Univ., Switzerland, 1995."},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"E. Saund. Perceptual organization in an interactive sketch editor. 5th Int. Conf. on Computer Vision. Cambridge, MA: 1995: 597\u2013604.","DOI":"10.1109\/ICCV.1995.466884"},{"key":"19_CR13","unstructured":"E. Saund. Perceptually closed paths in sketches and drawings. Submitted for publication."},{"issue":"5","key":"19_CR14","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1109\/TPAMI.1981.4767144","volume":"3","author":"L. G. Shapiro","year":"1981","unstructured":"L. G. Shapiro and R. M. Haralick. Structural descriptions and inexact matching. In IEEE PAMI, vol. 3, no. 5, Sept. 1981, pp. 504\u2013519.","journal-title":"IEEE PAMI"}],"container-title":["Lecture Notes in Computer Science","Graphics Recognition Algorithms and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45868-9_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T13:09:44Z","timestamp":1737032984000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45868-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440666","9783540458685"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45868-9_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}