A fast nearest neighbor search algorithm by filtration

@article{Cha2002AFN,
  title={A fast nearest neighbor search algorithm by filtration},
  author={Sung-Hyuk Cha and Sargur N. Srihari},
  journal={Pattern Recognition},
  year={2002},
  volume={35},
  pages={515-525}
}
Classifying an unknown input is a fundamental problem in Pattern Recognition. One standard method is "nding 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 namKve 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… CONTINUE READING
Highly Cited
This paper has 70 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

71 Citations

0510'00'03'07'11'15
Citations per Year
Semantic Scholar estimates that this publication has 71 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 19 references

Pattern Classi"cation

  • R. O. Duda, P. E. Hart, D. G. Stork
  • 2nd Edition, Wiley, New York
  • 2000
1 Excerpt

, Searching for nearest neighbors in constant average time with applications to discrete utterance speech recognition

  • H. Rulot E. Vidal, F. Casacuberta, H J.Benedm
  • 1990

Similar Papers

Loading similar papers…