{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T11:32:12Z","timestamp":1763811132062,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031262920"},{"type":"electronic","value":"9783031262937"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-26293-7_39","type":"book-chapter","created":{"date-parts":[[2023,3,10]],"date-time":"2023-03-10T20:02:47Z","timestamp":1678478567000},"page":"663-678","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Unsupervised Online Hashing with\u00a0Multi-Bit Quantization"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7857-8687","authenticated-orcid":false,"given":"Zhenyu","family":"Weng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2524-6800","authenticated-orcid":false,"given":"Yuesheng","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,11]]},"reference":[{"key":"39_CR1","doi-asserted-by":"crossref","unstructured":"Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In: FOCS, pp. 459\u2013468 (2006)","DOI":"10.1109\/FOCS.2006.49"},{"key":"39_CR2","doi-asserted-by":"crossref","unstructured":"Babenko, A., Lempitsky, V.: Additive quantization for extreme vector compression. In: CVPR, pp. 931\u2013938 (2014)","DOI":"10.1109\/CVPR.2014.124"},{"key":"39_CR3","doi-asserted-by":"crossref","unstructured":"Brandt, J.: Transform coding for fast approximate nearest neighbor search in high dimensions. In: CVPR, pp. 1815\u20131822 (2010)","DOI":"10.1109\/CVPR.2010.5539852"},{"key":"39_CR4","doi-asserted-by":"crossref","unstructured":"Cakir, F., He, K., Bargal, S.A., Sclaroff, S.: MIHash: online hashing with mutual information. In: ICCV, pp. 437\u2013445 (2017)","DOI":"10.1109\/ICCV.2017.55"},{"key":"39_CR5","first-page":"3907","volume":"23","author":"Y Cao","year":"2021","unstructured":"Cao, Y., Qi, H., Gui, J., Li, K., Tang, Y.Y., Kwok, J.T.Y.: Learning to hash with dimension analysis based quantizer for image retrieval. TMM 23, 3907\u20133918 (2021)","journal-title":"TMM"},{"key":"39_CR6","doi-asserted-by":"crossref","unstructured":"Chen, Y., Wang, S., Lu, J., Chen, Z., Zhang, Z., Huang, Z.: Local graph convolutional networks for cross-modal hashing. In: Proceedings of the 29th ACM International Conference on Multimedia, pp. 1921\u20131928 (2021)","DOI":"10.1145\/3474085.3475346"},{"key":"39_CR7","doi-asserted-by":"publisher","unstructured":"Douze, M., Sablayrolles, A., J\u00e9gou, H.: Link and code: fast indexing with graphs and compact regression codes. In: CVPR, pp. 3646\u20133654 (2018). https:\/\/doi.org\/10.1109\/CVPR.2018.00384","DOI":"10.1109\/CVPR.2018.00384"},{"key":"39_CR8","doi-asserted-by":"crossref","unstructured":"Huang, L., Yang, Q., Zheng, W.: Online hashing. TNNLS 29(6), 2309\u20132322 (2018)","DOI":"10.1109\/TNNLS.2017.2689242"},{"issue":"1","key":"39_CR9","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TPAMI.2010.57","volume":"33","author":"H Jegou","year":"2011","unstructured":"Jegou, H., Douze, M., Schmid, C.: Product quantization for nearest neighbor search. TPAMI 33(1), 117\u2013128 (2011)","journal-title":"TPAMI"},{"key":"39_CR10","unstructured":"Kong, W., Li, W.J.: Double-bit quantization for hashing. In: AAAI (2012)"},{"key":"39_CR11","doi-asserted-by":"crossref","unstructured":"Kong, W., Li, W.J., Guo, M.: Manhattan hashing for large-scale image retrieval. In: SIGIR, pp. 45\u201354 (2012)","DOI":"10.1145\/2348283.2348293"},{"key":"39_CR12","unstructured":"Krizhevsky, A., Sutskever, I., Hinton, G.E.: ImageNet classification with deep convolutional neural networks. In: NeurIPS, pp. 1097\u20131105 (2012)"},{"key":"39_CR13","doi-asserted-by":"crossref","unstructured":"Leng, C., Wu, J., Cheng, J., Bai, X., Lu, H.: Online sketching hashing. In: CVPR, pp. 2503\u20132511 (2015)","DOI":"10.1109\/CVPR.2015.7298865"},{"key":"39_CR14","doi-asserted-by":"publisher","first-page":"981","DOI":"10.1109\/TMM.2021.3062480","volume":"24","author":"P Li","year":"2022","unstructured":"Li, P., Xie, H., Min, S., Zha, Z.J., Zhang, Y.: Online residual quantization via streaming data correlation preserving. IEEE Trans. Multimedia 24, 981\u2013994 (2022). https:\/\/doi.org\/10.1109\/TMM.2021.3062480","journal-title":"IEEE Trans. Multimedia"},{"key":"39_CR15","doi-asserted-by":"crossref","unstructured":"Liberty, E.: Simple and deterministic matrix sketching. In: KDD, pp. 581\u2013588. ACM (2013)","DOI":"10.1145\/2487575.2487623"},{"key":"39_CR16","doi-asserted-by":"crossref","unstructured":"Lin, M., Ji, R., Liu, H., Sun, X., Chen, S., Tian, Q.: Hadamard matrix guided online hashing. IJCV 128(8), 2279\u20132306 (2020)","DOI":"10.1007\/s11263-020-01332-z"},{"key":"39_CR17","doi-asserted-by":"crossref","unstructured":"Lin, M., et al.: Fast class-wise updating for online hashing. In: TPAMI (2020)","DOI":"10.1109\/TPAMI.2020.3042193"},{"key":"39_CR18","doi-asserted-by":"crossref","unstructured":"Liu, C., Lian, D., Nie, M., Xia, H.: Online optimized product quantization. In: 2020 IEEE International Conference on Data Mining (ICDM), pp. 362\u2013371. IEEE (2020)","DOI":"10.1109\/ICDM50108.2020.00045"},{"key":"39_CR19","doi-asserted-by":"crossref","unstructured":"Matsui, Y., Uchida, Y., J\u00e9gou, H., Satoh, S.: A survey of product quantization. ITE Trans. Media Technol. Appl. 6(1), 2\u201310 (2018)","DOI":"10.3169\/mta.6.2"},{"key":"39_CR20","unstructured":"Norouzi, M., Blei, D.M.: Minimal loss hashing for compact binary codes. In: ICML, pp. 353\u2013360 (2011)"},{"issue":"12","key":"39_CR21","doi-asserted-by":"publisher","first-page":"3034","DOI":"10.1109\/TPAMI.2018.2789887","volume":"40","author":"F Shen","year":"2018","unstructured":"Shen, F., Xu, Y., Liu, L., Yang, Y., Huang, Z., Shen, H.T.: Unsupervised deep hashing with similarity-adaptive and discrete optimization. TPAMI 40(12), 3034\u20133044 (2018)","journal-title":"TPAMI"},{"key":"39_CR22","doi-asserted-by":"crossref","unstructured":"Shen, Y., et al.: Auto-encoding twin-bottleneck hashing. In: CVPR, pp. 2818\u20132827 (2020)","DOI":"10.1109\/CVPR42600.2020.00289"},{"key":"39_CR23","doi-asserted-by":"crossref","unstructured":"Silpa-Anan, C., Hartley, R.: Optimised kD-trees for fast image descriptor matching. In: CVPR, pp. 1\u20138 (2008)","DOI":"10.1109\/CVPR.2008.4587638"},{"key":"39_CR24","unstructured":"Simonyan, K., Zisserman, A.: Very deep convolutional networks for large-scale image recognition. CoRR abs\/1409.1556 (2014)"},{"issue":"1","key":"39_CR25","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1109\/JPROC.2015.2487976","volume":"104","author":"J Wang","year":"2016","unstructured":"Wang, J., Liu, W., Kumar, S., Chang, S.: Learning to hash for indexing big data $$ - $$ a survey. IEEE 104(1), 34\u201357 (2016)","journal-title":"IEEE"},{"issue":"4","key":"39_CR26","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1109\/TPAMI.2017.2699960","volume":"40","author":"J Wang","year":"2018","unstructured":"Wang, J., Zhang, T., Song, J., Sebe, N., Shen, H.T.: A survey on learning to hash. TPAMI 40(4), 769\u2013790 (2018)","journal-title":"TPAMI"},{"key":"39_CR27","doi-asserted-by":"crossref","unstructured":"Wang, J., Kumar, S., Chang, S.F.: Semi-supervised hashing for large-scale search. TPAMI 34(12), 2393\u20132406 (2012)","DOI":"10.1109\/TPAMI.2012.48"},{"key":"39_CR28","doi-asserted-by":"crossref","unstructured":"Wang, Y., Luo, X., Xu, X.S.: Label embedding online hashing for cross-modal retrieval. In: Proceedings of the 28th ACM International Conference on Multimedia, pp. 871\u2013879 (2020)","DOI":"10.1145\/3394171.3413971"},{"key":"39_CR29","unstructured":"Weiss, Y., Torralba, A., Fergus, R.: Spectral hashing. In: NeurIPS, pp. 1753\u20131760 (2009)"},{"key":"39_CR30","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.neucom.2016.04.037","volume":"207","author":"Z Weng","year":"2016","unstructured":"Weng, Z., Sun, Z., Zhu, Y.: Asymmetric hashing with multi-bit quantization for image retrieval. Neurocomputing 207, 71\u201377 (2016)","journal-title":"Neurocomputing"},{"key":"39_CR31","doi-asserted-by":"crossref","unstructured":"Weng, Z., Zhu, Y.: Online hashing with efficient updating of binary codes. In: AAAI, pp. 12354\u201312361 (2020)","DOI":"10.1609\/aaai.v34i07.6920"},{"key":"39_CR32","doi-asserted-by":"publisher","first-page":"1868","DOI":"10.1109\/TMM.2020.3004962","volume":"23","author":"Z Weng","year":"2021","unstructured":"Weng, Z., Zhu, Y.: Online hashing with bit selection for image retrieval. IEEE Trans. Multimedia 23, 1868\u20131881 (2021)","journal-title":"IEEE Trans. Multimedia"},{"key":"39_CR33","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.neucom.2019.06.053","volume":"364","author":"Z Weng","year":"2019","unstructured":"Weng, Z., Zhu, Y., Lan, Y., Huang, L.K.: A fast online spherical hashing method based on data sampling for large scale image retrieval. Neurocomputing 364, 209\u2013218 (2019)","journal-title":"Neurocomputing"},{"issue":"5","key":"39_CR34","doi-asserted-by":"publisher","first-page":"1248","DOI":"10.1109\/TMM.2018.2872898","volume":"21","author":"H Xie","year":"2019","unstructured":"Xie, H., Mao, Z., Zhang, Y., Deng, H., Yan, C., Chen, Z.: Double-bit quantization and index hashing for nearest neighbor search. TMM 21(5), 1248\u20131260 (2019). https:\/\/doi.org\/10.1109\/TMM.2018.2872898","journal-title":"TMM"},{"key":"39_CR35","doi-asserted-by":"crossref","unstructured":"Xu, D., Tsang, I.W., Zhang, Y.: Online product quantization. TKDE 30(11), 2185\u20132198 (2018)","DOI":"10.1109\/TKDE.2018.2817526"},{"key":"39_CR36","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2021.108262","volume":"122","author":"YW Zhan","year":"2022","unstructured":"Zhan, Y.W., Wang, Y., Sun, Y., Wu, X.M., Luo, X., Xu, X.S.: Discrete online cross-modal hashing. Pattern Recogn. 122, 108262 (2022)","journal-title":"Pattern Recogn."}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2013 ACCV 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-26293-7_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,10]],"date-time":"2023-03-10T20:12:08Z","timestamp":1678479128000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-26293-7_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031262920","9783031262937"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-26293-7_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"11 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACCV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asian Conference on Computer Vision","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Macao","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"accv2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.accv2022.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT Microsoft","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"836","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"277","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"For the ACCV 2022 workshops 25 papers have been accepted from 40 submissions","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}