{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T11:06:51Z","timestamp":1769080011364,"version":"3.49.0"},"reference-count":30,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,12,17]],"date-time":"2022-12-17T00:00:00Z","timestamp":1671235200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,12,17]],"date-time":"2022-12-17T00:00:00Z","timestamp":1671235200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100015843","name":"NAV","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100015843","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,12,17]]},"DOI":"10.1109\/bigdata55660.2022.10020464","type":"proceedings-article","created":{"date-parts":[[2023,1,26]],"date-time":"2023-01-26T19:35:23Z","timestamp":1674761723000},"page":"3895-3902","source":"Crossref","is-referenced-by-count":4,"title":["Hybrid Approximate Nearest Neighbor Indexing and Search (HANNIS) for Large Descriptor Databases"],"prefix":"10.1109","author":[{"given":"M M","family":"Mahabubur Rahman","sequence":"first","affiliation":[{"name":"Texas State University,Computer Science,San Marcos,TX,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jelena","family":"Tesic","sequence":"additional","affiliation":[{"name":"Texas State University,Computer Science,San Marcos,TX,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2889473"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963487"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.14778\/3303753.3303754"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3067706"},{"key":"ref5","author":"Iwasaki","year":"2015","journal-title":"Ngt: Neighborhood graph and tree for indexing"},{"key":"ref6","first-page":"28","article-title":"Practical and optimal lsh for angular distance","author":"Andoni","year":"2015","journal-title":"Advances in neural information processing systems"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.14778\/2850469.2850470"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.14778\/2735461.2735462"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2019.2921572"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2321376"},{"key":"ref11","author":"Bernhardsson","year":"2018","journal-title":"Annoy: Approximate Nearest Neighbors in C++\/Python"},{"key":"ref12","article-title":"TOROS N2 - lightweight approximate Nearest Neighbor library which runs fast even with large datasets","author":"Lee","year":"2017"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41062-8_28"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2019.02.006"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01258-8_13"},{"key":"ref16","article-title":"Optimization of indexing based on k-nearest neighbor graph for proximity search in high-dimensional data","author":"Iwasaki","year":"2018","journal-title":"arXiv preprint arXiv:1810.07355"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46759-7_2"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2909204"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587638"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1975.224297"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"ref23","article-title":"k-means++: The advantages of careful seeding","volume-title":"Technical report, Stanford","author":"Arthur","year":"2006"},{"key":"ref24","article-title":"Auto-jacobin: Auto-encoder jacobian binary hashing","volume":"abs\/1602.08127","author":"Fu","year":"2016","journal-title":"CoRR"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/cvpr.2018.00418"},{"key":"ref26","first-page":"28","article-title":"Faster rcnn: Towards real-time object detection with region proposal networks","author":"Ren","year":"2015","journal-title":"Advances in neural information processing systems"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref28","volume-title":"Detectron2","author":"Wu","year":"2019"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.7717\/peerj-cs.1806\/table-3"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2003.1211527"}],"event":{"name":"2022 IEEE International Conference on Big Data (Big Data)","location":"Osaka, Japan","start":{"date-parts":[[2022,12,17]]},"end":{"date-parts":[[2022,12,20]]}},"container-title":["2022 IEEE International Conference on Big Data (Big Data)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10020192\/10020156\/10020464.pdf?arnumber=10020464","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,13]],"date-time":"2024-02-13T07:41:43Z","timestamp":1707810103000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10020464\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,17]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/bigdata55660.2022.10020464","relation":{},"subject":[],"published":{"date-parts":[[2022,12,17]]}}}