By Topic

Color image segmentation using region adjacency 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 $33
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)
P. Colantoni ; CNRS, Univ. Jean Monnet de Saint Etienne, France ; B. Laget

An important aim of image analysis is to segment an image into parts that correlate strongly with real work objects or surfaces. In this paper, we present an algorithm for color image segmentation that uses a transformation based on region adjacency graphs. We examine partitions of region adjacency graphs that make it possible to pass rapidly from an initial representation of an image that uses a large number of regions to a final segmentation that is composed of appropriately few regions. After an initial segmentation process we create an associate adjacency graph, and partition this graph in two ways: by growth on graph vertices using region growing, and by a watershed transformation of a contour graph

Published in:

Image Processing and Its Applications, 1997., Sixth International Conference on  (Volume:2 )

Date of Conference:

14-17 Jul 1997