{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:50:40Z","timestamp":1725583840040},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642208409"},{"type":"electronic","value":"9783642208416"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-20841-6_14","type":"book-chapter","created":{"date-parts":[[2011,5,27]],"date-time":"2011-05-27T08:12:54Z","timestamp":1306483974000},"page":"160-170","source":"Crossref","is-referenced-by-count":3,"title":["Improved Spectral Hashing"],"prefix":"10.1007","author":[{"given":"Sanparith","family":"Marukatat","sequence":"first","affiliation":[]},{"given":"Wasin","family":"Sinthupinyo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","volume-title":"Nearest Neighbor Methods in Learning and Vision: Theory and Practice","author":"A. Andoni","year":"2006","unstructured":"Andoni, A., Datar, M., Immorlica, N., Indyk, P., Mirrokni, V.: Locality-Sensitive Hashing Scheme Based on p-Stable Distributions. In: Nearest Neighbor Methods in Learning and Vision: Theory and Practice. MIT Press, Cambridge (2006)"},{"key":"14_CR2","unstructured":"Beis, J.S., Lowe, D.G.: Shape indexing using approximating nearest-neighbor search in high-dimensional spaces. In: The International Conference on Computer Vision (CVPR) (1997)"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Beygelzimer, A., Kakade, S., Langford, J.: Cover trees for nearest neighbor. In: Proceedings of the International Conference on Machine Learning (ICML) (2006)","DOI":"10.1145\/1143844.1143857"},{"key":"14_CR4","unstructured":"Chen, Y.-S., Hung, Y.-P., Fuh, C.-S.: Fast algorithm for nearest neighbor search based on a lower bound tree. In: ICCV, pp. 446\u2013453 (2001)"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Dasgupta, S., Freund, Y.: Random projection trees and low dimensional manifolds. In: Annual ACM Symposium on Theory of Computing (STOC), pp. 537\u2013546 (2008)","DOI":"10.1145\/1374376.1374452"},{"key":"14_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-8643-8","volume-title":"Non-Uniform Random Variate Generation","author":"L. Devroye","year":"1986","unstructured":"Devroye, L.: Non-Uniform Random Variate Generation. Springer-Verlag New York Inc., New York (1986)"},{"issue":"3","key":"14_CR7","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/355744.355745","volume":"3","author":"J. Freidman","year":"1977","unstructured":"Freidman, J., Bentley, J., Finkel, A.: An algorithm for finding best matches in logarithmic expected time. ACM Transactions on Mathematical Software\u00a03(3), 209\u2013226 (1977)","journal-title":"ACM Transactions on Mathematical Software"},{"key":"14_CR8","unstructured":"Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: VLDB 1999, Proceedings of 25th International Conference on Very Large Data Bases (1999)"},{"key":"14_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/11559887_9","volume-title":"Deterministic and Statistical Methods in Machine Learning","author":"J. Goldstein","year":"2005","unstructured":"Goldstein, J., Plat, J.C., Burges, C.J.C.: Redundant bit vectors for quickly searching high-dimensional regions. In: Winkler, J.R., Niranjan, M., Lawrence, N.D. (eds.) Deterministic and Statistical Methods in Machine Learning. LNCS (LNAI), vol.\u00a03635, pp. 137\u2013158. Springer, Heidelberg (2005)"},{"key":"14_CR10","volume-title":"Digital Image Processing","author":"R.C. Gonzalez","year":"2002","unstructured":"Gonzalez, R.C., Woods, R.E.: Digital Image Processing. Prentice-Hall, N.J. (2002)"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: Towards removing the curse of dimensionality. In: STOC, pp. 604\u2013613 (1998)","DOI":"10.1145\/276698.276876"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/978-3-540-88682-2_24","volume-title":"Computer Vision \u2013 ECCV 2008","author":"H. Jegou","year":"2008","unstructured":"Jegou, H., Douze, M., Schmid, C.: Hamming embedding and weak geometric consistency for large scale image search. In: Forsyth, D., Torr, P., Zisserman, A. (eds.) ECCV 2008, Part I. LNCS, vol.\u00a05302, pp. 304\u2013317. Springer, Heidelberg (2008)"},{"issue":"2","key":"14_CR13","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1023\/B:VISI.0000029664.99615.94","volume":"60","author":"D.G. Lowe","year":"2004","unstructured":"Lowe, D.G.: Distinctive image features from scale-invariant keypoints. International Journal on Computer Vision (IJCV)\u00a060(2), 91\u2013110 (2004)","journal-title":"International Journal on Computer Vision (IJCV)"},{"issue":"9","key":"14_CR14","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1109\/34.955110","volume":"23","author":"J. McNames","year":"2001","unstructured":"McNames, J.: A fast nearest-neighbor algorithm based on a principal axis search tree. IEEE Transactions Pattern Analysis and Machine Intelligence\u00a023(9), 964\u2013976 (2001)","journal-title":"IEEE Transactions Pattern Analysis and Machine Intelligence"},{"key":"14_CR15","unstructured":"Salakhutdinov, R.R., Hinton, G.E.: Learning a nonlinear embedding by preserving class neighborhood structure. In: AI and Statistics (2007)"},{"key":"14_CR16","unstructured":"Salakhutdinov, R.R., Hinton, G.E.: Semantic hashing. In: SIGIR Workshop on Information Retrieval and Applications of Graphical Models (2007)"},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"1299","DOI":"10.1162\/089976698300017467","volume":"10","author":"B. Scholkopf","year":"1998","unstructured":"Scholkopf, B., Smola, A., Muller, K.-R.: Nonlinear component analysis as a kernel eigenvalue problem. Neural Computation\u00a010, 1299\u20131319 (1998)","journal-title":"Neural Computation"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Shakhanarovich, G., Viola, P., Darrell, T.: Fast pose estimation with parameter sensitive hashing. In: International Conference on Computer Vision (ICCV) (2003)","DOI":"10.1109\/ICCV.2003.1238424"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Silpa-Anan, C., Hartley, R.: Optimised kd-trees for fast image descriptor matching. In: The International Conference on Computer Vision (CVPR) (2008)","DOI":"10.1109\/CVPR.2008.4587638"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Torralba, A., Fergus, R., Weiss, Y.: Small codes and large databases for recognition. In: The International Conference on Computer Vision (CVPR) (2008)","DOI":"10.1109\/CVPR.2008.4587633"},{"key":"14_CR21","unstructured":"Weiss, Y., Torralba, A., Fergus, R.: Spectral hashing. In: Advance in Neural Information Processings (NIPS) (2008)"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20841-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T21:27:17Z","timestamp":1553722037000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20841-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642208409","9783642208416"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20841-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}