{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T19:57:22Z","timestamp":1760385442696,"version":"3.37.3"},"reference-count":61,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2016,10,1]],"date-time":"2016-10-01T00:00:00Z","timestamp":1475280000000},"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","61370125","51408018","61572388"],"award-info":[{"award-number":["61402026","61370125","51408018","61572388"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National High Technology Research and Development Program of China","award":["2013AA01A602"],"award-info":[{"award-number":["2013AA01A602"]}]},{"DOI":"10.13039\/501100004602","name":"Program for New Century Excellent Talents in University","doi-asserted-by":"publisher","award":["NCET-12-0917"],"award-info":[{"award-number":["NCET-12-0917"]}],"id":[{"id":"10.13039\/501100004602","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["K5051302019"],"award-info":[{"award-number":["K5051302019"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Key Science and Technology Program of Shaanxi Province","award":["2014K05-16"],"award-info":[{"award-number":["2014K05-16"]}]},{"name":"Fund of the State Key Laboratory of Software Development Environment","award":["SKLSDE-2014ZX-07","SKLSDE-2015ZX-04"],"award-info":[{"award-number":["SKLSDE-2014ZX-07","SKLSDE-2015ZX-04"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Cybern."],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1109\/tcyb.2015.2474742","type":"journal-article","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T18:51:03Z","timestamp":1443725463000},"page":"2252-2264","source":"Crossref","is-referenced-by-count":61,"title":["Structure Sensitive Hashing With Adaptive Product Quantization"],"prefix":"10.1109","volume":"46","author":[{"given":"Xianglong","family":"Liu","sequence":"first","affiliation":[]},{"given":"Bowen","family":"Du","sequence":"additional","affiliation":[]},{"given":"Cheng","family":"Deng","sequence":"additional","affiliation":[]},{"given":"Ming","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Bo","family":"Lang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref39","DOI":"10.1109\/CVPR.2013.206"},{"key":"ref38","first-page":"2604","article-title":"Double-bit quantization for hashing","author":"kong","year":"2012","journal-title":"Proc AAAI"},{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1109\/CVPR.2010.5539994"},{"doi-asserted-by":"publisher","key":"ref32","DOI":"10.1109\/CVPR.2010.5540024"},{"key":"ref31","first-page":"3419","article-title":"Discrete graph hashing","author":"liu","year":"2014","journal-title":"Proc NIPS"},{"key":"ref30","first-page":"1","article-title":"Hashing with graphs","author":"liu","year":"2011","journal-title":"Proc ICML"},{"key":"ref37","first-page":"1631","article-title":"Complementary hashing for approximate nearest neighbor search","author":"xu","year":"2011","journal-title":"Proc ICCV"},{"key":"ref36","first-page":"950","article-title":"Multi-probe LSH: Efficient indexing for high-dimensional similarity search","author":"lv","year":"2007","journal-title":"Proc VLDB"},{"doi-asserted-by":"publisher","key":"ref35","DOI":"10.1145\/2072298.2072354"},{"doi-asserted-by":"publisher","key":"ref34","DOI":"10.1145\/2540990"},{"key":"ref60","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1609\/aaai.v27i1.8582","article-title":"Reciprocal hash tables for nearest neighbor search","author":"liu","year":"2013","journal-title":"Proc AAAI"},{"doi-asserted-by":"publisher","key":"ref61","DOI":"10.1109\/JPROC.2012.2193849"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1109\/CVPR.2013.378"},{"key":"ref27","first-page":"2957","article-title":"Spherical hashing","author":"heo","year":"2012","journal-title":"Proc CVPR"},{"key":"ref29","first-page":"1753","article-title":"Spectral hashing","author":"weiss","year":"2008","journal-title":"Proc NIPS"},{"key":"ref2","first-page":"1127","article-title":"Sequential projection learning for hashing with compact codes","author":"wang","year":"2010","journal-title":"Proc ICML"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1109\/ICCV.2003.1238424"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1109\/CVPR.2011.5995432"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1109\/ICCV.2013.39"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1109\/CVPR.2013.388"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1109\/TCYB.2014.2360856"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1109\/CVPR.2013.64"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1145\/1835804.1835946"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1109\/ICCV.2009.5459466"},{"key":"ref50","first-page":"1509","article-title":"Locality-sensitive binary codes from shift-invariant kernels","author":"raginsky","year":"2009","journal-title":"Proc NIPS"},{"key":"ref51","first-page":"1042","article-title":"Learning to hash with binary reconstructive embeddings","author":"kulis","year":"2009","journal-title":"Proc NIPS"},{"doi-asserted-by":"publisher","key":"ref59","DOI":"10.1109\/CVPR.2012.6248043"},{"doi-asserted-by":"publisher","key":"ref58","DOI":"10.1145\/1646396.1646452"},{"doi-asserted-by":"publisher","key":"ref57","DOI":"10.1023\/A:1011139631724"},{"year":"2009","author":"krizhevsky","article-title":"Learning multiple layers of features from tiny images","key":"ref56"},{"doi-asserted-by":"publisher","key":"ref55","DOI":"10.1145\/1401890.1401986"},{"doi-asserted-by":"publisher","key":"ref54","DOI":"10.1109\/CVPR.2013.379"},{"doi-asserted-by":"publisher","key":"ref53","DOI":"10.1145\/2009916.2009950"},{"doi-asserted-by":"publisher","key":"ref52","DOI":"10.1109\/CVPR.2006.264"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1016\/j.patcog.2013.08.022"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1109\/CVPR.2013.237"},{"doi-asserted-by":"publisher","key":"ref40","DOI":"10.1016\/j.neucom.2014.09.033"},{"key":"ref12","first-page":"928","article-title":"Hashing hyperplane queries to near points with applications to large-scale active learning","author":"jain","year":"2010","journal-title":"Proc NIPS"},{"key":"ref13","first-page":"17","article-title":"Compact hyperplane hashing with bilinear functions","author":"liu","year":"2012","journal-title":"Proc ICML"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1109\/CVPR.2014.130"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1016\/j.sigpro.2014.07.017"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1109\/CVPR.2014.275"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1109\/CVPR.2014.8"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1145\/276698.276876"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1145\/509961.509965"},{"key":"ref4","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":"ref3","first-page":"2074","article-title":"Supervised hashing with kernels","author":"liu","year":"2012","journal-title":"Proc CVPR"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/TCYB.2014.2302018"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1109\/TCYB.2013.2281366"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/CVPR.2014.251"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/TCYB.2013.2289351"},{"key":"ref49","first-page":"1127","article-title":"On the difficulty of nearest neighbor search","author":"he","year":"2012","journal-title":"Proc ICML"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1109\/TCYB.2013.2283497"},{"doi-asserted-by":"publisher","key":"ref46","DOI":"10.1109\/TPAMI.2010.57"},{"doi-asserted-by":"publisher","key":"ref45","DOI":"10.1109\/TNNLS.2013.2253798"},{"doi-asserted-by":"publisher","key":"ref48","DOI":"10.1109\/CVPR.2011.5995709"},{"doi-asserted-by":"publisher","key":"ref47","DOI":"10.1145\/997817.997857"},{"doi-asserted-by":"publisher","key":"ref42","DOI":"10.1109\/ICCV.2013.323"},{"doi-asserted-by":"publisher","key":"ref41","DOI":"10.1007\/978-3-319-10605-2_28"},{"key":"ref44","doi-asserted-by":"crossref","first-page":"1438","DOI":"10.1109\/TSMCB.2009.2039566","article-title":"Multiview spectral embedding","volume":"40","author":"xia","year":"2010","journal-title":"IEEE Trans Syst Man Cybern B Cybern"},{"key":"ref43","first-page":"681","article-title":"A unified approximate nearest neighbor search scheme by combining data structure and hashing","author":"zhang","year":"2013","journal-title":"Proc IJCAI"}],"container-title":["IEEE Transactions on Cybernetics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6221036\/7567607\/07286797.pdf?arnumber=7286797","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,14]],"date-time":"2023-08-14T20:37:59Z","timestamp":1692045479000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7286797\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10]]},"references-count":61,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tcyb.2015.2474742","relation":{},"ISSN":["2168-2267","2168-2275"],"issn-type":[{"type":"print","value":"2168-2267"},{"type":"electronic","value":"2168-2275"}],"subject":[],"published":{"date-parts":[[2016,10]]}}}