A continuous relaxation labeling algorithm for Markov random fields

DOI10.1109/21.57279zbMATH Open0709.68018OpenAlexW2083244749MaRDI QIDQ3493229FDOQ3493229

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

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

zbMATH Keywords

finite graphMarkov random fieldprobabilistic relaxation algorithm

Mathematics Subject Classification ID

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

Cited In (10)

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

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)