Premium
STRUCTURE RECOGNITION BY CONNECTIONIST RELAXATION: FORMAL ANALYSIS
Author(s) -
Cooper Paul R.
Publication year - 1992
Publication title -
computational intelligence
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.353
H-Index - 52
eISSN - 1467-8640
pISSN - 0824-7935
DOI - 10.1111/j.1467-8640.1992.tb00336.x
Subject(s) - unary operation , connectionism , computer science , search engine indexing , theoretical computer science , consistency (knowledge bases) , relaxation (psychology) , algorithm , matching (statistics) , binary number , artificial intelligence , artificial neural network , mathematics , discrete mathematics , arithmetic , psychology , social psychology , statistics
A formal description is given of a connectionist implementation of discrete relaxation for labelled graph matching. The network is shown to converge. The desired behavior of the algorithm is formally specified; then it is proved that the result of the relaxation meets the formal goal. The network is limited by complexity considerations to the detection and propagation of unary and binary consistency constraints. The application is fast parallel indexing into a memory of object models, based on a visually derived junction/link structure description. Implementation experiments are presented, and explicit and exact space and time requirements are developed.