Gaussian KD-trees for fast high-dimensional filtering.
Andrew AdamsNatasha GelfandJennifer DolsonMarc LevoyPublished in: ACM Trans. Graph. (2009)
Keyphrases
- kd trees
- high dimensional
- nearest neighbor search
- high dimensional spaces
- nearest neighbor
- low dimensional
- space partitioning
- kd tree
- data structure
- dimensionality reduction
- similarity search
- high dimensional data
- feature space
- metric space
- locality sensitive hashing
- high dimensionality
- binary search trees
- brute force
- exhaustive search
- cost model
- search methods
- hashing methods
- multi dimensional
- multiresolution
- binary space partitioning