By Topic

Character recognition in a sparse distributed memory

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hong, Y.-S. ; Dept. of Comput. Sci., Dongguk Univ., Seoul, South Korea ; Chen, S.-C.

P. Kanerva's (1988) sparse distributed memory model is applied to character recognition. The results of recognizing corrupted characters, using a sparse distributed memory with fewer than 10000 locations, is described: 100 corrupted test patterns were generated to recognize 18 template patterns. The performance of the model is evaluated. Insights about the behavior of sparse distributed memories as well as the model's applicability to character recognition are provided. It was found that a sparse distributed memory of small size can recognize patterns with considerable noise

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:21 ,  Issue: 3 )