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.

Spatio-temporal context for codebook-based dynamic background subtraction

Abstract: In background subtraction, it is challenging to detect foreground objects in the presence of dynamic background motions. The paper proposes two new algorithms to this problem by improving the codebook model with the incorporation of the spatial and temporal context of each pixel. The spatial context involves the local spatial dependency between neighboring pixels, and the temporal context involves the preceding detection result. Only the spatial context is incorporated into the first algorithm which makes the background representation more compact than the standard codebook. The second algorithm explicitly models the spatio-temporal context with a Markov random field model, thus achieving more accurate foreground detection. Extensive experiments on several dynamic scenes are conducted to compare the two proposed algorithms with each other and with the standard codebook algorithm. (C) 2009 Elsevier GmbH. All rights reserved.

Distributed Estimation and Detection for Sensor Networks Using Hidden Markov Random Field Models

Abstract: We develop a hidden Markov random field (HMRF) framework for distributed signal processing in sensor-network environments. Under this framework, spatially distributed observations collected at the sensors form a noisy realization of an underlying random field that has a simple structure with Markovian dependence. We derive iterated conditional modes (ICM) algorithms for distributed estimation of the hidden random field from the noisy measurements. We consider both parametric and nonparametric measurement-error models. The proposed distributed estimators are computationally simple, applicable to a wide range of sensing environments, and localized, implying that the nodes communicate only with their neighbors to obtain the desired results. We also develop a calibration method for estimating Markov random field model parameters from training data and discuss initialization of the ICM algorithms. The HMRF framework and ICM algorithms are applied to event-region detection. Numerical simulations demonstrate the performance of the proposed approach

Methods for automatic microarray image segmentation

Abstract: This paper describes image processing methods for automatic spotted microarray image analysis. Automatic gridding is important to achieve constant data quality and is, therefore, especially interesting for large-scale experiments as well as for integration of microarray expression data from different sources. We propose a Markov random field (MRF) based approach to high-level grid segmentation, which is robust to common problems encountered with array images and does not require calibration. We also propose an active contour method for single-spot segmentation. Active contour models describe objects in images by properties of their boundaries. Both MRFs and active contour models have been used in various other computer vision applications. The traditional active contour model must be generalized for successful application to microarray spot segmentation. Our active contour model is employed for spot detection in the MRF score functions as well as for spot signal segmentation in quantitative array image analysis. An evaluation using several image series from different sources shows the robustness of our methods.

A Label Field Fusion Bayesian Model and Its Penalized Maximum Rand Estimator for Image Segmentation

Abstract: This paper presents a novel segmentation approach based on a Markov random field (MRF) fusion model which aims at combining several segmentation results associated with simpler clustering models in order to achieve a more reliable and accurate segmentation result. The proposed fusion model is derived from the recently introduced probabilistic Rand measure for comparing one segmentation result to one or more manual segmentations of the same image. This non-parametric measure allows us to easily derive an appealing fusion model of label fields, easily expressed as a Gibbs distribution, or as a nonstationary MRF model defined on a complete graph. Concretely, this Gibbs energy model encodes the set of binary constraints, in terms of pairs of pixel labels, provided by each segmentation results to be fused. Combined with a prior distribution, this energy-based Gibbs model also allows for definition of an interesting penalized maximum probabilistic rand estimator with which the fusion of simple, quickly estimated, segmentation results appears as an interesting alternative to complex segmentation models existing in the literature. This fusion framework has been successfully applied on the Berkeley image database. The experiments reported in this paper demonstrate that the proposed method is efficient in terms of visual evaluation and quantitative performance measures and performs well compared to the best existing state-of-the-art segmentation methods recently proposed in the literature.