A continuous relaxation labeling algorithm for Markov random fields
- 1 January 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics
- Vol. 20 (3) , 709-715
- https://doi.org/10.1109/21.57279
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- A parallel image segmentation algorithm using relaxation with varying neighborhoods and its mapping to array processorsComputer Vision, Graphics, and Image Processing, 1987
- Simple Parallel Hierarchical and Relaxation Algorithms for Segmenting Noncausal Markovian Random FieldsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- Bayes Smoothing Algorithms for Segmentation of Binary Images Modeled by Markov Random FieldsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1984
- On the Foundations of Relaxation Labeling ProcessesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- The relationship between image restoration by the maximum a posteriori method and a maximum entropy methodIEEE Transactions on Acoustics, Speech, and Signal Processing, 1980
- Markov Random Fields and Their ApplicationsPublished by American Mathematical Society (AMS) ,1980
- Relaxation Processes for Scene Labeling: Convergence, Speed, and StabilityIEEE Transactions on Systems, Man, and Cybernetics, 1978
- Approximating discrete probability distributionsIEEE Transactions on Information Theory, 1969
- Contingency tables with given marginalsBiometrika, 1968
- Maximum Entropy for Hypothesis Formulation, Especially for Multidimensional Contingency TablesThe Annals of Mathematical Statistics, 1963