Regions adjacency graph applied to color image segmentation

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