{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T16:55:10Z","timestamp":1781196910946,"version":"3.54.1"},"reference-count":25,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2013,11,1]],"date-time":"2013-11-01T00:00:00Z","timestamp":1383264000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001868","name":"National Science Council Taiwan","doi-asserted-by":"publisher","award":["NSC-102-2221-E-007-055-MY3, NSC-102-2220-E-007-023"],"award-info":[{"award-number":["NSC-102-2221-E-007-055-MY3, NSC-102-2220-E-007-023"]}],"id":[{"id":"10.13039\/501100001868","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004725","name":"Ministry of Economic Affairs","doi-asserted-by":"publisher","award":["MOEA-102-EC-17-A-02-S1-202"],"award-info":[{"award-number":["MOEA-102-EC-17-A-02-S1-202"]}],"id":[{"id":"10.13039\/501100004725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100004344","name":"Adobe Systems","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100004344","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000765","name":"University College London","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000765","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2013,11]]},"abstract":"<jats:p>\n            QR code is a popular form of barcode pattern that is ubiquitously used to tag information to products or for linking advertisements. While, on one hand, it is essential to keep the patterns machine-readable; on the other hand, even small changes to the patterns can easily render them unreadable. Hence, in absence of any computational support, such QR codes appear as random collections of black\/white modules, and are often visually unpleasant. We propose an approach to produce high quality visual QR codes, which we call\n            <jats:italic>halftone QR codes<\/jats:italic>\n            , that are still machine-readable. First, we build a pattern readability function wherein we learn a probability distribution of what modules can be replaced by which other modules. Then, given a text tag, we express the input image in terms of the learned dictionary to encode the source text. We demonstrate that our approach produces high quality results on a range of inputs and under different distortion effects.\n          <\/jats:p>","DOI":"10.1145\/2508363.2508408","type":"journal-article","created":{"date-parts":[[2013,11,6]],"date-time":"2013-11-06T14:09:19Z","timestamp":1383746959000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":118,"title":["Halftone QR codes"],"prefix":"10.1145","volume":"32","author":[{"given":"Hung-Kuo","family":"Chu","sequence":"first","affiliation":[{"name":"National Tsing Hua University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chia-Sheng","family":"Chang","sequence":"additional","affiliation":[{"name":"National Tsing Hua University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ruen-Rone","family":"Lee","sequence":"additional","affiliation":[{"name":"National Tsing Hua University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Niloy J.","family":"Mitra","sequence":"additional","affiliation":[{"name":"University College London"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2013,11]]},"reference":[{"key":"e_1_2_2_1_1","unstructured":"A. T. Communications Co. L. 2007. LogoQnet. http:\/\/logoq.net\/.  A. T. Communications Co. L. 2007. LogoQnet. http:\/\/logoq.net\/."},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.969114"},{"key":"e_1_2_2_3_1","unstructured":"Brown J. 2007. Zbar bar code reader. http:\/\/zbar.sourceforge.net\/.  Brown J. 2007. Zbar bar code reader. http:\/\/zbar.sourceforge.net\/."},{"key":"e_1_2_2_4_1","volume-title":"HOWTO: Make Your QR Codes More Beautiful","author":"Chan H.","year":"2011"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1618452.1618508"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1778765.1778788"},{"key":"e_1_2_2_7_1","unstructured":"Cox R. 2012. QArt Codes. http:\/\/research.swtch.com\/qart.  Cox R. 2012. QArt Codes. http:\/\/research.swtch.com\/qart."},{"key":"e_1_2_2_8_1","unstructured":"DENSO WAVE 2003. QR code.com. http:\/\/www.qrcode.com\/en\/.  DENSO WAVE 2003. QR code.com. http:\/\/www.qrcode.com\/en\/."},{"key":"e_1_2_2_9_1","unstructured":"D'Haem J. 2010. QR Code\u00ae Artist. http:\/\/www.qrcartist.com\/.  D'Haem J. 2010. QR Code\u00ae Artist. http:\/\/www.qrcartist.com\/."},{"key":"e_1_2_2_10_1","unstructured":"flickr 2009. QR code Art. http:\/\/www.flickr.com\/groups\/qr-art\/.  flickr 2009. QR code Art. http:\/\/www.flickr.com\/groups\/qr-art\/."},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1274871.1274873"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2070781.2024189"},{"key":"e_1_2_2_13_1","unstructured":"ISO\/IEC 18004 2006. Information technology - Automatic identification and data capture techniques - QR Code 2005 bar code symbology specification.  ISO\/IEC 18004 2006. Information technology - Automatic identification and data capture techniques - QR Code 2005 bar code symbology specification."},{"key":"e_1_2_2_14_1","unstructured":"Kentaro F. 2006. QRencode. http:\/\/fukuchi.org\/works\/qrencode\/.  Kentaro F. 2006. QRencode. http:\/\/fukuchi.org\/works\/qrencode\/."},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2010324.1964994"},{"key":"e_1_2_2_16_1","volume-title":"Proc. EG UK Theory and Practice of Computer Graphics, 51--58","author":"Kyprianidis J. E."},{"key":"e_1_2_2_17_1","unstructured":"Laporte A. 2012. Unitag. http:\/\/www.unitaglive.com\/qrcode.  Laporte A. 2012. Unitag. http:\/\/www.unitaglive.com\/qrcode."},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2010324.1964995"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1618452.1618502"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1360612.1360688"},{"key":"e_1_2_2_21_1","unstructured":"Peled U. 2012. Visualead. http:\/\/www.visualead.com\/.  Peled U. 2012. Visualead. http:\/\/www.visualead.com\/."},{"key":"e_1_2_2_22_1","unstructured":"Scheib V. 2010. QR Code hacks: modifying and altering for artistic fun. http:\/\/beautifulpixels.blogspot.tw\/2010\/08\/qr-codehacks-modifying-and-altering.html.  Scheib V. 2010. QR Code hacks: modifying and altering for artistic fun. http:\/\/beautifulpixels.blogspot.tw\/2010\/08\/qr-codehacks-modifying-and-altering.html."},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2003.819861"},{"key":"e_1_2_2_24_1","volume-title":"Scan Me: Everybody's Guide to the Magical World of QR Codes","author":"Winter M.","year":"2011"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1778765.1778789"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2508363.2508408","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2508363.2508408","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:28:39Z","timestamp":1750231719000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2508363.2508408"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11]]},"references-count":25,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["10.1145\/2508363.2508408"],"URL":"https:\/\/doi.org\/10.1145\/2508363.2508408","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11]]},"assertion":[{"value":"2013-11-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}