{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:10:29Z","timestamp":1742919029469,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540928911"},{"type":"electronic","value":"9783540928928"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-540-92892-8_36","type":"book-chapter","created":{"date-parts":[[2009,1,6]],"date-time":"2009-01-06T02:03:30Z","timestamp":1231207410000},"page":"344-355","source":"Crossref","is-referenced-by-count":0,"title":["Approximate Retrieval with HiPeR: Application to VA-Hierarchies"],"prefix":"10.1007","author":[{"given":"Nouha","family":"Bouteldja","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valerie","family":"Gouet-Brunet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Scholl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"crossref","unstructured":"Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In: FOCS, pp. 459\u2013468 (2006)","DOI":"10.1109\/FOCS.2006.49"},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"Berchtold, S., B\u00f6hm, C., Kriegel, H.: The pyramid-technique: towards breaking the curse of dimensionality. In: SIGMOD, pp. 142\u2013153 (1998)","DOI":"10.1145\/276305.276318"},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"Bouteldja, N., Gouet-Brunet, V., Scholl, M.: HiPeR: Hierarchical progressive exact retrieval in multi-dimensional spaces. In: SISAP, pp. 25\u201334 (2008)","DOI":"10.1109\/SISAP.2008.19"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Bouteldja, N., Gouet-Brunet, V., Scholl, M.: The many facets of progressive retrieval for CBIR. In: PCM (2008)","DOI":"10.1007\/978-3-540-89796-5_63"},{"key":"36_CR5","volume-title":"The Fourier Transformation and its Applications","author":"R.N. Bracewell","year":"1978","unstructured":"Bracewell, R.N.: The Fourier Transformation and its Applications, 2nd edn. McGraw-Hill, New York (1978)","edition":"2"},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"Cha, G., Chung, C.: The GC-tree: a high-dimensional index structure for similarity search in image databases. IEEE Transactions on Multimedia, 235\u2013247 (2002)","DOI":"10.1109\/TMM.2002.1017736"},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Ferhatosmanoglu, H., Tuncel, E., Agrawal, D., Abbadi, A.E.: Approximate nearest neighbor searching in multimedia databases. In: ICDE, USA, pp. 503\u2013521 (2001)","DOI":"10.1109\/ICDE.2001.914864"},{"key":"36_CR8","unstructured":"Guyon, I., Elisseeff, A.: An introduction to variable and feature selection. In: JMLS, pp. 1157\u20131182 (2003)"},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Lin, K., Jagadish, H.V., Faloutsos, C.: The tv-tree: An index structure for high-dimensional data. VLDB, 517\u2013542 (1994)","DOI":"10.1007\/BF01231606"},{"key":"36_CR10","doi-asserted-by":"crossref","unstructured":"Lowe, D.G.: Distinctive image features from scale-invariant keypoints. IJCV, 91\u2013110 (2004)","DOI":"10.1023\/B:VISI.0000029664.99615.94"},{"key":"36_CR11","doi-asserted-by":"crossref","unstructured":"Patella, M., Ciaccia, P.: The many facets of approximate similarity search. In: SISAP, pp. 10\u201321 (2008)","DOI":"10.1109\/SISAP.2008.18"},{"key":"36_CR12","unstructured":"Samet, H.: Foundations of Multidimensional and Metric Data Structures. The Morgan Kaufmann Series in Computer Graphics (2006)"},{"key":"36_CR13","doi-asserted-by":"crossref","unstructured":"Swain, M.J., Ballard, D.H.: Color indexing. In: IJCV, pp. 11\u201332 (November 1991)","DOI":"10.1007\/BF00130487"},{"key":"36_CR14","doi-asserted-by":"crossref","unstructured":"Urruty, T.: KpyrRec: a recursive multidimensional indexing structure. In: IJPEDS (2007)","DOI":"10.1080\/17445760701536159"},{"key":"36_CR15","doi-asserted-by":"crossref","unstructured":"Weber, R., B\u00f6hm, K.: Trading quality for time with nearest neighbor search. In: EDBT, pp. 21\u201335 (2000)","DOI":"10.1007\/3-540-46439-5_2"},{"key":"36_CR16","unstructured":"Weber, R., Schek, H., Blott, S.: A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: VLDB, pp. 194\u2013205 (1998)"}],"container-title":["Lecture Notes in Computer Science","Advances in Multimedia Modeling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92892-8_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,6]],"date-time":"2025-02-06T19:45:18Z","timestamp":1738871118000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92892-8_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783540928911","9783540928928"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92892-8_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}