Results 21 to 30 of about 29,958 (160)
Two-Pass K Nearest Neighbor Search for Feature Tracking
IEEE Access, 2018 In recent years, feature tracking has become one of the most important research topics in computer vision. Many efforts have been made to design excellent feature matching methods. For large-scale structure from motion, however, existing feature tracking
Mingwei Cao +5 more
doaj +1 more source
Simultaneous Nearest Neighbor Search
, 2016 Motivated by applications in computer vision and databases, we introduce and study the Simultaneous Nearest Neighbor Search (SNN) problem. Given a set of data points, the goal of SNN is to design a data structure that, given a collection of queries, finds a collection of close points that are compatible with each other. Formally, we are given $k$ query
Indyk, Piotr +3 more
openaire +5 more sources
Continuous Nearest Neighbor Search [PDF]
, 2002 A continuous nearest neighbor query retrieves the nearest neighbor (NN) of every point on a line segment (e.g., "find all my nearest gas stations during my route from points to point e. The result contains a set of (point, interval) tuples, such that point is the NN of all points in the corresponding interval.
Yufei Tao +2 more
openaire +1 more source
Privacy Preserving Nearest Neighbor Search [PDF]
Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06), 2006 Data mining is frequently obstructed by privacy concerns. In many cases data is distributed, and bringing the data together in one place for analysis is not possible due to privacy laws (e.g. HIPAA) or policies. Privacy preserving data mining techniques have been developed to address this issue by providing mechanisms to mine the data while giving ...
Mark Shaneck, Yongdae Kim, Vipin Kumar
openaire +1 more source
Self-supervised Action Recognition Based on Skeleton Data Augmentation and Double Nearest Neighbor Retrieval [PDF]
Jisuanji kexue, 2023 Traditional self-supervised methods based on skeleton data often take different data augmentation of a sample as positive examples,and the rest of the samples are regarded as negative examples,which makes the ratio of positive and negative samples ...
WU Yushan, XU Zengmin, ZHANG Xuelian, WANG Tao
doaj +1 more source
Population-Based Novelty Searches Can Converge
Proceedings of the International Florida Artificial Intelligence Research Society Conference, 2021 Novelty search is a powerful tool for finding sets of complex objects in complicated, open-ended spaces. Recent empirical analysis on a simplified version of novelty search makes it clear that novelty search happens at the level of the archive space, not
R. Paul Wiegand
doaj +1 more source
GGNN: Graph-Based GPU Nearest Neighbor Search
IEEE Transactions on Big Data, 2023 Approximate nearest neighbor (ANN) search in high dimensions is an integral part of several computer vision systems and gains importance in deep learning with explicit memory representations. Since PQT, FAISS, and SONG started to leverage the massive parallelism offered by GPUs, GPU-based implementations are a crucial resource for today's state-of-the ...
Fabian Groh +3 more
openaire +2 more sources
Enhancing SR-Tree for Nearest Neighbor Search
IEEE AccessNearest neighbor search, also known as k-nearest neighbors (kNN), has become one of the essential backbones in machine learning and data mining tasks, particularly in multidimensional dynamic and evolving data environments. While dynamic index structures
Kayumov Abduaziz +2 more
doaj +1 more source
Privacy-Preserving Public Route Planning Based on Passenger Capacity
Mathematics, 2023 Precise route planning needs huge amounts of trajectory data recorded in multimedia devices. The data, including each user’s location privacy, are stored as cipher text.
Xin Zhang +3 more
doaj +1 more source
Hardness of approximate nearest neighbor search [PDF]
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018 We prove conditional near-quadratic running time lower bounds for approximate Bichromatic Closest Pair with Euclidean, Manhattan, Hamming, or edit distance. Specifically, unless the Strong Exponential Time Hypothesis (SETH) is false, for every $ >0$ there exists a constant $ >0$ such that computing a $(1+ )$-approximation to the Bichromatic ...
openaire +2 more sources