STRUCTURE RECOGNITION BY CONNECTIONIST RELAXATION: FORMAL ANALYSIS
Paul R. Cooper · Computational Intelligence · 1992
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.