{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:50:34Z","timestamp":1740099034810,"version":"3.37.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319736020"},{"type":"electronic","value":"9783319736037"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-73603-7_25","type":"book-chapter","created":{"date-parts":[[2018,1,12]],"date-time":"2018-01-12T09:13:02Z","timestamp":1515748382000},"page":"305-316","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning to Index in Large-Scale Datasets"],"prefix":"10.1007","author":[{"given":"Amorntip","family":"Prayoonwong","sequence":"first","affiliation":[]},{"given":"Cheng-Hsien","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Chih-Yi","family":"Chiu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,1,13]]},"reference":[{"key":"25_CR1","unstructured":"Babenko, A., Lempitsky, V.: Efficient indexing of billion-scale datasets of deep descriptors. In: Proceedings of IEEE International Conference on Computer Vision and Pattern Recognition, Las Vegas, USA, pp. 2055\u20132063 (2016)"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Babenko, A., Lempitsky, V.: Tree quantization for large-scale similarity search and classification. In: Proceedings of IEEE International Conference on Computer Vision and Pattern Recognition, Massachusetts, USA, pp. 4240\u20134248 (2015)","DOI":"10.1109\/CVPR.2015.7299052"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Babenko, A., Lempitsky, V.: Additive quantization for extreme vector compression. In: Proceedings of IEEE International Conference on Computer Vision and Pattern Recognition, Ohio, USA, pp. 931\u2013938 (2014)","DOI":"10.1109\/CVPR.2014.124"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Babenko, A., Lempitsky, V.: The inverted multi-index. In: Proceedings of IEEE International Conference on Computer Vision and Pattern Recognition, Rhode Island, USA, pp. 3069\u20133076 (2012)","DOI":"10.1109\/CVPR.2012.6248038"},{"key":"25_CR5","unstructured":"Blott, S., Weber, R.: A simple vector-approximation file for similarity search in high-dimensional vector spaces (1998)"},{"issue":"12","key":"25_CR6","doi-asserted-by":"crossref","first-page":"11259","DOI":"10.3390\/s101211259","volume":"10","author":"Y Chen","year":"2010","unstructured":"Chen, Y., Guan, T., Wang, C.: Approximate nearest neighbor search by residual vector quantization. Sensors 10(12), 11259\u201311273 (2010)","journal-title":"Sensors"},{"issue":"1","key":"25_CR7","first-page":"3:1","volume":"13","author":"CY Chiu","year":"2016","unstructured":"Chiu, C.Y., Liou, Y.C., Prayoonwong, A.: Approximate asymmetric search for binary embedding codes. ACM Trans. Multimed. Comput. Commun. Appl. 13(1), 3:1\u20133:25 (2016)","journal-title":"ACM Trans. Multimed. Comput. Commun. Appl."},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Datar, M., Immorlica, N., Indyk, P., Mirrokni, V.S.: Locality-sensitive hashing scheme based on p-stable distribution. In: Proceedings of Symposium on Computational Geometry, New York, USA, pp. 253\u2013262 (2004)","DOI":"10.1145\/997817.997857"},{"key":"25_CR9","unstructured":"Ge, T., He, K., Ke, Q., Sun, J.: Optimized product quantization for approximate nearest neighbor search. In: Proceedings of IEEE International Conference on Computer Vision and Pattern Recognition, Colorado, USA, pp. 2946\u20132953 (2011)"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Gong, Y., Lazebnik, S.: Iterative quantization: a procrustean approach to learning binary codes. In: Proceedings of IEEE International Conference on Computer Vision and Pattern Recognition, Colorado, USA, pp. 817\u2013824 (2011)","DOI":"10.1109\/CVPR.2011.5995432"},{"issue":"1","key":"25_CR11","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1109\/TPAMI.2013.101","volume":"36","author":"A Gordo","year":"2014","unstructured":"Gordo, A., Perronnin, F., Gong, Y., Lazebnik, S.: Asymmetric distances for binary embeddings. IEEE Trans. Pattern Anal. Mach. Intell. 36(1), 33\u201347 (2014)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"He, K., Wen, F., Sun, J.: K-means hashing: an affinity-preserving quantization method for learning binary compact codes. In: Proceedings of IEEE International Conference on Computer Vision and Pattern Recognition, Portland, USA (2013)","DOI":"10.1109\/CVPR.2013.378"},{"issue":"1","key":"25_CR13","doi-asserted-by":"crossref","first-page":"2481","DOI":"10.1109\/TPAMI.2010.57","volume":"33","author":"H J\u00e9gou","year":"2011","unstructured":"J\u00e9gou, H., Douze, M., Schmid, C.: Product quantization for nearest neighbor search. IEEE Trans. Pattern Anal. Mach. Intell. 33(1), 2481\u20132488 (2011)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"J\u00e9gou, H., Tavenard, R., Douze, M., Amsaleg, L.: Searching in one billion vectors: re-rank with source coding. In: Proceedings of IEEE International Conference on Acoustics, Speech and Signal Processing, Prague, Czech Republic, pp. 861\u2013864 (2011)","DOI":"10.1109\/ICASSP.2011.5946540"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Kalantidis, Y., Avrithis, Y.: Locally optimized product quantization for approximate nearest neighbor search. In: Proceedings of IEEE International Conference on Computer Vision and Pattern Recognition, Ohio, USA, pp. 2329\u20132336 (2014)","DOI":"10.1109\/CVPR.2014.298"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Kulis, B., Grauman, K.: Kernelized locality-sensitive hashing for scalable image search. In: Proceedings of IEEE International Conference on Computer Vision, Kyoto, Japan, pp. 2130\u20132137 (2009)","DOI":"10.1109\/ICCV.2009.5459466"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Lejsek, H., J\u00f3nsson, B.\u00de., Amsaleg, L.: NV-Tree: nearest neighbors at the billion scale. In: Proceedings of ACM International Conference on Multimedia Retrieval, Trento, Italy (2011)","DOI":"10.1145\/1991996.1992050"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Liu, X., Deng, C., Mu, Y., Li, Z.: Boosting complementary hash tables for fast nearest neighbor search. In: Proceedings of AAAI Conference on Artificial Intelligence, San Francisco, USA, pp. 4183\u20134189 (2017)","DOI":"10.1609\/aaai.v31i1.11204"},{"issue":"2","key":"25_CR19","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1023\/B:VISI.0000029664.99615.94","volume":"60","author":"DG Lowe","year":"2004","unstructured":"Lowe, D.G.: Distinctive image features from scale-invariant keypoints. Int. J. Comput. Vis. 60(2), 91\u2013110 (2004)","journal-title":"Int. J. Comput. Vis."},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"Matsui, Y., Yamasaki, T., Aizawa, K.: PQTable: fast exact asymmetric distance neighbor search for product quantization using hash tables. In: Proceedings of IEEE International Conference on Computer Vision, Santiago, Chile, pp. 1940\u20131948 (2015)","DOI":"10.1109\/ICCV.2015.225"},{"issue":"11","key":"25_CR21","doi-asserted-by":"crossref","first-page":"2227","DOI":"10.1109\/TPAMI.2014.2321376","volume":"36","author":"M Muja","year":"2014","unstructured":"Muja, M., Lowe, D.G.: Scalable nearest neighbor algorithms for dimensional data. IEEE Trans. Pattern Anal. Mach. Intell. 36(11), 2227\u20132240 (2014)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"25_CR22","doi-asserted-by":"crossref","unstructured":"Nist\u00e9r, D., Stew\u00e9nius, H.: Scalable recognition with a vocabulary tree. In: Proceedings of IEEE International Conference on Computer Vision and Pattern Recognition, New York, USA (2006)","DOI":"10.1109\/CVPR.2006.264"},{"key":"25_CR23","doi-asserted-by":"crossref","unstructured":"Norouze, M., Fleet, D.: Cartesian k-means. In: Proceedings of IEEE International Conference on Computer Vision and Pattern Recognition, Portland, USA (2013)","DOI":"10.1109\/CVPR.2013.388"},{"key":"25_CR24","doi-asserted-by":"crossref","unstructured":"Silpa-Anan, C., Hartley, R.: Optimized KD-trees for fast image descriptor matching. In: Proceedings of IEEE International Conference on Computer Vision and Pattern Recognition, Anchorage, USA (2008)","DOI":"10.1109\/CVPR.2008.4587638"},{"key":"25_CR25","doi-asserted-by":"crossref","unstructured":"Wang, J., Li, S.: Query-driven iterated neighborhood graph search for large scale indexing. In: Proceedings of ACM International Conference on Multimedia, New York, USA, pp. 179\u2013188 (2012)","DOI":"10.1145\/2393347.2393378"},{"issue":"3","key":"25_CR26","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1109\/MMUL.2013.65","volume":"21","author":"B Wei","year":"2014","unstructured":"Wei, B., Guan, T., Yu, J.: Projected residual vector quantization for ANN search. IEEE Multimed. 21(3), 41\u201351 (2014)","journal-title":"IEEE Multimed."},{"key":"25_CR27","unstructured":"Weiss, Y., Torralba, A., Fergus, R.: Spectral hashing. In: Proceedings of Advances in Neural Information Processing Systems, vol. 21, pp. 1753\u20131760 (2009)"},{"key":"25_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-3-642-33715-4_25","volume-title":"Computer Vision \u2013 ECCV 2012","author":"Y Weiss","year":"2012","unstructured":"Weiss, Y., Fergus, R., Torralba, A.: Multidimensional spectral hashing. In: Fitzgibbon, A., Lazebnik, S., Perona, P., Sato, Y., Schmid, C. (eds.) ECCV 2012. LNCS, vol. 7576, pp. 340\u2013353. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33715-4_25"}],"container-title":["Lecture Notes in Computer Science","MultiMedia Modeling"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-73603-7_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T10:11:26Z","timestamp":1660299086000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-73603-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319736020","9783319736037"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-73603-7_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}