Issue No. 04 - April (1980 vol. 2)
Shmuel Peleg , Computer Science Center, University of Maryland, College Park, MD 20742.
Let a vector of probabilities be associated with every node of a graph. These probabilities define a random variable representing the possible labels of the node. Probabilities at neighboring nodes are used iteratively to update the probabilities at a given node based on statistical relations among node labels. The results are compared with previous work on probabilistic relaxation labeling, and examples are given from the image segmentation domain. References are also given to applications of the new scheme in text processing.
S. Peleg, "A New Probabilistic Relaxation Scheme," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 2, no. , pp. 362-369, 1980.