By Topic

Multiple-Region Segmentation Without Supervision by Adaptive Global Maximum Clustering

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)
Sunhee Kim ; Department of Mathematical Sciences, Seoul National University, Seoul, Korea ; Myungjoo Kang

In this paper, we propose a new method of segmenting an image into several sets of pixels with similar intensity values called regions. A multiple-region segmentation problem is unstable because the result considerably depends on the number of regions given a priori. Therefore, one of the most important tasks in solving the problem is automatically finding the number of regions. The method we propose is able to find the reasonable number of distinct regions not only for clean images but also for noisy ones. Our method is made up of two procedures. First, we develop the adaptive global maximum clustering. In this procedure, we deal with an image histogram and automatically obtain the number of significant local maxima of the histogram. This number indicates the number of different regions in the image. Second, we derive a simple and fast calculation to segment an image composed of distinct multiple regions. Then, we split an image into multiple regions according to the previous procedure. Finally, we show the efficiency of our method by comparing it with other previous methods.

Published in:

IEEE Transactions on Image Processing  (Volume:21 ,  Issue: 4 )