Capacity of k-gridgraphs as associative memory

Michael Werman*

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

Abstract

Bienenstock and C. von der Malsberg propose a graph based method to model memory and visual pattern recognition. It involves modeling each remembered picture as a subgraph of global memory, where each of these subgraphs is a simple grid, each vertex with four neighbors; above, below, to the right and to the left, with each vertex labeled either black or white. Each vertex can be in many different subgraphs. In this paper we calculate the capacity of a given memory (vertex size) that will still allow good pattern recognition. We give this as a function of the allowed degradation of matched input. This is done using probabilistic and graph theoretical methods.

Original languageAmerican English
Pages (from-to)60
Number of pages1
JournalNeural Networks
Volume1
Issue number1 SUPPL
DOIs
StatePublished - 1988
Externally publishedYes
EventInternational Neural Network Society 1988 First Annual Meeting - Boston, MA, USA
Duration: 6 Sep 198810 Sep 1988

Fingerprint

Dive into the research topics of 'Capacity of k-gridgraphs as associative memory'. Together they form a unique fingerprint.

Cite this