{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,13]],"date-time":"2026-11-13T17:56:37Z","timestamp":1794592597948,"version":"4.9.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T00:00:00Z","timestamp":1766534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T00:00:00Z","timestamp":1766534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"name":"Deanship of Graduate Studies and Scientific Research, Qassim University"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci Rep"],"DOI":"10.1038\/s41598-025-28392-w","type":"journal-article","created":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T13:30:25Z","timestamp":1766583025000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Integrating semantic and content features into bloom filters for efficient image retrieval"],"prefix":"10.1038","volume":"15","author":[{"given":"Ali Mustafa","family":"Qamar","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rehan Ullah","family":"Khan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohammed","family":"Alsuhaibani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Suliman A.","family":"Alsuhibany","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,12,24]]},"reference":[{"issue":"2","key":"28392_CR1","doi-asserted-by":"publisher","first-page":"1912","DOI":"10.1109\/COMST.2018.2889329","volume":"21","author":"L Luo","year":"2018","unstructured":"Luo, L., Guo, D., Ma, R. T., Rottenstreich, O. & Luo, X. Optimizing bloom filter: Challenges, solutions, and comparisons. IEEE Commun. Surv. Tutor. 21(2), 1912\u20131949. https:\/\/doi.org\/10.1109\/COMST.2018.2889329 (2018).","journal-title":"IEEE Commun. Surv. Tutor."},{"issue":"1","key":"28392_CR2","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1109\/SURV.2011.031611.00024","volume":"14","author":"S Tarkoma","year":"2011","unstructured":"Tarkoma, S., Rothenberg, C. E. & Lagerspetz, E. Theory and practice of bloom filters for distributed systems. IEEE Commun. Surv. Tutor. 14(1), 131\u2013155. https:\/\/doi.org\/10.1109\/SURV.2011.031611.00024 (2011).","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"28392_CR3","doi-asserted-by":"publisher","unstructured":"Breidenbach, U., Steinebach, M. & Liu, H. Privacy-enhanced robust image hashing with bloom filters. In Proceedings of the 15th International Conference on Availability, Reliability and Security, 1\u201310. https:\/\/doi.org\/10.1145\/3407023.3409212 (2020).","DOI":"10.1145\/3407023.3409212"},{"key":"28392_CR4","doi-asserted-by":"publisher","unstructured":"Araujo, A., Chaves, J., Lakshman, H., Angst, R. & Girod, B. Large-scale query-by-image video retrieval using bloom filters. arXiv preprint arXiv:1604.07939. https:\/\/doi.org\/10.48550\/arXiv.1604.07939 (2016).","DOI":"10.48550\/arXiv.1604.07939"},{"key":"28392_CR5","unstructured":"Rae, J., Bartunov, S. & Lillicrap, T. Meta-learning neural bloom filters. In International Conference on Machine Learning, 5271\u20135280 (PMLR, 2019)."},{"key":"28392_CR6","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2004.10129096","author":"M Alsuhaibani","year":"2023","unstructured":"Alsuhaibani, M., Khan, R., Qamar, A. & Alsuhibany, S. Content-based approach for improving bloom filter efficiency. Appl. Sci. https:\/\/doi.org\/10.1080\/15427951.2004.10129096 (2023).","journal-title":"Appl. Sci."},{"key":"28392_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing: Randomized Algorithms and Probabilistic Analysis","author":"M Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M. & Upfal, E. Probability and Computing: Randomized Algorithms and Probabilistic Analysis (Cambridge University Press, Cambridge, 2005). https:\/\/doi.org\/10.1017\/CBO9780511813603."},{"issue":"4","key":"28392_CR8","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1080\/15427951.2004.10129096","volume":"1","author":"A Broder","year":"2004","unstructured":"Broder, A. & Mitzenmacher, M. Network applications of bloom filters: A survey. Internet Math. 1(4), 485\u2013509. https:\/\/doi.org\/10.1080\/15427951.2004.10129096 (2004).","journal-title":"Internet Math."},{"key":"28392_CR9","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/11841036_42","volume-title":"Algorithms\u2014ESA 2006","author":"A Kirsch","year":"2006","unstructured":"Kirsch, A. & Mitzenmacher, M. Less hashing, same performance: Building a better bloom filter. In Algorithms\u2014ESA 2006 (eds Azar, Y. & Erlebach, T.) 456\u2013467 (Springer, Berlin, 2006). https:\/\/doi.org\/10.1007\/11841036_42."},{"key":"28392_CR10","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-540-30494-4_26","volume-title":"Formal Methods in Computer-Aided Design","author":"PC Dillinger","year":"2004","unstructured":"Dillinger, P. C. & Manolios, P. Bloom filters in probabilistic verification. In Formal Methods in Computer-Aided Design (eds Hu, A. J. & Martin, A. K.) 367\u2013381 (Berlin, Springer, 2004). https:\/\/doi.org\/10.1007\/978-3-540-30494-4_26."},{"issue":"4","key":"28392_CR11","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1145\/1151659.1159950","volume":"36","author":"F Bonomi","year":"2006","unstructured":"Bonomi, F., Mitzenmacher, M., Panigrah, R., Singh, S. & Varghese, G. Beyond bloom filters: from approximate membership checks to approximate state machines. SIGCOMM Comput. Commun. Rev. 36(4), 315\u2013326. https:\/\/doi.org\/10.1145\/1151659.1159950 (2006).","journal-title":"SIGCOMM Comput. Commun. Rev."},{"key":"28392_CR12","doi-asserted-by":"publisher","DOI":"10.1145\/1498698.1594230","author":"F Putze","year":"2010","unstructured":"Putze, F., Sanders, P. & Singler, J. Cache-, hash-, and space-efficient bloom filters. ACM J. Exp. Algorithm. https:\/\/doi.org\/10.1145\/1498698.1594230 (2010).","journal-title":"ACM J. Exp. Algorithm."},{"key":"28392_CR13","doi-asserted-by":"publisher","unstructured":"Acar, U., Blelloch, G. & Blumofe, R. The data locality of work stealing. In Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures. SPAA \u201900, 1\u201312 (Association for Computing Machinery, New York, NY, USA, 2000). https:\/\/doi.org\/10.1145\/341800.341801.","DOI":"10.1145\/341800.341801"},{"key":"28392_CR14","doi-asserted-by":"publisher","unstructured":"Fan, B., Andersen, D. & Kaminsky, M. MemC3: Compact and concurrent MemCache with dumber caching and smarter hashing. In Proceedings of the 10th USENIX Conference on Networked Systems Design and Implementation (NSDI\u201913), 371\u2013384 (USENIX Association, USA, 2013). https:\/\/doi.org\/10.5555\/2482626.2482662.","DOI":"10.5555\/2482626.2482662"},{"issue":"2","key":"28392_CR15","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.jalgor.2003.12.002","volume":"51","author":"R Pagh","year":"2004","unstructured":"Pagh, R. & Rodler, F. Cuckoo hashing. J. Algorithms 51(2), 122\u2013144. https:\/\/doi.org\/10.1016\/j.jalgor.2003.12.002 (2004).","journal-title":"J. Algorithms"},{"key":"28392_CR16","doi-asserted-by":"publisher","unstructured":"Chakrabarti, S. Efficient image retrieval using multi neural hash codes and bloom filters. In 2020 IEEE International Conference for Innovation in Technology (INOCON), 1\u20136 (IEEE, 2020). https:\/\/doi.org\/10.33130\/AJCT.2020v06i03.004.","DOI":"10.33130\/AJCT.2020v06i03.004"},{"issue":"3","key":"28392_CR17","doi-asserted-by":"publisher","first-page":"5024","DOI":"10.1109\/JIOT.2023.3301969","volume":"11","author":"Y Li","year":"2024","unstructured":"Li, Y. et al. Secure and efficient bloom-filter-based image search in cloud-based internet of things. IEEE Internet Things J. 11(3), 5024\u20135035. https:\/\/doi.org\/10.1109\/JIOT.2023.3301969 (2024).","journal-title":"IEEE Internet Things J."},{"issue":"1","key":"28392_CR18","doi-asserted-by":"publisher","first-page":"851","DOI":"10.12785\/ijcds\/160161","volume":"16","author":"A Salim","year":"2024","unstructured":"Salim, A., Abdulbasit, M. K., Maath, J. F. & Makki, S. A. Image steganography technique based on Lorenz chaotic system and bloom filter. Int. J. Comput. Digit. Syst. 16(1), 851\u2013859. https:\/\/doi.org\/10.12785\/ijcds\/160161 (2024).","journal-title":"Int. J. Comput. Digit. Syst."},{"key":"28392_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13640-018-0375-6","volume":"2018","author":"M Jiang","year":"2018","unstructured":"Jiang, M., Zhao, C., Mo, Z. & Wen, J. An improved algorithm based on Bloom filter and its application in bar code recognition and processing. EURASIP J. Image Video Process. 2018, 1\u201312. https:\/\/doi.org\/10.1186\/s13640-018-0375-6 (2018).","journal-title":"EURASIP J. Image Video Process."},{"key":"28392_CR20","doi-asserted-by":"publisher","unstructured":"Ng, W. W. Y., Xu, Y., Tian, X., Yang, Y., Wu, H. & Gao, Y. Improved bloom filter for efficient image retrieval on mobile device. In 2022 12th International Conference on Information Science and Technology (ICIST), 265\u2013270. https:\/\/doi.org\/10.1109\/ICIST55546.2022.9926800 (2022).","DOI":"10.1109\/ICIST55546.2022.9926800"},{"issue":"4","key":"28392_CR21","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1016\/j.ipl.2015.11.002","volume":"116","author":"S Pontarelli","year":"2016","unstructured":"Pontarelli, S., Reviriego, P. & Maestro, J. A. Improving counting bloom filter performance with fingerprints. Inf. Process. Lett. 116(4), 304\u2013309 (2016).","journal-title":"Inf. Process. Lett."},{"key":"28392_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/s00371-024-03517-w","author":"Z Yu","year":"2024","unstructured":"Yu, Z. et al. A novel image hashing with low-rank sparse matrix decomposition and feature distance. Vis Comput. https:\/\/doi.org\/10.1007\/s00371-024-03517-w (2024).","journal-title":"Vis Comput."},{"issue":"6","key":"28392_CR23","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1016\/j.vrih.2023.06.003","volume":"5","author":"M Wang","year":"2023","unstructured":"Wang, M., Meng, M., Liu, J. & Wu, J. Adequate alignment and interaction for cross-modal retrieval. Virtual Real. Intell. Hardw. 5(6), 509\u2013522. https:\/\/doi.org\/10.1016\/j.vrih.2023.06.003 (2023).","journal-title":"Virtual Real. Intell. Hardw."},{"issue":"1","key":"28392_CR24","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.vrih.2023.08.005","volume":"6","author":"M Li","year":"2024","unstructured":"Li, M., Jung, Y., Fulham, M. & Kim, J. Importance-aware 3D volume visualization for medical content-based image retrieval\u2014a preliminary study. Virtual Real. Intell. Hardw. 6(1), 71\u201381. https:\/\/doi.org\/10.1016\/j.vrih.2023.08.005 (2024).","journal-title":"Virtual Real. Intell. Hardw."},{"issue":"3","key":"28392_CR25","doi-asserted-by":"publisher","first-page":"e2269","DOI":"10.1002\/cav.2269","volume":"35","author":"J Cai","year":"2024","unstructured":"Cai, J., Li, F. W. B., Nan, F. & Yang, B. Multi-style cartoonization: Leveraging multiple datasets with generative adversarial networks. Comput. Anim. Virtual Worlds 35(3), e2269. https:\/\/doi.org\/10.1002\/cav.2269 (2024).","journal-title":"Comput. Anim. Virtual Worlds"},{"issue":"3","key":"28392_CR26","doi-asserted-by":"publisher","first-page":"e2275","DOI":"10.1002\/cav.2275","volume":"35","author":"S Feng","year":"2024","unstructured":"Feng, S., Hou, F., Chen, J. & Wang, W. Extracting roads from satellite images via enhancing road feature investigation in learning. Comput. Anim. Virtual Worlds 35(3), e2275. https:\/\/doi.org\/10.1002\/cav.2275 (2024).","journal-title":"Comput. Anim. Virtual Worlds"},{"issue":"4","key":"28392_CR27","doi-asserted-by":"publisher","first-page":"2476","DOI":"10.1109\/TII.2020.3000204","volume":"17","author":"R Ali","year":"2021","unstructured":"Ali, R. et al. Optic disk and cup segmentation through fuzzy broad learning system for glaucoma screening. IEEE Trans. Ind. Inf. 17(4), 2476\u20132487. https:\/\/doi.org\/10.1109\/TII.2020.3000204 (2021).","journal-title":"IEEE Trans. Ind. Inf."},{"key":"28392_CR28","doi-asserted-by":"publisher","first-page":"101654","DOI":"10.1016\/j.media.2020.101654","volume":"61","author":"Y Shen","year":"2020","unstructured":"Shen, Y. et al. Domain-invariant interpretable fundus image quality assessment. Med. Image Anal. 61, 101654. https:\/\/doi.org\/10.1016\/j.media.2020.101654 (2020).","journal-title":"Med. Image Anal."},{"issue":"1","key":"28392_CR29","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/j.media.2015.09.002","volume":"26","author":"B Yin","year":"2015","unstructured":"Yin, B. et al. Jia W Vessel extraction from non-fluorescein fundus images using orientation-aware detector. Med. Image Anal. 26(1), 232\u2013242. https:\/\/doi.org\/10.1016\/j.media.2015.09.002 (2015).","journal-title":"Med. Image Anal."},{"issue":"3","key":"28392_CR30","doi-asserted-by":"publisher","first-page":"5024","DOI":"10.1109\/JIOT.2023.3301969","volume":"11","author":"Y Li","year":"2024","unstructured":"Li, Y. et al. Secure and efficient Bloom-filter-based image search in cloud-based IoT. IEEE Internet Things J. 11(3), 5024\u20135035. https:\/\/doi.org\/10.1109\/JIOT.2023.3301969 (2024).","journal-title":"IEEE Internet Things J."},{"issue":"1","key":"28392_CR31","doi-asserted-by":"publisher","first-page":"851","DOI":"10.12785\/ijcds\/160161","volume":"16","author":"A Salim","year":"2024","unstructured":"Salim, A., Mohammed, K. A., Jasem, F. M. & Sagheer, A. M. Image steganography technique based on Lorenz chaotic system and bloom filter. Int. J. Comput. Digit. Syst. 16(1), 851\u2013859. https:\/\/doi.org\/10.12785\/ijcds\/160161 (2024).","journal-title":"Int. J. Comput. Digit. Syst."},{"key":"28392_CR32","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1162\/tacl_a_00166","volume":"2","author":"P Young","year":"2014","unstructured":"Young, P., Lai, A., Hodosh, M. & Hockenmaier, J. From image descriptions to visual denotations: New similarity metrics for semantic inference over event descriptions. Trans. Assoc. Comput. Linguist. 2, 67\u201378. https:\/\/doi.org\/10.1162\/tacl_a_00166 (2014).","journal-title":"Trans. Assoc. Comput. Linguist."},{"key":"28392_CR33","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1613\/jair.3994","volume":"47","author":"M Hodosh","year":"2013","unstructured":"Hodosh, M., Young, P. & Hockenmaier, J. Framing image description as a ranking task: Data, models and evaluation metrics. J. Artif. Intell. Res. 47, 853\u2013899. https:\/\/doi.org\/10.1613\/jair.3994 (2013).","journal-title":"J. Artif. Intell. Res."},{"key":"28392_CR34","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/s41019-023-00224-9","volume":"8","author":"H Chen","year":"2023","unstructured":"Chen, H. et al. Deep learning-based bloom filter for efficient multi-key membership testing. Data Sci. Eng. 8, 234\u2013246. https:\/\/doi.org\/10.1007\/s41019-023-00224-9 (2023).","journal-title":"Data Sci. Eng."},{"key":"28392_CR35","doi-asserted-by":"publisher","unstructured":"Liu, Y., Li, X., Si, X., Zhang, M., Yuan, K. & Li, P. A neural network and bloom filter-based name search method in named data networking. In 4th International Conference on Neural Networks, Information and Communication Engineering (NNICE), 110\u2013113 (IEEE, Guangzhou, China, 2024). https:\/\/doi.org\/10.1109\/NNICE61279.2024.10499124.","DOI":"10.1109\/NNICE61279.2024.10499124"}],"container-title":["Scientific Reports"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.nature.com\/articles\/s41598-025-28392-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41598-025-28392-w","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41598-025-28392-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T10:35:09Z","timestamp":1777113309000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/s41598-025-28392-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,24]]},"references-count":35,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["28392"],"URL":"https:\/\/doi.org\/10.1038\/s41598-025-28392-w","relation":{},"ISSN":["2045-2322"],"issn-type":[{"value":"2045-2322","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,24]]},"assertion":[{"value":"21 February 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 November 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 December 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"44582"}}