By Topic

Image segmentation using factor graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
R. J. Drost ; Coordinated Sci. Lab., Illinois Univ., Urbana-Champaign, IL, USA ; A. C. Singer

Factor graphs were first studied in the context of error correction decoding and have since been shown to be a useful tool in a wide variety of applications. In this paper, we provide a brief introduction to factor graphs with an emphasis on their broad applicability, and then describe a new algorithm for segmenting binary images that have been blurred and corrupted by additive white Gaussian noise. Though the algorithm is developed for this particular class of images, generalizations are immediate. Simulation results detail the performance of the algorithm for images in three separate blurring conditions. The results suggest the potential for this approach, providing additional evidence of the usefulness of the factor graph framework.

Published in:

Statistical Signal Processing, 2003 IEEE Workshop on

Date of Conference:

28 Sept.-1 Oct. 2003