Ho-Kashyap Associative Processors

Brian Telfer; David Casasent

doi:10.1117/12.949030

7 March 1989 Ho-Kashyap Associative Processors

Brian Telfer, David Casasent

Proceedings Volume 1005, Optics, Illumination, and Image Sensing for Machine Vision III; (1989) https://doi.org/10.1117/12.949030
Event: 1988 Cambridge Symposium on Advances in Intelligent Robotics Systems, 1988, Boston, MA, United States

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.

Citation Download Citation

Brian Telfer and David Casasent "Ho-Kashyap Associative Processors", Proc. SPIE 1005, Optics, Illumination, and Image Sensing for Machine Vision III, (7 March 1989); https://doi.org/10.1117/12.949030

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available