Training Bayesian networks for image segmentation

Xiaojuan Feng, Christopher Williams

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

We are concerned with the problem of image segmentation in which each pixel is assigned to one of a predefined finite number of classes. In Bayesian image analysis, this requires fusing together local predictions for the class labels with a prior model of segmentations. Markov Random Fields (MRFs) have been used to incorporate some of this prior knowledge, but this not entirely satisfactory as inference in MRFs is NP-hard. The multiscale quadtree model of Bouman and Shapiro (1994) is an attractive alternative, as this is a tree-structured belief network in which inference can be carried out in linear time (Pearl 1988). It is an hierarchical model where the bottom-level nodes are pixels, and higher levels correspond to downsampled versions of the image. The conditional-probability tables (CPTs) in the belief network encode the knowledge of how the levels interact. In this paper we discuss two methods of learning the CPTs given training data, using (a) maximum likelihood and the EM algorithm and (b) conditional maximum likelihood (CML). Segmentation obtained using networks trained by CML show a statistically-significant improvement in performance on synthetic images. We also demonstrate the methods on a real-world outdoor- scene segmentation task.
Original languageEnglish
Title of host publicationSPIE's International Symposium on Optical Science, Engineering, and Instrumentation
Pages82-92
Number of pages11
DOIs
Publication statusPublished - 1998

Fingerprint

Dive into the research topics of 'Training Bayesian networks for image segmentation'. Together they form a unique fingerprint.

Cite this