Results 141 to 150 of about 70,489 (181)

Approximate nearest neighbor search on HDD

2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops, 2009
Nearest Neighbor (NN) search plays important roles in Computer Vision algorithms. Especially, NN search on immensely large amount of image data set stored on the Internet is getting highlighted. For dealing with such huge data, main memory of a single PC is insufficient.
Noritaka Himei, Toshikazu Wada
openaire   +1 more source

Projection search for approximate nearest neighbor

2016 17th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD), 2016
Many existing approaches to speed up the nearest neighbor search are based on spatial partition trees, which search the nearest neighbor for a query sample by traversing the tree data structure in a guided depth-first manner. However, this search manner is generally observed to find the exact nearest neighbor at a early time, and spend the remaining ...
Cheng Feng, Bo Yang
openaire   +1 more source

SONG: Approximate Nearest Neighbor Search on GPU

2020 IEEE 36th International Conference on Data Engineering (ICDE), 2020
Approximate nearest neighbor (ANN) searching is a fundamental problem in computer science with numerous applications in (e.g.,) machine learning and data mining. Recent studies show that graph-based ANN methods often outperform other types of ANN algorithms.
Weijie Zhao, Shulong Tan, Ping Li
openaire   +1 more source

Expected-Case Complexity of Approximate Nearest Neighbor Searching

SIAM Journal on Computing, 2003
Summary: Most research in algorithms for geometric query problems has focused on their worst-case performance. However, when information on the query distribution is available, the alternative paradigm of designing and analyzing algorithms from the perspective of expected-case performance appears more attractive.
Arya, Sunil, Fu, HYA
openaire   +3 more sources

Trinary-Projection Trees for Approximate Nearest Neighbor Search

IEEE Transactions on Pattern Analysis and Machine Intelligence, 2014
We address the problem of approximate nearest neighbor (ANN) search for visual descriptor indexing. Most spatial partition trees, such as KD trees, VP trees, and so on, follow the hierarchical binary space partitioning framework. The key effort is to design different partition functions (hyperplane or hypersphere) to divide the points so that 1) the ...
Wang, Jingdong, Wang, Naiyan, Jia, You, Li, Jian, Zeng, Gang, Zha, Hongbin, Hua, Xian-Sheng   +6 more
openaire   +3 more sources

Fast Approximate Nearest Neighbor Search via k-Diverse Nearest Neighbor Graph

Proceedings of the AAAI Conference on Artificial Intelligence, 2018
Approximate nearest neighbor search is a fundamental problem and has been studied for a few decades. Recently graph-based indexing methods have demonstrated their great efficiency, whose main idea is to construct neighborhood graph offline and perform a greedy search starting from some sampled points of the graph online.
Yan Xiao, Jiafeng Guo, Yanyan Lan, Jun Xu, Xueqi Cheng   +4 more
openaire   +1 more source

Approximate Nearest Neighbor Search under Translation Invariant Hausdorff Distance

International Journal of Computational Geometry & Applications, 2008
We present an embedding and search reduction which allow us to build the first data structure for the nearest neighbor search among small point sets with respect to the directed Hausdorff distance under translation. The search structure is non-heuristic in the sense that the quality of the results, the performance, and the space bound are guaranteed.
Knauer, Christian, Scherfenberg, Marc
openaire   +2 more sources

Supporting subseries nearest neighbor search via approximation

Proceedings of the ninth international conference on Information and knowledge management, 2000
Searc hingfor nearest neigh b orsin a large set of time series is an importan tdata mining task. This paper studies the following type of time series nearest neighbor queries: Given a query series and a starting time, among all the subseries (of a collection of data series) that have the same length as the query series and start at the given time, nd ...
Changzhou Wang, X. Sean Wang
openaire   +1 more source

Approximate nearest neighbor searching in multimedia databases

Proceedings 17th International Conference on Data Engineering, 2002
Develops a general framework for approximate nearest-neighbor queries. We categorize the current approaches for nearest-neighbor query processing based on either their ability to reduce the data set that needs to be examined, or their ability to reduce the representation size of each data object.
H. Ferhatosmanoglu, E. Tuncel, D. Agrawal, A. El Abbadi   +3 more
openaire   +1 more source

M-PCA Binary Embedding for Approximate Nearest Neighbor Search

2015 IEEE Trustcom/BigDataSE/ISPA, 2015
Principal Component Analysis (PCA) is widely used within binary embedding methods for approximate nearest neighbor search and has proven to have a significant effect on the performance. Current methods aim to represent the whole data using a single PCA however, considering the Gaussian distribution requirements of PCA, this representation is not ...
Ozan Ezgi Can, Gabbouj Moncef, Kiranyaz Serkan   +2 more
openaire   +1 more source