{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T11:02:00Z","timestamp":1775041320662,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Vietnam National Foundation for Science and Technology Development","award":["102.01-2016.01"],"award-info":[{"award-number":["102.01-2016.01"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Multimed Tools Appl"],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1007\/s11042-018-6626-9","type":"journal-article","created":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T02:29:52Z","timestamp":1535768992000},"page":"9991-10012","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Embedding hierarchical clustering in product quantization for feature indexing"],"prefix":"10.1007","volume":"78","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0674-8066","authenticated-orcid":false,"given":"The-Anh","family":"Pham","sequence":"first","affiliation":[]},{"given":"Nang-Toan","family":"Do","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,1]]},"reference":[{"key":"6626_CR1","doi-asserted-by":"crossref","unstructured":"Andoni A, Indyk P (2006) Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In: 2006 47th annual IEEE symposium on foundations of computer science (FOCS\u201906), pp 459\u2013468","DOI":"10.1109\/FOCS.2006.49"},{"key":"6626_CR2","doi-asserted-by":"crossref","unstructured":"Andoni A, Indyk P, Nguyen H L, Razenshteyn I (2014) Beyond locality-sensitive hashing. In: Proceedings of the 25th annual ACM-SIAM symposium on discrete algorithms, SODA \u201914, pp 1018\u20131028","DOI":"10.1137\/1.9781611973402.76"},{"key":"6626_CR3","doi-asserted-by":"crossref","unstructured":"Babenko A, Lempitsky V (2014) Additive quantization for extreme vector compression. In: 2014 IEEE conference on computer vision and pattern recognition, pp 931\u2013938","DOI":"10.1109\/CVPR.2014.124"},{"key":"6626_CR4","doi-asserted-by":"crossref","unstructured":"Babenko A, Lempitsky V (2015) Tree quantization for large-scale similarity search and classification. In: 2015 IEEE conference on computer vision and pattern recognition (CVPR), pp 4240\u20134248","DOI":"10.1109\/CVPR.2015.7299052"},{"issue":"6","key":"6626_CR5","doi-asserted-by":"publisher","first-page":"1247","DOI":"10.1109\/TPAMI.2014.2361319","volume":"37","author":"A Babenko","year":"2015","unstructured":"Babenko A, Lempitsky V (2015) The inverted multi-index. IEEE Trans Pattern Anal Mach Intell 37(6):1247\u20131260","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"6626_CR6","doi-asserted-by":"crossref","unstructured":"Cheng D Y, Gersho A, Ramamurthi B, Shoham Y (1984) Fast search algorithms for vector quantization and pattern matching. In: IEEE international conference on acoustics, speech, and signal processing, ICASSP\u201984, pp 372\u2013375","DOI":"10.1109\/ICASSP.1984.1172352"},{"issue":"3","key":"6626_CR7","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/355744.355745","volume":"3","author":"JH Friedman","year":"1977","unstructured":"Friedman J H, Bentley J L, Finkel R A (1977) An algorithm for finding best matches in logarithmic expected time. ACM Trans Math Softw 3(3):209\u2013226","journal-title":"ACM Trans Math Softw"},{"issue":"4","key":"6626_CR8","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 Pattern Anal Mach Intell 36(4):744\u2013755","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"6626_CR9","doi-asserted-by":"crossref","unstructured":"He J, Liu W, Chang S F (2010) Scalable similarity search with optimized kernel hashing. In: Proceedings of the 16th ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201910, pp 1129\u20131138","DOI":"10.1145\/1835804.1835946"},{"key":"6626_CR10","doi-asserted-by":"crossref","unstructured":"Indyk P, Motwani R (1998) Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of the 13th annual ACM symposium on theory of computing, STOC\u201998, pp 604\u2013613","DOI":"10.1145\/276698.276876"},{"issue":"1","key":"6626_CR11","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 (2011) Product quantization for nearest neighbor search. IEEE Trans Pattern Anal Mach Intell 33(1):117\u2013128","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"6626_CR12","doi-asserted-by":"crossref","unstructured":"Kalantidis Y, Avrithis Y (2014) Locally optimized product quantization for approximate nearest neighbor search. In: Proceedings of international conference on computer vision and pattern recognition (CVPR 2014). Columbus, Ohio, pp 2329\u20132336","DOI":"10.1109\/CVPR.2014.298"},{"key":"6626_CR13","doi-asserted-by":"crossref","unstructured":"Kulis B, Grauman K (2009) Kernelized locality-sensitive hashing for scalable image search. In: IEEE international conference on computer vision, ICCV\u201909, pp 2130\u20132137","DOI":"10.1109\/ICCV.2009.5459466"},{"key":"6626_CR14","doi-asserted-by":"crossref","unstructured":"Leibe B, Mikolajczyk K, Schiele B (2006) Efficient clustering and matching for object class recognition. In: Proceedings of British machine vision conference, BMCV\u201906, pp 789\u2013798","DOI":"10.5244\/C.20.81"},{"key":"6626_CR15","unstructured":"Liu T, Moore A W, Yang K, Gray A G (2004) An investigation of practical approximate nearest neighbor algorithms. In: Saul LK, Weiss Y, Bottou L (eds) Advances in neural information processing systems 17. MIT Press, Cambridge, pp 825\u2013832"},{"key":"6626_CR16","unstructured":"Lv Q, Josephson W, Wang Z, Charikar M, Li K (2007) Multi-probe lsh: efficient indexing for high-dimensional similarity search. In: Proceedings of the 33rd international conference on very large databases, VLDB\u201907, pp 950\u2013961"},{"issue":"9","key":"6626_CR17","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1109\/34.955110","volume":"23","author":"J McNames","year":"2001","unstructured":"McNames J (2001) A fast nearest-neighbor algorithm based on a principal axis search tree. IEEE Trans Pattern Anal Mach Intell 23(9):964\u2013976","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"6626_CR18","unstructured":"Muja M, Lowe D G (2009) Fast approximate nearest neighbors with automatic algorithm configuration. In: Proceedings of international conference on computer vision theory and applications, VISAPP\u201909, pp 331\u2013340"},{"key":"6626_CR19","doi-asserted-by":"crossref","unstructured":"Muja M, Lowe D G (2012) Fast matching of binary features. In: Proceedings of the 9th conference on computer and robot vision, CRV\u201912, pp 404\u2013410","DOI":"10.1109\/CRV.2012.60"},{"key":"6626_CR20","doi-asserted-by":"publisher","first-page":"2227","DOI":"10.1109\/TPAMI.2014.2321376","volume":"36","author":"M Muja","year":"2014","unstructured":"Muja M, Lowe D G (2014) Scalable nearest neighbor algorithms for high dimensional data. IEEE Trans Pattern Anal Mach Intell 36:2227\u20132240","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"6626_CR21","doi-asserted-by":"crossref","unstructured":"Nister D, Stewenius H (2006) Scalable recognition with a vocabulary tree. In: Proceedings of the 2006 IEEE computer society conference on computer vision and pattern recognition, CVPR\u201906, vol 2, pp 2161\u20132168","DOI":"10.1109\/CVPR.2006.264"},{"key":"6626_CR22","doi-asserted-by":"crossref","unstructured":"Norouzi M, Fleet D J (2013) Cartesian k-means. In: Proceedings of the 2013 IEEE conference on computer vision and pattern recognition, CVPR \u201913, pp 3017\u20133024","DOI":"10.1109\/CVPR.2013.388"},{"key":"6626_CR23","doi-asserted-by":"crossref","unstructured":"Panigrahy R (2006) Entropy based nearest neighbor search in high dimensions. In: Proceedings of the 17th annual ACM-SIAM symposium on discrete algorithm, SODA\u201906, pp 1186\u20131195","DOI":"10.1145\/1109557.1109688"},{"issue":"1","key":"6626_CR24","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.cviu.2016.07.011","volume":"154","author":"TA Pham","year":"2017","unstructured":"Pham T A (2017) Pair-wisely optimized clustering tree for feature indexing. Comput Vis Image Underst 154(1):35\u201347","journal-title":"Comput Vis Image Underst"},{"key":"6626_CR25","doi-asserted-by":"crossref","unstructured":"Pham T A, Barrat S, Delalandre M, Ramel J Y (2013) An efficient indexing scheme based on linked-node m-ary tree structure. In: 17th international conference on image analysis and processing (ICIAP 2013), vol 8156. LNCS, pp 752\u2013762","DOI":"10.1007\/978-3-642-41181-6_76"},{"issue":"1","key":"6626_CR26","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.patrec.2014.08.006","volume":"55","author":"TA Pham","year":"2015","unstructured":"Pham T A, Barrat S, Delalandre M, Ramel J Y (2015) An efficient tree structure for indexing feature vectors. Pattern Recogn Lett 55(1):42\u201350","journal-title":"Pattern Recogn Lett"},{"key":"6626_CR27","doi-asserted-by":"crossref","unstructured":"Popescu A, Spyromitros-Xioufis E, Papadopoulos S, Le Borgne H, Kompatsiaris I (2015) Toward an automatic evaluation of retrieval performance with large scale image collections. In: Proceedings of the 2015 workshop on community-organized multimodal mining: opportunities for novel solutions, MMCommons \u201915, pp 7\u201312","DOI":"10.1145\/2814815.2814819"},{"key":"6626_CR28","doi-asserted-by":"crossref","unstructured":"Silpa-Anan C, Hartley R (2008) Optimised kd-trees for fast image descriptor matching. In: IEEE conference on computer vision and pattern recognition, CVPR\u201908, pp 1\u20138","DOI":"10.1109\/CVPR.2008.4587638"},{"key":"6626_CR29","unstructured":"Simonyan K, Zisserman A (2014) Very deep convolutional networks for large-scale image recognition. arXiv:\n                    1409.1556"},{"key":"6626_CR30","unstructured":"Wang J, Shen HT, Song J, Ji J (2014) Hashing for similarity search: a survey. arXiv:\n                    1408.2927"},{"key":"6626_CR31","unstructured":"Zhang T, Du C, Wang J (2014) Composite quantization for approximate nearest neighbor search. In: Proceedings of the 31st international conference on machine learning (ICML-14), pp 838\u2013846"},{"key":"6626_CR32","doi-asserted-by":"crossref","unstructured":"Zhang T, Qi G J, Tang J, Wang J (2015) Sparse composite quantization. In: Proceedings of international conference on computer vision and pattern recognition (CVPR\u201915), pp 4548\u20134556","DOI":"10.1109\/CVPR.2015.7299085"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-018-6626-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11042-018-6626-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-018-6626-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,31]],"date-time":"2019-08-31T20:09:34Z","timestamp":1567282174000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11042-018-6626-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,1]]},"references-count":32,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["6626"],"URL":"https:\/\/doi.org\/10.1007\/s11042-018-6626-9","relation":{},"ISSN":["1380-7501","1573-7721"],"issn-type":[{"value":"1380-7501","type":"print"},{"value":"1573-7721","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9,1]]},"assertion":[{"value":"8 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 March 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 August 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 September 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}