Abstract

The study of connectionist models for pattern recognition is mainly motivated by their presumed simultaneous feature selection and classification. Character recognition is a common test case to illustrate the feature extraction and classification characteristics of neural networks. Most of the variability concerning size and rotation can be handled easily, while acquisition conditions are usually controlled. Many examples of neural character recognition applications were presented where the most successful results for optical character recognition (OCR) with image inputs were reported on a layered network (LeCun et al., 1990) integrating feature selection and invariance notions introduced earlier in neocognitron networks. Previously, we have presented a supervised learning algorithm, based on Kohonen's self- organizing feature maps, and its applications to image and speech processing (Midenet et al., 1991). From pattern recognition point of view, the first network performs local feature extraction while the second does a global statistical template matching. We describe these models and their comparative results when applied to a common French handwritten zip-code database. We discuss possible cooperation schemes and show that the performances obtained by these networks working in parallel exceed those of the networks working separately. We conclude by the possible extensions of this work for automatic document processing systems.© (1992) COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call