A New Probabilistic Relaxation Scheme

Shmuel Peleg

doi:10.1109/TPAMI.1980.4767035

A New Probabilistic Relaxation Scheme

Shmuel Peleg^*

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

142 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 language	English
Pages (from-to)	362-369
Number of pages	8
Journal	IEEE Transactions on Pattern Analysis and Machine Intelligence
Volume	PAMI-2
Issue number	4
DOIs	https://doi.org/10.1109/TPAMI.1980.4767035
State	Published - Jul 1980
Externally published	Yes

Keywords

Image processing
line enhancement
relaxation
segmentation

Access to Document

10.1109/TPAMI.1980.4767035

Cite this

@article{7fb4d92cf0c74890aeecf667a6b51887,

title = "A New Probabilistic Relaxation Scheme",

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 = "Image processing, line enhancement, relaxation, segmentation",

author = "Shmuel Peleg",

year = "1980",

month = jul,

doi = "10.1109/TPAMI.1980.4767035",

language = "אנגלית",

volume = "PAMI-2",

pages = "362--369",

journal = "IEEE Transactions on Pattern Analysis and Machine Intelligence",

issn = "0162-8828",

publisher = "IEEE Computer Society",

number = "4",

}

TY - JOUR

T1 - A New Probabilistic Relaxation Scheme

AU - Peleg, Shmuel

PY - 1980/7

Y1 - 1980/7

N2 - 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.

AB - 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.

KW - Image processing

KW - line enhancement

KW - relaxation

KW - segmentation

UR - http://www.scopus.com/inward/record.url?scp=0019035608&partnerID=8YFLogxK

U2 - 10.1109/TPAMI.1980.4767035

DO - 10.1109/TPAMI.1980.4767035

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0019035608

SN - 0162-8828

VL - PAMI-2

SP - 362

EP - 369

JO - IEEE Transactions on Pattern Analysis and Machine Intelligence

JF - IEEE Transactions on Pattern Analysis and Machine Intelligence

IS - 4

ER -

A New Probabilistic Relaxation Scheme

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this