{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T06:58:24Z","timestamp":1764053904857,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031533105"},{"type":"electronic","value":"9783031533112"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-53311-2_20","type":"book-chapter","created":{"date-parts":[[2024,1,27]],"date-time":"2024-01-27T21:37:36Z","timestamp":1706391456000},"page":"270-283","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Time-Quality Tradeoff of\u00a0MuseHash Query Processing Performance"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2643-0028","authenticated-orcid":false,"given":"Maria","family":"Pegia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7276-2472","authenticated-orcid":false,"given":"Ferran Agullo","family":"Lopez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7615-8400","authenticated-orcid":false,"given":"Anastasia","family":"Moumtzidou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5548-3359","authenticated-orcid":false,"given":"Alberto","family":"Gutierrez-Torre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0889-3491","authenticated-orcid":false,"given":"Bj\u00f6rn \u00de\u00f3r","family":"J\u00f3nsson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3037-3580","authenticated-orcid":false,"given":"Josep Llu\u00eds Berral","family":"Garc\u00eda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5234-9795","authenticated-orcid":false,"given":"Ilias","family":"Gialampoukidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2505-9178","authenticated-orcid":false,"given":"Stefanos","family":"Vrochidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6447-9020","authenticated-orcid":false,"given":"Ioannis","family":"Kompatsiaris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,1,28]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Abbasifard, M.R., Ghahremani, B., Naderi, H.: A survey on nearest neighbor search methods. Int. J. Comput. Appl. 95(25) (2014)","DOI":"10.5120\/16754-7073"},{"issue":"1","key":"20_CR2","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s10462-017-9591-1","volume":"52","author":"P Arulmozhi","year":"2017","unstructured":"Arulmozhi, P., Abirami, S.: A comparative study of hash based approximate nearest neighbor learning and its application in image retrieval. Artif. Intell. Rev. 52(1), 323\u2013355 (2017). https:\/\/doi.org\/10.1007\/s10462-017-9591-1","journal-title":"Artif. Intell. Rev."},{"key":"20_CR3","doi-asserted-by":"publisher","unstructured":"Aum\u00fcller, M., Bernhardsson, E., Faithfull, A.: ANN-benchmarks: a benchmarking tool for approximate nearest neighbor algorithms. In: International Conference on Similarity Search and Applications, pp. 34\u201349. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-68474-1_3","DOI":"10.1007\/978-3-319-68474-1_3"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Bai, C., Zeng, C., Ma, Q., Zhang, J., Chen, S.: Deep adversarial discrete hashing for cross-modal retrieval. In: Proceedings of the 2020 International Conference on Multimedia Retrieval (2020)","DOI":"10.1145\/3372278.3390711"},{"key":"20_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-642-41062-8_28","volume-title":"Similarity Search and Applications","author":"L Boytsov","year":"2013","unstructured":"Boytsov, L., Naidan, B.: Engineering efficient and effective non-metric space library. In: Brisaboa, N., Pedreira, O., Zezula, P. (eds.) SISAP 2013. LNCS, vol. 8199, pp. 280\u2013293. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-41062-8_28"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Bozcan, I., Kayacan, E.: AU-AIR: A multi-modal unmanned aerial vehicle dataset for low altitude traffic surveillance. In: 2020 IEEE International Conference on Robotics and Automation (ICRA), pp. 8504\u20138510. IEEE (2020)","DOI":"10.1109\/ICRA40945.2020.9196845"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Cao, Y., Long, M., Liu, B., Wang, J.: Deep cauchy hashing for hamming space retrieval. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (2018)","DOI":"10.1109\/CVPR.2018.00134"},{"key":"20_CR8","first-page":"5199","volume":"34","author":"Q Chen","year":"2021","unstructured":"Chen, Q., et al.: Spann: highly-efficient billion-scale approximate nearest neighborhood search. Adv. Neural. Inf. Process. Syst. 34, 5199\u20135212 (2021)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"20_CR9","unstructured":"Chen, S., et al.: Hadamard Codebook based Deep Hashing. arXiv Preprint arXiv:1910.09182 (2019)"},{"key":"20_CR10","unstructured":"Chen, X., G\u00fcttel, S.: Fast Exact Fixed-Radius Nearest Neighbor Search based on Sorting. Preprint at arXiv. 1048550\/ARXIV2212 (2022)"},{"key":"20_CR11","unstructured":"Chetlur, S., et al.: cuDNN: Efficient Primitives for Deep Learning (2014)"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Dong, W., Moses, C., Li, K.: Efficient K-nearest neighbor graph construction for generic similarity measures. In: Proceedings of the 20th International Conference on World Wide Web, pp. 577\u2013586 (2011)","DOI":"10.1145\/1963405.1963487"},{"issue":"3","key":"20_CR13","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1016\/j.ejor.2016.07.024","volume":"256","author":"MJ Geiger","year":"2017","unstructured":"Geiger, M.J.: A Multi-threaded local search algorithm and computer implementation for the multi-mode, resource-constrained multi-project scheduling problem. Eur. J. Oper. Res. 256(3), 729\u2013741 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"20_CR14","unstructured":"Guo, R., et al.: Accelerating large-scale inference with anisotropic vector quantization. In: International Conference on Machine Learning, pp. 3887\u20133896. PMLR (2020)"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Gurrin, C., et al.: Introduction to the sixth annual lifelog sarch challenge, LSC\u201923. In: Proceedings of the 2023 ACM International Conference on Multimedia Retrieval, pp. 678\u2013679 (2023)","DOI":"10.1145\/3591106.3592304"},{"issue":"7","key":"20_CR16","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1109\/MC.2008.209","volume":"41","author":"MD Hill","year":"2008","unstructured":"Hill, M.D., Marty, M.R.: Amdahl\u2019s law in the multicore era. Computer 41(7), 33\u201338 (2008). https:\/\/doi.org\/10.1109\/MC.2008.209","journal-title":"Computer"},{"key":"20_CR17","unstructured":"Jayaram Subramanya, S., Devvrit, F., Simhadri, H.V., Krishnawamy, R., Kadekodi, R.: Diskann: fast accurate billion-point nearest neighbor search on a single node. In: Advances in Neural Information Processing Systems, vol. 32 (2019)"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Jing, L., Vahdani, E., Tan, J., Tian, Y.: Cross-Modal Center Loss for 3D Cross-Modal Retrieval. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition (2021)","DOI":"10.1109\/CVPR46437.2021.00316"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Li, W., et al.: Approximate nearest neighbor search on high dimensional data-experiments, analyses, and improvement. IEEE Transactions on Knowledge and Data Engineering (2019)","DOI":"10.1109\/TKDE.2019.2909204"},{"issue":"6","key":"20_CR20","doi-asserted-by":"publisher","first-page":"3481","DOI":"10.1007\/s00530-023-01143-5","volume":"29","author":"J Loko\u010d","year":"2023","unstructured":"Loko\u010d, J., et al.: Interactive video retrieval in the age of effective joint embedding deep models: lessons from the 11th VBS. Multimedia Syst. 29(6), 3481\u20133504 (2023)","journal-title":"Multimedia Syst."},{"key":"20_CR21","unstructured":"Luna, A.: Using Annoy in Package C++ Code"},{"issue":"4","key":"20_CR22","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1109\/TPAMI.2018.2889473","volume":"42","author":"YA Malkov","year":"2018","unstructured":"Malkov, Y.A., Yashunin, D.A.: Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs. IEEE Trans. Pattern Anal. Mach. Intell. 42(4), 824\u2013836 (2018)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"20_CR23","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.is.2013.10.006","volume":"45","author":"Y Malkov","year":"2014","unstructured":"Malkov, Y., Ponomarenko, A., Logvinov, A., Krylov, V.: Approximate nearest neighbor algorithm based on navigable small world graphs. Inf. Syst. 45, 61\u201368 (2014)","journal-title":"Inf. Syst."},{"key":"20_CR24","unstructured":"Narasimhulu, Y., Suthar, A., Pasunuri, R., Venkaiah, V.C.: CKD-Tree: an improved kd-tree construction algorithm. In: ISIC, pp. 211\u2013218 (2021)"},{"key":"20_CR25","unstructured":"NVIDIA, Vingelmann, P., Fitzek, F.H.: CUDA, Release: 10.2.89 (2020). https:\/\/developer.nvidia.com\/cuda-toolkit"},{"key":"20_CR26","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"20_CR27","doi-asserted-by":"crossref","unstructured":"Pegia, M., et al.: MuseHash: supervised bayesian hashing for multimodal image representation. In: ICMR, pp. 434\u2013442 (2023)","DOI":"10.1145\/3591106.3592228"},{"key":"20_CR28","doi-asserted-by":"crossref","unstructured":"Raschka, S., Patterson, J., Nolet, C.: Machine Learning in Python: Main Developments and Technology Trends in Data Science, Machine Learning, and Artificial Intelligence. arXiv Preprint arXiv:2002.04803 (2020)","DOI":"10.3390\/info11040193"},{"key":"20_CR29","doi-asserted-by":"crossref","unstructured":"Ukey, N., Yang, Z., Li, B., Zhang, G., Hu, Y., Zhang, W.: Survey on Exact KNN Qeries over High-Dimensional Data Space. Sensors (2023)","DOI":"10.3390\/s23020629"},{"key":"20_CR30","unstructured":"Weber, R., Schek, H.J., Blott, S.: A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: VLDB. vol. 98, pp. 194\u2013205 (1998)"},{"key":"20_CR31","doi-asserted-by":"crossref","unstructured":"Zhao, W., Tan, S., Li, P.: Song: approximate nearest neighbor search on GPU. In: 2020 IEEE 36th International Conference on Data Engineering (ICDE), pp. 1033\u20131044. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00094"}],"container-title":["Lecture Notes in Computer Science","MultiMedia Modeling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-53311-2_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T15:27:36Z","timestamp":1710257256000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-53311-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031533105","9783031533112"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-53311-2_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"28 January 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MMM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Multimedia Modeling","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amsterdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 January 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 February 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mmm2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"ConfTool Pro","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"297","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"112","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}