Markov Random Fields in Image Segmentation introduces the fundamentals of Markovian modeling in image segmentation as well as providing a brief overview of recent advances in the field.

%I Now Publishers %C Hanover, NH %8 2012 %G eng %9 Book %0 Journal Article %J IEEE TRANSACTIONS ON IMAGE PROCESSING %D 2009 %T Detection of Object Motion Regions in Aerial Image Pairs with a Multilayer Markovian Model %A Csaba Benedek %A Tamas Sziranyi %A Zoltan Kato %A Josiane Zerubia %XWe propose a new Bayesian method for detectingthe regions of object displacements in aerial image pairs. We use a robust but coarse 2-D image registration algorithm. Our main challenge is to eliminate the registration errors from the extracted change map. We introduce a three-layer Markov Random Field (L3MRF) model which integrates information from two different features, and ensures connected homogenous regions in the segmented images. Validation is given on real aerial photos.

%B IEEE TRANSACTIONS ON IMAGE PROCESSING %I IEEE %V 18 %P 2303 - 2315 %8 2009 %@ 1057-7149 %G eng %N 10 %9 Journal article %! IEEE T IMAGE PROCESS %R 10.1109/TIP.2009.2025808 %0 Journal Article %J PATTERN RECOGNITION %D 2009 %T A higher-order active contour model of a 'gas of circles' and its application to tree crown extraction %A Peter Horvath %A Ian Jermyn %A Zoltan Kato %A Josiane Zerubia %B PATTERN RECOGNITION %V 42 %P 699 - 709 %8 2009/// %@ 0031-3203 %G eng %N 5 %! PATTERN RECOGN %0 Conference Paper %B A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2007 %D 2007 %T Kör alakú objektumok szegmentálása magasabb rendű aktív kontúr modellek segítségével %A Peter Horvath %A Ian Jermyn %A Zoltan Kato %A Josiane Zerubia %E Attila Fazekas %E András Hajdú %B A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2007 %I Képfeldolgozók és Alakfelismerők Társasága %C Debrecen %P 133 - 140 %8 Jan 2007 %G eng %9 Conference paper %0 Generic %D 2007 %T A Three-layer MRF model for Object Motion Detection in Airborne Images %A Csaba Benedek %A Tamas Sziranyi %A Zoltan Kato %A Josiane Zerubia %8 2007/// %G eng %0 Book Section %B Proceedings of the18th International Conference on Pattern Recognition, ICPR 2006 %D 2006 %T A higher-order active contour model for tree detection %A Peter Horvath %A Ian Jermyn %A Zoltan Kato %A Josiane Zerubia %E YY Tang %XWe present a model of a 'gas of circles', the ensemble of regions in the image domain consisting of an unknown number of circles with approximately fixed radius and short range repulsive interactions, and apply it to the extraction of tree crowns from aerial images. The method uses the recently introduced 'higher order active contours' (HOACs), which incorporate long-range interactions between contour points, and thereby include prior geometric information without using a template shape. This makes them ideal when looking for multiple instances of an entity in an image. We study an existing HOAC model for networks, and show via a stability calculation that circles stable to perturbations are possible for constrained parameter sets. Combining this prior energy with a data term, we show results on aerial imagery that demonstrate the effectiveness of the method and the need for prior geometric knowledge. The model has many other potential applications. © 2006 IEEE.

%B Proceedings of the18th International Conference on Pattern Recognition, ICPR 2006 %I IEEE %P 130 - 133 %8 2006/// %G eng %0 Conference Paper %B Proceedings of the International Conference on Pattern Recognition (ICPR) %D 2006 %T A Higher-Order Active Contour Model for Tree Detection %A Peter Horvath %A Ian Jermyn %A Zoltan Kato %A Josiane Zerubia %XWe present a model of a 'gas of circles', the ensemble of regions in the image domain consisting of an unknown number of circles with approximately fixed radius and short range repulsive interactions, and apply it to the extraction of tree crowns from aerial images. The method uses the recently introduced 'higher order active contours' (HOACs), which incorporate long-range interactions between contour points, and thereby include prior geometric information without using a template shape. This makes them ideal when looking for multiple instances of an entity in an image. We study an existing HOAC model for networks, and show via a stability calculation that circles stable to perturbations are possible for constrained parameter sets. Combining this prior energy with a data term, we show results on aerial imagery that demonstrate the effectiveness of the method and the need for prior geometric knowledge. The model has many other potential applications. ` `

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. © 1999 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.

