{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T02:42:16Z","timestamp":1771296136003,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,1,7]],"date-time":"2021-01-07T00:00:00Z","timestamp":1609977600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,7]],"date-time":"2021-01-07T00:00:00Z","timestamp":1609977600000},"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":["Inf Retrieval J"],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1007\/s10791-020-09388-8","type":"journal-article","created":{"date-parts":[[2021,1,7]],"date-time":"2021-01-07T12:03:36Z","timestamp":1610021016000},"page":"114-136","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["LSH kNN graph for diffusion on image retrieval"],"prefix":"10.1007","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5526-0449","authenticated-orcid":false,"given":"Federico","family":"Magliani","sequence":"first","affiliation":[]},{"given":"Andrea","family":"Prati","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,7]]},"reference":[{"key":"9388_CR1","unstructured":"Arthur, D., & Vassilvitskii, S. (2007). k-means++: The advantages of careful seeding. In Proceedings of the 18th annual ACM-SIAM symposium on Discrete algorithms, pp. 1027\u20131035. Society for Industrial and Applied Mathematics."},{"issue":"Sep","key":"9388_CR2","first-page":"1989","volume":"10","author":"J Chen","year":"2009","unstructured":"Chen, J., Fang, Hr, & Saad, Y. (2009). Fast approximate kNN graph construction for high dimensional data via recursive lanczos bisection. Journal of Machine Learning Research, 10(Sep), 1989\u20132012.","journal-title":"Journal of Machine Learning Research"},{"key":"9388_CR3","doi-asserted-by":"crossref","unstructured":"Chum, O., Philbin, J., Sivic, J., Isard, M., & Zisserman, A. (2007). Total recall: Automatic query expansion with a generative feature model for object retrieval. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 1\u20138. IEEE.","DOI":"10.1109\/ICCV.2007.4408891"},{"key":"9388_CR4","doi-asserted-by":"crossref","unstructured":"Debatty, T., Michiardi, P., Thonnard, O., & Mees, W. (2014). Building k-nn graphs from large text data. In IEEE International Conference on Big Data, pp. 573\u2013578. IEEE.","DOI":"10.1109\/BigData.2014.7004276"},{"key":"9388_CR5","doi-asserted-by":"crossref","unstructured":"Dong, W., Moses, C., & Li, K. (2011). Efficient k-nearest neighbor graph construction for generic similarity measures. In Proceedings of the 20th International Conference on World Wide Web, pp. 577\u2013586. ACM.","DOI":"10.1145\/1963405.1963487"},{"key":"9388_CR6","doi-asserted-by":"crossref","unstructured":"Donoser, M., & Bischof, H. (2013). Diffusion processes for retrieval revisited. In Proceedings of the IEEE conference on computer vision and pattern recognition, pp. 1320\u20131327.","DOI":"10.1109\/CVPR.2013.174"},{"key":"9388_CR7","doi-asserted-by":"crossref","unstructured":"Douze, M., Szlam, A., Hariharan, B., & J\u00e9gou, H. (2018). Low-shot learning with large-scale diffusion. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 3349\u20133358.","DOI":"10.1109\/CVPR.2018.00353"},{"key":"9388_CR8","volume-title":"Matrix computations","author":"GH Golub","year":"2012","unstructured":"Golub, G. H., & Van Loan, C. F. (2012). Matrix computations (Vol. 3). Baltimore: JHU press."},{"issue":"2","key":"9388_CR9","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s11263-017-1016-8","volume":"124","author":"A Gordo","year":"2017","unstructured":"Gordo, A., Almazan, J., Revaud, J., & Larlus, D. (2017). End-to-end learning of deep visual representations for image retrieval. International Journal of Computer Vision, 124(2), 237\u2013254.","journal-title":"International Journal of Computer Vision"},{"key":"9388_CR10","doi-asserted-by":"crossref","unstructured":"Houle, M. E., Ma, X., Oria, V., & Sun, J. (2014). Improving the quality of K-NN graphs for image databases through vector sparsification. In Proceedings of International Conference on Multimedia Retrieval, p.\u00a089. ACM.","DOI":"10.1145\/2578726.2578730"},{"key":"9388_CR11","doi-asserted-by":"crossref","unstructured":"Huiskes, M. J., & Lew, M. S. (2008). The MIR flickr retrieval evaluation. In Proceedings of the 1st ACM international conference on Multimedia Information Retrieval, pp. 39\u201343. ACM.","DOI":"10.1145\/1460096.1460104"},{"key":"9388_CR12","doi-asserted-by":"crossref","unstructured":"Indyk, P., & Motwani, R. (1998). Approximate nearest neighbors: towards removing the curse of dimensionality. In Proceedings of the thirtieth annual ACM symposium on Theory of computing, pp. 604\u2013613. ACM.","DOI":"10.1145\/276698.276876"},{"key":"9388_CR13","doi-asserted-by":"crossref","unstructured":"Iscen, A., Tolias, G., Avrithis, Y., & Chum, O. (2018). Mining on manifolds: Metric learning without labels. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 7642\u20137651.","DOI":"10.1109\/CVPR.2018.00797"},{"key":"9388_CR14","doi-asserted-by":"crossref","unstructured":"Iscen, A., Tolias, G., Avrithis, Y. S., Furon, T., & Chum, O. (2017). Efficient diffusion on region manifolds: Recovering small objects with compact CNN representations. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, vol.\u00a01, p.\u00a03.","DOI":"10.1109\/CVPR.2017.105"},{"issue":"1","key":"9388_CR15","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TPAMI.2010.57","volume":"33","author":"H Jegou","year":"2011","unstructured":"Jegou, H., Douze, M., & Schmid, C. (2011). Product quantization for nearest neighbor search. IEEE Transactions on Pattern Analysis and Machine Intelligence, 33(1), 117\u2013128.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"9388_CR16","doi-asserted-by":"crossref","unstructured":"Li, D., Hung, W. C., Huang, J. B., Wang, S., Ahuja, N., & Yang, M. H. (2016). Unsupervised visual representation learning by graph-based consistent constraints. In European Conference on Computer Vision, pp. 678\u2013694. Springer.","DOI":"10.1007\/978-3-319-46493-0_41"},{"key":"9388_CR17","unstructured":"Lv, Q., Josephson, W., Wang, Z., Charikar, M., & Li, K. (2007). Multi-probe LSH: efficient indexing for high-dimensional similarity search. In Proceedings of the 33rd international conference on Very Large Data Bases, pp. 950\u2013961. VLDB Endowment."},{"key":"9388_CR18","doi-asserted-by":"crossref","unstructured":"Magliani, F., Fontanini, T., & Prati, A. (2018). Efficient nearest neighbors search for large-scale landmark recognition. International Symposium on Visual Computing.","DOI":"10.1007\/978-3-030-03801-4_47"},{"key":"9388_CR19","doi-asserted-by":"crossref","unstructured":"Magliani, F., Fontanini, T., & Prati, A. (2019). Landmark recognition: From small-scale to large-scale retrieval. In Recent Advances in Computer Vision, pp. 237\u2013259. Springer.","DOI":"10.1007\/978-3-030-03000-1_10"},{"key":"9388_CR20","doi-asserted-by":"crossref","unstructured":"Magliani, F., McGuiness, K., Mohedano, E., & Prati, A. (2019). An efficient approximate kNN graph method for diffusion on image retrieval. Proceedings of the 20th International Conference on Image Analysis and Processing.","DOI":"10.1007\/978-3-030-30645-8_49"},{"key":"9388_CR21","doi-asserted-by":"crossref","unstructured":"Magliani, F., & Prati, A. (2018). An accurate retrieval through R-MAC+ descriptors for landmark recognition. In Proceedings of the 12th International Conference on Distributed Smart Cameras, p.\u00a06. ACM.","DOI":"10.1145\/3243394.3243686"},{"key":"9388_CR22","doi-asserted-by":"crossref","unstructured":"Magliani, F., Sani, L., Cagnoni, S., & Prati, A. (2019). Genetic algorithms for the optimization of diffusion parameters in content-based image retrieval. In Proceedings of the 13th International Conference on Distributed Smart Cameras, p.\u00a014. ACM.","DOI":"10.1145\/3349801.3349815"},{"key":"9388_CR23","doi-asserted-by":"crossref","unstructured":"Park, Y., Park, S., Lee, S. g., & Jung, W. (2013). Scalable k-nearest neighbor graph construction based on greedy filtering. In Proceedings of the 22nd International Conference on World Wide Web, pp. 227\u2013228. ACM.","DOI":"10.1145\/2487788.2487905"},{"key":"9388_CR24","doi-asserted-by":"crossref","unstructured":"Pearson, E. S., D\u00a0\u201c\u2019Agostino, R. B., Bowman, K. O. (1977). Tests for departure from normality: Comparison of powers. Biometrika 64(2), 231\u2013246.","DOI":"10.1093\/biomet\/64.2.231"},{"key":"9388_CR25","doi-asserted-by":"crossref","unstructured":"Philbin, J., Chum, O., Isard, M., Sivic, J., & Zisserman, A. (2007). Object retrieval with large vocabularies and fast spatial matching. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition.","DOI":"10.1109\/CVPR.2007.383172"},{"key":"9388_CR26","doi-asserted-by":"crossref","unstructured":"Philbin, J., Chum, O., Isard, M., Sivic, J., & Zisserman, A. (2008). Lost in quantization: Improving particular object retrieval in large scale image databases. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 1\u20138. IEEE.","DOI":"10.1109\/CVPR.2008.4587635"},{"key":"9388_CR27","doi-asserted-by":"crossref","unstructured":"Radenovi\u0107, F., Iscen, A., Tolias, G., Avrithis, Y., & Chum, O. (2018). Revisiting oxford and paris: Large-scale image retrieval benchmarking. In CVPR.","DOI":"10.1109\/CVPR.2018.00598"},{"key":"9388_CR28","doi-asserted-by":"crossref","unstructured":"Sieranoja, S., & Fr\u00e4nti, P. (2018). Fast random pair divisive construction of knn graph using generic distance measures. In Proceedings of the 2018 International Conference on Big Data and Computing, pp. 95\u201398. ACM.","DOI":"10.1145\/3220199.3220215"},{"key":"9388_CR29","unstructured":"Tolias, G., Sicre, R., & J\u00e9gou, H. (2016). Particular object retrieval with integral max-pooling of CNN activations. International Conference on Learning Representations."},{"key":"9388_CR30","doi-asserted-by":"crossref","unstructured":"Wang, J., Wang, J., Zeng, G., Tu, Z., Gan, R., & Li, S. (2012). Scalable k-nn graph construction for visual descriptors. In 2012 IEEE Conference on Computer Vision and Pattern Recognition, pp. 1106\u20131113. IEEE.","DOI":"10.1109\/CVPR.2012.6247790"},{"key":"9388_CR31","doi-asserted-by":"crossref","unstructured":"Xu, J., Wang, C., Qi, C., Shi, C., & Xiao, B. (2018). Iterative manifold embedding layer learned by incomplete data for large-scale image retrieval. IEEE Transactions on Multimedia.","DOI":"10.1109\/TMM.2018.2883860"},{"key":"9388_CR32","first-page":"660","volume-title":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","author":"YM Zhang","year":"2013","unstructured":"Zhang, Y. M., Huang, K., Geng, G., & Liu, C. L. (2013). Fast kNN graph construction with locality sensitive hashing. Joint European Conference on Machine Learning and Knowledge Discovery in Databases (pp. 660\u2013674). Berlin: Springer."},{"key":"9388_CR33","unstructured":"Zhou, D., Weston, J., Gretton, A., Bousquet, O., & Sch\u00f6lkopf, B. (2004). Ranking on data manifolds. In Advances in Neural Information Processing Systems, pp. 169\u2013176."}],"container-title":["Information Retrieval Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-020-09388-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10791-020-09388-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10791-020-09388-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T14:06:26Z","timestamp":1704204386000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10791-020-09388-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,7]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["9388"],"URL":"https:\/\/doi.org\/10.1007\/s10791-020-09388-8","relation":{},"ISSN":["1386-4564","1573-7659"],"issn-type":[{"value":"1386-4564","type":"print"},{"value":"1573-7659","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,7]]},"assertion":[{"value":"7 November 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 December 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}