Sciweavers

89 search results - page 13 / 18
» Efficient Search for Approximate Nearest Neighbor in High Di...
Sort
View
TKDE
2011
332views more  TKDE 2011»
13 years 2 months ago
Adaptive Cluster Distance Bounding for High-Dimensional Indexing
—We consider approaches for similarity search in correlated, high-dimensional data-sets, which are derived within a clustering framework. We note that indexing by “vector appro...
Sharadh Ramaswamy, Kenneth Rose
VLDB
2007
ACM
191views Database» more  VLDB 2007»
14 years 7 months ago
Multidimensional reverse k NN search
Given a multidimensional point q, a reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k nearest neighbors. Existing methods for proc...
Yufei Tao, Dimitris Papadias, Xiang Lian, Xiaokui ...
3DIM
2003
IEEE
13 years 11 months ago
Approximate K-D Tree Search for Efficient ICP
A method is presented that uses an Approximate Nearest Neighbor method for determining correspondences within the Iterative Closest Point Algorithm. The method is based upon the k...
Michael A. Greenspan, Mike Yurick
MMM
2011
Springer
251views Multimedia» more  MMM 2011»
12 years 11 months ago
Randomly Projected KD-Trees with Distance Metric Learning for Image Retrieval
Abstract. Efficient nearest neighbor (NN) search techniques for highdimensional data are crucial to content-based image retrieval (CBIR). Traditional data structures (e.g., kd-tree...
Pengcheng Wu, Steven C. H. Hoi, Duc Dung Nguyen, Y...
ICDE
2006
IEEE
154views Database» more  ICDE 2006»
14 years 1 months ago
Efficient Image Classification on Vertically Decomposed Data
Organizing digital images into semantic categories is imperative for effective browsing and retrieval. In large image collections, an efficient algorithm is crucial to quickly cat...
Taufik Abidin, Aijuan Dong, Honglin Li, William Pe...