乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T07:19:43Z","timestamp":1725693583364},"reference-count":57,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Key R&D Program of China","award":["2018YFB1402600"]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61822208","61632019"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012492","name":"Youth Innovation Promotion Association","doi-asserted-by":"publisher","award":["2018497"],"id":[{"id":"10.13039\/501100012492","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61836011"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Multimedia"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1109\/tmm.2019.2943778","type":"journal-article","created":{"date-parts":[[2019,9,25]],"date-time":"2019-09-25T19:58:24Z","timestamp":1569441504000},"page":"1507-1518","source":"Crossref","is-referenced-by-count":5,"title":["Neighborhood Pyramid Preserving Hashing"],"prefix":"10.1109","volume":"22","author":[{"ORCID":"http:\/\/orcid.org\/0000-0003-3048-6980","authenticated-orcid":false,"given":"Min","family":"Wang","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-1690-9836","authenticated-orcid":false,"given":"Wengang","family":"Zhou","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-5165-4325","authenticated-orcid":false,"given":"Qi","family":"Tian","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-2188-3028","authenticated-orcid":false,"given":"Houqiang","family":"Li","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2006.68"},{"key":"ref38","first-page":"3419","article-title":"Discrete graph hashing","author":"liu","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298947"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298598"},{"key":"ref31","first-page":"2156","article-title":"Supervised hashing for image retrieval via image representation learning","volume":"1","author":"xia","year":"0","journal-title":"Proc Assoc Advancement Artif Intell"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2600428.2609600"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/2502081.2502091"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2502081.2502100"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.378"},{"key":"ref34","first-page":"557","article-title":"Hashing with binary autoencoders","author":"carreira-perpin\u00e1n","year":"0","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5540129"},{"key":"ref27","first-page":"2074","article-title":"Supervised hashing with kernels","author":"liu","year":"0","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2013.2291214"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"ref20","first-page":"1042","article-title":"Learning to hash with binary reconstructive embeddings","author":"kulis","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539852"},{"key":"ref21","first-page":"3332","article-title":"Sparse projections for high-dimensional binary codes","author":"xia","year":"0","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2016.2614858"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"907","DOI":"10.1109\/TIP.2017.2751150","article-title":"A general framework for linear distance preserving hashing","volume":"27","author":"min","year":"2018","journal-title":"IEEE Trans Image Process"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.48"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2017.2703636"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2018.2877888"},{"key":"ref51","first-page":"4539","article-title":"Direct hashing without pseudo-labels","author":"zheng","year":"0","journal-title":"Proc Assoc Advancement Artif Intell"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.5244\/C.28.6"},{"key":"ref56","article-title":"Learning multiple layers of features from tiny images","author":"krizhevsky","year":"2009"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/2964284.2964334"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.223"},{"key":"ref53","first-page":"3911","article-title":"Ranking preserving hashing for fast similarity search","author":"wang","year":"0","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/148"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2018.2814344"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2430329"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298862"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2014.2301979"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2017.2710635"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48890-5_55"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1459359.1459388"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.219"},{"key":"ref17","first-page":"1","article-title":"Hashing with graphs","author":"liu","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref18","first-page":"2248","article-title":"Scalable graph hashing with feature transformation","author":"jiang","year":"0","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref19","first-page":"2957","article-title":"Spherical hashing","author":"heo","year":"0","journal-title":"Proc IEEE Conf Comput Vision Pattern Recognit"},{"key":"ref4","first-page":"1753","article-title":"Spectral hashing","author":"weiss","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref3","first-page":"518","article-title":"Similarity search in high dimensions via hashing","volume":"99","author":"gionis","year":"0","journal-title":"Proc 5th Int Conf Very Large Data Bases"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2015.2455415"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995432"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2013.2271746"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2016.2610324"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2019.2903661"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2016.2645565"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.206"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00386"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46475-6_49"},{"key":"ref47","first-page":"353","article-title":"Minimal loss hashing for compact binary codes","author":"norouzi","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.133"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46454-1_14"},{"key":"ref44","first-page":"913","article-title":"Stochastic generative hashing","author":"dai","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3123266.3123403"}],"container-title":["IEEE Transactions on Multimedia"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6046\/9097818\/08848432.pdf?arnumber=8848432","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T15:55:45Z","timestamp":1651074945000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8848432\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":57,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tmm.2019.2943778","relation":{},"ISSN":["1520-9210","1941-0077"],"issn-type":[{"value":"1520-9210","type":"print"},{"value":"1941-0077","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6]]}}}