{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T16:40:10Z","timestamp":1745944810413,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642357275"},{"type":"electronic","value":"9783642357282"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-3-642-35728-2_38","type":"book-chapter","created":{"date-parts":[[2013,1,4]],"date-time":"2013-01-04T11:21:25Z","timestamp":1357298485000},"page":"395-406","source":"Crossref","is-referenced-by-count":1,"title":["Distribution-Aware Locality Sensitive Hashing"],"prefix":"10.1007","author":[{"given":"Lei","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Yongdong","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Dongming","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Qi","family":"Tian","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Bentley, J.L.: K-d trees for semidynamic point sets. In: Proc. SCG, pp. 187\u2013197 (1990)","key":"38_CR1","DOI":"10.1145\/98524.98564"},{"doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: International Conference on Management of Data, pp. 47\u201357 (1984)","key":"38_CR2","DOI":"10.1145\/971697.602266"},{"key":"38_CR3","first-page":"217","volume-title":"Lecture Notes in Computer Science","author":"Kevin Beyer","year":"1999","unstructured":"Beyer, K., Goldstein, J., Ramakrishnan, R., Shaft, U.: When is \u201cnearest neighbor\u201d meaningful? In: International Conference on Database Theory, pp. 217\u2013235 (1999)"},{"issue":"3","key":"38_CR4","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/1806907.1806912","volume":"35","author":"Y. Tao","year":"2010","unstructured":"Tao, Y., Yi, K., Sheng, C., Kalnis, P.: Efficient and accurate nearest neighbor and closest pair search in high-dimensional space. ACM TODS\u00a035(3), 20 (2010)","journal-title":"ACM TODS"},{"unstructured":"Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: Proceedings of the International Conference on Very Large Data Bases, pp. 518\u2013529 (1999)","key":"38_CR5"},{"doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proc. STOC, pp. 604\u2013613 (1998)","key":"38_CR6","DOI":"10.1145\/276698.276876"},{"doi-asserted-by":"crossref","unstructured":"Datar, M., Immorlica, N., Indyk, P., Mirrokni, V.S.: Locality-sensitive hashing scheme based on p-stable distributions. In: Proc. SCG, pp. 253\u2013262 (2004)","key":"38_CR7","DOI":"10.1145\/997817.997857"},{"unstructured":"Lv, Q., Josephson, W., Wang, Z., Charikar, M., Li, K.: Multi-probe lsh: efficient indexing for high-dimensional similarity search. In: Proc. VLDB, pp. 950\u2013961 (2007)","key":"38_CR8"},{"unstructured":"Wang, J., Kumar, S., Chang, S.F.: Sequential projection learning for hashing with compact codes. In: Proc. ICML, pp. 1127\u20131134 (2010)","key":"38_CR9"},{"doi-asserted-by":"crossref","unstructured":"Kulis, B., Grauman, K.: Kernelized locality-sensitive hashing for scale image search. In: International Conference on Computer Vision, pp. 2130\u20132137 (2009)","key":"38_CR10","DOI":"10.1109\/ICCV.2009.5459466"},{"unstructured":"Liu, W., Wang, J., Kumar, S., Chang, S.F.: Hashing with graphs. In: ICML, pp. 1\u20138 (2011)","key":"38_CR11"},{"doi-asserted-by":"crossref","unstructured":"Joly, A., Buisson, O.: A posteriori multi-probe locality sensitive hashing. In: ACM MM (2008)","key":"38_CR12","DOI":"10.1145\/1459359.1459388"},{"doi-asserted-by":"crossref","unstructured":"Bawa, M., Condie, T., Ganesan, P.: LSH forest: self-tuning indexes for similarity search. In: Proc. WWW, pp. 651\u2013660 (2005)","key":"38_CR13","DOI":"10.1145\/1060745.1060840"},{"issue":"2","key":"38_CR14","first-page":"337","volume":"19","author":"G. Shakhnarovich","year":"2008","unstructured":"Shakhnarovich, G., Darrell, T., Indyk, P.: Nearest-neighbor methods in learning and vision. IEEE Transactions on Neural Networks\u00a019(2), 337 (2008)","journal-title":"IEEE Transactions on Neural Networks"},{"doi-asserted-by":"crossref","unstructured":"J\u00e9gou, H., Amsaleg, L., Schmid, C., Gros, P.: Query adaptative locality sensitive hashing. In: IEEE Int. Conf. on Acoustics, Speech and Signal Processing, pp. 825\u2013828 (2008)","key":"38_CR15","DOI":"10.1109\/ICASSP.2008.4517737"},{"issue":"11","key":"38_CR16","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1016\/j.patrec.2010.04.004","volume":"31","author":"L. Paulev\u00e9","year":"2010","unstructured":"Paulev\u00e9, L., J\u00e9gou, H., Amsaleg, L.: Locality sensitive hashing: A comparison of hash function types and querying mechanisms. Pattern Recognition Letters\u00a031(11), 1348 (2010)","journal-title":"Pattern Recognition Letters"},{"issue":"7","key":"38_CR17","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1016\/j.ijar.2008.11.006","volume":"50","author":"R. Salakhutdinov","year":"2009","unstructured":"Salakhutdinov, R., Hinton, G.: Semantic hashing. Int. J. Approx Reason.\u00a050(7), 969 (2009)","journal-title":"Int. J. Approx Reason."},{"unstructured":"Weiss, Y., Torralba, A., Fergus, R.: Spectral hashing. In: NIPS, pp. 1753\u20131760 (2008)","key":"38_CR18"},{"unstructured":"Raginsky, M., Lazebnik, S.: Locality-sensitive binary codes from shift-invariant kernels. In: Neural Information Processing Systems, pp. 1509\u20131517 (2009)","key":"38_CR19"},{"issue":"8","key":"38_CR20","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1109\/TMM.2010.2055045","volume":"12","author":"Meng Wang","year":"2010","unstructured":"Wang, M., Yang, K., Hua, X., Zhang, H.: Towards a relevant and diverse search of social images. IEEE Transactions on Multimedia, 829\u2013842 (2010)","journal-title":"IEEE Transactions on Multimedia"},{"doi-asserted-by":"crossref","unstructured":"Liu, W., Wang, J., Ji, R., Jiang, Y.G., Chang, S.F.: Supervised hashing with kernels. In: Proc. CVPR, pp. 2074\u20132081 (2012)","key":"38_CR21","DOI":"10.1109\/CVPR.2012.6247912"},{"issue":"5","key":"38_CR22","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1109\/TPAMI.2008.130","volume":"31","author":"H. Lejsek","year":"2009","unstructured":"Lejsek, H., \u00c1smundsson, F.H., J\u00f3nsson, B.T., Amsaleg, L.: NV-tree: An efficient disk based index for approximate search in very large high-dimensional collections. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a031(5), 869 (2009)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"1","key":"38_CR23","doi-asserted-by":"publisher","first-page":"117","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 Transactions on Pattern Analysis and Machine Intelligence\u00a033(1), 117 (2011)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"2","key":"38_CR24","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1023\/B:VISI.0000029664.99615.94","volume":"60","author":"David G. Lowe","year":"2004","unstructured":"Lowe, D.G.: Distinctive image features from scale-invariant keypoints. International Journal of Computer Vision, 91\u2013110 (2004)","journal-title":"International Journal of Computer Vision"},{"issue":"3","key":"38_CR25","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1023\/A:1011139631724","volume":"42","author":"A. Oliva","year":"2001","unstructured":"Oliva, A., Torralba, A.: Modeling the shape of the scene: A holistic representation of the spatial envelope. International Journal of Computer Vision\u00a042(3), 145 (2001)","journal-title":"International Journal of Computer Vision"},{"doi-asserted-by":"crossref","unstructured":"Silpa-Anan, C., Hartley, R.: Optimised KD-trees for fast image descriptor matching. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 1\u20138 (2008)","key":"38_CR26","DOI":"10.1109\/CVPR.2008.4587638"},{"unstructured":"Muja, M., Lowe, D.G.: Fast approximate nearest neighbors with automatic algorithm configuration. In: Int. Conf. Computer Vision Theory and Applications, pp. 331\u2013340 (2009)","key":"38_CR27"}],"container-title":["Lecture Notes in Computer Science","Advances in Multimedia Modeling"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35728-2_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T16:00:50Z","timestamp":1745942450000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35728-2_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642357275","9783642357282"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35728-2_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}