Approximate Nearest Neighbor Search by Residual Vector Quantization [PDF]
A recently proposed product quantization method is efficient for large scale approximate nearest neighbor search, however, its performance on unstructured vectors is limited.
Cheng Wang, Tao Guan, Yongjian Chen
doaj +7 more sources
Multi-PQTable for Approximate Nearest-Neighbor Search [PDF]
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.
Xinpan Yuan +4 more
doaj +3 more sources
Competitive Quantization for Approximate Nearest Neighbor Search [PDF]
In this study, we propose a novel vector quantization algorithm for Approximate Nearest Neighbor (ANN) search, based on a joint competitive learning strategy and hence called as competitive quantization (CompQ). CompQ is a hierarchical algorithm, which iteratively minimizes the quantization error by jointly optimizing the codebooks in each layer, using
Ezgi Can Ozan +2 more
exaly +5 more sources
Accumulative Quantization for Approximate Nearest Neighbor Search. [PDF]
To further improve the approximate nearest neighbor (ANN) search performance, an accumulative quantization (AQ) is proposed and applied to effective ANN search. It approximates a vector with the accumulation of several centroids, each of which is selected from a different codebook.
Ai L +6 more
europepmc +4 more sources
Capacity-Limited Failure in Approximate Nearest Neighbor Search on Image Embedding Spaces [PDF]
Similarity search on image embeddings is a common practice for image retrieval in machine learning and pattern recognition systems. Approximate nearest neighbor (ANN) methods enable scalable similarity search on large datasets, often approaching sub ...
Morgan Roy Cooper, Mike Busch
doaj +2 more sources
ON-NSW: Accelerating High-Dimensional Vector Search on Edge Devices with GPU-Optimized NSW [PDF]
The Industrial Internet of Things (IIoT) increasingly relies on vector embeddings for analytics and AI-driven applications such as anomaly detection, predictive maintenance, and sensor fusion.
Taeyoon Park +3 more
doaj +2 more sources
Binary Hashing for Approximate Nearest Neighbor Search on Big Data: A Survey
Nearest neighbor search is a fundamental problem in various domains, such as computer vision, data mining, and machine learning. With the explosive growth of data on the Internet, many new data structures using spatial partitions and recursive hyperplane
Yuan Cao +6 more
doaj +3 more sources
Approximate Nearest Neighbor Search Based on Neighbor Graphs with Parameter Adaptation [PDF]
Approximate Nearest Neighbor Search(ANNS) algorithms based on neighbor graphs typically organize vectors in a database into a neighbor graph structure and obtain the Approximate Nearest Neighbor(ANN) of the query vector by leveraging user-specified ...
GAN Hongnan, ZHANG Kai
doaj +1 more source
Leveraging a foundation model zoo for cell similarity search in oncological microscopy across devices [PDF]
BackgroundCellular imaging analysis using the traditional retrospective approach is extremely time-consuming and labor-intensive. Although AI-based solutions are available, these approaches rely heavily on supervised learning techniques that require high
Gabriel Kalweit +32 more
doaj +2 more sources
Secure Cloud-Aided Approximate Nearest Neighbor Search on High-Dimensional Data
As one fundamental data-mining problem, ANN (approximate nearest neighbor search) is widely used in many industries including computer vision, information retrieval, and recommendation system.
Jia Liu +7 more
doaj +1 more source

