This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Search Technique for Pattern Recognition Using Relative Distances
September 1995 (vol. 17 no. 9)
pp. 910-912

Abstract—A technique for creating and searching a tree of patterns using relative distances is presented. The search is conducted to find patterns which are nearest neighbors of a given test pattern. The structure of the tree is such that the search time is proportional to the distance between the test pattern and its nearest neighbor, which suggests the anomalous possibility that a larger tree, which can be expected on average to contain closer neighbors, can be searched faster than a smaller tree. The technique has been used to recognize OCR digit samples derived from NIST data at an accuracy rate of 97% using a tree of 7,000 patterns.

[1] D. Bar-Lev,Semiconductors and Electronic Devices, 2nd Edition, Prentice Hall, 1984.
[2] D.F. Beal,Advances in Computer Chess 6,West Sussex, England: Ellis Horwood Ltd, 1991.
[3] B.V. Dasarathy, ed., Nearest Neighbor (NN) Norms: NN Pattern Classification Techniques.Los Alamitos, Calif.: IEEE CS Press, 1991.
[4] J.S. Denker,W.R. Gardner,H.P. Graf,D. Henderson,R.E. Howard,W. Hubbard,L.D. Jackel,H.S. Baird,, and I. Guyon,“Neural network recognizer for hand-written zip code digits,” D. Touretzky, ed., Advances in Neural Information Processing Systems, pp. 323-331,San Mateo, Calif.: Morgan Kauffman, 1989.
[5] K. Fukunaga, Introduction to Statistical Pattern Recognition, second edition. Academic Press, 1990.
[6] R. Hill,A First Course in Coding Theory.New York: Oxford Univ. Press, 1988.
[7] M.A. Karim and A.A.S. Awwal,Optical Computing. John Wiley and Sons Inc., 1992.
[8] J.D. Keeler and D.E. Rumelhart,“A self-organizing integrated segmentation and recognition neural net,” J. Moody, S.J. Hanson, and R.P Lippman, eds., Advances in Neural Information Processing Systems 4, pp. 496-503,San Mateo, Calif.: Morgan Kauffman, 1992.
[9] B.S. Kim and S.B. Park, "A Fast k Nearest Neighbor Finding Algorithm Based on the Ordered Partition," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 8, no. 6, pp. 761-766, Nov. 1986.
[10] G.L. Martin and J.A. Pittman,“Recognizing hand-printed letters and digits,” D. Touretzky, ed., Advances in Neural Information Processing Systems 2, pp. 405-414,San Mateo, Calif.: Morgan Kauffman, 1990.
[11] The NIST database can be obtained by writing to: Standard Reference Data, National Institute of Standards and Tech nology, 221/A323 Gaithersburg, MD 20899 USA and asking for NIST special database 1 (HWDB).
[12] E. Sackinger,B.E. Boser,, and L.D. Jackel,“A neurocomputer board based on the ANNA neural network chip,” J. Moody, S.J. Hanson, and R.P Lippman, eds., Advances in Neural Information Processing Systems 4., pp. 773-780,San Mateo, Calif.: Morgan Kauffman, 1992.

Index Terms:
Pattern recognition, optical character recognition, nearest neighbor, distance metric, branch and bound, NIST digit samples.
Citation:
Thomas E. Portegys, "A Search Technique for Pattern Recognition Using Relative Distances," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 17, no. 9, pp. 910-912, Sept. 1995, doi:10.1109/34.406658
Usage of this product signifies your acceptance of the Terms of Use.