Region Merging for Severe Oversegmented Images Using a Hierarchical Social Metaheuristic
نویسندگان
چکیده
This paper proposes a new evolutionary region merging method to improve segmentation quality result on oversegmented images. The initial segmented image is described by a modified Region Adjacency Graph model. In a second phase, this graph is successively partitioned in a hierarchical fashion into two subgraphs, corresponding to the two most significant components of the actual image, until a termination condition is met. This graph-partitioning task is solved as a variant of the min-cut problem (normalized cut) using a Hierarchical Social (HS) metaheuristic. We applied the proposed approach on different standard test images, with high-quality visual and objective segmentation results.
منابع مشابه
Improving image segmentation quality through effective region merging using a hierarchical social metaheuristic
This paper proposes a new evolutionary region merging method in order to efficiently improve segmentation quality results. Our approach starts from an oversegmented image, which is obtained by applying a standard morphological watershed transformation on the original image. Next, each resulting region is represented by its centroid. The oversegmented image is described by a simplified undirecte...
متن کاملRegion-based Correspondence in Oversegmented Images. Correspondencia Basada En Regiones En Imágenes Sobresegmentadas. Region-based Correspondence in Oversegmented Images
A method to solve oversegmentation and undersegmentation in a region-based correspondence process is presented. The approach is based on performing a preprocessing step before using existing graph based methods. This preprocessing tries to assess the possible split regions in each image, with respect to the corresponding image, and form merge regions that could map better with regions in the ot...
متن کاملTop-Down Evolutionary Image Segmentation Using a Hierarchical Social Metaheuristic
This paper presents an application of a hierarchical social (HS) metaheuristic to region-based segmentation. The original image is modelled as a simplified image graph, which is successively partitioned into two regions, corresponding to the most significant components of the actual image, until a termination condition is met. The graph-partitioning task is solved as a variant of the min-cut pr...
متن کاملA Graph-Based Image Segmentation Algorithm Using a Hierarchical Social Metaheuristic
This chapter proposes a new evolutionary graph-based image segmentation method to improve quality result. Our approach is quite general and can be considered as a pixel or region based segmentation technique. What is more important is that they (pixels or regions) are not necessarily adjacent. It starts from an image described by a simplified undirected weighted graph where nodes represent eith...
متن کاملImage Segmentation of Color Image Based on Region Coherency
Two-step image segmentation algorithm is proposed, which is based on region coherency for the segmentation of color image. The first step is the watershed segmentation, and the next one is the region merging using artificial neural networks. Spatially homogeneous regions are obtained by the first step, but the regions are oversegmented. The second step merges the oversegmented regions. The prop...
متن کامل