Abstract
We present a broad algorithmic framework for transforming an image comprised of pixels into a vectorized image segmented into polygons that can be subsequently used in image processing and understanding. A digital image is processed to extract edge pixel chains and a constrained Delaunay triangulation of the edge contour set is performed to yield triangles that cover the pixelated image without crossing edge contours. Each triangle is attributed a color by a Monte Carlo sampling of pixels within it. A combination of rules, each of which models an elementary perceptual grouping criterion, determines which adjacent triangles should be merged. A grouping graph is formed with vertices representing triangles and edges between vertices that correspond to adjacent triangles to be merged according to the combination of grouping rules. A connected component analysis on the grouping graph then yields collections of triangles that form polygons segmenting and vectorizing the image.
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
Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. PAMI (2000)
Mahamud, S., Williams, L.R., Thornber, K.K., Xu, K.: Segmentation of Multiple Salient Closed Contours from Real Images. IEEE Trans. PAMIÂ 25(4) (2003)
Blum, H.: A Transformation for Extracting New Descriptors of Shape. In: Whaten-Dunn, W. (ed.) Symp. Models for Speech and Visual Form. MIT Press, Redmond (1967)
Goodman, J.E., O’Rourke, J. (eds.): Handbook of Discrete and Computational Geometry. CRC Press (1997)
Prasad, L.: Morphological Analysis of Shapes. CNLS Newsletter 139 (July 1997)
Prasad, L., Rao, R.L.: A Geometric Transform for Shape Feature Extraction. In: Proc. SPIE, vol. 4117, Vision Geometry IX (2000)
Prasad, L., Skourikhine, A.N.: VISTA: Vectorized Image Segmentation via Trixel Agglomeration. Los Alamos Invention Disclosure 2003-064/S-100Â 632 (June 2003)
Tu, P., Saxena, T., Hartley, R.: Recognizing Objects Using Color-Annotated Adjacency Graphs. In: Forsyth, D., Mundy, J.L., Di Gesú, V., Cipolla, R. (eds.) Shape, Contour, and Grouping 1999. LNCS, vol. 1681, p. 246. Springer, Heidelberg (1999)
Wu, Q., Yu, Y.: Two-level Image Segmentation Based on Region and Edge Intergration. In: Proc. 7th Digital Image Computing, Sydney (December 2003)
Canny, J.: A Computational Approach to Edge Detection. IEEE Trans. on Pattern Analysis and Machine Intelligence 8(6) (November 1986)
Shewchuck, J.: Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator. In: ACM 1st Workshop on Appl. Comp. Geom., Philadelphia, PA (1996)
M. Wertheimer.: Laws of Organization in Perceptual Forms (1923); Ellis, W.: Trans. in: A sourcebook of Gestalt psychology (1938)
Mumford, D., Shah, J.: Optimal approximations by piecewise smooth functions and associated variational problems. Communications on Pure and Applied Mathematics 42, 577–684 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Prasad, L., Skourikhine, A.N. (2005). Vectorized Image Segmentation via Trixel Agglomeration. In: Brun, L., Vento, M. (eds) Graph-Based Representations in Pattern Recognition. GbRPR 2005. Lecture Notes in Computer Science, vol 3434. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31988-7_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-31988-7_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25270-2
Online ISBN: 978-3-540-31988-7
eBook Packages: Computer ScienceComputer Science (R0)