Share Email Print

Proceedings Paper

Ho-Kashyap Associative Processors
Author(s): Brian Telfer; David Casasent
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

A Ho-Kashyap (H-K) associative processor (AP) is demonstrated to have a larger storage capacity than the pseudoinverse AP and to allow linearly dependent key vectors to be accurately stored. A new Robust H-K AP is shown to perform well over all M/N (where M is the number of keys and N is their dimension), specifically when M ≈ N, where the standard pseudoinverse and H-K APs perform poorly. Also considered are variable thresholds, an error-correcting algorithm to allow analog synthesis of the H-K AP, and the different reliabilities of the recollection elements.

Paper Details

Date Published: 7 March 1989
PDF: 11 pages
Proc. SPIE 1005, Optics, Illumination, and Image Sensing for Machine Vision III, (7 March 1989); doi: 10.1117/12.949030
Show Author Affiliations
Brian Telfer, Carnegie Mellon University (United States)
David Casasent, Carnegie Mellon University (United States)

Published in SPIE Proceedings Vol. 1005:
Optics, Illumination, and Image Sensing for Machine Vision III
Donald J. Svetkoff, Editor(s)

© SPIE. Terms of Use
Back to Top