Share Email Print

Proceedings Paper

Universal pattern recognition by matched filters synthesized by primitive patterns and by the algorithm for uniquely selecting the optimum reference patterns
Author(s): Shun-ichi Kamemaru; Kiyotaka Tanaka; Masayasu Nakazawa
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

In most pattern recognition systems, many target patterns should be recognized at one time by fewer reference patterns when the system uses a matched spatial filter. In this paper, two approaches are described for reducing the number of reference patterns in matched spatial filtering called universal pattern recognition which means a recognition technique of various shapes of patterns not depending on a target shapes. One approach is based on very simple bar patterns for the reference object for a matched filter according to a concept that every pattern or symbol is synthesized by many line components with various directions. By also using correlation diagrams with such reference patterns, 26 English alphabets were fairly recognized. Another technique is based on the algorithm to find automatically the unique and proper reference patterns of the matched spatial filter for recognition of the desired target sets. By the algorithm, unique and minimum numbers of reference patterns are selected and 26 English alphabets and 10 digits were recognized.

Paper Details

Date Published: 28 August 1995
PDF: 8 pages
Proc. SPIE 2565, Optical Implementation of Information Processing, (28 August 1995);
Show Author Affiliations
Shun-ichi Kamemaru, Ibaraki Univ. (Japan)
Kiyotaka Tanaka, Ibaraki Univ. (Japan)
Masayasu Nakazawa, Ibaraki Univ. (Japan)

Published in SPIE Proceedings Vol. 2565:
Optical Implementation of Information Processing
Bahram Javidi; Joseph L. Horner, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?