An asymmetric associative memory model based on relaxation labeling processes
نویسندگان
چکیده
منابع مشابه
Autoassociative learning in relaxation labeling networks
We address the problem of training relaxation labeling processes, a popular class of parallel iterative procedures widely employed in pattern recognition and computer vision. The approach discussed here is based on a theory of consistency developed by Hummel and Zucker, and contrasts with a recently introduced learning strategy which can be regarded as heteroassociative, i.e., what is actually ...
متن کاملAn analysis of the exponential correlation associative memory
The exponential correlation associative memory (ECAM) is a recurrent neural network model which has large storage capacity and is particularly suited for VLSI hardware implementation. Our aim in this paper is to show how the ECAM model can be entirely derived within a Bayesian framework, thereby providing more insight into the behaviour of this algorithm. The framework for our study is a novel ...
متن کاملAnalysis of the dynamical behavior of a feedback auto-associative memory
The dynamical behavior and the stability properties of fixed points in a feedback auto-associative memory are investigated. The proposed structure encompasses a multi-layer perceptron (MLP) and a feedback connection that links input and output layers through delay elements. The MLP is initially trained so that it maps the training patterns into themselves as an auto-associative memory. The feed...
متن کاملA CMOS Spiking Neural Network Circuit with Symmetric/Asymmetric STDP Function
SUMMARY In this paper, we propose an analog CMOS circuit which achieves spiking neural networks with spike-timing dependent synaptic plasticity (STDP). In particular, we propose a STDP circuit with symmetric function for the first time, and also we demonstrate associative memory operation in a Hopfield-type feedback network with STDP learning. In our spiking neuron model, analog information exp...
متن کاملLabeling Raam
In this paper we propose an extension of the Recursive Auto-Associative Memory (RAAM) by Pollack. This extension, the Labeling RAAM (LRAAM), is able to encode labeled graphs with cycles by representing pointers explicitly. A theoretical analysis of the constraints imposed on the weights by the learning task under the hypothesis of perfect learning and linear output units is presented. Cycles an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995