By Topic

Stochastic relaxation on partitions with connected components and its application to image segmentation

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

1 Author(s)
Jia-Ping Wang ; Cergy-Pontoise Univ., France

We present a new method of segmentation in which images are segmented in partitions with connected components. We give computationally inexpensive algorithms for probability simulation and simulated annealing on the space of partitions with connected components of a general graph. In particular, Hastings algorithms (1970) and generalized Metropolis algorithms are defined to avoid heavy computation. To achieve segmentation, we propose a hierarchical approach which at each step minimizes a cost function on the space of partitions with connected components of a graph. The algorithm is applied to segment gray-level, color, and textured images

Published in:

IEEE Transactions on Pattern Analysis and Machine Intelligence  (Volume:20 ,  Issue: 6 )