{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T00:13:42Z","timestamp":1768522422153,"version":"3.49.0"},"reference-count":65,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T00:00:00Z","timestamp":1509494400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61402026"],"award-info":[{"award-number":["61402026"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Foundation of State Key Laboratory of Software Development Environment","award":["2015ZX-04"],"award-info":[{"award-number":["2015ZX-04"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. on Image Process."],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1109\/tip.2017.2695895","type":"journal-article","created":{"date-parts":[[2017,4,19]],"date-time":"2017-04-19T14:20:56Z","timestamp":1492611656000},"page":"5367-5380","source":"Crossref","is-referenced-by-count":38,"title":["Hash Bit Selection for Nearest Neighbor Search"],"prefix":"10.1109","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8425-4195","authenticated-orcid":false,"given":"Xianglong","family":"Liu","sequence":"first","affiliation":[]},{"given":"Junfeng","family":"He","sequence":"additional","affiliation":[]},{"given":"Shih-Fu","family":"Chang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"2298","article-title":"Hamming compatible quantization for hashing","author":"wang","year":"2015","journal-title":"Proc AAAI"},{"key":"ref38","first-page":"214","article-title":"Quadra-embedding: Binary code embedding with low quantization error","author":"lee","year":"2012","journal-title":"Proc ACCV"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2015.2474742"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2014.09.033"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2540990"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2013.08.022"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2911502"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.206"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/72.977291"},{"key":"ref34","first-page":"1127","article-title":"On the difficulty of nearest neighbor search","author":"he","year":"2012","journal-title":"Proc ICML"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1145\/1991996.1992003"},{"key":"ref62","first-page":"5","article-title":"Double-bit quantization for hashing","author":"kong","year":"2012","journal-title":"Proc AAAI"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995709"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"ref28","first-page":"2957","article-title":"Spherical hashing","author":"heo","year":"2012","journal-title":"Proc CVPR"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1145\/1646396.1646452"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2009.5459466"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973440.20"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2072298.2072354"},{"key":"ref2","first-page":"3005","article-title":"Mobile product search with bag of hash bits and boundary reranking","author":"he","year":"2012","journal-title":"Proc CVPR"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"ref20","first-page":"3419","article-title":"Discrete graph hashing","author":"liu","year":"2014","journal-title":"Proc NIPS"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2016.2593344"},{"key":"ref21","first-page":"3332","article-title":"Sparse projections for high-dimensional binary codes","author":"xia","year":"2015","journal-title":"Proc IEEE CVPR"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995432"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995518"},{"key":"ref26","first-page":"2074","article-title":"Supervised hashing with kernels","author":"liu","year":"2012","journal-title":"Proc CVPR"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.388"},{"key":"ref50","doi-asserted-by":"crossref","first-page":"1610","DOI":"10.1109\/TPAMI.2009.190","article-title":"Local-learning-based feature selection for high-dimensional data analysis","volume":"32","author":"sun","year":"2010","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"ref51","first-page":"4183","article-title":"Boosting complementary hash tables for fast nearest neighbor search","author":"liu","year":"2017","journal-title":"Proc AAAI"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.174"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2006.130"},{"key":"ref57","first-page":"712","article-title":"What is a cluster? perspectives from game theory","author":"pelillo","year":"2009","journal-title":"Proc of the PASCAL"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511806292"},{"key":"ref55","first-page":"671","article-title":"Robust graph mode seeking by graph shift","author":"liu","year":"2010","journal-title":"Proc ICML"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.250608"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.48"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835946"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2015.2505180"},{"key":"ref11","first-page":"1","article-title":"Deep sketch hashing: Fast free-hand sketch-based image retrieval","author":"liu","year":"2017","journal-title":"Proc IEEE CVPR"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298947"},{"key":"ref12","author":"goodman","year":"2004","journal-title":"Nearest Neighbors High-Dimensional Spaces Handbook Discrete Computer Geometry"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997857"},{"key":"ref15","first-page":"1753","article-title":"Spectral hashing","author":"weiss","year":"2008","journal-title":"Proc NIPS"},{"key":"ref16","first-page":"1042","article-title":"Learning to hash with binary reconstructive embeddings","author":"kulis","year":"2009","journal-title":"Proc NIPS"},{"key":"ref17","first-page":"1127","article-title":"Sequential projection learning for hashing with compact codes","author":"wang","year":"2010","journal-title":"Proc ICML"},{"key":"ref18","first-page":"1","article-title":"Hashing with graphs","author":"liu","year":"2011","journal-title":"Proc ICML"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.378"},{"key":"ref4","first-page":"1","article-title":"Collaborative hashin","author":"liu","year":"2014","journal-title":"Proc IEEE CVPR"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2013.2281366"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298598"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2013.2289351"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2015.2419973"},{"key":"ref7","first-page":"19","article-title":"Web scale photo hash clustering on a single machine","author":"gong","year":"2015","journal-title":"Proc IEEE CVPR"},{"key":"ref49","first-page":"1","author":"he","year":"2005","journal-title":"Laplacian score for feature selection"},{"key":"ref9","first-page":"2181","article-title":"To project more or to quantize more: Minimize reconstruction bias for learning compact binary codes","author":"wang","year":"2016","journal-title":"Proc IJCAI"},{"key":"ref46","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"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.377"},{"key":"ref48","first-page":"1157","article-title":"An introduction to variable and feature selection","volume":"3","author":"guyon","year":"2003","journal-title":"J Mach Learn Res"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/s13735-012-0003-7"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539994"},{"key":"ref41","first-page":"2475","article-title":"Deep hashing for compact binary codes learning","author":"erin liong","year":"2015","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit (CVPR)"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/2502081.2502100"},{"key":"ref43","first-page":"353","article-title":"Minimal loss hashing for compact binary codes","author":"norouzi","year":"2011","journal-title":"Proc ICML"}],"container-title":["IEEE Transactions on Image Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/83\/8013197\/07904662.pdf?arnumber=7904662","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:39:45Z","timestamp":1641987585000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7904662\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11]]},"references-count":65,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tip.2017.2695895","relation":{},"ISSN":["1057-7149","1941-0042"],"issn-type":[{"value":"1057-7149","type":"print"},{"value":"1941-0042","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,11]]}}}