NEW PROBABILISTIC RELAXATION SCHEME.

Shmuel Peleg*

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

12 Scopus citations

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.

Original languageEnglish
Pages337-343
Number of pages7
StatePublished - 1979
EventProc IEEE Comput Soc Conf Pattern Recognition Image Process - Chicago, IL, USA
Duration: 6 Aug 19798 Aug 1979

Conference

ConferenceProc IEEE Comput Soc Conf Pattern Recognition Image Process
CityChicago, IL, USA
Period6/08/798/08/79

Fingerprint

Dive into the research topics of 'NEW PROBABILISTIC RELAXATION SCHEME.'. Together they form a unique fingerprint.

Cite this