%B PATTERN RECOGNITION %V 32 %P 591 - 604 %8 1999/// %@ 0031-3203 %G eng %N 4 %! PATTERN RECOGN %0 Generic %D 1997 %T Image segmentation using Markov random field model in fully parallel cellular network architectures. %A Tamas Sziranyi %A Josiane Zerubia %A László Czúni %A David Geldreich %A Zoltan Kato %P - 17 %8 1997/// %G eng %0 Generic %D 1997 %T Markov Random Field Image Segmentation using Cellular Neural Network %A Tamas Sziranyi %A Josiane Zerubia %A László Czúni %A David Geldreich %A Zoltan Kato %8 1997/// %G eng %0 Conference Paper %B A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 1997 %D 1997 %T MRF based image segmentation with fully parallel cellular nonlinear networks %A Tamas Sziranyi %A Josiane Zerubia %A David Geldreich %A Zoltan Kato %A László Czúni %E Tamas Sziranyi %E József Berke %B A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 1997 %I Pannon Agrártudományi Egyetem Georgikon Mezőgazdaságtudományi Kar %C Keszthely %P 43 - 50 %8 Oct 1997 %G eng %0 Journal Article %J IMAGE AND VISION COMPUTING %D 1996 %T Bayesian image classification using Markov random fields %A Mark Berthod %A Zoltan Kato %A Shan Yu %A Josiane Zerubia %XIn this paper, we present three optimisation techniques, Deterministic Pseudo-Annealing (DPA), Game Strategy Approach (GSA), and Modified Metropolis Dynamics (MMD), in order to carry out image classification using a Markov random field model. For the first approach (DPA), the a posteriori probability of a tentative labelling is generalised to a continuous labelling. The merit function thus defined has the same maxima under constraints yielding probability vectors. Changing these constraints convexifies the merit function. The algorithm solves this unambiguous maximisation problem, and then tracks down the solution while the original constraints are restored yielding a good, even if suboptimal, solution to the original labelling assignment problem. In the second method (GSA), the maximisation problem of the a posteriori probability of the labelling is solved by an optimisation algorithm based on game theory. A non-cooperative n-person game with pure strategies is designed such that the set of Nash equilibrium points of the game is identical to the set of local maxima of the a posteriori probability of the labelling. The algorithm converges to a Nash equilibrium. The third method (MMD) is a modified version of the Metropolis algorithm: at each iteration the new state is chosen randomly, but the decision to accept it is purely deterministic. This is also a suboptimal technique but it is much faster than stochastic relaxation. These three methods have been implemented on a Connection Machine CM2. Experimental results are compared to those obtained by the Metropolis algorithm, the Gibbs sampler and ICM (Iterated Conditional Mode).

%B IMAGE AND VISION COMPUTING %V 14 %P 285 - 295 %8 1996/// %@ 0262-8856 %G eng %N 4 %! IMAGE VISION COMPUT %0 Book Section %B 1996 FOURTH IEEE INTERNATIONAL WORKSHOP ON CELLULAR NEURAL NETWORKS AND THEIR APPLICATIONS, PROCEEDINGS (CNNA-96) %D 1996 %T Cellular Neural Network in Markov Random Field Image Segmentation %A Tamas Sziranyi %A Josiane Zerubia %A David Geldreich %A Zoltan Kato %A *IEEE Circuits & *Society %B 1996 FOURTH IEEE INTERNATIONAL WORKSHOP ON CELLULAR NEURAL NETWORKS AND THEIR APPLICATIONS, PROCEEDINGS (CNNA-96) %I Wiley - IEEE Press %C New York %P 139 - 144 %8 1996/// %G eng %0 Journal Article %J GRAPHICAL MODELS AND IMAGE PROCESSING %D 1996 %T A Hierarchical Markov Random Field Model and Multitemperature Annealing for Parallel Image Classification %A Zoltan Kato %A Mark Berthod %A Josiane Zerubia %XIn this paper, we are interested in massively parallel multiscale relaxation algorithms applied to image classification. It is well known that multigrid methods can improve significantly the convergence rate and the quality of the final results of iterative relaxation techniques. First, we present a classical multiscale model which consists of a label pyramid and a whole observation field. The potential functions of coarser grids are derived by simple computations. The optimization problem is first solved at the higher scale by a parallel relaxation algorithm; then the next lower scale is initialized by a projection of the result. Second, we propose a hierarchical Markov random field model based on this classical model. We introduce new interactions between neighbor levels in the pyramid. It can also be seen as a way to incorporate cliques with far apart sites for a reasonable price. This model results in a relaxation algorithm with a new annealing scheme: the multitemperature annealing (MTA) scheme, which consists of associating higher temperatures to higher levels, in order to be less sensitive to local minima at coarser grids. The convergence to the global optimum is proved by a generalization of the annealing theorem of S. Geman and D. Geman (IEEE Trans. Pattern Anal. Mach. Intell. 6, 1984, 721-741). © 1996 Academic Press, Inc.

