Admissibility Of Constraint Functions In Relaxation Labeling

H. Isil Bozma, James S. Duncan

Abstract: In relaxation labeling, the domain model is incorporated into the system through the constraint functions ( compatibility coefficients). The selection of these functions is shown to be critical. In particular, for certain choices of the contraint functions, some processes will have a single nontrivial convergence point regardless of the initial labeling. Criteria on the constraint functions which result in a single convergence point are presented for those relaxation labeling processes whose formulations are within the framework of an optimization problem. We then present the necessary and sufficient conditions on the constraint €unctions under which the first of these sufficiency criteria is satisfied. The othpr conditions can be tested using standard techniques. These criteria yield a formal guideline for detecting some of the inadmi-ible constraint functions.