{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T15:04:11Z","timestamp":1761059051270,"version":"3.41.0"},"reference-count":33,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2010,6,1]],"date-time":"2010-06-01T00:00:00Z","timestamp":1275350400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["IIS-0747356"],"award-info":[{"award-number":["IIS-0747356"]}],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[2010,6]]},"abstract":"<jats:p>New algorithms provide the ability for robust but scalable image search.<\/jats:p>","DOI":"10.1145\/1743546.1743570","type":"journal-article","created":{"date-parts":[[2010,6,1]],"date-time":"2010-06-01T12:21:35Z","timestamp":1275394895000},"page":"84-94","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Efficiently searching for similar images"],"prefix":"10.1145","volume":"53","author":[{"given":"Kristen","family":"Grauman","sequence":"first","affiliation":[{"name":"University of Texas at Austin"}]}],"member":"320","published-online":{"date-parts":[[2010,6]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997856"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230130404"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015330.1015424"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/794189.794431"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509965"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1460096.1460144"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273523"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.410146"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/355744.355745"},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of the International Conference on Very Large Data Bases","author":"Gionis A.","year":"1999","unstructured":"Gionis , A. , Indyk , P. , Motwani , R. Similarity search in high dimensions via hashing . In Proceedings of the International Conference on Very Large Data Bases ( 1999 ). Gionis, A., Indyk, P., Motwani, R. Similarity search in high dimensions via hashing. In Proceedings of the International Conference on Very Large Data Bases (1999)."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/227683.227684"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2005.239"},{"key":"e_1_2_1_13_1","volume-title":"Advances in Neural Information Processing Systems","author":"Grauman K.","year":"2006","unstructured":"Grauman , K. , Darell , T. Approximate correspondences in high dimensions . In Advances in Neural Information Processing Systems ( 2006 ). Grauman, K., Darell, T. Approximate correspondences in high dimensions. In Advances in Neural Information Processing Systems (2006)."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.383225"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1248659.1248685"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"e_1_2_1_17_1","volume-title":"International Workshop on Statistical and Computational Theories of Vision","author":"Indyk P.","year":"2003","unstructured":"Indyk , P. , Thaper , N. Fast image retrieval via embeddings . In International Workshop on Statistical and Computational Theories of Vision ( 2003 ). Indyk, P., Thaper, N. Fast image retrieval via embeddings. In International Workshop on Statistical and Computational Theories of Vision (2003)."},{"key":"e_1_2_1_18_1","volume-title":"Learning Discriminative Matching Functions for Local Image Features","author":"Jain P.","year":"2007","unstructured":"Jain , P. , Huynh , T. , Grauman , K. Learning Discriminative Matching Functions for Local Image Features . Technical Report , UT-Austin , April 2007 . Jain, P., Huynh, T., Grauman, K. Learning Discriminative Matching Functions for Local Image Features. Technical Report, UT-Austin, April 2007."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587841"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-009-0268-3"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2009.5459466"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2006.68"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:VISI.0000029664.99615.94"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.383131"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2006.12.004"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2006.264"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1561\/0600000003"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1179352.1141964"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00130487"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1561\/0600000017"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90074-R"},{"key":"e_1_2_1_32_1","volume-title":"Distance Metric Learning: A Comprehensive Survey","author":"Yang L.","year":"2006","unstructured":"Yang , L. Distance Metric Learning: A Comprehensive Survey . Technical Report , Michigan State University , 2006 . Yang, L. Distance Metric Learning: A Comprehensive Survey. Technical Report, Michigan State University, 2006."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2006.301"}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1743546.1743570","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1743546.1743570","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:23:19Z","timestamp":1750245799000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1743546.1743570"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":33,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["10.1145\/1743546.1743570"],"URL":"https:\/\/doi.org\/10.1145\/1743546.1743570","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"type":"print","value":"0001-0782"},{"type":"electronic","value":"1557-7317"}],"subject":[],"published":{"date-parts":[[2010,6]]},"assertion":[{"value":"2010-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}