Results 11 to 20 of about 29,958 (160)
Product Quantization for Nearest Neighbor Search [PDF]
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2011 This paper introduces a product quantization-based approach for approximate nearest neighbor search. The idea is to decompose the space into a Cartesian product of low-dimensional subspaces and to quantize each subspace separately. A vector is represented by a short code composed of its subspace quantization indices.
Jégou, Hervé +2 more
openaire +6 more sources
Nearest-Neighbor Searching Under Uncertainty II [PDF]
ACM Transactions on Algorithms, 2013 Nearest-neighbor search, which returns the nearest neighbor of a query point in a set of points, is an important and widely studied problem in many fields, and it has a wide range of applications. In many of them, such as sensor databases, location-based services, face recognition, and mobile data, the location of data is imprecise.
Agarwal, Pankaj Kumar +5 more
openaire +4 more sources
Nearest Neighbor Search in the Metric Space of a Complex Network for Community Detection
Information, 2016 The objective of this article is to bridge the gap between two important research directions: (1) nearest neighbor search, which is a fundamental computational tool for large data analysis; and (2) complex network analysis, which deals with large real ...
Suman Saha, Satya P. Ghrera
doaj +1 more source
APPROXIMATE NEAREST NEIGHBOR SEARCH IN HIGH DIMENSIONS [PDF]
Proceedings of the International Congress of Mathematicians (ICM 2018), 2019 27 pages, no figures; to appear in the proceedings of ICM 2018 (accompanying the talk by P. Indyk)
Andoni, Alexandr +2 more
openaire +3 more sources
Multi-PQTable for Approximate Nearest-Neighbor Search
Information, 2019 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 +1 more source
Approximate Nearest Neighbor Search on Standard Search Engines
, 2022 Approximate search for high-dimensional vectors is commonly addressed using dedicated techniques often combined with hardware acceleration provided by GPUs, FPGAs, and other custom in-memory silicon. Despite their effectiveness, harmonizing those optimized solutions with other types of searches often poses technological difficulties.
Carrara F +3 more
openaire +3 more sources
Partially Specified Nearest Neighbor Search [PDF]
, 2012 We study the Partial Nearest Neighbor Problem that consists in preprocessing n points \(\mathcal{D}\) from d-dimensional metric space such that the following query can be answered efficiently: Given a query vector Q ∈ ℝ d and an axes-aligned query subspace represented by S ∈ {0,1} d , report a point \(P \in \mathcal{D}\) with d S (Q,P) ≤ d S (Q,P′) for
Tomas Hruz, Marcel Schöngens
openaire +3 more sources
A Nearest Neighbor Search Algorithm for LR-LD on High SNR [PDF]
International Journal of Networked and Distributed Computing (IJNDC), 2016 This paper presents a new chaos-based image cipher using a plaintext-related permutation. The cat map and Lorenz system are employed to shuffle the positions of image pixels and generate the diffusion keystream, respectively.
Thae Thae Yu Khine +3 more
doaj +1 more source
Associative Memories to Accelerate Approximate Nearest Neighbor Search
Applied Sciences, 2018 Nearest neighbor search is a very active field in machine learning. It appears in many application cases, including classification and object retrieval.
Vincent Gripon +2 more
doaj +1 more source
A Hybrid Spatial Indexing Structure of Massive Point Cloud Based on Octree and 3D R*-Tree
Applied Sciences, 2021 The spatial index structure is one of the most important research topics for organizing and managing massive 3D Point Cloud. As a point in Point Cloud consists of Cartesian coordinates (x,y,z), the common method to explore geometric information and ...
Wei Wang +5 more
doaj +1 more source