A continuous relaxation labeling algorithm for Markov random fields

DOI10.1109/21.57279MaRDI QIDQ3493229zbMATH OpenOpenAlexFDO

Authors Lionel Pelkowitz

Publication date 1990

Published in IEEE Transactions on Systems, Man, and Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/21.57279

zbMATH Keywords

finite graphMarkov random fieldprobabilistic relaxation algorithm

Mathematics Subject Classification ID

Random fields (60G60) Parallel algorithms in computer science (68W10) Graph theory (05C99)

Recommendations

• Markov models for image labeling
• Relaxation Labeling with Learning Automata
• scientific article; zbMATH DE number 613142
• Relaxation labelling and the entropy of neighbourhood information
• Markov random fields in image segmentation

Cited in

(10)

• Probabilistic Relaxation Labeling by Fokker-Planck Diffusion on a Graph
• A doubly graduated method for inference in Markov random field
• scientific article; zbMATH DE number 4189256 (Why is no real title available?)
• An approach to reducing the labeling cost of Markov random fields within an infinite label space.
• Relaxation labeling: 25 years and still iterating
• Probabilistic relaxation labelling using the Fokker-Planck equation
• Neuro-fuzzy synergism to the intelligent system for edge detection and enhancement.
• An efficient feature fusion in HSI image classification
• Relaxation Labeling with Learning Automata
• Markov models for image labeling

This page was built for publication: A continuous relaxation labeling algorithm for Markov random fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3493229)