We present a novel multi-scale image segmentation approach based on irregular triangular and polygonal tessellations produced by proximity graphs. Our approach consists of two separate stages: polygonal seeds generation followed by an iterative bottom-up polygon agglomeration. We employ constrained Delaunay triangulation combined with the principles known from visual perception to extract an initial irregular polygonal tessellation of the image. These initial polygons are built upon a triangular mesh composed of irregular sized triangles, whose spatial arrangement is adapted to the image content. We represent the image as a graph with vertices corresponding to the built polygons and edges reflecting polygon relations. The segmentation problem is then formulated as Minimum Spanning Tree (MST) construction. We build a successive fine-to-coarse hierarchy of irregular polygonal partitions by an iterative graph contraction. It uses local information and merges the polygons bottom-up based on local region- and edge- based characteristics. © Springer-Verlag Berlin Heidelberg 2008.
CITATION STYLE
Skurikhin, A. N. (2008). Proximity graphs based multi-scale image segmentation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5358 LNCS, pp. 298–307). https://doi.org/10.1007/978-3-540-89639-5_29
Mendeley helps you to discover research relevant for your work.