Markov random field

About: Markov random field is a research topic. Over the lifetime, 5669 publications have been published within this topic receiving 179568 citations. The topic is also known as: MRF.

Distributed Local MRF Models for Tissue and Structure Brain Segmentation

Abstract: Accurate tissue and structure segmentation of magnetic resonance (MR) brain scans is critical in several applications. In most approaches this task is handled through two sequential steps. We propose to carry out cooperatively both tissue and subcortical structure segmentation by distributing a set of local and cooperative Markov random field (MRF) models. Tissue segmentation is performed by partitioning the volume into subvolumes where local MRFs are estimated in cooperation with their neighbors to ensure consistency. Local estimation fits precisely to the local intensity distribution and thus handles nonuniformity of intensity without any bias field modelization. Similarly, subcortical structure segmentation is performed via local MRF models that integrate localization constraints provided by a priori fuzzy description of brain anatomy. Subcortical structure segmentation is not reduced to a subsequent processing step but joined with tissue segmentation: the two procedures cooperate to gradually and conjointly improve model accuracy. We propose a framework to implement this distributed modeling integrating cooperation, coordination, and local model checking in an efficient way. Its evaluation was performed using both phantoms and real 3 T brain scans, showing good results and in particular robustness to nonuniformity and noise with a low computational cost. This original combination of local MRF models, including anatomical knowledge, appears as a powerful and promising approach for MR brain scan segmentation.

Markov Random Field Surface Reconstruction

Abstract: A method for implicit surface reconstruction is proposed. The novelty in this paper is the adaption of Markov Random Field regularization of a distance field. The Markov Random Field formulation allows us to integrate both knowledge about the type of surface we wish to reconstruct (the prior) and knowledge about data (the observation model) in an orthogonal fashion. Local models that account for both scene-specific knowledge and physical properties of the scanning device are described. Furthermore, how the optimal distance field can be computed is demonstrated using conjugate gradients, sparse Cholesky factorization, and a multiscale iterative optimization scheme. The method is demonstrated on a set of scanned human heads and, both in terms of accuracy and the ability to close holes, the proposed method is shown to have similar or superior performance when compared to current state-of-the-art algorithms.

Improved VHR Urban Area Mapping Exploiting Object Boundaries

Abstract: In this paper, a mapping procedure exploiting object boundaries in very high-resolution (VHR) images is proposed. After discrimination between boundary and nonboundary pixel sets, each of the two sets is separately classified. The former are labeled using a neural network (NN), and the shape of the pixel set is finely tuned by enforcing a few geometrical constraints, while the latter are classified using an adaptive Markov random field (MRF) model. The two mapping outputs are finally combined through a decision fusion process. Experimental results on hyperspectral and satellite VHR imagery show the superior performance of this method over conventional NN and MRF classifiers.

Fast image-based obstacle detection from unmanned surface vehicles

Abstract: Obstacle detection plays an important role in unmanned surface vehicles (USV). The USVs operate in highly diverse environments in which an obstacle may be a floating piece of wood, a scuba diver, a pier, or a part of a shoreline, which presents a significant challenge to continuous detection from images taken onboard. This paper addresses the problem of online detection by constrained unsupervised segmentation. To this end, a new graphical model is proposed that affords a fast and continuous obstacle image-map estimation from a single video stream captured onboard a USV. The model accounts for the semantic structure of marine environment as observed from USV by imposing weak structural constraints. A Markov random field framework is adopted and a highly efficient algorithm for simultaneous optimization of model parameters and segmentation mask estimation is derived. Our approach does not require computationally intensive extraction of texture features and comfortably runs in real-time. The algorithm is tested on a new, challenging, dataset for segmentation and obstacle detection in marine environments, which is the largest annotated dataset of its kind. Results on this dataset show that our model outperforms the related approaches, while requiring a fraction of computational effort.

Optimization by estimation of distribution with DEUM framework based on Markov random fields

Abstract: This paper presents a Markov random field (MRF) approach to estimating and sampling the probability distribution in populations of solutions. The approach is used to define a class of algorithms under the general heading distribution estimation using Markov random fields (DEUM). DEUM is a subclass of estimation of distribution algorithms (EDAs) where interaction between solution variables is represented as an undirected graph and the joint probability of a solution is factorized as a Gibbs distribution derived from the structure of the graph. The focus of this paper will be on describing the three main characteristics of DEUM framework, which distinguishes it from the traditional EDA. They are: 1) use of MRF models, 2) fitness modeling approach to estimating the parameter of the model and 3) Monte Carlo approach to sampling from the model.