The hB-tree: a multiattribute indexing method with good guaranteed performance
ACM Transactions on Database Systems (TODS)
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Reducing the overhead of the AESA metric-space nearest neighbour searching algorithm
Information Processing Letters
Direct spatial search on pictorial databases using packed R-trees
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
An Algorithm for Finding Best Matches in Logarithmic Expected Time
ACM Transactions on Mathematical Software (TOMS)
Optimal Expected-Time Algorithms for Closest Point Problems
ACM Transactions on Mathematical Software (TOMS)
An effective way to represent quadtrees
Communications of the ACM
Multidimensional divide-and-conquer
Communications of the ACM
Multidimensional binary search trees used for associative searching
Communications of the ACM
Fast Nearest-Neighbor Search in Dissimilarity Spaces
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast texture synthesis using tree-structured vector quantization
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Real-time texture synthesis by patch-based sampling
ACM Transactions on Graphics (TOG)
ACM Computing Surveys (CSUR)
A Fast Nearest-Neighbor Algorithm Based on a Principal Axis Search Tree
IEEE Transactions on Pattern Analysis and Machine Intelligence
Offline General Handwritten Word Recognition Using an Approximate BEAM Matching Algorithm
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fixed Queries Array: A Fast and Economical Data Structure for Proximity Searching
Multimedia Tools and Applications
Example-Based Super-Resolution
IEEE Computer Graphics and Applications
Subspace position measurement in the presence of occlusion
Pattern Recognition Letters
Implicit Probabilistic Models of Human Motion for Synthesis and Tracking
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part I
When Is ''Nearest Neighbor'' Meaningful?
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Contrast Plots and P-Sphere Trees: Space vs. Time in Nearest Neighbour Searches
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Recognizing Objects Using Color-Annotated Adjacency Graphs
Shape, Contour and Grouping in Computer Vision
Priority Vantage Points Structures for Similarity Queries in Metric Spaces
EurAsia-ICT '02 Proceedings of the First EurAsian Conference on Information and Communication Technology
Searching in metric spaces by spatial approximation
The VLDB Journal — The International Journal on Very Large Data Bases
Simple termination conditions for k-nearest neighbor method
Pattern Recognition Letters
Vision-based control of 3D facial animation
Proceedings of the 2003 ACM SIGGRAPH/Eurographics symposium on Computer animation
Index-driven similarity search in metric spaces (Survey Article)
ACM Transactions on Database Systems (TODS)
Fast k-Nearest Neighbor Classification Using Cluster-Based Trees
IEEE Transactions on Pattern Analysis and Machine Intelligence
Characterisation of a Novel Indexing Technique for Case-Based Reasoning
Artificial Intelligence Review
Image matching using alpha-entropy measures and entropic graphs
Signal Processing - Special section on content-based image and video retrieval
Example-Based Photometric Stereo: Shape Reconstruction with General, Varying BRDFs
IEEE Transactions on Pattern Analysis and Machine Intelligence
A compact space decomposition for effective metric indexing
Pattern Recognition Letters
Extending natural textures with multi-scale synthesis
Graphical Models - Special issue: Vision and computer graphics
Rapid Object Indexing Using Locality Sensitive Hashing and Joint 3D-Signature Space Estimation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast k-nearest-neighbor search based on projection and triangular inequality
Pattern Recognition
A practical approach for efficiently answering top-k relational queries
Decision Support Systems
Selecting representative examples and attributes by a genetic algorithm
Intelligent Data Analysis
Image alignment and stitching: a tutorial
Foundations and Trends® in Computer Graphics and Vision
Dynamic spatial approximation trees
Journal of Experimental Algorithmics (JEA)
Autotagging to improve text search for 3d models
Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries
An Empirical Comparison of Exact Nearest Neighbour Algorithms
PKDD 2007 Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases
Randomized sub-vectors hashing for high-dimensional image feature matching
MM '08 Proceedings of the 16th ACM international conference on Multimedia
A Fast and Effective Dichotomy Based Hash Algorithm for Image Matching
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing
Multi-view Feature Matching and Image Grouping from Multiple Unordered Wide-Baseline Images
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing, Part II
Parallel query processing on distributed clustering indexes
Journal of Discrete Algorithms
Patch-based video processing: a variational Bayesian approach
IEEE Transactions on Circuits and Systems for Video Technology
Fast k most similar neighbor classifier for mixed data (tree k-MSN)
Pattern Recognition
A Fast Nearest Neighbor Method Using Empirical Marginal Distribution
KES '09 Proceedings of the 13th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems: Part II
Fast structural learning of distance-based neural networks
IJCNN'09 Proceedings of the 2009 international joint conference on Neural Networks
Probably correct k-nearest neighbor search in high dimensions
Pattern Recognition
Speed-up of the R4-rule for distance-based neural network learning
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Designing eigenspace manifolds: with application to object identification and pose estimation
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Fast exact k nearest neighbors search using an orthogonal search tree
Pattern Recognition
HPAT indexing for fast object/scene recognition based on local appearance
CIVR'03 Proceedings of the 2nd international conference on Image and video retrieval
Surface signature-based method for modeling and recognizing free-form objects
ISVC'07 Proceedings of the 3rd international conference on Advances in visual computing - Volume Part II
Fast k-nearest neighbors search using modified principal axis search tree
Digital Signal Processing
Real-time Object Recognition in Sparse Range Images Using Error Surface Embedding
International Journal of Computer Vision
Nearest neighbor searching in high dimensions using multiple KD-trees
ISCGAV'10 Proceedings of the 10th WSEAS international conference on Signal processing, computational geometry and artificial vision
Local shape descriptor selection for object recognition in range data
Computer Vision and Image Understanding
Fast reciprocal nearest neighbors clustering
Signal Processing
Trading precision for speed: localised similarity functions
CIVR'05 Proceedings of the 4th international conference on Image and Video Retrieval
Fast color-based object recognition independent of position and orientation
ICANN'05 Proceedings of the 15th international conference on Artificial Neural Networks: biological Inspirations - Volume Part I
Estimating gaze direction from low-resolution faces in video
ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part II
Putting the user in the loop: visual resource discovery
AMR'05 Proceedings of the Third international conference on Adaptive Multimedia Retrieval: user, context, and feedback
Enhancing face recognition using Directional Filter Banks
Digital Signal Processing
Modelling efficient novelty-based search result diversification in metric spaces
Journal of Discrete Algorithms
| Hi-index | 0.14 |
The problem of finding the closest point in high-dimensional spaces is common in pattern recognition. Unfortunately, the complexity of most existing search algorithms, such as k-d tree and R-tree, grows exponentially with dimension, making them impractical for dimensionality above 15. In nearly all applications, the closest point is of interest only if it lies within a user-specified distance $\epsilon.$ We present a simple and practical algorithm to efficiently search for the nearest neighbor within Euclidean distance $\epsilon.$ The use of projection search combined with a novel data structure dramatically improves performance in high dimensions. A complexity analysis is presented which helps to automatically determine $\epsilon$ in structured problems. A comprehensive set of benchmarks clearly shows the superiority of the proposed algorithm for a variety of structured and unstructured search problems. Object recognition is demonstrated as an example application. The simplicity of the algorithm makes it possible to construct an inexpensive hardware search engine which can be 100 times faster than its software equivalent. A C++ implementation of our algorithm is available upon request to search@cs.columbia.edu/CAVE/.