1996
DOI: 10.1016/0262-8856(95)01072-6
|View full text |Cite
|
Sign up to set email alerts
|

Bayesian image classification using Markov random fields

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
105
0
2

Year Published

1997
1997
2021
2021

Publication Types

Select...
6
2
1

Relationship

1
8

Authors

Journals

citations
Cited by 146 publications
(107 citation statements)
references
References 10 publications
0
105
0
2
Order By: Relevance
“…The most promising methods within this category are based on Markov random fields (MRF), a multidimensional extension of Markov chains [Kindermann and Snell, 1980;Chellappa and Jain, 1993]. These methods are usually insensitive to local image noise and produce reasonable results, but may require a priori knowledge for construction of an appropriate image model, a supervised learning process or manual initialization [e.g., Berthod et al, 1996;Szirányi et al, 2000;Li, 2001].…”
Section: Overview Of Segmentation Techniquesmentioning
confidence: 99%
See 1 more Smart Citation
“…The most promising methods within this category are based on Markov random fields (MRF), a multidimensional extension of Markov chains [Kindermann and Snell, 1980;Chellappa and Jain, 1993]. These methods are usually insensitive to local image noise and produce reasonable results, but may require a priori knowledge for construction of an appropriate image model, a supervised learning process or manual initialization [e.g., Berthod et al, 1996;Szirányi et al, 2000;Li, 2001].…”
Section: Overview Of Segmentation Techniquesmentioning
confidence: 99%
“…Unfortunately, as with any deformable surface or region growing approach, this method heavily depends on initial seeding (thresholding) and the implementation of the speed function (sensitivity to between-class intensity contrast and local gradient values) is governing contour evolution. [44] MRF-Berthod is an algorithm for supervised Bayesian segmentation developed by Berthod et al [1996]. We adopted a C ++ code written by Csaba Gradwohl and Zoltan Kato (University of Szeged, Hungary) to implement this algorithm.…”
Section: Locally Adaptive Segmentationmentioning
confidence: 99%
“…Due to the fine spatial detail contained in the VFSR imagery, the parameter γ controlling the level of smoothness was set as 0.7 to achieve an increasing level of smoothness in terms of the MRF. The simulated annealing optimization using a Gibbs sampler [55] was employed in MLP-MRF to maximize the posterior probability through iteration.…”
Section: B Model Architectures and Parameter Settingsmentioning
confidence: 99%
“…We can cite here some models widely used like the structural approach by regions growth [25], the stochastic approaches [11,12,16,17,21] and the variational approaches which are based on various strategies like level set formulations, the Mumford-Shah functional, active contours and geodesic active contours methods or wavelet transforms [7-9, 23, 24, 28, 29, 35].…”
Section: Introductionmentioning
confidence: 99%