Proceedings. Fourteenth International Conference on Pattern Recognition (Cat. No.98EX170)
DOI: 10.1109/icpr.1998.711275
|View full text |Cite
|
Sign up to set email alerts
|

Unsupervised texture based image segmentation by simulated annealing using Markov random field and Potts models

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 13 publications
0
2
0
Order By: Relevance
“…Some algorithms are based on simple tools such as the histograms and others are very computationally expensive such as MRF-label modeling. Optimization algorithms such as mean-field annealing (MFA), stochastic simulated annealing (SSA), and iterative conditional mode (ICM) [3,4,5] among others are used to solve segmentation problems in general. MFA has proven its superiority on others in two ways, computational complexity and optimality of the solution [6], and thus was chosen for this work.…”
Section: Introductionmentioning
confidence: 99%
“…Some algorithms are based on simple tools such as the histograms and others are very computationally expensive such as MRF-label modeling. Optimization algorithms such as mean-field annealing (MFA), stochastic simulated annealing (SSA), and iterative conditional mode (ICM) [3,4,5] among others are used to solve segmentation problems in general. MFA has proven its superiority on others in two ways, computational complexity and optimality of the solution [6], and thus was chosen for this work.…”
Section: Introductionmentioning
confidence: 99%
“…Especially, random field models such as Gibbs and Markov random fields have been extensively used to model images [16,17,18,19]. …”
Section: Introductionmentioning
confidence: 99%