{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:17:49Z","timestamp":1750306669513,"version":"3.41.0"},"reference-count":29,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2014,6,1]],"date-time":"2014-06-01T00:00:00Z","timestamp":1401580800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100002855","name":"Ministry of Science and Technology of the People's Republic of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002855","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Multimedia Comput. Commun. Appl."],"published-print":{"date-parts":[[2014,6]]},"abstract":"<jats:p>Indexing structure plays an important role in the application of fast near-duplicate image detection, since it can narrow down the search space. In this article, we develop a cluster of uniform randomized trees (URTs) as an efficient indexing structure to perform fast near-duplicate image detection. The main contribution in this article is that we introduce \u201cuniformity\u201d and \u201crandomness\u201d into the indexing construction. The uniformity requires classifying the object images into the same scale subsets. Such a decision makes good use of the two facts in near-duplicate image detection, namely: (1) the number of categories is huge; (2) a single category usually contains only a small number of images. Therefore, the uniform distribution is very beneficial to narrow down the search space and does not significantly degrade the detection accuracy. The randomness is embedded into the generation of feature subspace and projection direction, improveing the flexibility of indexing construction. The experimental results show that the proposed method is more efficient than the popular locality-sensitive hashing and more stable and flexible than the traditional KD-tree.<\/jats:p>","DOI":"10.1145\/2602186","type":"journal-article","created":{"date-parts":[[2014,7,28]],"date-time":"2014-07-28T13:21:33Z","timestamp":1406553693000},"page":"1-15","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Fast Near-Duplicate Image Detection Using Uniform Randomized Trees"],"prefix":"10.1145","volume":"10","author":[{"given":"Yanqiang","family":"Lei","sequence":"first","affiliation":[{"name":"Sun Yat-sen University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guoping","family":"Qiu","sequence":"additional","affiliation":[{"name":"University of Nottingham, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ligang","family":"Zheng","sequence":"additional","affiliation":[{"name":"Guangzhou University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiwu","family":"Huang","sequence":"additional","affiliation":[{"name":"Shenzhen University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,7,4]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327494"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.677275"},{"volume-title":"Proceedings of the IEEE International Conference on Computer Vision. 1--8.","author":"Bosch A.","key":"e_1_2_1_3_1","unstructured":"A. Bosch , A. Zisserman , and X. Muoz . 2007. Image classification using random forests and ferns . In Proceedings of the IEEE International Conference on Computer Vision. 1--8. A. Bosch, A. Zisserman, and X. Muoz. 2007. Image classification using random forests and ferns. In Proceedings of the IEEE International Conference on Computer Vision. 1--8."},{"volume-title":"Proceedings of the IEEE International Conference on Image Processing. 2461--2464","author":"Cao Y.","key":"e_1_2_1_4_1","unstructured":"Y. Cao , H. Zhang , and J. Guo . 2011. Weakly supervised locality sensitive hashing for duplicate image retrieval . In Proceedings of the IEEE International Conference on Image Processing. 2461--2464 . Y. Cao, H. Zhang, and J. Guo. 2011. Weakly supervised locality sensitive hashing for duplicate image retrieval. In Proceedings of the IEEE International Conference on Image Processing. 2461--2464."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1117\/12.325852"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1282280.1282359"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1646396.1646421"},{"volume-title":"Proceedings of the IEEE International Conference on Multimedia and Expo. 657--660","author":"Hu Y.","key":"e_1_2_1_8_1","unstructured":"Y. Hu , M. Li , and N. Yu . 2008. Efficient near-duplicate image detection by learning from examples . In Proceedings of the IEEE International Conference on Multimedia and Expo. 657--660 . Y. Hu, M. Li, and N. Yu. 2008. Efficient near-duplicate image detection by learning from examples. In Proceedings of the IEEE International Conference on Multimedia and Expo. 657--660."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1460096.1460104"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.235"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2006.886278"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1027527.1027729"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0923-5965(02)00130-3"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.image.2011.04.007"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2006.188"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:VISI.0000029664.99615.94"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011139631724"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2005.54"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2006.09.020"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1049\/el.2009.1111"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-007-0090-8"},{"key":"e_1_2_1_22_1","unstructured":"G. Shakhnarovich. 2008. The source code of locality sensitive hashing. http:\/\/www.ttic.edu\/gregory.  G. Shakhnarovich. 2008. The source code of locality sensitive hashing. http:\/\/www.ttic.edu\/gregory."},{"volume-title":"Proceedings of the IEEE International Conference on Computer Vision. 1470--1477","author":"Sivic J.","key":"e_1_2_1_23_1","unstructured":"J. Sivic and A. Zisserman . 2003. Video google: A text retrieval approach to object matching in videos . In Proceedings of the IEEE International Conference on Computer Vision. 1470--1477 . J. Sivic and A. Zisserman. 2003. Video google: A text retrieval approach to object matching in videos. In Proceedings of the IEEE International Conference on Computer Vision. 1470--1477."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2006.12.001"},{"volume-title":"Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition. 25--32","author":"Wu Z.","key":"e_1_2_1_25_1","unstructured":"Z. Wu , Q. Ke , M. Isard , and J. Sun . 2009. Bundling features for large scale partial-duplicate web image search . In Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition. 25--32 . Z. Wu, Q. Ke, M. Isard, and J. Sun. 2009. Bundling features for large scale partial-duplicate web image search. In Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition. 25--32."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2010.212"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1743384.1743410"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2011.2128301"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2012.2206386"}],"container-title":["ACM Transactions on Multimedia Computing, Communications, and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2602186","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2602186","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:00:47Z","timestamp":1750230047000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2602186"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["10.1145\/2602186"],"URL":"https:\/\/doi.org\/10.1145\/2602186","relation":{},"ISSN":["1551-6857","1551-6865"],"issn-type":[{"type":"print","value":"1551-6857"},{"type":"electronic","value":"1551-6865"}],"subject":[],"published":{"date-parts":[[2014,6]]},"assertion":[{"value":"2013-05-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-03-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-07-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}