Training Set Expansion in Handwritten Character Recognition
暂无分享,去创建一个
[1] Bruce W. Weide,et al. Optimal Expected-Time Algorithms for Closest Point Problems , 1980, TOMS.
[2] Song B. Park,et al. A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[3] Horst Bunke,et al. Off-Line, Handwritten Numeral Recognition by Perturbation Method , 1997, IEEE Trans. Pattern Anal. Mach. Intell..
[4] C. G. Hilborn,et al. The Condensed Nearest Neighbor Rule , 1967 .
[5] Jon Louis Bentley,et al. An Algorithm for Finding Best Matches in Logarithmic Expected Time , 1976, TOMS.
[6] Rafael Llobet,et al. Fast and Accurate Handwritten Character Recognition Using Approximate Nearest Neighbours Search on Large Databases , 2000, SSPR/SPR.
[7] Dennis L. Wilson,et al. Asymptotic Properties of Nearest Neighbor Rules Using Edited Data , 1972, IEEE Trans. Syst. Man Cybern..
[8] Anil K. Jain,et al. Object Matching Using Deformable Templates , 1996, IEEE Trans. Pattern Anal. Mach. Intell..
[9] Jianchang Mao,et al. Improving OCR performance using character degradation models and boosting algorithm , 1997, Pattern Recognit. Lett..
[10] Karl Sims,et al. Handwritten Character Classification Using Nearest Neighbor in Large Databases , 1994, IEEE Trans. Pattern Anal. Mach. Intell..
[11] Peter E. Hart,et al. The condensed nearest neighbor rule (Corresp.) , 1968, IEEE Trans. Inf. Theory.
[12] Sunil Arya,et al. An optimal algorithm for approximate nearest neighbor searching fixed dimensions , 1998, JACM.