{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:27:03Z","timestamp":1740122823618,"version":"3.37.3"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"17","license":[{"start":{"date-parts":[[2019,1,7]],"date-time":"2019-01-07T00:00:00Z","timestamp":1546819200000},"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":"publisher","award":["61472298"],"award-info":[{"award-number":["61472298"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61672408"],"award-info":[{"award-number":["61672408"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61702403"],"award-info":[{"award-number":["61702403"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1135002"],"award-info":[{"award-number":["U1135002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"China 111 Project","award":["B16037"],"award-info":[{"award-number":["B16037"]}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2018M633473"],"award-info":[{"award-number":["2018M633473"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Natural Science Basic Research Plan in Shaanxi Province of China","award":["2015JQ6227"],"award-info":[{"award-number":["2015JQ6227"]}]},{"name":"the Fundamental Research Funds for the Central Universities","award":["JB170308"],"award-info":[{"award-number":["JB170308"]}]},{"name":"the Fundamental Research Funds for the Central Universities"},{"name":"the Innovation Fund of Xidian University"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Multimed Tools Appl"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s11042-018-6987-0","type":"journal-article","created":{"date-parts":[[2019,1,8]],"date-time":"2019-01-08T12:28:29Z","timestamp":1546950509000},"page":"24407-24429","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An efficient LSH indexing on discriminative short codes for high-dimensional nearest neighbors"],"prefix":"10.1007","volume":"78","author":[{"given":"Feng","family":"Xiaokang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5569-0780","authenticated-orcid":false,"given":"Cui","family":"Jiangtao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Hui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liu","family":"Yingfan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,1,7]]},"reference":[{"key":"6987_CR1","doi-asserted-by":"crossref","unstructured":"Babenko A, Lempitsky V (2012) The inverted multi-index. In: CVPR. IEEE, pp 3069\u20133076","DOI":"10.1109\/CVPR.2012.6248038"},{"issue":"2","key":"6987_CR2","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1145\/357775.357776","volume":"25","author":"C B\u00f6hm","year":"2000","unstructured":"B\u00f6hm C (2000) A cost model for query processing in high dimensional data spaces. ACM Trans Database Syst 25(2):129\u2013178","journal-title":"ACM Trans Database Syst"},{"key":"6987_CR3","doi-asserted-by":"crossref","unstructured":"Datar M, Immorlica N, Indyk P, Mirrokni VS (2004) Locality-sensitive hashing scheme based on p-stable distributions. In: SoCG, pp 253\u2013262","DOI":"10.1145\/997817.997857"},{"key":"6987_CR4","doi-asserted-by":"crossref","unstructured":"Faloutsos C, Roseman S (1989) Fractals for secondary key retrieval. In: PODS, pp 247\u2013252","DOI":"10.1145\/73721.73746"},{"issue":"2","key":"6987_CR5","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V Gaede","year":"1998","unstructured":"Gaede V, G\u00fcnther O (1998) Multidimensional access methods. ACM Comput Surv 30(2):170\u2013231","journal-title":"ACM Comput Surv"},{"key":"6987_CR6","doi-asserted-by":"crossref","unstructured":"Gan J, Feng J, Fang Q, Ng W (2012) Locality sensitive hashing scheme based on dynamic collision counting. In: SIGMOD, pp 541\u2013552","DOI":"10.1145\/2213836.2213898"},{"key":"6987_CR7","unstructured":"Gionis A, Indyk P, Motwani R (1999) Similarity search in high dimensions via hashing. In: VLDB, pp 518\u2013529"},{"key":"6987_CR8","doi-asserted-by":"crossref","unstructured":"Gong Y, Lazebnik S (2011) Iterative quantization: a procrustean approach to learning binary codes. In: CVPR. pp 817\u2013824","DOI":"10.1109\/CVPR.2011.5995432"},{"key":"6987_CR9","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.neucom.2017.12.005","volume":"282","author":"S He","year":"2018","unstructured":"He S, Ye G, Hu M, Yang Y, Shen F, Shen HT, Li X (2018) Learning binary codes with local and inner data structure. Neurocomputing 282:32\u201341","journal-title":"Neurocomputing"},{"issue":"1","key":"6987_CR10","first-page":"1","volume":"9","author":"Q Huang","year":"2015","unstructured":"Huang Q, Feng J, Zhang Y, Fang Q, Ng W (2015) Query-aware locality-sensitive hashing for approximate nearest neighbor search. PVLDB 9(1):1\u201312","journal-title":"PVLDB"},{"key":"6987_CR11","doi-asserted-by":"crossref","unstructured":"Indyk P, Motwani R (1998) Approximate nearest neighbors: towards removing the curse of dimensionality. In: STOC, pp 604\u2013613","DOI":"10.1145\/276698.276876"},{"issue":"1","key":"6987_CR12","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TPAMI.2010.57","volume":"33","author":"H Jegou","year":"2011","unstructured":"Jegou H, Douze M, Schmid C (2011) Product quantization for nearest neighbor search. IEEE Trans Pattern Anal Mach Intell 33(1):117\u2013128","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"6987_CR13","doi-asserted-by":"crossref","unstructured":"Joly A, Buisson O (2008) A posteriori multi-probe locality sensitive hashing. In: ACM multimedia, pp 209\u2013218","DOI":"10.1145\/1459359.1459388"},{"key":"6987_CR14","doi-asserted-by":"crossref","unstructured":"Kalantidis Y, Avrithis YS (2014) Locally optimized product quantization for approximate nearest neighbor search. In: CVPR, pp 2329\u20132336","DOI":"10.1109\/CVPR.2014.298"},{"issue":"10","key":"6987_CR15","doi-asserted-by":"publisher","first-page":"2100","DOI":"10.1109\/TKDE.2017.2728531","volume":"29","author":"Z Li","year":"2017","unstructured":"Li Z, Nie F, Chang X, Yang Y (2017) Beyond trace ratio: weighted harmonic mean of trace ratios for multiclass discriminant analysis. IEEE Trans Knowl Data Eng 29(10):2100\u20132110","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"9","key":"6987_CR16","first-page":"745","volume":"7","author":"Y Liu","year":"2014","unstructured":"Liu Y, Cui J, Huang Z, Li H, Shen HT (2014) SK-LSH: An efficient index structure for approximate nearest neighbor search. PVLDB 7(9):745\u2013756","journal-title":"PVLDB"},{"key":"6987_CR17","doi-asserted-by":"crossref","unstructured":"Lowe DG (1999) Object recognition from local scale-invariant features. In: The proceedings of the 7th IEEE international conference on computer vision, 1999, vol 2. IEEE, pp 1150\u20131157","DOI":"10.1109\/ICCV.1999.790410"},{"issue":"2","key":"6987_CR18","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1023\/B:VISI.0000029664.99615.94","volume":"60","author":"DG Lowe","year":"2004","unstructured":"Lowe DG (2004) Distinctive image features from scale-invariant keypoints. Int J Comput Vis 60(2):91\u2013110","journal-title":"Int J Comput Vis"},{"key":"6987_CR19","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.cviu.2017.07.001","volume":"163","author":"M Luo","year":"2017","unstructured":"Luo M, Chang X, Li Z, Nie L, Hauptmann AG, Zheng Q (2017) Simple to complex cross-modal learning to rank. Comput Vis Image Underst 163:67\u201377","journal-title":"Comput Vis Image Underst"},{"key":"6987_CR20","doi-asserted-by":"crossref","unstructured":"Luo X, Nie L, He X, Wu Y, Chen ZD, Xu XS (2018) Fast scalable supervised hashing. In: SIGIR, pp 735\u2013744","DOI":"10.1145\/3209978.3210035"},{"key":"6987_CR21","unstructured":"Lv Q, Josephson W, Wang Z, Charikar M, Li K (2007) Multi-probe lsh: efficient indexing for high-dimensional similarity search. In: VLDB, pp 950\u2013961"},{"issue":"2","key":"6987_CR22","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/2180868.2180875","volume":"30","author":"L Nie","year":"2012","unstructured":"Nie L, Wang M, Zha ZJ, Chua TS (2012) Oracle in image search: a content-based approach to performance prediction. ACM Trans Inf Syst (TOIS) 30 (2):13","journal-title":"ACM Trans Inf Syst (TOIS)"},{"key":"6987_CR23","doi-asserted-by":"crossref","unstructured":"Nie L, Yan S, Wang M, Hong R, Chua TS (2012) Harvesting visual concepts for image search with complex queries. In: Proceedings of the 20th ACM international conference on multimedia. ACM, pp 59\u201368","DOI":"10.1145\/2393347.2393363"},{"key":"6987_CR24","doi-asserted-by":"crossref","unstructured":"Norouzi M, Fleet DJ (2013) Cartesian k-means. In: CVPR, pp 3017\u20133024","DOI":"10.1109\/CVPR.2013.388"},{"issue":"3","key":"6987_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 (2001) Modeling the shape of the scene: a holistic representation of the spatial envelope. Int J Comput Vis 42(3):145\u2013175","journal-title":"Int J Comput Vis"},{"key":"6987_CR26","doi-asserted-by":"crossref","unstructured":"Panigrahy R (2006) Entropy based nearest neighbor search in high dimensions. In: SODA, pp 1186\u20131195","DOI":"10.1145\/1109557.1109688"},{"issue":"3","key":"6987_CR27","first-page":"144","volume":"9","author":"Y Park","year":"2015","unstructured":"Park Y, Cafarella MJ, Mozafari B (2015) Neighbor-sensitive hashing. PVLDB 9(3):144\u2013155","journal-title":"PVLDB"},{"issue":"12","key":"6987_CR28","doi-asserted-by":"publisher","first-page":"5610","DOI":"10.1109\/TIP.2016.2612883","volume":"25","author":"F Shen","year":"2016","unstructured":"Shen F, Zhou X, Yang Y, Song J, Shen HT, Tao D (2016) A fast optimization method for general binary code learning. IEEE Trans Image Process 25 (12):5610\u20135621","journal-title":"IEEE Trans Image Process"},{"issue":"9","key":"6987_CR29","doi-asserted-by":"publisher","first-page":"2022","DOI":"10.1109\/TMM.2017.2699863","volume":"19","author":"F Shen","year":"2017","unstructured":"Shen F, Yang Y, Liu L, Liu W, Dacheng Tao HTS (2017) Asymmetric binary coding for image search. IEEE Trans Multimed 19(9):2022\u20132032","journal-title":"IEEE Trans Multimed"},{"key":"6987_CR30","doi-asserted-by":"crossref","unstructured":"Shen F, Xu Y, Liu L, Yang Y, Huang Z, Shen HT (2018) Unsupervised deep hashing with similarity-adaptive and discrete optimization. IEEE Trans Pattern Anal Mach Intell","DOI":"10.1109\/TPAMI.2018.2789887"},{"issue":"1","key":"6987_CR31","first-page":"1","volume":"8","author":"Y Sun","year":"2014","unstructured":"Sun Y, Wang W, Qin J, Zhang Y, Lin X (2014) SRS: Solving c-approximate nearest neighbor queries in high dimensional euclidean space with a tiny index. PVLDB 8(1):1\u201312","journal-title":"PVLDB"},{"key":"6987_CR32","doi-asserted-by":"crossref","unstructured":"Tao Y, Yi K, Sheng C, Kalnis P (2009) Quality and efficiency in high dimensional nearest neighbor search. In: SIGMOD, pp 563\u2013576","DOI":"10.1145\/1559845.1559905"},{"issue":"4","key":"6987_CR33","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1561\/0400000014","volume":"2","author":"JS Vitter","year":"2008","unstructured":"Vitter JS (2008) Algorithms and data structures for external memory. Foundations Trends\u24c7, Theor Comput Sci 2(4):305\u2013474","journal-title":"Foundations Trends\u24c7, Theor Comput Sci"},{"key":"6987_CR34","unstructured":"Wang J, Shen HT, Song J, Ji J (2014) Hashing for similarity search: a survey. CoRR \n                    1408.2927"},{"key":"6987_CR35","unstructured":"Weber R, Schek HJ, Blott S (1998) A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: VLDB, vol 98, pp 194\u2013205"},{"key":"6987_CR36","unstructured":"Weiss Y, Torralba A, Fergus R (2008) Spectral hashing. In: Proceedings of the 22nd annual conference on neural information processing systems, advances in neural information processing systems 21, Vancouver, British Columbia, Canada, December 8-11, 2008, pp 1753\u20131760"},{"key":"6987_CR37","doi-asserted-by":"crossref","unstructured":"Zhang PF, Li CX, Liu MY, Nie L, Xu XS (2017) Semi-relaxation supervised hashing for cross-modal retrieval. In: Proceedings of the 2017 ACM on multimedia conference. ACM, pp 1762\u20131770","DOI":"10.1145\/3123266.3123320"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-018-6987-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11042-018-6987-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-018-6987-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,6]],"date-time":"2020-01-06T19:11:07Z","timestamp":1578337867000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11042-018-6987-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,7]]},"references-count":37,"journal-issue":{"issue":"17","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["6987"],"URL":"https:\/\/doi.org\/10.1007\/s11042-018-6987-0","relation":{},"ISSN":["1380-7501","1573-7721"],"issn-type":[{"type":"print","value":"1380-7501"},{"type":"electronic","value":"1573-7721"}],"subject":[],"published":{"date-parts":[[2019,1,7]]},"assertion":[{"value":"25 June 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 October 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 November 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}