Paper
16 September 1992 Connectionist model for object recognition
Shingchern D. You, Gary E. Ford
Author Affiliations +
Abstract
An application of neural networks is the recognition of objects under translation, rotation, and scale change. Most existing networks for invariant object recognition require a huge number of connections and/or processing units. In this paper, we propose a new connectionist model for invariant object recognition for binary images with a reasonable network size. The network consists of five stages. The first stage shifts the object so that the centroid of the object coincides with the center of the image plane. The second stage is a variation of the polar- coordinate transformation used to obtain two N-dimensional representations of the input object. In this stage, the 0 axis is represented by the positions of the output units; therefore, any rotation of the original object becomes a cyclic shift of the output values of this stage. The third stage is a variation of the rapid transform, which provides invariant representations of cyclic-shift inputs. The next stage normalizes the outputs of the rapid transform to obtain scale invariance. The final stage is a nearest neighbor classifier. We tested the performance of the network for character recognition and good results were obtained with only one pattern per class in training.
© (1992) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Shingchern D. You and Gary E. Ford "Connectionist model for object recognition", Proc. SPIE 1709, Applications of Artificial Neural Networks III, (16 September 1992); https://doi.org/10.1117/12.139998
Lens.org Logo
CITATIONS
Cited by 3 scholarly publications and 2 patents.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Object recognition

Neural networks

Binary data

Osmium

Artificial neural networks

Fourier transforms

Image processing

Back to Top