{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T13:51:35Z","timestamp":1761745895634,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"18","license":[{"start":{"date-parts":[[2023,11,16]],"date-time":"2023-11-16T00:00:00Z","timestamp":1700092800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,16]],"date-time":"2023-11-16T00:00:00Z","timestamp":1700092800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"The Ph.D Stand-up Fund of Xi\u2019an University of Technology","award":["108-451121002"],"award-info":[{"award-number":["108-451121002"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1903213"],"award-info":[{"award-number":["U1903213"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100017594","name":"Medical Science and Technology Project of Zhejiang Province","doi-asserted-by":"publisher","award":["LGF21F030002"],"award-info":[{"award-number":["LGF21F030002"]}],"id":[{"id":"10.13039\/501100017594","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Multimed Tools Appl"],"DOI":"10.1007\/s11042-023-17564-3","type":"journal-article","created":{"date-parts":[[2023,11,16]],"date-time":"2023-11-16T06:01:46Z","timestamp":1700114506000},"page":"53243-53261","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Flexible product quantization for fast approximate nearest neighbor search"],"prefix":"10.1007","volume":"83","author":[{"given":"Jingya","family":"Fan","sequence":"first","affiliation":[]},{"given":"Yang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Wenwen","family":"Song","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4695-311X","authenticated-orcid":false,"given":"Zhibin","family":"Pan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,16]]},"reference":[{"key":"17564_CR1","doi-asserted-by":"crossref","unstructured":"Boiman O, Shechtman E, Irani M (2008) In defense of nearest-neighbor based image classification. In: 2008 IEEE Conference on computer vision and pattern recognition, pp 1\u20138","DOI":"10.1109\/CVPR.2008.4587598"},{"key":"17564_CR2","unstructured":"Wang J, Wen C (2011) Personalized commodity recommending method and system which integrate attributes and structural similarity"},{"issue":"5","key":"17564_CR3","doi-asserted-by":"publisher","first-page":"1774","DOI":"10.1109\/TNNLS.2017.2673241","volume":"29","author":"S Zhang","year":"2017","unstructured":"Zhang S, Li X, Zong M, Zhu X, Wang R (2017) Efficient knn classification with different numbers of nearest neighbors. IEEE Trans Neural Netw Learn Syst 29(5):1774\u20131785","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"17564_CR4","doi-asserted-by":"crossref","unstructured":"Pan Y, Pan Z, Wang Y, Wang W (2020) A new fast search algorithm for exact k-nearest neighbors based on optimal triangle-inequality-based check strategy. Knowl-Based Syst 189","DOI":"10.1016\/j.knosys.2019.105088"},{"key":"17564_CR5","doi-asserted-by":"crossref","unstructured":"Indyk P, Motwani R (1998) Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of the thirtieth annual ACM symposium on Theory of computing, pp 604\u2013613","DOI":"10.1145\/276698.276876"},{"key":"17564_CR6","doi-asserted-by":"crossref","unstructured":"Liu W, Wang J, Ji R, Jiang Y-G, Chang S-F (2012) Supervised hashing with kernels. In: 2012 IEEE Conference on computer vision and pattern recognition, pp 2074\u20132081","DOI":"10.1109\/CVPR.2012.6247912"},{"issue":"11","key":"17564_CR7","doi-asserted-by":"publisher","first-page":"2521","DOI":"10.1109\/TMM.2017.2697824","volume":"19","author":"S Ercoli","year":"2017","unstructured":"Ercoli S, Bertini M, Bimbo AD (2017) Compact hash codes for efficient visual descriptors retrieval in large scale databases. IEEE Trans Multimed 19(11):2521\u20132532","journal-title":"IEEE Trans Multimed"},{"issue":"12","key":"17564_CR8","doi-asserted-by":"publisher","first-page":"2393","DOI":"10.1109\/TPAMI.2012.48","volume":"34","author":"J Wang","year":"2012","unstructured":"Wang J, Kumar S, Chang S-F (2012) Semi-supervised hashing for large-scale search. IEEE Trans Patt Anal Mach Intell 34(12):2393\u20132406","journal-title":"IEEE Trans Patt Anal Mach Intell"},{"issue":"4","key":"17564_CR9","doi-asserted-by":"publisher","first-page":"1838","DOI":"10.1109\/TNNLS.2020.2997020","volume":"34","author":"L Jin","year":"2020","unstructured":"Jin L, Li Z, Tang J (2020) Deep semantic multimodal hashing network for scalable image-text and video-text retrievals. IEEE Trans Neural Netw Learn Syst 34(4):1838\u20131851","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"17564_CR10","doi-asserted-by":"publisher","first-page":"2265","DOI":"10.1007\/s11263-020-01331-0","volume":"128","author":"Z Li","year":"2020","unstructured":"Li Z, Tang J, Zhang L, Yang J (2020) Weakly-supervised semantic guided hashing for social image retrieval. Int J Comp Vision 128:2265\u20132278","journal-title":"Int J Comp Vision"},{"issue":"1","key":"17564_CR11","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TPAMI.2010.57","volume":"33","author":"H J\u00e9gou","year":"2011","unstructured":"J\u00e9gou H, Douze M, Schmid C (2011) Product quantization for nearest neighbor search. IEEE Trans Patt Anal Mach Intell 33(1):117\u2013128","journal-title":"IEEE Trans Patt Anal Mach Intell"},{"key":"17564_CR12","doi-asserted-by":"crossref","unstructured":"Song W, Wang Y, Pan Z (2023) A novel cell partition method by introducing Silhouette Coefficient for fast approximate nearest neighbor search. Inf Sci 642:119216","DOI":"10.1016\/j.ins.2023.119216"},{"key":"17564_CR13","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.neucom.2020.03.016","volume":"401","author":"Z Pan","year":"2020","unstructured":"Pan Z, Wang L, Wang Y, Liu Y (2020) Product quantization with dual codebooks for approximate nearest neighbor search. Neurocomputing 401:59\u201368","journal-title":"Neurocomputing"},{"key":"17564_CR14","doi-asserted-by":"crossref","unstructured":"Fan F, Pan Z,Wang L,WangY (2022) Codebook-softened product quantization for high accuracy approximate nearest neighbor search. Neurocomputing 507(1):107\u2013116","DOI":"10.1016\/j.neucom.2022.08.002"},{"issue":"4","key":"17564_CR15","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1109\/TPAMI.2013.240","volume":"36","author":"T Ge","year":"2014","unstructured":"Ge T, He K, Ke Q, Sun J (2014) Optimized product quantization. IEEE Trans Patt Anal Mach Intell 36(4):744\u2013755","journal-title":"IEEE Trans Patt Anal Mach Intell"},{"key":"17564_CR16","doi-asserted-by":"crossref","unstructured":"Kalantidis Y, Avrithis Y (2014) Locally optimized product quantization for approximate nearest neighbor search. In: 2014 IEEE Conference on computer vision and pattern recognition, pp 2329\u20132336","DOI":"10.1109\/CVPR.2014.298"},{"key":"17564_CR17","doi-asserted-by":"crossref","unstructured":"Norouzi M, Fleet DJ (2013) Cartesian k-means. In: 2013 IEEE Conference on computer vision and pattern recognition, pp 3017\u20133024","DOI":"10.1109\/CVPR.2013.388"},{"issue":"7","key":"17564_CR18","doi-asserted-by":"publisher","first-page":"1783","DOI":"10.1109\/TPAMI.2019.2925347","volume":"42","author":"W Hong","year":"2020","unstructured":"Hong W, Tang X, Meng J, Yuan J (2020) Asymmetric mapping quantization for nearest neighbor search. IEEE Trans Patt Anal Mach Intell 42(7):1783\u20131790","journal-title":"IEEE Trans Patt Anal Mach Intell"},{"issue":"9","key":"17564_CR19","doi-asserted-by":"publisher","first-page":"2084","DOI":"10.1109\/TPAMI.2018.2853161","volume":"41","author":"J-P Heo","year":"2019","unstructured":"Heo J-P, Lin Z, Yoon S-E (2019) Distance encoded product quantization for approximate k-nearest neighbor search in high-dimensional space. IEEE Trans Patt Anal Mach Intell 41(9):2084\u20132097","journal-title":"IEEE Trans Patt Anal Mach Intell"},{"issue":"12","key":"17564_CR20","doi-asserted-by":"publisher","first-page":"3504","DOI":"10.1109\/TCSVT.2017.2759277","volume":"28","author":"L Li","year":"2018","unstructured":"Li L, Hu Q, Han Y, Li X (2018) Distribution sensitive product quantization. IEEE Trans Circ Syst Video Tech 28(12):3504\u20133515","journal-title":"IEEE Trans Circ Syst Video Tech"},{"issue":"3","key":"17564_CR21","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1109\/TMM.2016.2625260","volume":"19","author":"Q Ning","year":"2017","unstructured":"Ning Q, Zhu J, Zhong Z, Hoi SC, Chen C (2017) Scalable image retrieval by sparse product quantization. IEEE Trans Multimed 19(3):586\u2013597","journal-title":"IEEE Trans Multimed"},{"key":"17564_CR22","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.patrec.2019.04.017","volume":"125","author":"S An","year":"2019","unstructured":"An S, Huang Z, Bai S, Che G, Ma X, Luo J, Chen Y (2019) Quarter-point product quantization for approximate nearest neighbor search. Pattern Recogn Lett 125:187\u2013194","journal-title":"Pattern Recogn Lett"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-023-17564-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11042-023-17564-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-023-17564-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,15]],"date-time":"2024-05-15T10:07:04Z","timestamp":1715767624000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11042-023-17564-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,16]]},"references-count":22,"journal-issue":{"issue":"18","published-online":{"date-parts":[[2024,5]]}},"alternative-id":["17564"],"URL":"https:\/\/doi.org\/10.1007\/s11042-023-17564-3","relation":{},"ISSN":["1573-7721"],"issn-type":[{"type":"electronic","value":"1573-7721"}],"subject":[],"published":{"date-parts":[[2023,11,16]]},"assertion":[{"value":"29 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 July 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 October 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 November 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"We declare that we have no financial and personal relationships with other people or organizations that can inappropriately influence our work, and there is no professional or other personal interest of any nature or kind in any product, service and\/or company that could be construed as influencing the position presented in the manuscript entitled \u201cFlexible Product Quantization for Fast Approximate Nearest Neighbor Search\u201d.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}