{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T12:00:05Z","timestamp":1780488005645,"version":"3.54.1"},"reference-count":48,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Key R&D Program","award":["2017YFC0113000"],"award-info":[{"award-number":["2017YFC0113000"]}]},{"name":"National Key R&D Program","award":["2016YFB1001503"],"award-info":[{"award-number":["2016YFB1001503"]}]},{"name":"Nature Science Foundation of China","award":["U1705262"],"award-info":[{"award-number":["U1705262"]}]},{"name":"Nature Science Foundation of China","award":["61772443"],"award-info":[{"award-number":["61772443"]}]},{"name":"Nature Science Foundation of China","award":["61572410"],"award-info":[{"award-number":["61572410"]}]},{"name":"Post Doctoral Innovative Talent Support Program","award":["BX201600094"],"award-info":[{"award-number":["BX201600094"]}]},{"name":"China Post-Doctoral Science Foundation","award":["2017M612134"],"award-info":[{"award-number":["2017M612134"]}]},{"name":"National Language Committee of China","award":["YB135-49"],"award-info":[{"award-number":["YB135-49"]}]},{"name":"Nature Science Foundation of Fujian Province, China","award":["2017J01125"],"award-info":[{"award-number":["2017J01125"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2019,4,1]]},"DOI":"10.1109\/tpami.2018.2819978","type":"journal-article","created":{"date-parts":[[2018,3,27]],"date-time":"2018-03-27T19:08:14Z","timestamp":1522177694000},"page":"941-955","source":"Crossref","is-referenced-by-count":50,"title":["Ordinal Constraint Binary Coding for Approximate Nearest Neighbor Search"],"prefix":"10.1109","volume":"41","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4295-2224","authenticated-orcid":false,"given":"Hong","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9163-2932","authenticated-orcid":false,"given":"Rongrong","family":"Ji","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4888-4445","authenticated-orcid":false,"given":"Jingdong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8648-8718","authenticated-orcid":false,"given":"Chunhua","family":"Shen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.207"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587633"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0584-1"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1015330.1015408"},{"key":"ref31","first-page":"45","article-title":"Model selection for principal component analysis","author":"vidal","year":"2016","journal-title":"Generalized Principal Component Analysis"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.3150\/15-BEJ792"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011139631724"},{"key":"ref36","first-page":"2859","article-title":"Linear dimensionality reduction: Survey, insights, and generalizations","volume":"16","author":"cunningham","year":"2015","journal-title":"J Mach Learn Res"},{"key":"ref35","author":"absil","year":"2009","journal-title":"Optimization Algorithms on Matrix Manifolds"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.240"},{"key":"ref10","first-page":"1","article-title":"Hashing with graphs","author":"liu","year":"2011","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.124"},{"key":"ref11","first-page":"1631","article-title":"Complementary hashing for approximate nearest neighbor search","author":"xu","year":"2011","journal-title":"Proc IEEE Int Conf Comput Vis"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.193"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2502081.2502100"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2408363"},{"key":"ref15","first-page":"3419","article-title":"Discrete graph hashing","author":"liu","year":"2014","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref16","first-page":"2248","article-title":"Scalable graph hashing with feature transformation","author":"jiang","year":"2015","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref17","first-page":"1258","article-title":"Towards optimal binary code learning via ordinal embedding","author":"liu","year":"2016","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref18","first-page":"1042","article-title":"Learning to hash with binary reconstructive embeddings","author":"kulis","year":"2009","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref19","first-page":"353","article-title":"Minimal loss hashing for compact binary codes","author":"norouzi","year":"2011","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997857"},{"key":"ref28","first-page":"2238","article-title":"Ordinal constrained binary code learning for nearest neighbor search","author":"liu","year":"2017","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref3","first-page":"838","article-title":"Composite quantization for approximate nearest neighbor search","author":"zhang","year":"2014","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref27","first-page":"1646","article-title":"Isotropic hashing","author":"kong","year":"2012","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/509961.509965"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1131"},{"key":"ref29","first-page":"847","article-title":"Local ordinal embedding","author":"terada","year":"2014","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.219"},{"key":"ref7","first-page":"1509","article-title":"Locality-sensitive binary codes from shift-invariant kernels","author":"raginsky","year":"2009","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2487976"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2699960"},{"key":"ref9","first-page":"1753","article-title":"Spectral hashing","author":"weiss","year":"2009","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.378"},{"key":"ref20","first-page":"2074","article-title":"Supervised hashing with kernels","author":"liu","year":"2012","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref45","article-title":"A revisit of hashing algorithms for approximate nearest neighbor search","author":"cai","year":"2016","journal-title":"arXiv preprint arXiv 1612 07545"},{"key":"ref48","first-page":"2579","article-title":"Visualizing data using T-SNE","volume":"9","author":"maaten","year":"2008","journal-title":"J Mach Learn Res"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298598"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2017.2774009"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2404776"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"ref24","first-page":"613","article-title":"Optimizing ranking measures for compact binary code learning","author":"lin","year":"2014","journal-title":"Proc Eur Conf Comput Vis"},{"key":"ref41","first-page":"774","article-title":"Negative evidences and co-occurences in image retrieval: The benefit of PCA and whitening","author":"j\u00e9gou","year":"2012","journal-title":"Proc Eur Conf Comput Vis"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.377"},{"key":"ref44","first-page":"1102","article-title":"Affinity preserving quantization for hashing: A vector quantization approach to learning compact binary codes","author":"wang","year":"2016","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref26","first-page":"1061","article-title":"Hamming distance metric learning","author":"norouzi","year":"2012","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/1646396.1646452"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.223"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/8660600\/08326558.pdf?arnumber=8326558","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:09:25Z","timestamp":1657746565000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8326558\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,1]]},"references-count":48,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2018.2819978","relation":{},"ISSN":["0162-8828","2160-9292","1939-3539"],"issn-type":[{"value":"0162-8828","type":"print"},{"value":"2160-9292","type":"electronic"},{"value":"1939-3539","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4,1]]}}}