Fast Algorithm for Nearest Neighbor Search Based on a Lower Bound Tree.
Yong-Sheng ChenYi-Ping HungChiou-Shann FuhPublished in: ICCV (2001)
Keyphrases
- nearest neighbor search
- optimal solution
- lower bound
- dynamic programming
- tree structure
- learning algorithm
- cost function
- np hard
- computational complexity
- kd trees
- objective function
- exhaustive search
- kd tree
- nearest neighbor
- matching algorithm
- simulated annealing
- fractal image compression
- index structure
- linear programming
- convex hull