{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:28:41Z","timestamp":1750307321169,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,4,18]],"date-time":"2011-04-18T00:00:00Z","timestamp":1303084800000},"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":[[2011,4,18]]},"DOI":"10.1145\/1991996.1992027","type":"proceedings-article","created":{"date-parts":[[2011,6,6]],"date-time":"2011-06-06T11:53:52Z","timestamp":1307361232000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["A comparison of extended fingerprint hashing and locality sensitive hashing for binary audio fingerprints"],"prefix":"10.1145","author":[{"given":"Kimberly","family":"Moravec","sequence":"first","affiliation":[{"name":"University College London, Malet Place, London, UK"}]},{"given":"Ingemar J.","family":"Cox","sequence":"additional","affiliation":[{"name":"University College London, Malet Place, London, UK"}]}],"member":"320","published-online":{"date-parts":[[2011,4,18]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Audible magic. (Online). Available: {http:\/\/www.audiblemagic.com}.  Audible magic. (Online). Available: {http:\/\/www.audiblemagic.com}."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327494"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/358841.358850"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.1993.341106"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11265-005-4151-3"},{"key":"e_1_3_2_1_6_1","volume-title":"Proc. 112th Int. Conv. of the AES","author":"Cano P.","year":"2002","unstructured":"P. Cano , E. Batlle , H. Mayer , and H. Neuschmied . Robust sound modeling for song detection in broadcast audio . In Proc. 112th Int. Conv. of the AES , 2002 . P. Cano, E. Batlle, H. Mayer, and H. Neuschmied. Robust sound modeling for song detection in broadcast audio. In Proc. 112th Int. Conv. of the AES, 2002."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/502807.502808"},{"key":"e_1_3_2_1_8_1","first-page":"15","volume-title":"Nearest-neighbor searching and metric space dimensions","author":"Clarkson K. L.","year":"2006","unstructured":"K. L. Clarkson . Nearest-neighbor searching and metric space dimensions . In G. Shakhnarovich, T. Darrell, and P. Indyk, editors, Nearest-Neighbor Methods for Learning and Vision: Theory and Practice, pages 15 -- 59 . MIT Press , 2006 . K. L. Clarkson. Nearest-neighbor searching and metric space dimensions. In G. Shakhnarovich, T. Darrell, and P. Indyk, editors, Nearest-Neighbor Methods for Learning and Vision: Theory and Practice, pages 15--59. MIT Press, 2006."},{"key":"e_1_3_2_1_9_1","first-page":"107","volume-title":"Proc. of the Int. Symposium on Music Information Retrieval","author":"Haitsma J.","year":"2002","unstructured":"J. Haitsma and T. Kalker . A highly robust audio fingerprinting system . In Proc. of the Int. Symposium on Music Information Retrieval , pages 107 -- 115 , 2002 . J. Haitsma and T. Kalker. A highly robust audio fingerprinting system. In Proc. of the Int. Symposium on Music Information Retrieval, pages 107--115, 2002."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/795662.796303"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258653"},{"key":"e_1_3_2_1_13_1","volume-title":"Proc. 112th Audio Engineering Society Convention","author":"Kurth F.","year":"2002","unstructured":"F. Kurth , A. Ribbrock , and M. Clausen . Identification of highly distorted audio material for querying large scale data bases . In Proc. 112th Audio Engineering Society Convention , 2002 . F. Kurth, A. Ribbrock, and M. Clausen. Identification of highly distorted audio material for querying large scale data bases. In Proc. 112th Audio Engineering Society Convention, 2002."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276877"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1394399"},{"key":"e_1_3_2_1_16_1","first-page":"331","volume-title":"VISSAPP '09: Proc. of the Int. Conf. on Computer Vision Theory and Application","author":"Muja M.","year":"2009","unstructured":"M. Muja and D. G. Lowe . Fast approximate nearest neighbors with automatic algorithm configuration . In VISSAPP '09: Proc. of the Int. Conf. on Computer Vision Theory and Application , pages 331 -- 340 . INSTICC Press , 2009 . M. Muja and D. G. Lowe. Fast approximate nearest neighbors with automatic algorithm configuration. In VISSAPP '09: Proc. of the Int. Conf. on Computer Vision Theory and Application, pages 331--340. INSTICC Press, 2009."},{"key":"e_1_3_2_1_17_1","first-page":"311","volume-title":"SODA '93: Proceedings of the 4th annual ACM-SIAM Symposium on Discrete algorithms","author":"Yianilos P. N.","year":"1993","unstructured":"P. N. Yianilos . Data structures and algorithms for nearest neighbor search in general metric spaces . In SODA '93: Proceedings of the 4th annual ACM-SIAM Symposium on Discrete algorithms , pages 311 -- 321 , Philadelphia, PA, USA , 1993 . Society for Industrial and Applied Mathematics. P. N. Yianilos. Data structures and algorithms for nearest neighbor search in general metric spaces. In SODA '93: Proceedings of the 4th annual ACM-SIAM Symposium on Discrete algorithms, pages 311--321, Philadelphia, PA, USA, 1993. Society for Industrial and Applied Mathematics."},{"key":"e_1_3_2_1_18_1","first-page":"361","volume-title":"SODA '00: Proc. of the 11th annual ACM-SIAM symposium on Discrete algorithms","author":"Yianilos P. N.","year":"2000","unstructured":"P. N. Yianilos . Locally lifting the curse of dimensionality for nearest neighbor search (extended abstract) . In SODA '00: Proc. of the 11th annual ACM-SIAM symposium on Discrete algorithms , pages 361 -- 370 , Philadelphia, PA, USA , 2000 . Society for Industrial and Applied Mathematics. P. N. Yianilos. Locally lifting the curse of dimensionality for nearest neighbor search (extended abstract). In SODA '00: Proc. of the 11th annual ACM-SIAM symposium on Discrete algorithms, pages 361--370, Philadelphia, PA, USA, 2000. Society for Industrial and Applied Mathematics."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132956.1132959"}],"event":{"name":"ICMR'11: International Conference on Multimedia Retrieval","sponsor":["SIGMM ACM Special Interest Group on Multimedia"],"location":"Trento Italy","acronym":"ICMR'11"},"container-title":["Proceedings of the 1st ACM International Conference on Multimedia Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1991996.1992027","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1991996.1992027","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:05:54Z","timestamp":1750244754000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1991996.1992027"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,18]]},"references-count":19,"alternative-id":["10.1145\/1991996.1992027","10.1145\/1991996"],"URL":"https:\/\/doi.org\/10.1145\/1991996.1992027","relation":{},"subject":[],"published":{"date-parts":[[2011,4,18]]},"assertion":[{"value":"2011-04-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}