{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:27:46Z","timestamp":1740122866879,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,1,16]],"date-time":"2016-01-16T00:00:00Z","timestamp":1452902400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61271394"],"award-info":[{"award-number":["61271394"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Multimed Tools Appl"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s11042-015-3217-x","type":"journal-article","created":{"date-parts":[[2016,1,16]],"date-time":"2016-01-16T04:25:00Z","timestamp":1452918300000},"page":"2441-2466","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Accelerated Manhattan hashing via bit-remapping with location information"],"prefix":"10.1007","volume":"76","author":[{"given":"Wenshuo","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guiguang","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zijia","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jisheng","family":"Pei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,16]]},"reference":[{"key":"3217_CR1","doi-asserted-by":"crossref","unstructured":"Andoni A, Indyk P (2008) Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In: Communications of the ACM - 50th anniversary issue: 1958\u20132008, vol 51","DOI":"10.1145\/1327452.1327494"},{"key":"3217_CR2","doi-asserted-by":"crossref","unstructured":"Baluja S, Covell M (2008) Learning to hash: forgiving hash functions and applications. Data Min Knowl Disc 17(3)","DOI":"10.1007\/s10618-008-0096-z"},{"key":"3217_CR3","doi-asserted-by":"crossref","unstructured":"Cheng W, Jin X, Sun J-T, Lin X, Zhang X, Wang W (2014) Searching dimension incomplete databases. Knowl Data Eng 26(3)","DOI":"10.1109\/TKDE.2013.14"},{"key":"3217_CR4","doi-asserted-by":"crossref","unstructured":"Ding G, Guo Y, Zhou J (2014) Collective matrix factorization hashing for multimodal data. In: Computer vision and pattern recognition","DOI":"10.1109\/CVPR.2014.267"},{"key":"3217_CR5","doi-asserted-by":"crossref","unstructured":"Friedman JH, Bentley JL, Finkel RA (1977) An algorithm for finding best matches in logarithmic expected time. ACM Trans Math Softw 3(3)","DOI":"10.1145\/355744.355745"},{"key":"3217_CR6","unstructured":"Gionis A, Indyk P, Motwani R, et al. (1999) Similarity search in high dimensions via hashing. In: Very large data bases, vol 99"},{"key":"3217_CR7","doi-asserted-by":"crossref","unstructured":"Gong Y, Lazebnik S (2011) Iterative quantization: a procrustean approach to learning binary codes. In: Computer vision and pattern recognition","DOI":"10.1109\/CVPR.2011.5995432"},{"key":"3217_CR8","doi-asserted-by":"crossref","unstructured":"Guttman A (1984) R-trees: a dynamic index structure for spatial searching 14(2)","DOI":"10.1145\/971697.602266"},{"key":"3217_CR9","doi-asserted-by":"crossref","unstructured":"Indyk P, Motwani R (1998) Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of the 13th annual ACM symposium on theory of computing","DOI":"10.1145\/276698.276876"},{"key":"3217_CR10","doi-asserted-by":"crossref","unstructured":"Jegou H, Douze M, Schmid C (2008) Hamming embedding and weak geometric consistency for large scale image search. In: European conference on computer vision","DOI":"10.1007\/978-3-540-88682-2_24"},{"key":"3217_CR11","doi-asserted-by":"crossref","unstructured":"J\u00e9gou H, Douze M, Schmid C (2010) Improving bag-of-features for large scale image search. Int J Comput Vis 87(3)","DOI":"10.1007\/s11263-009-0285-2"},{"key":"3217_CR12","doi-asserted-by":"crossref","unstructured":"Jegou H, Douze M, Schmid C (2011) Product quantization for nearest neighbor search. Pattern Analysis and Machine Intelligence 33(1)","DOI":"10.1109\/TPAMI.2010.57"},{"key":"3217_CR13","unstructured":"Jolliffe I (2002) Principal component analysis"},{"key":"3217_CR14","unstructured":"Kong W, Li W-J (2012) Double-bit quantization for hashing. In: Association for the advancement of artificial intelligence"},{"key":"3217_CR15","doi-asserted-by":"crossref","unstructured":"Kong W, Li W-J, Guo M (2012) Manhattan hashing for large-scale image retrieval. In: ACM special interest group on information retrieval","DOI":"10.1145\/2348283.2348293"},{"key":"3217_CR16","doi-asserted-by":"crossref","unstructured":"Lee Y, Heo J-P, Yoon S-E (2014) Quadra-embedding: binary code embedding with low quantization error. Comput Vis Image Underst 125","DOI":"10.1016\/j.cviu.2014.04.007"},{"key":"3217_CR17","doi-asserted-by":"crossref","unstructured":"Lin Z, Ding G, Hu M (2014) Image auto-annotation via tag-dependent random search over range-constrained visual neighbours. Multimedia tools and applications","DOI":"10.1007\/s11042-013-1811-3"},{"key":"3217_CR18","doi-asserted-by":"crossref","unstructured":"Lin Z, Ding G, Hu M, Wang J (2015) Semantics-preserving hashing for cross-view retrieval. In: Computer vision and pattern recognition","DOI":"10.1109\/CVPR.2015.7299011"},{"key":"3217_CR19","unstructured":"Liu W, Wang J, Kumar S, Chang S-F (2011) Hashing with graphs. In: Proceedings of the 28th international conference on machine learning"},{"key":"3217_CR20","doi-asserted-by":"crossref","unstructured":"Moran S, Lavrenko V, Osborne M (2013) Neighbourhood preserving quantisation for lsh. In: Proceedings of the 36th international ACM SIGIR conference on research and development in information retrieval","DOI":"10.1145\/2484028.2484162"},{"key":"3217_CR21","unstructured":"Moran S, Lavrenko V, Osborne M (2013) Variable bit quantisation for lsh. In: Association for computational linguistics"},{"key":"3217_CR22","doi-asserted-by":"crossref","unstructured":"Mu Y, Shen J, Yan S (2010) Weakly-supervised hashing in kernel space. In: Computer vision and pattern recognition","DOI":"10.1109\/CVPR.2010.5540024"},{"key":"3217_CR23","unstructured":"Norouzi M, Blei DM (2011) Minimal loss hashing for compact binary codes. In: International conference on machine learning"},{"key":"3217_CR24","unstructured":"Raginsky M, Lazebnik S (2009) Locality-sensitive binary codes from shift-invariant kernels. In: Advances in neural information processing systems"},{"key":"3217_CR25","doi-asserted-by":"crossref","unstructured":"Song J, Yang Y, Huang Z, Shen HT, Hong R (2011) Multiple feature hashing for real-time large scale near-duplicate video retrieval. In: Proceedings of the 19th ACM international conference on multimedia","DOI":"10.1145\/2072298.2072354"},{"key":"3217_CR26","doi-asserted-by":"crossref","unstructured":"Uhlmann JK (1991) Satisfying general proximity\/similarity queries with metric trees. Inf Process Lett 40(4)","DOI":"10.1016\/0020-0190(91)90074-R"},{"key":"3217_CR27","doi-asserted-by":"crossref","unstructured":"Wang J, Kumar S, Chang SF (2010) Semi-supervised hashing for scalable image retrieval. In: Computer vision and pattern recognition","DOI":"10.1109\/CVPR.2010.5539994"},{"key":"3217_CR28","doi-asserted-by":"crossref","unstructured":"Wang X, Jin X, Chen M-E, Zhang K, Shen D (2012) Topic mining over asynchronous text sequences. Knowl Data Eng 24(1)","DOI":"10.1109\/TKDE.2010.229"},{"key":"3217_CR29","unstructured":"Weiss Y, Torralba A, Fergus R (2009) Spectral hashing. In: Advances in neural information processing systems"},{"key":"3217_CR30","doi-asserted-by":"crossref","unstructured":"Wold S, Esbensen K, Geladi P (1987) Principal component analysis. Chemom Intell Lab Syst 2(1)","DOI":"10.1016\/0169-7439(87)80084-9"},{"key":"3217_CR31","doi-asserted-by":"crossref","unstructured":"Yu Z, Wu F, Yang Y, Tian Q, Luo J, Zhuang Y (2014) Discriminative coupled dictionary hashing for fast cross-media retrieval. In: Proceedings of the 37th international ACM SIGIR conference on research and development in information retrieval","DOI":"10.1145\/2600428.2609563"},{"key":"3217_CR32","doi-asserted-by":"crossref","unstructured":"Zhou J, Ding G, Guo Y (2014) Latent semantic sparse hashing for cross-modal similarity search. In: Proceedings of the 37th international ACM SIGIR conference on research and development in information retrieval","DOI":"10.1145\/2600428.2609610"},{"key":"3217_CR33","doi-asserted-by":"crossref","unstructured":"Zhu X, Huang Z, Cheng H, Cui J, Shen HT (2013) Sparse hashing for fast multimedia search. ACM Trans Inf Syst 31(2)","DOI":"10.1145\/2457465.2457469"},{"key":"3217_CR34","doi-asserted-by":"crossref","unstructured":"Zhu X, Huang Z, Shen HT, Zhao X (2013) Linear cross-modal hashing for efficient multimedia search. In: Proceedings of the 21st ACM international conference on multimedia","DOI":"10.1145\/2502081.2502107"},{"key":"3217_CR35","doi-asserted-by":"crossref","unstructured":"Zhu X, Zhang L, Huang Z (2014) A sparse embedding and least variance encoding approach to hashing. Image Processing 23(9)","DOI":"10.1109\/TIP.2014.2332764"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11042-015-3217-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-015-3217-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-015-3217-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-015-3217-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,3]],"date-time":"2019-09-03T15:07:55Z","timestamp":1567523275000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11042-015-3217-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,16]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["3217"],"URL":"https:\/\/doi.org\/10.1007\/s11042-015-3217-x","relation":{},"ISSN":["1380-7501","1573-7721"],"issn-type":[{"type":"print","value":"1380-7501"},{"type":"electronic","value":"1573-7721"}],"subject":[],"published":{"date-parts":[[2016,1,16]]}}}