A segmentation can be represented by a graph where each vertex corresponds to a region and where the arc between two vertices (i.e. two regions) denotes the connectivity between the two regions. Each vertex and each arc being characterized by a set of attributes (color attributes, geometrical attributes, ...), the first aim of the paper is to define a symbolic description for each attribute. Then, by using rule basis, the similarity between two adjacent regions is also described in a symbolic way. Finally, according to this similarity definition the graph is reduced to get a simplified segmentation. In the presented applications, it is shown that the simplification can be performed in different ways, depending on a the aim of the analysis.
展开▼
