{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:01:43Z","timestamp":1750309303698,"version":"3.41.0"},"reference-count":57,"publisher":"Association for Computing Machinery (ACM)","issue":"10","license":[{"start":{"date-parts":[[2024,9,12]],"date-time":"2024-09-12T00:00:00Z","timestamp":1726099200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Fulbright Commission, in part by S\u00e3o Paulo Research Foundation - FAPESP","award":["#2018\/15597-6, #2018\/15519-5, #2023\/00694-4"],"award-info":[{"award-number":["#2018\/15597-6, #2018\/15519-5, #2023\/00694-4"]}]},{"name":"Brazilian National Council for Scientific and Technological Development - CNPq","award":["#309439\/2020-5, #422667\/2021-8, and #313193\/2023-1"],"award-info":[{"award-number":["#309439\/2020-5, #422667\/2021-8, and #313193\/2023-1"]}]},{"DOI":"10.13039\/501100004225","name":"Petrobras","doi-asserted-by":"crossref","award":["#2023\/00095-3"],"award-info":[{"award-number":["#2023\/00095-3"]}],"id":[{"id":"10.13039\/501100004225","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation, USA","doi-asserted-by":"crossref","award":["CNS-2333611"],"award-info":[{"award-number":["CNS-2333611"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Multimedia Comput. Commun. Appl."],"published-print":{"date-parts":[[2024,10,31]]},"abstract":"<jats:p>The large and growing amount of digital data creates a pressing need for approaches capable of indexing and retrieving multimedia content. A traditional and fundamental challenge consists of effectively and efficiently performing nearest-neighbor searches. After decades of research, several different methods are available, including trees, hashing, and graph-based approaches. Most of the current methods exploit learning to hash approaches based on deep learning. In spite of effective results and compact codes obtained, such methods often require a significant amount of labeled data for training. Unsupervised approaches also rely on expensive training procedures usually based on a huge amount of data. In this work, we propose an unsupervised data-independent approach for nearest neighbor searches, which can be used with different features, including deep features trained by transfer learning. The method uses a rank-based formulation and exploits a hashing approach for efficient ranked list computation at query time. A comprehensive experimental evaluation was conducted on seven public datasets, considering deep features based on CNNs and Transformers. Both effectiveness and efficiency aspects were evaluated. The proposed approach achieves remarkable results in comparison to traditional and state-of-the-art methods. Hence, it is an attractive and innovative solution, especially when costly training procedures need to be avoided.<\/jats:p>","DOI":"10.1145\/3659580","type":"journal-article","created":{"date-parts":[[2024,4,16]],"date-time":"2024-04-16T15:51:30Z","timestamp":1713282690000},"page":"1-19","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Rank-based Hashing for Effective and Efficient Nearest Neighbor Search for Image Retrieval"],"prefix":"10.1145","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0153-7910","authenticated-orcid":false,"given":"Vinicius Sato","family":"Kawai","sequence":"first","affiliation":[{"name":"Department of Statistics, Applied Math. and Computing, State University of S\u00e3o Paulo (UNESP), Rio Claro, Brazil"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3833-9072","authenticated-orcid":false,"given":"Lucas Pascotti","family":"Valem","sequence":"additional","affiliation":[{"name":"Department of Statistics, Applied Math. and Computing, State University of S\u00e3o Paulo (UNESP), Rio Claro Brazil"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8824-3055","authenticated-orcid":false,"given":"Alexandro","family":"Baldassin","sequence":"additional","affiliation":[{"name":"Department of Statistics, Applied Math. and Computing, State University of S\u00e3o Paulo (UNESP), Rio Claro Brazil"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1783-4231","authenticated-orcid":false,"given":"Edson","family":"Borin","sequence":"additional","affiliation":[{"name":"DSC, University of Campinas (UNICAMP), Campinas, Brazil"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2867-4838","authenticated-orcid":false,"given":"Daniel Carlos Guimar\u00e3es","family":"Pedronette","sequence":"additional","affiliation":[{"name":"DEMAC, State University of S\u00e3o Paulo (UNESP), Rio Claro, Brazil"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5102-8244","authenticated-orcid":false,"given":"Longin Jan","family":"Latecki","sequence":"additional","affiliation":[{"name":"Temple University, Philadelphia, United States"}]}],"member":"320","published-online":{"date-parts":[[2024,9,12]]},"reference":[{"key":"e_1_3_2_2_2","first-page":"599","volume-title":"International Conference on Machine Learning, ICML (Proceedings of Machine Learning Research)","volume":"162","author":"Andoni Alexandr","year":"2022","unstructured":"Alexandr Andoni and Daniel Beaglehole. 2022. Learning to hash robustly, guaranteed. In International Conference on Machine Learning, ICML (Proceedings of Machine Learning Research), Vol. 162. 599\u2013618."},{"doi-asserted-by":"publisher","key":"e_1_3_2_3_2","DOI":"10.1109\/TKDE.2019.2953897"},{"doi-asserted-by":"publisher","key":"e_1_3_2_4_2","DOI":"10.1145\/502807.502808"},{"key":"e_1_3_2_5_2","article-title":"Deep image retrieval: A survey","volume":"2101","author":"Chen Wei","year":"2021","unstructured":"Wei Chen, Yu Liu, Weiping Wang, Erwin M. Bakker, Theodoros Georgiou, Paul W. Fieguth, Li Liu, and Michael S. Lew. 2021. Deep image retrieval: A survey. CoRR abs\/2101.11282 (2021).","journal-title":"CoRR"},{"doi-asserted-by":"publisher","key":"e_1_3_2_6_2","DOI":"10.1109\/ICCV.2019.00989"},{"key":"e_1_3_2_7_2","first-page":"913","volume-title":"Proceedings of the 34th International Conference on Machine Learning (Proceedings of Machine Learning Research)","volume":"70","author":"Dai Bo","year":"2017","unstructured":"Bo Dai, Ruiqi Guo, Sanjiv Kumar, Niao He, and Le Song. 2017. Stochastic generative hashing. In Proceedings of the 34th International Conference on Machine Learning (Proceedings of Machine Learning Research), Doina Precup and Yee Whye Teh (Eds.), Vol. 70. PMLR, 913\u2013922."},{"doi-asserted-by":"publisher","key":"e_1_3_2_8_2","DOI":"10.1145\/997817.997857"},{"doi-asserted-by":"publisher","key":"e_1_3_2_9_2","DOI":"10.1109\/TCSVT.2020.3035775"},{"doi-asserted-by":"publisher","key":"e_1_3_2_10_2","DOI":"10.1145\/872757.872795"},{"doi-asserted-by":"publisher","key":"e_1_3_2_11_2","DOI":"10.1016\/j.patcog.2019.107082"},{"key":"e_1_3_2_12_2","article-title":"Tree-based search graph for approximate nearest neighbor search","volume":"2201","author":"Fan Xiaobin","year":"2022","unstructured":"Xiaobin Fan, Xiaoping Wang, Kai Lu, Lei Xue, and Jinjing Zhao. 2022. Tree-based search graph for approximate nearest neighbor search. CoRR abs\/2201.03237 (2022). https:\/\/arxiv.org\/abs\/2201.03237","journal-title":"CoRR"},{"doi-asserted-by":"publisher","key":"e_1_3_2_13_2","DOI":"10.1023\/B:VISI.0000042993.50813.60"},{"doi-asserted-by":"publisher","key":"e_1_3_2_14_2","DOI":"10.5555\/645925.671516"},{"doi-asserted-by":"publisher","key":"e_1_3_2_15_2","DOI":"10.1109\/CVPR.2011.5995432"},{"doi-asserted-by":"publisher","key":"e_1_3_2_16_2","DOI":"10.1016\/j.neucom.2019.08.050"},{"doi-asserted-by":"publisher","key":"e_1_3_2_17_2","DOI":"10.1109\/CVPR.2016.90"},{"doi-asserted-by":"publisher","key":"e_1_3_2_18_2","DOI":"10.1109\/CVPR.2016.559"},{"doi-asserted-by":"publisher","key":"e_1_3_2_19_2","DOI":"10.1145\/1460096.1460104"},{"doi-asserted-by":"publisher","key":"e_1_3_2_20_2","DOI":"10.1109\/TIP.2021.3091895"},{"doi-asserted-by":"publisher","key":"e_1_3_2_21_2","DOI":"10.1109\/TPAMI.2010.57"},{"key":"e_1_3_2_22_2","volume-title":"Workshop on Fine-Grained Visual Categorization, CVPR","author":"Khosla Aditya","year":"2011","unstructured":"Aditya Khosla, Nityananda Jayadevaprakash, Bangpeng Yao, and Li Fei-Fei. 2011. Novel dataset for fine-grained image categorization. In Workshop on Fine-Grained Visual Categorization, CVPR."},{"doi-asserted-by":"publisher","key":"e_1_3_2_23_2","DOI":"10.5555\/3120747.3120765"},{"unstructured":"Alex Krizhevsky. 2009. Learning multiple layers of features from tiny images. Retrieved from https:\/\/www.cs.toronto.edu\/kriz\/learning-features-2009-TR.pdf","key":"e_1_3_2_24_2"},{"doi-asserted-by":"publisher","key":"e_1_3_2_25_2","DOI":"10.1109\/ICCV.2009.5459466"},{"doi-asserted-by":"publisher","key":"e_1_3_2_26_2","DOI":"10.1007\/978-3-540-88688-4_27"},{"doi-asserted-by":"publisher","key":"e_1_3_2_27_2","DOI":"10.1109\/TKDE.2022.3220683"},{"key":"e_1_3_2_28_2","article-title":"Self-supervised weighted hashing with topology mining","author":"Li Peishuo","year":"2023","unstructured":"Peishuo Li, P. Li, and Wanting Yin. 2023. Self-supervised weighted hashing with topology mining. Proceedings of the 7th International Conference on Control Engineering and Artificial Intelligence (2023). https:\/\/api.semanticscholar.org\/CorpusID:257283375","journal-title":"Proceedings of the 7th International Conference on Control Engineering and Artificial Intelligence"},{"doi-asserted-by":"publisher","key":"e_1_3_2_29_2","DOI":"10.1609\/aaai.v36i2.20025"},{"key":"e_1_3_2_30_2","article-title":"Deep unsupervised image hashing by maximizing bit entropy","author":"Li Yunqiang","year":"2021","unstructured":"Yunqiang Li and Jan van Gemert. 2021. Deep unsupervised image hashing by maximizing bit entropy. AAAI (2021).","journal-title":"AAAI"},{"doi-asserted-by":"publisher","key":"e_1_3_2_31_2","DOI":"10.1109\/CVPR.2016.133"},{"key":"e_1_3_2_32_2","article-title":"A comparative study on hierarchical navigable small world graphs","volume":"1904","author":"Lin Peng-Cheng","year":"2019","unstructured":"Peng-Cheng Lin and Wan-Lei Zhao. 2019. A comparative study on hierarchical navigable small world graphs. CoRR abs\/1904.02077 (2019).","journal-title":"CoRR"},{"doi-asserted-by":"publisher","key":"e_1_3_2_33_2","DOI":"10.1016\/j.patcog.2012.06.001"},{"doi-asserted-by":"publisher","key":"e_1_3_2_34_2","DOI":"10.1109\/ICCV.2015.132"},{"key":"e_1_3_2_35_2","article-title":"Swin transformer: Hierarchical vision transformer using shifted windows","volume":"2103","author":"Liu Ze","year":"2021","unstructured":"Ze Liu, Yutong Lin, Yue Cao, Han Hu, Yixuan Wei, Zheng Zhang, Stephen Lin, and Baining Guo. 2021. Swin transformer: Hierarchical vision transformer using shifted windows. CoRR abs\/2103.14030 (2021).","journal-title":"CoRR"},{"key":"e_1_3_2_36_2","article-title":"A survey on deep hashing methods","author":"Luo Xiao","year":"2022","unstructured":"Xiao Luo, Haixin Wang, Daqing Wu, Chong Chen, Minghua Deng, Jianqiang Huang, and Xian-Sheng Hua. 2022. A survey on deep hashing methods. ACM Trans. Knowl. Discov. Data (Apr.2022).","journal-title":"ACM Trans. Knowl. Discov. Data"},{"doi-asserted-by":"publisher","key":"e_1_3_2_37_2","DOI":"10.1145\/3532624"},{"doi-asserted-by":"publisher","key":"e_1_3_2_38_2","DOI":"10.1109\/ICME51207.2021.9428094"},{"doi-asserted-by":"publisher","key":"e_1_3_2_39_2","DOI":"10.1145\/3474085.3475570"},{"doi-asserted-by":"publisher","key":"e_1_3_2_40_2","DOI":"10.24963\/ijcai.2021\/125"},{"doi-asserted-by":"publisher","key":"e_1_3_2_41_2","DOI":"10.1109\/CVPR.2006.42"},{"doi-asserted-by":"publisher","key":"e_1_3_2_42_2","DOI":"10.1109\/CVPR.2006.264"},{"doi-asserted-by":"crossref","unstructured":"Yun Peng Byron Choi Tsz Nam Chan Jianye Yang and Jianliang Xu. 2023. Efficient approximate nearest neighbor search in multi-dimensional databases. 1 1 Article 54 (2023) 27 pages.","key":"e_1_3_2_43_2","DOI":"10.1145\/3588908"},{"doi-asserted-by":"publisher","key":"e_1_3_2_44_2","DOI":"10.1007\/s11263-015-0816-y"},{"doi-asserted-by":"publisher","key":"e_1_3_2_45_2","DOI":"10.1109\/TPAMI.2018.2789887"},{"doi-asserted-by":"publisher","key":"e_1_3_2_46_2","DOI":"10.1109\/CVPR42600.2020.00289"},{"doi-asserted-by":"publisher","key":"e_1_3_2_47_2","DOI":"10.1007\/s10115-022-01734-0"},{"key":"e_1_3_2_48_2","first-page":"806","volume-title":"Proceedings of the 32nd International Conference on Neural Information Processing Systems (NIPS\u201918)","author":"Su Shupeng","year":"2018","unstructured":"Shupeng Su, Chao Zhang, Kai Han, and Yonghong Tian. 2018. Greedy hash: Towards fast optimization for accurate hash coding in CNN. In Proceedings of the 32nd International Conference on Neural Information Processing Systems (NIPS\u201918). Curran Associates Inc., Red Hook, NY, USA, 806\u2013815."},{"unstructured":"Hui Wang Yong Wang and Wan-Lei Zhao. 2022. Graph-based Approximate NN Search: A Revisit. (2022). https:\/\/arxiv.org\/abs\/2204.00824","key":"e_1_3_2_49_2"},{"doi-asserted-by":"publisher","key":"e_1_3_2_50_2","DOI":"10.1109\/TPAMI.2013.125"},{"doi-asserted-by":"publisher","key":"e_1_3_2_51_2","DOI":"10.1109\/TPAMI.2017.2699960"},{"doi-asserted-by":"publisher","key":"e_1_3_2_52_2","DOI":"10.14778\/3476249.3476255"},{"doi-asserted-by":"publisher","key":"e_1_3_2_53_2","DOI":"10.1145\/1852102.1852106"},{"key":"e_1_3_2_54_2","volume-title":"Advances in Neural Information Processing Systems","author":"Weiss Yair","year":"2008","unstructured":"Yair Weiss, Antonio Torralba, and Rob Fergus. 2008. Spectral hashing. In Advances in Neural Information Processing Systems, D. Koller, D. Schuurmans, Y. Bengio, and L. Bottou (Eds.), Vol. 21. Curran Associates, Inc."},{"doi-asserted-by":"publisher","key":"e_1_3_2_55_2","DOI":"10.5555\/3304415.3304566"},{"doi-asserted-by":"publisher","key":"e_1_3_2_56_2","DOI":"10.1109\/CVPR.2019.00306"},{"doi-asserted-by":"publisher","key":"e_1_3_2_57_2","DOI":"10.1609\/aaai.v35i5.16592"},{"doi-asserted-by":"publisher","key":"e_1_3_2_58_2","DOI":"10.5555\/2540128.2540227"}],"container-title":["ACM Transactions on Multimedia Computing, Communications, and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3659580","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3659580","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:03:42Z","timestamp":1750291422000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3659580"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,12]]},"references-count":57,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2024,10,31]]}},"alternative-id":["10.1145\/3659580"],"URL":"https:\/\/doi.org\/10.1145\/3659580","relation":{},"ISSN":["1551-6857","1551-6865"],"issn-type":[{"type":"print","value":"1551-6857"},{"type":"electronic","value":"1551-6865"}],"subject":[],"published":{"date-parts":[[2024,9,12]]},"assertion":[{"value":"2023-07-11","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-03-31","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-09-12","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}