Nearest Neighbor Search Using Additive Binary Tree

Classifying an unknown input is a fundamental problem in Pattern Recognition. One standard method is finding its nearest neighbors in a reference set. It would be very time consuming if computed feature by feature for all templates in the reference set; this na?ive method is O(nd) where n is the number of templates in the reference set and d is the number of features or dimension. For this reason, we present a technique for quickly eliminating most templates from consideration as possible neighbors. The remaining candidate templates are then evaluated feature by feature against the query vector. We utilize frequencies of features as a pre-processing to reduce query processing time burden. The most notable advantage of the new method over other existing techniques occurs where the number of features is large and the type of each feature is binary although it works for other type features. We improved our OCR system at least twice (without a threshold) or faster (with higher threshold v...

• Type: Conference
• Year: 2000
• Where: CVPR
• Authors: Sung-Hyuk Cha, Sargur N. Srihari
• Keywords: Additive Binary Tree, Candidate Templates, Computer Vision, CVPR 2000, Nearest Neighbors, Query Processing Time, Reference Set