Lossless acceleration for correlation-based nearest-neighbor pattern recognition

Author

Avi-Itzhak, Hadar ; Diep, Thanh

Author_Institution

Canon Res. Center America, Palo Alto, CA, USA

Volume

2

fYear

1994

fDate

9-13 Oct 1994

Firstpage

240

Abstract

This paper presents four lossless acceleration algorithms for a special type of nearest-neighbor pattern recognition whereby correlation functions are used. The algorithms are called template stopping, template ordering, pixel stopping, and pixel ordering. All four algorithms may be used either independently or simultaneously to accelerate the nearest-neighbor search without incurring any loss to accuracy. To illustrate their usefulness, all four algorithms are demonstrated on an optical character recognition system

Keywords

pattern recognition; correlation functions; correlation-based nearest-neighbor pattern recognition; lossless acceleration; optical character recognition system; pixel ordering; pixel stopping; template ordering; template stopping; Acceleration; Character recognition; Euclidean distance; Frequency; Information systems; Nearest neighbor searches; Optical character recognition software; Optical losses; Pattern recognition; Statistics;

fLanguage

English

Publisher

ieee

Conference_Titel

Pattern Recognition, 1994. Vol. 2 - Conference B: Computer Vision & Image Processing., Proceedings of the 12th IAPR International. Conference on

Conference_Location

Jerusalem

Print_ISBN

0-8186-6270-0

Type

conf

DOI

10.1109/ICPR.1994.576911

Filename

576911