EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

A fast image matching algorithm based on locality-sensitive hashing

Zhijun Song, Qiang Wang, Xiaoyan Yang, Jinhua Sun, Weiwei Zhuang, Yuping Song, Wei Li

Discover Artificial Intelligence · 27.03.2026 · 6 (1)

DOI: 10.1007/s44163-026-01151-0 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Discover Artificial Intelligence, online erschienen am 27.03.2026. Verfasst von Zhijun Song und 6 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 41 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: This work was supported in part by Ministry of Education of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The exponential growth of multimedia data in today’s highly digitized, mobile-centric society poses formidable challenges to efficient data storage and rapid information retrieval. To overcome these bottlenecks, we introduce ViT-LSH, a highly optimized algorithm that seamlessly integrates Vision Transformer (ViT) with locality-sensitive hashing (LSH) to deliver unprecedented image matching accuracy and retrieval speeds. The superiority of ViT-LSH stems from its dual-engine architecture. First, the ViT module revolutionizes feature extraction by dividing images into fixed-size patches and projecting them into token sequences without relying on down-sampling. This perfectly preserves the original image resolution and achieves exceptional global information modeling for semantic segmentation. Second, the LSH module drastically minimizes space consumption and accelerates query processing by mapping proximate data points to identical hash values. Evaluated against five existing baseline schemes, our LSH approach demonstrates vastly superior time and space efficiency while guaranteeing highly accurate approximate nearest neighbor queries. The proposed algorithm follows a streamlined, robust pipeline: image preprocessing (e.g., denoising) and segmentation, followed by ViT-driven feature extraction, dimensionality reduction, and LSH-based hash coding. By utilizing Hamming distance for direct similarity calculation, the system achieves ultra-fast sorting and matching. Extensive experimental results unequivocally validate that ViT-LSH provides a massive leap forward in both the computational efficiency and precision of large-scale image matching.

Förderung

  • This work was supported in part by Ministry of Education of China

Zitieren

APA

Song, Z., Wang, Q., Yang, X., Sun, J., Zhuang, W., Song, Y., & Li, W. (2026). A fast image matching algorithm based on locality-sensitive hashing. Discover Artificial Intelligence, 6(1). https://doi.org/10.1007/s44163-026-01151-0

Vancouver

Song Z, Wang Q, Yang X, Sun J, Zhuang W, Song Y, et al. A fast image matching algorithm based on locality-sensitive hashing. Discover Artificial Intelligence. 2026;6(1). doi:10.1007/s44163-026-01151-0

BibTeX
@article{Song2026,
  author = {Song, Zhijun and Wang, Qiang and Yang, Xiaoyan and Sun, Jinhua and Zhuang, Weiwei and Song, Yuping and Li, Wei},
  title = {A fast image matching algorithm based on locality-sensitive hashing},
  journal = {Discover Artificial Intelligence},
  year = {2026},
  volume = {6},
  number = {1},
  doi = {10.1007/s44163-026-01151-0}
}
Kostenlos starten →