{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:13:59Z","timestamp":1725498839076},"reference-count":23,"publisher":"Association for Computing Machinery (ACM)","issue":"1","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2013,1]]},"abstract":"Vectorization provides a link between raster scans of pencil-and-paper drawings and modern digital processing algorithms that require accurate vector representations. Even when input drawings are comprised of clean, crisp lines, inherent ambiguities near junctions make vectorization deceptively difficult. As a consequence, current vectorization approaches often fail to faithfully capture the junctions of drawn strokes. We propose a vectorization algorithm specialized for clean line drawings that analyzes the drawing's topology in order to overcome junction ambiguities. A gradient-based pixel clustering technique facilitates topology computation. This topological information is exploited during centerline extraction by a new \u201creverse drawing\u201d procedure that reconstructs all possible drawing states prior to the creation of a junction and then selects the most likely stroke configuration. For cases where the automatic result does not match the artist's interpretation, our drawing analysis enables an efficient user interface to easily adjust the junction location. We demonstrate results on professional examples and evaluate the vectorization quality with quantitative comparison to hand-traced centerlines as well as the results of leading commercial algorithms.<\/jats:p>","DOI":"10.1145\/2421636.2421640","type":"journal-article","created":{"date-parts":[[2013,2,19]],"date-time":"2013-02-19T14:32:37Z","timestamp":1361284357000},"page":"1-11","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":76,"title":["Topology-driven vectorization of clean line drawings"],"prefix":"10.1145","volume":"32","author":[{"given":"Gioacchino","family":"Noris","sequence":"first","affiliation":[{"name":"ETH Zurich and Disney Research Zurich"}]},{"given":"Alexander","family":"Hornung","sequence":"additional","affiliation":[{"name":"Disney Research Zurich"}]},{"given":"Robert W.","family":"Sumner","sequence":"additional","affiliation":[{"name":"Disney Research Zurich"}]},{"given":"Maryann","family":"Simmons","sequence":"additional","affiliation":[{"name":"Walt Disney Animation Studios"}]},{"given":"Markus","family":"Gross","sequence":"additional","affiliation":[{"name":"ETH Zurich and Disney Research Zurich"}]}],"member":"320","published-online":{"date-parts":[[2013,2,7]]},"reference":[{"key":"e_1_2_2_1_1","unstructured":"Adobe 2010. Illustrator. http:\/\/www.adobe.com\/. Adobe 2010. Illustrator. http:\/\/www.adobe.com\/."},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1384429.1384456"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(98)00045-4"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1987.4767946"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2007.1002"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/356625.356627"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2006.127"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1006\/cviu.1996.0484"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1031120.1031121"},{"key":"e_1_2_2_10_1","unstructured":"Kleinberg J. and Tardos E. 2005. Algorithm Design. Addison-Wesley Longman Publishing Co. Inc. Kleinberg J. and Tardos E. 2005. Algorithm Design. Addison-Wesley Longman Publishing Co. Inc."},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDIP.2009.21"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.161346"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/2383894.2383939"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1360612.1360691"},{"key":"e_1_2_2_15_1","unstructured":"Sisoft.Net 2010. Wintopo. http:\/\/wintopo.com\/. Sisoft.Net 2010. Wintopo. http:\/\/wintopo.com\/."},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1276377.1276391"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/11595755_6"},{"key":"e_1_2_2_18_1","unstructured":"ToonBoom 2010. Harmony. http:\/\/www.toonboom.com\/. ToonBoom 2010. Harmony. http:\/\/www.toonboom.com\/."},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1134\/S1054661809020102"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2009.01630.x"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1618452.1618461"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2009.9"},{"key":"e_1_2_2_23_1","volume-title":"Proceedings of the International Conference on Computer Graphics. 225--231","author":"Zou J. J.","unstructured":"Zou , J. J. , and Yan , H . 2001. Cartoon image vectorization based on shape subdivision . In Proceedings of the International Conference on Computer Graphics. 225--231 . Zou, J. J., and Yan, H. 2001. Cartoon image vectorization based on shape subdivision. In Proceedings of the International Conference on Computer Graphics. 225--231."}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2421636.2421640","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T08:37:49Z","timestamp":1672389469000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2421636.2421640"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,1]]}},"alternative-id":["10.1145\/2421636.2421640"],"URL":"https:\/\/doi.org\/10.1145\/2421636.2421640","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1]]},"assertion":[{"value":"2010-12-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-05-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-02-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}