{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:19:05Z","timestamp":1750306745930,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,10,21]],"date-time":"2013-10-21T00:00:00Z","timestamp":1382313600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,10,21]]},"DOI":"10.1145\/2502081.2502152","type":"proceedings-article","created":{"date-parts":[[2013,10,22]],"date-time":"2013-10-22T13:42:56Z","timestamp":1382449376000},"page":"577-580","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Sim-min-hash"],"prefix":"10.1145","author":[{"given":"Wan-Lei","family":"Zhao","sequence":"first","affiliation":[{"name":"INRIA, Rennes, France"}]},{"given":"Herv\u00e9","family":"J\u00e9gou","sequence":"additional","affiliation":[{"name":"INRIA, Rennes, France"}]},{"given":"Guillaume","family":"Gravier","sequence":"additional","affiliation":[{"name":"CNRS\/IRISA, Rennes, France"}]}],"member":"320","published-online":{"date-parts":[[2013,10,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/2354409.2355123"},{"key":"e_1_3_2_1_2_1","volume-title":"Proc. Compression and Complexity of Sequences","author":"Broder A. Z.","year":"1997","unstructured":"A. Z. Broder . On the resemblance and containment of documents . In Proc. Compression and Complexity of Sequences , 1997 . A. Z. Broder. On the resemblance and containment of documents. In Proc. Compression and Complexity of Sequences, 1997."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2009.166"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1282280.1282359"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5244\/C.22.50"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539991"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-009-0285-2"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1687044.1687107"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2006.264"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2393347.2396520"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.383172"},{"key":"e_1_3_2_1_12_1","unstructured":"D. Qin S. Gammeter L. Bossard T. Quack and L. van Gool. Hello neighbor: Accurate object retrieval with k-reciprocal nearest neighbors. In CVPR 201  D. Qin S. Gammeter L. Bossard T. Quack and L. van Gool. Hello neighbor: Accurate object retrieval with k-reciprocal nearest neighbors. In CVPR 201"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/946247.946751"},{"key":"e_1_3_2_1_14_1","volume-title":"BMVC","author":"Voravuthikunchai W.","year":"2012","unstructured":"W. Voravuthikunchai , B. Cremilleux , and F. Jurie . Findging groups of duplicate images in very large datasets . In BMVC , 2012 . W. Voravuthikunchai, B. Cremilleux, and F. Jurie. Findging groups of duplicate images in very large datasets. In BMVC, 2012."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICME.2006.262509"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5540046"}],"event":{"name":"MM '13: ACM Multimedia Conference","sponsor":["SIGMM ACM Special Interest Group on Multimedia"],"location":"Barcelona Spain","acronym":"MM '13"},"container-title":["Proceedings of the 21st ACM international conference on Multimedia"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2502081.2502152","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2502081.2502152","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:28:22Z","timestamp":1750231702000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2502081.2502152"}},"subtitle":["an efficient matching technique for linking large image collections"],"short-title":[],"issued":{"date-parts":[[2013,10,21]]},"references-count":16,"alternative-id":["10.1145\/2502081.2502152","10.1145\/2502081"],"URL":"https:\/\/doi.org\/10.1145\/2502081.2502152","relation":{},"subject":[],"published":{"date-parts":[[2013,10,21]]},"assertion":[{"value":"2013-10-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}