{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:31:52Z","timestamp":1743013912754,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030306441"},{"type":"electronic","value":"9783030306458"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-30645-8_49","type":"book-chapter","created":{"date-parts":[[2019,9,4]],"date-time":"2019-09-04T08:08:15Z","timestamp":1567584495000},"page":"537-548","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["An Efficient Approximate kNN Graph Method for Diffusion on Image Retrieval"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5526-0449","authenticated-orcid":false,"given":"Federico","family":"Magliani","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1336-6477","authenticated-orcid":false,"given":"Kevin","family":"McGuinness","sequence":"additional","affiliation":[]},{"given":"Eva","family":"Mohedano","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1211-529X","authenticated-orcid":false,"given":"Andrea","family":"Prati","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,2]]},"reference":[{"issue":"Sep","key":"49_CR1","first-page":"1989","volume":"10","author":"J Chen","year":"2009","unstructured":"Chen, J., Fang, H.R., Saad, Y.: Fast approximate kNN graph construction for high dimensional data via recursive Lanczos bisection. J. Mach. Learn. Res. 10(Sep), 1989\u20132012 (2009)","journal-title":"J. Mach. Learn. Res."},{"key":"49_CR2","doi-asserted-by":"crossref","unstructured":"Debatty, T., Michiardi, P., Thonnard, O., Mees, W.: Building K-NN graphs from large text data. In: IEEE International Conference on Big Data, pp. 573\u2013578. IEEE (2014)","DOI":"10.1109\/BigData.2014.7004276"},{"key":"49_CR3","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. ACM (2011)","DOI":"10.1145\/1963405.1963487"},{"key":"49_CR4","doi-asserted-by":"crossref","unstructured":"Douze, M., Szlam, A., Hariharan, B., J\u00e9gou, H.: Low-shot learning with large-scale diffusion. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 3349\u20133358 (2018)","DOI":"10.1109\/CVPR.2018.00353"},{"key":"49_CR5","volume-title":"Matrix Computations","author":"GH Golub","year":"2012","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, vol. 3. JHU press, Baltimore (2012)"},{"issue":"2","key":"49_CR6","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.: End-to-end learning of deep visual representations for image retrieval. Int. J. Comput. Vis. 124(2), 237\u2013254 (2017)","journal-title":"Int. J. Comput. Vis."},{"key":"49_CR7","doi-asserted-by":"crossref","unstructured":"Houle, M.E., Ma, X., Oria, V., Sun, J.: Improving the quality of K-NN graphs for image databases through vector sparsification. In: Proceedings of International Conference on Multimedia Retrieval, p. 89. ACM (2014)","DOI":"10.1145\/2578726.2578730"},{"key":"49_CR8","doi-asserted-by":"crossref","unstructured":"Huiskes, M.J., Lew, M.S.: The MIR flickr retrieval evaluation. In: Proceedings of the 1st ACM International Conference on Multimedia Information Retrieval, pp. 39\u201343. ACM (2008)","DOI":"10.1145\/1460096.1460104"},{"key":"49_CR9","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: 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 (1998)","DOI":"10.1145\/276698.276876"},{"key":"49_CR10","doi-asserted-by":"crossref","unstructured":"Iscen, A., Tolias, G., Avrithis, Y., Chum, O.: Mining on manifolds: metric learning without labels. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 7642\u20137651 (2018)","DOI":"10.1109\/CVPR.2018.00797"},{"key":"49_CR11","doi-asserted-by":"crossref","unstructured":"Iscen, A., Tolias, G., Avrithis, Y.S., Furon, T., Chum, O.: 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. 1, p. 3 (2017)","DOI":"10.1109\/CVPR.2017.105"},{"key":"49_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1007\/978-3-319-46493-0_41","volume-title":"Computer Vision \u2013 ECCV 2016","author":"D Li","year":"2016","unstructured":"Li, D., Hung, W.-C., Huang, J.-B., Wang, S., Ahuja, N., Yang, M.-H.: Unsupervised visual representation learning by graph-based consistent constraints. In: Leibe, B., Matas, J., Sebe, N., Welling, M. (eds.) ECCV 2016. LNCS, vol. 9908, pp. 678\u2013694. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46493-0_41"},{"key":"49_CR13","unstructured":"Lv, Q., Josephson, W., Wang, Z., Charikar, M., Li, K.: 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 (2007)"},{"key":"49_CR14","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-030-03000-1_10","volume-title":"Recent Advances in Computer Vision","author":"F Magliani","year":"2019","unstructured":"Magliani, F., Fontanini, T., Prati, A.: Landmark recognition: from small-scale to large-scale retrieval. In: Hassaballah, M., Hosny, K.M. (eds.) Recent Advances in Computer Vision. SCI, vol. 804, pp. 237\u2013259. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-03000-1_10"},{"key":"49_CR15","doi-asserted-by":"crossref","unstructured":"Magliani, F., Prati, A.: An accurate retrieval through R-MAC+ descriptors for landmark recognition. In: Proceedings of the 12th International Conference on Distributed Smart Cameras, p. 6. ACM (2018)","DOI":"10.1145\/3243394.3243686"},{"key":"49_CR16","doi-asserted-by":"crossref","unstructured":"Park, Y., Park, S., Lee, S.G., Jung, W.: 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 (2013)","DOI":"10.1145\/2487788.2487905"},{"key":"49_CR17","doi-asserted-by":"crossref","unstructured":"Philbin, J., Chum, O., Isard, M., Sivic, J., Zisserman, A.: Object retrieval with large vocabularies and fast spatial matching. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (2007)","DOI":"10.1109\/CVPR.2007.383172"},{"key":"49_CR18","doi-asserted-by":"crossref","unstructured":"Philbin, J., Chum, O., Isard, M., Sivic, J., Zisserman, A.: 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 (2008)","DOI":"10.1109\/CVPR.2008.4587635"},{"key":"49_CR19","doi-asserted-by":"crossref","unstructured":"Sieranoja, S., Fr\u00e4nti, P.: 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 (2018)","DOI":"10.1145\/3220199.3220215"},{"key":"49_CR20","unstructured":"Tolias, G., Sicre, R., J\u00e9gou, H.: Particular object retrieval with integral max-pooling of CNN activations. arXiv preprint arXiv:1511.05879 (2015)"},{"key":"49_CR21","unstructured":"Wang, J., Wang, J., Zeng, G., Tu, Z., Gan, R., Li, S.: Scalable K-NN graph construction for visual descriptors. In: 2012 IEEE Conference on Computer Vision and Pattern Recognition, pp. 1106\u20131113. IEEE (2012)"},{"key":"49_CR22","unstructured":"Wang, J., Shen, H.T., Song, J., Ji, J.: Hashing for similarity search: a survey. arXiv preprint arXiv:1408.2927 (2014)"},{"issue":"4","key":"49_CR23","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1109\/TPAMI.2017.2699960","volume":"40","author":"J Wang","year":"2017","unstructured":"Wang, J., Zhang, T., Sebe, N., Shen, H.T., et al.: A survey on learning to hash. IEEE Trans. Pattern Anal. Mach. Intell. 40(4), 769\u2013790 (2017)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"6","key":"49_CR24","doi-asserted-by":"publisher","first-page":"1551","DOI":"10.1109\/TMM.2018.2883860","volume":"21","author":"J Xu","year":"2019","unstructured":"Xu, J., Wang, C., Qi, C., Shi, C., Xiao, B.: Iterative manifold embedding layer learned by incomplete data for large-scale image retrieval. IEEE Trans. Multimed. 21(6), 1551\u20131562 (2019)","journal-title":"IEEE Trans. Multimed."},{"key":"49_CR25","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1007\/978-3-642-40991-2_42","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"Y-M Zhang","year":"2013","unstructured":"Zhang, Y.-M., Huang, K., Geng, G., Liu, C.-L.: Fast kNN graph construction with locality sensitive hashing. In: Blockeel, H., Kersting, K., Nijssen, S., \u017delezn\u00fd, F. (eds.) ECML PKDD 2013. LNCS (LNAI), vol. 8189, pp. 660\u2013674. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40991-2_42"},{"key":"49_CR26","unstructured":"Zhou, D., Weston, J., Gretton, A., Bousquet, O., Sch\u00f6lkopf, B.: Ranking on data manifolds. In: Advances in Neural Information Processing Systems, pp. 169\u2013176 (2004)"}],"container-title":["Lecture Notes in Computer Science","Image Analysis and Processing \u2013 ICIAP 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30645-8_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T00:08:00Z","timestamp":1693786080000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-30645-8_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030306441","9783030306458"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30645-8_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"2 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIAP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Image Analysis and Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trento","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iciap2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/event.unitn.it\/iciap2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"207","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":"117","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":"57% - 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":"2.6","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":"4","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}