<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Zoltan Kato</style></author><author><style face="normal" font="default" size="100%">Josiane Zerubia</style></author><author><style face="normal" font="default" size="100%">Marc Berthod</style></author><author><style face="normal" font="default" size="100%">Wojciech Pieczynski</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">*IEEE Signal Pro *Society</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Unsupervised adaptive image segmentation</style></title><secondary-title><style face="normal" font="default" size="100%">ICASSP-95</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1995</style></year><pub-dates><date><style  face="normal" font="default" size="100%">1995///</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">IEEE</style></publisher><pub-location><style face="normal" font="default" size="100%">Piscataway</style></pub-location><pages><style face="normal" font="default" size="100%">2399 - 2402</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">This paper deals with the problem of unsupervised Bayesian segmentation 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, ICM, etc...). However, when they are not known, the problem becomes more difficult. One has to estimate the hidden label field parameters from the available image only. Our approach consists of a recent iterative method of estimation, called Iterative Conditional Estimation (ICE), applied to a monogrid Markovian image segmentation model. The method has been tested on synthetic and real satellite images.</style></abstract><notes><style face="normal" font="default" size="100%">ScopusID: 0028996751doi: 10.1109/ICASSP.1995.479976</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Zoltan Kato</style></author><author><style face="normal" font="default" size="100%">Marc Berthod</style></author><author><style face="normal" font="default" size="100%">Josiane Zerubia</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">*IEEE Signal Pro *Society</style></author><author><style face="normal" font="default" size="100%">*Institute of Electri *Engineers</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Parallel image classification using multiscale Markov random fields</style></title><secondary-title><style face="normal" font="default" size="100%">ICASSP-93</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1993</style></year><pub-dates><date><style  face="normal" font="default" size="100%">1993///</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">IEEE</style></publisher><pub-location><style face="normal" font="default" size="100%">New York</style></pub-location><pages><style face="normal" font="default" size="100%">137 - 140</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">In this paper, we are interested in massively parallel multiscale relaxation algorithms applied to image classification. First, we present a classical multiscale model applied to supervised image classification. The model consists of a label pyramid and a whole observation field. The potential functions of the coarse grid are derived by simple computations. Then, we propose another scheme introducing a local interaction between two neighbor grids in the label pyramid. This is a way to incorporate cliques with far apart sites for a reasonable price. Finally we present the results on noisy synthetic data and on a SPOT image obtained by different relaxation methods using these models.</style></abstract><notes><style face="normal" font="default" size="100%">ScopusID: 0027266514doi: 10.1109/ICASSP.1993.319766</style></notes></record></records></xml>