Search results for "Markov Random Field"

Fuzzy Distributed Genetic Approaches for Image Segmentation

2010

This paper presents a new image segmentation algorithm (called FDGA-Seg) based on a combination of fuzzy logic, multiagent systems and genetic algorithms. We propose to use a fuzzy representation of the image site labels by introducing some imprecision in the gray tones values. The distributivity of FDGA-Seg comes from the fact that it is designed around a MultiAgent System (MAS) working with two different architectures based on the master-slave and island models. A rich set of experimental segmentation results given by FDGA-Seg is discussed and compared to the ICM results in the last section.

Statistical Shape and Probability Prior Model for Automatic Prostate Segmentation

2011

International audience; Accurate prostate segmentation in Trans Rectal Ultra Sound (TRUS) images is an important step in different clinical applications. However, the development of computer aided automatic prostate segmentation in TRUS images is a challenging task due to low contrast, heterogeneous intensity distribution inside the prostate region, imaging artifacts like shadow, and speckle. Significant variations in prostate shape, size and contrast between the datasets pose further challenges to achieve an accurate segmentation. In this paper we propose to use graph cuts in a Bayesian framework for automatic initialization and propagate multiple mean parametric models derived from princi…

MRF Model-Based Approach for Image Segmentation Using a Chaotic MultiAgent System

2006

In this paper, we propose a new Chaotic MultiAgent System (CMAS) for image segmentation. This CMAS is a distributed system composed of a set of segmentation agents connected to a coordinator agent. Each segmentation agent performs Iterated Conditional Modes (ICM) starting from its own initial image created initially from the observed one by using a chaotic mapping. However, the coordinator agent receives and diversifies these images using a crossover and a chaotic mutation. A chaotic system is successfully used in order to benefit from the special chaotic characteristic features such as ergodic property, stochastic aspect and dependence on initialization. The efficiency of our approach is s…

Methods cooperation for multiresolution motion estimation

2002

For a medical application, we are interested in an estimation of optical flow on a patient's face, particularly around the eyes. Among the methods of optical flow estimation, gradient estimation and block matching are the main methods. However, the gradient-based approach can only be applied for small displacements (one or two pixels). Gener- ally, the process of block matching leads to good results only if the searching strategy is judiciously selected. Our approach is based on a Markov random field model, combined with an algorithm of block match- ing in a multiresolution scheme. The multiresolution approach allows de- tection of a large range of speeds. The large displacements are detect…

Using Fourier local magnitude in adaptive smoothness constraints in motion estimation

2007

Like many problems in image analysis, motion estimation is an ill-posed one, since the available data do not always sufficiently constrain the solution. It is therefore necessary to regularize the solution by imposing a smoothness constraint. One of the main difficulties while estimating motion is to preserve the discontinuities of the motion field. In this paper, we address this problem by integrating the motion magnitude information obtained by the Fourier analysis into the smoothness constraint, resulting in an adaptive smoothness. We describe how to achieve this with two different motion estimation approaches: the Horn and Schunck method and the Markov Random Field (MRF) modeling. The t…

On the use of adaptive spatial weight matrices from disease mapping multivariate analyses

2020

Conditional autoregressive distributions are commonly used to model spatial dependence between nearby geographic units in disease mapping studies. These distributions induce spatial dependence by means of a spatial weights matrix that quantifies the strength of dependence between any two neighboring spatial units. The most common procedure for defining that spatial weights matrix is using an adjacency criterion. In that case, all pairs of spatial units with adjacent borders are given the same weight (typically 1) and the remaining non-adjacent units are assigned a weight of 0. However, assuming all spatial neighbors in a model to be equally influential could be possibly a too rigid or inapp…

[IC‐P‐029]: GAUSSIAN MARKOV RANDOM FIELDS FOR ASSESSING INTERMODAL REGIONAL ASSOCIATIONS IN PRODROMAL ALZHEIMER's DISEASE

2017

Hidden Markov Random Fields and Direct Search Methods for Medical Image Segmentation

2016

The goal of image segmentation is to simplify the representation of an image to items meaningful and easier to analyze. Medical image segmentation is one of the fundamental problems in image processing field. It aims to provide a crucial decision support to physicians. There is no one way to perform the segmentation. There are several methods based on HMRF. Hidden Markov Random Fields (HMRF) constitute an elegant way to model the problem of segmentation. This modelling leads to the minimization of an energy function. In this paper we investigate direct search methods that are Nelder-Mead and Torczon methods to solve this optimization problem. The quality of segmentation is evaluated on grou…

A mutual GrabCut method to solve co-segmentation

2013

Publised version of an article from the journal:Eurasip Journal on Image and Video Processing. Also available on SpringerLink:http://dx.doi.org/10.1186/1687-5281-2013-20. Open Access Co-segmentation aims at segmenting common objects from a group of images. Markov random field (MRF) has been widely used to solve co-segmentation, which introduces a global constraint to make the foreground similar to each other. However, it is difficult to minimize the new model. In this paper, we propose a new Markov random field-based co-segmentation model to solve co-segmentation problem without minimization problem. In our model, foreground similarity constraint is added into the unary term of MRF model ra…

An autoregressive approach to spatio-temporal disease mapping

2007

Disease mapping has been a very active research field during recent years. Nevertheless, time trends in risks have been ignored in most of these studies, yet they can provide information with a very high epidemiological value. Lately, several spatio-temporal models have been proposed, either based on a parametric description of time trends, on independent risk estimates for every period, or on the definition of the joint covariance matrix for all the periods as a Kronecker product of matrices. The following paper offers an autoregressive approach to spatio-temporal disease mapping by fusing ideas from autoregressive time series in order to link information in time and by spatial modelling t…