Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bhandarkar, S.M., Zeng, X.: Evolutionary approaches to figure-ground separation. Applied Intelligence 11, 187–212 (1999)
Boyer, K.L., Sarkar, S. (eds.): Perceptual Organization for Artificial Vision Systems. Kluwer Acad. Publ., Dordrecht (2000)
Boykov, Y., Veksler, O., Zabin, R.: Fast approximate energy minimization via graph cuts. IEEE Trans. On Pattern Analysis and Machine Intelligence 23(11), 1222–1239 (2001)
Canny, J.: A computational approach to edge detection. IEEE Trans. on Pattern Analysis and Machine Intelligence 8(6), 679–698 (1986)
Felzenszwalb, P.F., Huttenlocher, D.P.: Image segmentation using local variation. In: Proc. of the IEEE Conf. on Computer Vision and Pattern Recognition, pp. 98–104 (1998)
Haxhimusa, Y., Kropatsch, W.G.: Segmentation graph hierarchies. In: Fred, A., Caelli, T.M., Duin, R.P.W., Campilho, A.C., de Ridder, D. (eds.) SSPR&SPR 2004. LNCS, vol. 3138, pp. 343–351. Springer, Heidelberg (2004)
Haxhimusa, Y., Ion, A., Kropatsch, W.G.: Comparing hierarchies of segmentations: Humans, normalized cut, and minimum spanning tree. In: Digital Imaging and Pattern Recognition, pp. 95–103 (2006)
Herault, L., Horaud, R.: Figure-ground discrimination: a combinatorial optimization approach. IEEE Trans. On Pattern Analysis and Machine Intelligence 15(9), 899–914 (1993)
Horowitz, S.L., Pavlidis, T.: Picture segmentation by a tree traversal algorithm. Journal of the Association for Computing Machinery 23(2), 368–388 (1976)
Jolion, J.-M., Montanvert, A.: The adaptive pyramid, a framework for 2D image analysis. CVGIP: Image Understanding 55(3), 339–348 (1992)
Kropatsch, W.G., Haxhimusa, Y., Ion, A.: Multiresolution image segmentation in graph pyramids. In: Kandel, A., Bunke, H.H., Last, M. (eds.) Applied Graph Theory in Computer Vision and Pattern Recognition, vol. 52, pp. 3–42 (2007)
Montanvert, A., Meer, P., Rosenfeld, A.: Hierarchical image analysis using irregular tesselations. IEEE Trans. on Pattern Analysis and Machine Intelligence 13(4), 307–316 (1991)
Prasad, L., Skourikhine, A.N.: Vectorized image segmentation via trixel agglomeration. Pattern Recognition 39(4), 501–514 (2006)
Prasad, L., Skourikhine, A.N.: Vectorized image segmentation via trixel agglomeration. Pattern Recognition, U.S. Patent No. 7127104 (2006)
Sarkar, S., Soundararajan, P.: Supervised learning of large perceptual organization: graph spectral partitioning and learning automata. IEEE Trans. On Pattern Analysis and Machine Intelligence 22(5), 504–525 (2000)
Shewchuk, J.R.: Triangle: engineering a 2D quality mesh generator and Delaunay triangulator. LNCS, vol. 1148, pp. 203–222. Springer, Heidelberg (1996)
Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. on Pattern Analysis and Machine Intelligence 22(8), 888–905 (2000)
Wertheimer, M.: Principles of perceptual organization. In: Beardslee, D., Wertheimer, M. (eds.) Readings in Perception. Van Nostrand, D. Princeton, NJ, pp. 115–135 (1958)
Xu, Y., Uberbacher, E.C.: 2D image segmentation using minimum spanning trees. Image and Vision Computing 15, 47–57 (1997)
Yu, S.X.: Segmentation using multiscale cues. In: Proc. of the IEEE Conf. on Computer Vision and Pattern Recognition, vol. 1, pp. 247–254 (2004)
Zahn, C.T.: Graph-theoretic methods for detecting and describing gestalt clusters. IEEE Transactions on Computers 20(1), 68–86 (1971)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Skurikhin, A.N. (2008). Proximity Graphs Based Multi-scale Image Segmentation. In: Bebis, G., et al. Advances in Visual Computing. ISVC 2008. Lecture Notes in Computer Science, vol 5358. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89639-5_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-89639-5_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89638-8
Online ISBN: 978-3-540-89639-5
eBook Packages: Computer ScienceComputer Science (R0)