Depth-first k-nearest neighbor finding using the MaxNearestDist estimator

A description is given of how to use an estimate of the maximum possible distance at which a nearest neighbor can be found to prune the search process in a depth-first branch and bound k-nearest neighbor finding algorithm.

• Type: Conference
• Year: 2003
• Where: ICIAP
• Authors: Hanan Samet
• Keywords: ICIAP 2003, Image Processing, Nearest Neighbor, Neighbor Finding Algorithm