Image classification based on quantum K-Nearest-Neighbor algorithm

被引:0
|
作者
Yijie Dang
Nan Jiang
Hao Hu
Zhuoxiao Ji
Wenyin Zhang
机构
[1] Beijing University of Technology,Faculty of Information Technology
[2] Beijing Key Laboratory of Trusted Computing,School of Information Science and Technology
[3] National Engineering Laboratory for Critical Technologies of Information Security Classified Protection,undefined
[4] Linyi University,undefined
来源
关键词
Quantum K-Nearest-Neighbor; Quantum image classification; Quantum image processing; Machine learning; Quantum intelligence computation;
D O I
暂无
中图分类号
学科分类号
摘要
Image classification is an important task in the field of machine learning and image processing. However, common classification method, the K-Nearest-Neighbor algorithm, has high complexity, because its two main processes: similarity computing and searching, are time-consuming. Especially in the era of big data, the problem is prominent when the amount of images to be classified is large. In this paper, we try to use the powerful parallel computing ability of quantum computers to optimize the efficiency of image classification. The scheme is based on quantum K-Nearest-Neighbor algorithm. Firstly, the feature vectors of images are extracted on classical computers. Then, the feature vectors are inputted into a quantum superposition state, which is used to achieve parallel computing of similarity. Next, the quantum minimum search algorithm is used to speed up searching process for similarity. Finally, the image is classified by quantum measurement. The complexity of the quantum algorithm is only O(kM)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$O(\sqrt{kM})$$\end{document}, which is superior to the classical algorithms. Moreover, the measurement step is executed only once to ensure the validity of the scheme. The experimental results show that the classification accuracy is 83.1%\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$83.1\%$$\end{document} on Graz-01 dataset and 78%\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$78\%$$\end{document} on Caltech-101 dataset, which is close to existing classical algorithms. Hence, our quantum scheme has a good classification performance while greatly improving the efficiency.
引用
收藏
相关论文
共 50 条
  • [21] Kernel-induced distance K-nearest-neighbor algorithm
    Wu, Xiaohong
    Zhou, Janjiang
    DYNAMICS OF CONTINUOUS DISCRETE AND IMPULSIVE SYSTEMS-SERIES B-APPLICATIONS & ALGORITHMS, 2006, 13 : 757 - 759
  • [22] Accelerating k-nearest-neighbor searches
    Bernstein, Herbert J.
    Andrews, Lawrence C.
    JOURNAL OF APPLIED CRYSTALLOGRAPHY, 2016, 49 : 1471 - 1477
  • [23] DEVELOPMENT OF A NOVEL WEIGHTING SCHEME FOR THE K-NEAREST-NEIGHBOR ALGORITHM
    FORBES, RA
    TEWS, EC
    FREISER, BS
    WISE, MB
    PERONE, SP
    JOURNAL OF CHEMICAL INFORMATION AND COMPUTER SCIENCES, 1986, 26 (03): : 93 - 98
  • [24] Quantum K nearest neighbor algorithm
    Li, Qiang
    Jiang, Jing-Ping
    Xi Tong Gong Cheng Yu Dian Zi Ji Shu/Systems Engineering and Electronics, 2008, 30 (05): : 940 - 943
  • [25] An Enhanced Quantum K-Nearest Neighbor Classification Algorithm Based on Polar Distance
    Feng, Congcong
    Zhao, Bo
    Zhou, Xin
    Ding, Xiaodong
    Shan, Zheng
    ENTROPY, 2023, 25 (01)
  • [26] An agglomerative clustering algorithm using a dynamic k-nearest-neighbor list
    Lai, Jim Z. C.
    Huang, Tsung-Jen
    INFORMATION SCIENCES, 2011, 181 (09) : 1722 - 1734
  • [27] An Improved Algorithm for k-Nearest-Neighbor Finding and Surface Normals Estimation
    赵灿
    孟祥林
    Tsinghua Science and Technology, 2009, 14(S1) (S1) : 77 - 81
  • [28] The k-Nearest-Neighbor Voronoi Diagram Revisited
    Liu, Chih-Hung
    Papadopoulou, Evanthia
    Lee, Der-Tsai
    ALGORITHMICA, 2015, 71 (02) : 429 - 449
  • [29] Adaptive soft k-nearest-neighbor classifiers
    Bermejo, S
    Cabestany, J
    PATTERN RECOGNITION, 1999, 32 (12) : 2077 - 2079
  • [30] k-nearest-neighbor clustering and percolation theory
    Teng, Shang-Hua
    Yao, Frances F.
    ALGORITHMICA, 2007, 49 (03) : 192 - 211