Discrete Relaxation for Matching Relational Structures
Les Kitchen · 1978
Abstract : Local constraint analysis ('discrete relaxation') is used to reduce ambiguity in matching pairs of relational structures. It is found empirically that if the set of possible local properties is sufficiently large, this generally results in unambiguous identifications after only a few iterations.