By Topic

Regions adjacency graph applied to color 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

2 Author(s)
A. Tremeau ; Inst. d'Ingnierie de la Vision-LIGIV, Univ. Jean Monnet, Saint-Etienne, France ; P. Colantoni

This paper presents different algorithms, based on a combination of two structures of a graph and of two color image processing methods, in order to segment color images. The structures used in this study are the region adjacency graph and the associated line graph. We see how these structures can enhance segmentation processes such as region growing or watershed transformation. The principal advantage of these structures is that they give more weight to the adjacency relationships between regions than the usual methods. We note, nevertheless, that this advantage leads the adjustment of more parameters than other methods to best refine the result of the segmentation. We show that this adjustment is necessarily image dependent and observer dependent

Published in:

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