Many approaches to Bayesian image segmentation have used maximum a posteriori (MAP) estimation in conjunction with Markov random fields (MRF). Although this approach performs well, it has a number of disadvantages. In particular, exact MAP estimates cannot be computed, approximate MAP estimates are computationally expensive to compute, and unsupervised parameter estimation of the MRF is difficult. The authors propose a new approach to Bayesian image segmentation that directly addresses these problems. The new method replaces the MRF model with a novel multiscale random field (MSRF) and replaces the MAP estimator with a sequential MAP (SMAP) estimator derived from a novel estimation criteria. Together, the proposed estimator and model result in a segmentation algorithm that is not iterative and can be computed in time proportional to MN where M is the number of classes and N is the number of pixels. The also develop a computationally efficient method for unsupervised estimation of model parameters. Simulations on synthetic images indicate that the new algorithm performs better and requires much less computation than MAP estimation using simulated annealing. The algorithm is also found to improve classification accuracy when applied to the segmentation of multispectral remotely sensed images with ground truth data. >

/pdf/a-multiscale-random-field-model-for-bayesian-image-4l9xf5lk6e.pdf

A multiscale random field model for Bayesian image segmentation

Reviews a significant component of the rich field of statistical multiresolution (MR) modeling and processing. These MR methods have found application and permeated the literature of a widely scattered set of disciplines, and one of our principal objectives is to present a single, coherent picture of this framework. A second goal is to describe how this topic fits into the even larger field of MR methods and concepts-in particular, making ties to topics such as wavelets and multigrid methods. A third goal is to provide several alternate viewpoints for this body of work, as the methods and concepts we describe intersect with a number of other fields. The principle focus of our presentation is the class of MR Markov processes defined on pyramidally organized trees. The attractiveness of these models stems from both the very efficient algorithms they admit and their expressive power and broad applicability. We show how a variety of methods and models relate to this framework including models for self-similar and 1/f processes. We also illustrate how these methods have been used in practice.

/pdf/multiresolution-markov-models-for-signal-and-image-3q2cf4ypr0.pdf

Multiresolution Markov models for signal and image processing

An automated system for detecting and classifying particular types of tumors in digitized mammograms is described The analysis of mammograms is performed in two stages First, the system identifies pixel groupings that may correspond to tumors Next, detected pixel groupings are subjected to classification The essence of the first processing stage is multiresolution image processing based on fuzzy pyramid linking The second stage uses a classification hierarchy to identify benign and malignant tumors Each level of the hierarchy uses deterministic or Bayes classifiers and a particular measurement The measurements pertain to shape and intensity characteristics of particular types of tumors The classification hierarchy is organized in such a way that the simplest measurements are used at the top, with the system stepping through the hierarchy only when it cannot classify the detected pixel groupings with certainty >

An approach to automated detection of tumors in mammograms

Image segmentation is difficult because objects may differ from their background by any of a variety of properties that can be observed in some, but often not all scales. A further complication is that coarse measurements, applied to the image for detecting these properties, often average over properties of neighboring segments, making it difficult to separate the segments and to reliably detect their boundaries. Below we present a method for segmentation that generates and combines multiscale measurements of intensity contrast, texture differences, and boundary integrity. The method is based on our former algorithm SWA, which efficiently detects segments that optimize a normalized-cut like measure by recursively coarsening a graph reflecting similarities between intensities of neighboring pixels. In this process aggregates of pixels of increasing size are gradually collected to form segments. We intervene in this process by computing properties of the aggregates and modifying the graph to reflect these coarse scale measurements. This allows us to detect regions that differ by fine as well as coarse properties, and to accurately locate their boundaries. Furthermore, by combining intensity differences with measures of boundary integrity across neighboring aggregates we can detect regions separated by weak, yet consistent edges.

/pdf/segmentation-and-boundary-detection-using-multiscale-3rd3m2dgo7.pdf

Hendrik James Antonisse

Papers

Image segmentation in pyramids