|
|
Publications sur Hierarchical model
Résultat de la recherche dans la liste des publications :
Article |
1 - Unsupervised parallel image classification using Markovian models.
Z. Kato et J. Zerubia et M. Berthod. Pattern Recognition, 32(4): pages 591-604, 1999.
Mots-clés : Markov random field model, Hierarchical model, Parameter estimation, Parallel unsupervised image classification.
@ARTICLE{jz99a,
|
| author |
= |
{Kato, Z. and Zerubia, J. and Berthod, M.}, |
| title |
= |
{Unsupervised parallel image classification using Markovian models}, |
| year |
= |
{1999}, |
| journal |
= |
{Pattern Recognition}, |
| volume |
= |
{32}, |
| number |
= |
{4}, |
| pages |
= |
{591-604}, |
| pdf |
= |
{http://dx.doi.org/10.1016/S0031-3203(98)00104-6}, |
| keyword |
= |
{Markov random field model, Hierarchical model, Parameter estimation, Parallel unsupervised image classification} |
| } |
Abstract :
This paper deals with the problem of unsupervised classification of images modeled by Markov random fields (MRF). If the model parameters are known then we have various methods to solve the segmentation problem (simulated annealing (SA), iterated conditional modes (ICM), etc). However, when the parameters are unknown, the problem becomes more difficult. One has to estimate the hidden label field parameters only from the observed image. Herein, we are interested in parameter estimation methods related to monogrid and hierarchical MRF models. The basic idea is similar to the expectation–maximization (EM) algorithm: we recursively look at the maximum a posteriori (MAP) estimate of the label field given the estimated parameters, then we look at the maximum likelihood (ML) estimate of the parameters given a tentative labeling obtained at the previous step. The only parameter supposed to be known is the number of classes, all the other parameters are estimated. The proposed algorithms have been implemented on a Connection Machine CM200. Comparative experiments have been performed on both noisy synthetic data and real images. |
|
 haut de la page
Ces pages sont générées par 
|
Nouvelle page de démos
bibtex
