Fast analog associative memory

Jason M. Kinser

doi:10.1117/12.216362

11 August 1995 Fast analog associative memory

Jason M. Kinser

Proceedings Volume 2568, Neural, Morphological, and Stochastic Methods in Image and Signal Processing; (1995) https://doi.org/10.1117/12.216362
Event: SPIE's 1995 International Symposium on Optical Science, Engineering, and Instrumentation, 1995, San Diego, CA, United States

Abstract

Traditional neural networks such as backpropagation begin with a set of decision boundaries and optimize the network by moving the boundaries. The problem with this approach is a large number of iterations is required and the network can easily be stuck in a local minima. The algorithm presented here rapidly creates boundaries when necessary and destroys boundaries when they become obsolete. Optimization is achieved by a 'survival of the fittest' boundaries approach. Since the individual boundaries are not optimized the algorithm does not require iterations and trains the network very quickly. The algorithm is well suited for high- dimensional analog inputs and analog outputs.

Citation Download Citation

Jason M. Kinser "Fast analog associative memory", Proc. SPIE 2568, Neural, Morphological, and Stochastic Methods in Image and Signal Processing, (11 August 1995); https://doi.org/10.1117/12.216362

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