{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:39:59Z","timestamp":1760240399005,"version":"build-2065373602"},"reference-count":33,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61402165, 61702560"],"award-info":[{"award-number":["61402165, 61702560"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Key Research Program of Hunan Province","award":["2016JC2018, 2018GK2052"],"award-info":[{"award-number":["2016JC2018, 2018GK2052"]}]},{"DOI":"10.13039\/501100004735","name":"Natural Science Foundation of Hunan Province","doi-asserted-by":"publisher","award":["2018JJ2099"],"award-info":[{"award-number":["2018JJ2099"]}],"id":[{"id":"10.13039\/501100004735","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>Image retrieval or content-based image retrieval (CBIR) can be transformed into the calculation of the distance between image feature vectors. The closer the vectors are, the higher the image similarity will be. In the image retrieval system for large-scale dataset, the approximate nearest-neighbor (ANN) search can quickly obtain the top k images closest to the query image, which is the Top-k problem in the field of information retrieval. With the traditional ANN algorithms, such as KD-Tree, R-Tree, and M-Tree, when the dimension of the image feature vector increases, the computing time will increase exponentially due to the curse of dimensionality. In order to reduce the calculation time and improve the efficiency of image retrieval, we propose an ANN search algorithm based on the Product Quantization Table (PQTable). After quantizing and compressing the image feature vectors by the product quantization algorithm, we can construct the image index structure of the PQTable, which speeds up image retrieval. We also propose a multi-PQTable query strategy for ANN search. Besides, we generate several nearest-neighbor vectors for each sub-compressed vector of the query vector to reduce the failure rate and improve the recall in image retrieval. Through theoretical analysis and experimental verification, it is proved that the multi-PQTable query strategy and the generation of several nearest-neighbor vectors are greatly correct and efficient.<\/jats:p>","DOI":"10.3390\/info10060190","type":"journal-article","created":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T02:08:40Z","timestamp":1559527720000},"page":"190","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Multi-PQTable for Approximate Nearest-Neighbor Search"],"prefix":"10.3390","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9509-0755","authenticated-orcid":false,"given":"Xinpan","family":"Yuan","sequence":"first","affiliation":[{"name":"School of Computer, Hunan University of Technology, Zhuzhou 412000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qunfeng","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Central South University, Changsha 410083, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0163-0007","authenticated-orcid":false,"given":"Jun","family":"Long","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Central South University, Changsha 410083, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Hu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Central South University, Changsha 410083, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Songlin","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer, Hunan University of Technology, Zhuzhou 412000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2019,6,1]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1023\/B:VISI.0000029664.99615.94","article-title":"Distinctive Image Features from Scale-Invariant Keypoints","volume":"60","author":"Lowe","year":"2004","journal-title":"Int. J. Comput. Vis."},{"doi-asserted-by":"crossref","unstructured":"Figat, J., Kornuta, T., and Kasprzak, W. (2014, January 15\u201317). Performance Evaluation of Binary Descriptors of Local Features. Proceedings of the International Conference on Computer Vision and Graphics, Warsaw, Poland.","key":"ref_2","DOI":"10.1007\/978-3-319-11331-9_23"},{"doi-asserted-by":"crossref","unstructured":"Bay, H., Tuytelaars, T., and Gool, L.V. (2006). SURF: Speeded Up Robust Features. European Conference on Computer Vision, Springer.","key":"ref_3","DOI":"10.1007\/11744023_32"},{"key":"ref_4","first-page":"141","article-title":"Face Antispoofing Using Speeded-Up Robust Features and Fisher Vector Encoding","volume":"24","author":"Boulkenafet","year":"2017","journal-title":"IEEE Signal Process. Lett."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1023\/A:1011139631724","article-title":"Modeling the Shape of the Scene: A Holistic Representation of the Spatial Envelope","volume":"42","author":"Oliva","year":"2001","journal-title":"Int. J. Comput. Vis."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0079-6123(06)55002-2","article-title":"Building the gist of a scene: The role of global image features in recognition","volume":"155","author":"Oliva","year":"2006","journal-title":"Prog. Brain Res."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/j.patrec.2015.03.010","article-title":"Exponential family Fisher vector for image classification","volume":"59","author":"Redolfi","year":"2015","journal-title":"Pattern Recognit. Lett."},{"doi-asserted-by":"crossref","unstructured":"J\u00e9gou, H., Douze, M., Schmid, C., and P\u00e9rez, P. (2010, January 13\u201318). Aggregating local descriptors into a compact image representation. Proceedings of the IEEE Conference on Computer Vision & Pattern Recognition, San Francisco, CA, USA.","key":"ref_8","DOI":"10.1109\/CVPR.2010.5540039"},{"doi-asserted-by":"crossref","unstructured":"Amato, G., Bolettieri, P., Falchi, F., and Gennaro, C. (2013). Large Scale Image Retrieval Using Vector of Locally Aggregated Descriptors. International Conference on Similarity Search & Applications, Springer.","key":"ref_9","DOI":"10.1007\/978-3-642-41062-8_25"},{"unstructured":"Sun, P.X., Lin, H.T., and Luo, T. (2016, January 5\u20138). Learning discriminative CNN features and similarity metrics for image retrieval. Proceedings of the IEEE International Conference on Signal Processing, Communications and Computing, Hong Kong, China.","key":"ref_10"},{"unstructured":"Fu, R., Li, B., Gao, Y., and Wang, P. (2016, January 14\u201317). Content-based image retrieval based on CNN and SVM. Proceedings of the IEEE International Conference on Computer and Communications, Chengdu, China.","key":"ref_11"},{"doi-asserted-by":"crossref","unstructured":"Melekhov, I., Kannala, J., and Rahtu, E. (2016, January 4\u20138). Siamese network features for image matching. Proceedings of the International Conference on Pattern Recognition, Cancun, Mexico.","key":"ref_12","DOI":"10.1109\/ICPR.2016.7899663"},{"unstructured":"Appalaraju, S., and Chaoji, V. (2017). Image Similarity Using Deep CNN and Curriculum Learning. arXiv.","key":"ref_13"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1049\/el.2017.3620","article-title":"Deep binary constraint hashing for fast image retrieval","volume":"54","author":"Li","year":"2018","journal-title":"Electron. Lett."},{"doi-asserted-by":"crossref","unstructured":"Hoffer, E., and Ailon, N. (2015). Deep Metric Learning Using Triplet Network. Similarity-Based Pattern Recognition, Springer.","key":"ref_15","DOI":"10.1007\/978-3-319-24261-3_7"},{"doi-asserted-by":"crossref","unstructured":"Schroff, F., Kalenichenko, D., and Philbin, J. (2015, January 7\u201312). FaceNet: A unified embedding for face recognition and clustering. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Boston, MA, USA.","key":"ref_16","DOI":"10.1109\/CVPR.2015.7298682"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1109\/JSTARS.2017.2761800","article-title":"Scene Classification via Triplet Networks","volume":"11","author":"Liu","year":"2018","journal-title":"IEEE J. Sel. Top. Appl. Earth Obs. Remote Sens."},{"unstructured":"Kumar, Y.S., and Pavithra, N. (2015, January 9\u201311). KD-Tree approach in sketch based image retrieval. Proceedings of the International Conference on Mining Intelligence and Knowledge Exploration, Hyderabad, India.","key":"ref_18"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"1219","DOI":"10.1109\/TKDE.2010.82","article-title":"Clustering Uncertain Data Using Voronoi Diagrams and R-Tree Index","volume":"22","author":"Kao","year":"2010","journal-title":"IEEE Trans. Knowl. Data Eng."},{"doi-asserted-by":"crossref","unstructured":"Viet, H.H., and Anh, D.T. (2013, January 21\u201324). M-tree as an index structure for time series data. Proceedings of the International Conference on Computing, Management and Telecommunications, Ho Chi Minh City, Vietnam.","key":"ref_20","DOI":"10.1109\/ComManTel.2013.6482381"},{"doi-asserted-by":"crossref","unstructured":"Wieschollek, P., Wang, O., Sorkine-Hornung, A., and Lensch, H. (2017, January 27\u201330). Efficient Large-scale Approximate Nearest Neighbor Search on the GPU. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Las Vegas, NV, USA.","key":"ref_21","DOI":"10.1109\/CVPR.2016.223"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1348","DOI":"10.1016\/j.patrec.2010.04.004","article-title":"Locality sensitive hashing: A comparison of hash function types and querying mechanisms","volume":"31","author":"Amsaleg","year":"2010","journal-title":"Pattern Recognit. Lett."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1007\/s11192-017-2569-6","article-title":"Use of locality sensitive hashing (LSH) algorithm to match Web of Science and Scopus","volume":"116","author":"Abdulhayoglu","year":"2018","journal-title":"Scientometrics"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1109\/TPAMI.2010.57","article-title":"Product Quantization for Nearest Neighbor Search","volume":"33","author":"Douze","year":"2011","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"doi-asserted-by":"crossref","unstructured":"Ge, T., He, K., Ke, Q., and Sun, J. (2013, January 23\u201328). Optimized Product Quantization for Approximate Nearest Neighbor Search. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Portland, OR, USA.","key":"ref_25","DOI":"10.1109\/CVPR.2013.379"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"744","DOI":"10.1109\/TPAMI.2013.240","article-title":"Optimized Product Quantization","volume":"36","author":"Ge","year":"2014","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"doi-asserted-by":"crossref","unstructured":"Kalantidis, Y., and Avrithis, Y. (2018, May 15). Locally Optimized Product Quantization for Approximate Nearest Neighbor Search. Available online: http:\/\/openaccess.thecvf.com\/content_cvpr_2014\/papers\/Kalantidis_Locally_Optimized_Product_2014_CVPR_paper.pdf.","key":"ref_27","DOI":"10.1109\/CVPR.2014.298"},{"unstructured":"Martinez, J., Hoos, H.H., and Little, J.J. (2014). Stacked Quantizers for Compositional Vector Compression. arXiv.","key":"ref_28"},{"doi-asserted-by":"crossref","unstructured":"Wang, J., Li, Z., Du, Y., and Qu, W. (2016, January 23\u201326). Stacked Product Quantization for Nearest Neighbor Search on Large Datasets. Proceedings of the IEEE Trustcom, Tianjin, China.","key":"ref_29","DOI":"10.1109\/TrustCom.2016.0250"},{"doi-asserted-by":"crossref","unstructured":"Babenko, A., and Lempitsky, V. (2014, January 23\u201328). Additive Quantization for Extreme Vector Compression. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Columbus, OH, USA.","key":"ref_30","DOI":"10.1109\/CVPR.2014.124"},{"doi-asserted-by":"crossref","unstructured":"Yuan, X., Liu, Q., Long, J., Hu, L., and Wang, Y. (2019). Deep Image Similarity Measurement based on the Improved Triplet Network with Spatial Pyramid Pooling. Information, 10.","key":"ref_31","DOI":"10.3390\/info10040129"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"74","DOI":"10.3934\/ElectrEng.2017.1.74","article-title":"Real-time indoor assistive localization with mobile omnidirectional vision and cloud GPU acceleration","volume":"1","author":"Hu","year":"2017","journal-title":"AIMS Electron. Electr. Eng."},{"unstructured":"Bing, Z., and Xin-xin, Y.A. (2010, January 25\u201327). A content-based parallel image retrieval system. Proceedings of the International Conference on Computer Design and Applications (ICCDA), Qinhuangdao, China.","key":"ref_33"}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/10\/6\/190\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T12:55:30Z","timestamp":1760187330000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/10\/6\/190"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,1]]},"references-count":33,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2019,6]]}},"alternative-id":["info10060190"],"URL":"https:\/\/doi.org\/10.3390\/info10060190","relation":{},"ISSN":["2078-2489"],"issn-type":[{"type":"electronic","value":"2078-2489"}],"subject":[],"published":{"date-parts":[[2019,6,1]]}}}