%B GRAPHICAL MODELS AND IMAGE PROCESSING %V 58 %P 18 - 37 %8 1996/// %@ 1077-3169 %G eng %N 1 %! GRAPH MODEL IM PROC %0 Journal Article %J IEEE TRANSACTIONS ON IMAGE PROCESSING %D 1995 %T DPA: a deterministic approach to the MAP problem %A Marc Berthod %A Zoltan Kato %A Josiane Zerubia %X Deterministic pseudo-annealing (DPA) is a new deterministic optimization method for finding the maximum a posteriori (MAP) labeling in a Markov random field, in which the probability of a tentative labeling is extended to a merit function on continuous labelings. This function is made convex by changing its definition domain. This unambiguous maximization problem is solved, and the solution is followed down to the original domain, yielding a good, if suboptimal, solution to the original labeling assignment problem. The performance of DPA is analyzed on randomly weighted graphs. %B IEEE TRANSACTIONS ON IMAGE PROCESSING %V 4 %P 1312 - 1314 %8 1995/// %@ 1057-7149 %G eng %N 9 %! IEEE T IMAGE PROCESS %0 Book Section %B ICASSP-95 %D 1995 %T Unsupervised adaptive image segmentation %A Zoltan Kato %A Josiane Zerubia %A Marc Berthod %A Wojciech Pieczynski %E *IEEE Signal Pro *Society %X 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. %B ICASSP-95 %I IEEE %C Piscataway %P 2399 - 2402 %8 1995/// %G eng %0 Book Section %B Proceedings of the 5th International Conference on Computer Vision %D 1995 %T Unsupervised parallel image classification using a hierarchical Markovian model %A Zoltan Kato %A Josiane Zerubia %A Marc Berthod %E IEEE Computer *Society %X 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, ICM, etc...). However, when they are not known, the problem becomes more difficult. One has to estimate the hidden label field parameters from the only observable image. Our approach consists of extending a recent iterative method of estimation, called Iterative Conditional Estimation (ICE) to a hierarchical markovian model. The idea resembles the Estimation-Maximization (EM) algorithm as 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. We propose unsupervised image classification algorithms using a hierarchical model. The only parameter supposed to be known is the number of regions, all the other parameters are estimated. The presented algorithms have been implemented on a Connection Machine CM200. Comparative tests have been done on noisy synthetic and real images (remote sensing). %B Proceedings of the 5th International Conference on Computer Vision %I IEEE %C Piscataway %P 169 - 174 %8 1995/// %G eng %0 Book Section %B Proceedings of the 12th IAPR International Conference on Pattern Recognition %D 1994 %T Multi-Temperature Annealing: A New Approach for the Energy-Minimization of Hierarchical Markov Random Field Models %A Josiane Zerubia %A Zoltan Kato %A Mark Berthod %E IEEE Computer *Society %B Proceedings of the 12th IAPR International Conference on Pattern Recognition %I IEEE %C Los Alamitos %P 520 - 522 %8 1994/// %G eng %0 Generic %D 1994 %T Segmentation hiérarchique d'images sur CM200 (Hierarchical Image Segmentation on the CM200) %A Zoltan Kato %A Josiane Zerubia %A Mark Berthod %8 1994/// %G eng %0 Generic %D 1994 %T Segmentation multirésolution d'images sur SUN version 1 du 26.05.1994 (Multiresolution Image Segmentation on SUN version 1 of 26.05.1994) %A Zoltan Kato %A Josiane Zerubia %A Mark Berthod %8 1994/// %G eng %U http://www.app.asso.fr/en/ %0 Book Section %B Maximum Entropy and Bayesian Methods %D 1993 %T Bayesian Image Classification Using Markov Random Fields %A Zoltan Kato %A Josiane Zerubia %A Mark Berthod %E Ali Mohammad-Djafari %E Guy Demoment %B Maximum Entropy and Bayesian Methods %I Kluwer Academic Publishers %C Dordrecht; Boston; London %P 375 - 382 %8 1993/// %G eng %0 Generic %D 1993 %T Extraction d'information dans les images SPOT %A Mark Berthod %A Gerard Giraudon %A Shan Liu %A Frank Mangin %A Zoltan Kato %A Sabine Urago %A Josiane Zerubia %8 1993/// %G eng %0 Generic %D 1993 %T A Hierarchical Markov Random Field Model and Multi-Temperature Annealing for Parallel Image Classification %A Zoltan Kato %A Mark Berthod %A Josiane Zerubia %8 1993/// %G eng %U http://hal.inria.fr/inria-00074736/ %0 Conference Paper %B International Workshop on Image and Multidimensional Digital Signal Processing (IMDSP) %D 1993 %T A Hierarchical Markov Random Field Model for Image Classification %A Zoltan Kato %A Mark Berthod %A Josiane Zerubia %B International Workshop on Image and Multidimensional Digital Signal Processing (IMDSP) %I IEEE Computer Soc. Pr. %8 Sep 1993 %G eng %0 Book Section %B Fourth International Conference on Computer Vision, ICCV 1993, Berlin, Germany, 11-14 May, 1993, Proceedings %D 1993 %T Multiscale Markov random field models for parallel image classification %A Zoltan Kato %A Marc Berthod %A Josiane Zerubia %E *IEEE Computer S *Analysis %E *Machine *Intelligence %X In this paper, we are interested in multiscale Markov Random Field (MRF) models. It is well known that multigrid methods can improve significantly the convergence rate and the quality of the final results of iterative relaxation techniques. Herein, we propose a new hierarchical model, which consists of a label pyramid and a whole observation field. The parameters of the coarse grid can be derived by simple computation from the finest grid. In the label pyramid, we have introduced a new local interaction between two neighbor grids. This model gives a relaxation algorithm which can be run in parallel on the entire pyramid. On the other hand, the new model allows to propagate local interactions more efficiently giving estimates closer to the global optimum for deterministic as well as for stochastic relaxation schemes. It can also be seen as a way to incorporate cliques with far apart sites for a reasonable price. %B Fourth International Conference on Computer Vision, ICCV 1993, Berlin, Germany, 11-14 May, 1993, Proceedings %I IEEE %C Los Alamitos %P 253 - 257 %8 1993/// %G eng %0 Book Section %B ICASSP-93 %D 1993 %T Parallel image classification using multiscale Markov random fields %A Zoltan Kato %A Marc Berthod %A Josiane Zerubia %E *IEEE Signal Pro *Society %E *Institute of Electri *Engineers %X 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. %B ICASSP-93 %I IEEE %C New York %P 137 - 140 %8 1993/// %G eng %0 Generic %D 1992 %T Image Classification Using Markov Random Fields with Two New Relaxation Methods %A Zoltan Kato %A Josiane Zerubia %A Mark Berthod %8 1992/// %G eng %U http://hal.inria.fr/docs/00/07/49/54/PDF/RR-1606.pdf %0 Conference Paper %B International Conference on Acoustics, Speech and Signal Processing (ICASSP) %D 1992 %T Satellite Image Classification Using a Modified Metropolis Dynamics %A Zoltan Kato %A Josiane Zerubia %A Mark Berthod %B International Conference on Acoustics, Speech and Signal Processing (ICASSP) %I IEEE Computer Soc. Pr. %P 573 - 576 %8 Mar 1992 %G eng