A New Probabilistic Relaxation Scheme

IEEE Transactions on Pattern Analysis and Machine IntelligencePublished 1 July 1980

Bezalel Peleg

DOI10.1109/tpami.1980.4767035

Source URL

Citations185

SJR quartileQ1

SJR score3.91

SNIP5.99

TL;DR

The results are compared with previous work on probabilistic relaxation labeling, and examples are given from the image segmentation domain, to applications of the new scheme in text processing.

Abstract

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.

Keywords

Computer ScienceEngineering

IEEE Transactions on Systems Man and CyberneticsScene Labeling by Relaxation Operations

1,401 Citations1976Azriel Rosenfeld, Robert A. Hummel +1 more

This paper formulates the ambiguity-reduction process in terms of iterated parallel operations (i.e., relaxation operations) performed on an array of object, identification data.

IEEE Transactions on ComputersAn Application of Relaxation Labeling to Line and Curve Enhancement

219 Citations1977Zucker, Hummel +1 more

A relaxation process is described and is applied to the detection of smooth lines and curves in noisy, real world images, effective even for curves of low contrast, and even when many curves lie close to one another.

Communications of the ACMBreaking substitution ciphers using a relaxation algorithm

85 Citations1979Shmuel Peleg, Azriel Rosenfeld

In this paper the problem of breaking substitution ciphers is represented as a probabilistic labeling problem, where every code letter is assigned probabilities of representing plaintext letters, and updated in parallel for all code letters, using joint letter probabilities.

View PDF

Computer Graphics and Image ProcessingA product rule relaxation method

21 Citations1980Robert Kirby

The experiments showed that in some applications, the product rule converges more rapidly to estimates that permit making reasonable decisions than did a previous formula using arithmetic averaging.

Computer Graphics and Image ProcessingAmbiguity reduction in handwriting with ambiguous segmentation and uncertain interpretation

18 Citations1979Bezalel Peleg

An iterative relaxation algorithm is presented that considerably reduces the number of possible interpretations for the handwriting, while preserving the most likely interpretations.

International Joint Conference on Artificial IntelligenceContinuous relaxation and local maxima selection: conditions for equivalence

7 Citations1979Steven W. Zucker, Yvan G. Leclerc +1 more