This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A New Probabilistic Relaxation Scheme
April 1980 (vol. 2 no. 4)
pp. 362-369
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.
Citation:
Shmuel Peleg, "A New Probabilistic Relaxation Scheme," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 2, no. 4, pp. 362-369, April 1980, doi:10.1109/TPAMI.1980.4767035
Usage of this product signifies your acceptance of the Terms of Use.