Abstract
Polygonalization is a way to approximate curves by straight-line segments. All the polygonalization methods use thresholds to produce the extreme points of the straight lines used in the approximation [1],[2],[3]. The method here introduced does not use thresholds to select the points. Ant Colony Optimization (ACO) is an optimization paradigm that mimics the exploration strategy of a colony of ants [4]. Images containing bi-dimensional shapes have been considered in this work. The goal is to find a good polygonal approximation of the contours of these images. The ants travel on segments connecting the points of the contours. Two points define a path in the ant travel. The points number of the polygonal approximation (num_steps) is user-defined. Last point connects with the first one. The two catheti AB and BC in Fig. 1 are a better curve approximation than the hypotenuse AC. AB + BC is longer than AC.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Williams, C., Bounded straigth-line approximation of digitized planar curves and lines. Computer Graphics Image Processing, 16: 370–381 (1981)
Pavlidis, T., Horowitz, S., Segmentation of planar curves. IEEE Trans. Comput., C-23: 860–870 (1974)
Wall, K., Danielsson, P.E.: A fast sequential method for polygonal approximation of digitized curves. Comput. Vision, Graphics and Image Process., 28: 220–227 (1984)
Stützle, T., Dorigo, M.: ACO Algorithms for the Quadratic Assignment Problem. In New Ideas in Optimization, McGraw-Hill (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vallone, U. (2002). Bidimensional Shapes Polygonalization by ACO. In: Dorigo, M., Di Caro, G., Sampels, M. (eds) Ant Algorithms. ANTS 2002. Lecture Notes in Computer Science, vol 2463. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45724-0_33
Download citation
DOI: https://doi.org/10.1007/3-540-45724-0_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44146-5
Online ISBN: 978-3-540-45724-4
eBook Packages: Springer Book Archive