Pattern recognition by labeled graph matching.

von der Malsburg, C.

doi:10.1016/0893-6080(88)90016-0

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Pattern recognition by labeled graph matching.

MPS-Authors

/persons/resource/persons209353

von der Malsburg, C.
Department of Molecular Developmental Biology, MPI for biophysical chemistry, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

von der Malsburg, C. (1988). Pattern recognition by labeled graph matching. Neural Networks, 1(2), 141-148. doi:10.1016/0893-6080(88)90016-0.

Cite as: https://hdl.handle.net/11858/00-001M-0000-002D-F3EB-4

Abstract

A model for position invariant pattern recognition is presented. Although not demonstrated here, the system is insensitive to distortions. Recognition is based on labeled graph matching. The system consists of two layers of neurons, an input layer, and a memory and recognition layer. The latter consists of subnets to represent individual patterns. In both layers, patterns are represented by labeled graphs. Nodes are “neurons,” labels are local feature types, links are implemented by excitatory connections and represent topology. Recognition is driven by spontaneous dynamic activations of local clusters in the input layer. Network dynamics is able to selectively activate with good reliability corresponding clusters in memory layer. Few cluster activations suffice to identify the subnet and pattern corresponding to the graph in the input layer. The system has been implemented and tested with the help of simulations.