Regions adjacency graph applied to color image segmentation

The aim of this paper is to present different algorithms, based on a combination of two structures of 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 line graph associated. We will 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 adjacency relationships between regions than usual methods. Let us note nevertheless that this advantage leads in return to adjust more parameters than other methods to best refine the result of the segmentation, We will show that this adjustment is necessarily image dependent and observer dependent.