{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T19:48:37Z","timestamp":1760384917253},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540929567"},{"type":"electronic","value":"9783540929574"}],"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-92957-4_33","type":"book-chapter","created":{"date-parts":[[2009,1,8]],"date-time":"2009-01-08T17:28:06Z","timestamp":1231435686000},"page":"374-385","source":"Crossref","is-referenced-by-count":19,"title":["Principal Component Hashing: An Accelerated Approximate Nearest Neighbor Search"],"prefix":"10.1007","author":[{"given":"Yusuke","family":"Matsushita","sequence":"first","affiliation":[]},{"given":"Toshikazu","family":"Wada","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"33_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","volume":"13","author":"T.M. Cover","year":"1967","unstructured":"Cover, T.M., Hart, P.E.: Nearest neighbor pattern classification. IEEE Transactions on Information Theory\u00a0IT-13(1), 21\u201327 (1967)","journal-title":"IEEE Transactions on Information Theory"},{"key":"33_CR2","unstructured":"Zhang, Z.: Iterative Point Matching for Registration of Free-Form Curves and Surfaces. Tech. Report INRIA, No 1658 (1992)"},{"issue":"9","key":"33_CR3","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J.L. Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM\u00a018(9), 509\u2013517 (1975)","journal-title":"Commun. ACM"},{"key":"33_CR4","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45","author":"S. Arya","year":"1998","unstructured":"Arya, S., Mount, D.M., Netanyahu, N.S., Silverman, R., Wu, A.Y.: An optimal algorithm for approximate nearest neighbor searching. Journal of the ACM\u00a045, 891\u2013923 (1998)","journal-title":"Journal of the ACM"},{"key":"33_CR5","unstructured":"ANN: Library for Approximate Nearest Neighbor Searching, \n                    \n                      http:\/\/www.cs.umd.edu\/~mount\/ANN\/"},{"key":"33_CR6","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. In: Proceedings of the 30th ACM Symposium on Theory of Computing (STOC 1998), pp. 604\u2013613 (May 1998)","DOI":"10.1145\/276698.276876"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"Datar, M., Indyk, P., Immorlica, N., Mirrokni, V.: Locality-Sensitive Hashing Scheme Based on p-Stable Distributions. In: Proceedings of the 20th Annual Symposium on Computational Geometry (SCG 2004) (June 2004)","DOI":"10.1145\/997817.997857"},{"key":"33_CR8","doi-asserted-by":"crossref","unstructured":"Andoni, A., Indyk, P.: Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions. In: Proc. of FOCS 2006, pp. 459\u2013468 (2006)","DOI":"10.1109\/FOCS.2006.49"},{"key":"33_CR9","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0167-8655(86)90013-9","volume":"4","author":"R. Vidal","year":"1986","unstructured":"Vidal, R.: An algorithm for finding nearest neighbor in (approximately) constant average time. Pattern Recognition Letters\u00a04, 145\u2013158 (1986)","journal-title":"Pattern Recognition Letters"},{"key":"33_CR10","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0167-8655(94)90095-7","volume":"15","author":"L. Mico","year":"1994","unstructured":"Mico, L., Oncina, J., Vidal, E.: A new version of the nearest-neighbor approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirements. Pattern Recognition Letters\u00a015, 9\u201317 (1994)","journal-title":"Pattern Recognition Letters"},{"key":"33_CR11","unstructured":"Brin, S.: Near neighbor search in large metric spaces. In: Proc. of 21st Conf. on very large database (VLDB), Zurich, Switzerland, pp. 574\u2013584 (1995)"},{"key":"33_CR12","unstructured":"Yianilos, P.Y.: Data structures and algorithms for nearest neighbor search in general metric spaces. In: Proc. of the Fourth Annual ACM-SIAM Symp. on Discrete Algorithms, Austin, TX, pp. 311\u2013321 (1993)"}],"container-title":["Lecture Notes in Computer Science","Advances in Image and Video Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92957-4_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T21:29:19Z","timestamp":1551734959000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92957-4_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783540929567","9783540929574"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92957-4_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}