Skip to main content
SpringerLink
Log in

Comparison of Two Evolutionary Approaches for the Polygonal Approximation of Digital Curves

  • Conference paper
EVOLVE - A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation II

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 175))

Abstract

In this paper, we address the approximation of digital curves using straight-line segments. Our objective is to compare the performance of two population-based evolutionary algorithms: an evolutionary programming approach and a variable length chromosome genetic algorithm to solve the polygonal approximation problem.We describe the main elements of the methods under comparison and we show the results of the tests executed on a dataset comprising curves that exhibit a range of conditions with respect to two main features: openness and straightness. Our experiments show that the evolutionary programming based technique is faster and more accurate than the genetic algorithm based approach.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kolesnikov, A.: Fast algorithm for error-bounded compression of digital curves. In: Proc. of the 2010 IEEE Int. Conf. on Image Processing, Hong Kong, pp. 1453–1456 (2010)

    Google Scholar 

  2. Wang, Z., Li, H.Y.: User-controlled geometric feature preserving simplification. In: Fifth Interntional Conference on Frontier of Computer Science and Technology, pp. 335–340 (2010)

    Google Scholar 

  3. Sirakov, N., Swift, J., Mlsna, P.: Image database query using shape-based boundary descriptors. In: Proc. of International Conference on Intelligent Systems Design and Applications (ISDA 2003), pp. 373–382 (2003)

    Google Scholar 

  4. Perez, J., Vidal, E.: Optimum polygonal approximation of digitized curves. Pattern Recognition Letters 15, 743–750 (1994)

    Article  MATH  Google Scholar 

  5. Tsai, Y.H.: Fast polygonal approximation based on genetic algorithms. In: Proceedings of the 5th IEEE/ACIS International Conference on Computer and Information Science and 1st IEEE/ACIS International Workshop on Component-Based Software Engineering, Software Architecture and Reuse, pp. 322–326 (2006)

    Google Scholar 

  6. Traver, V.J., Recatalá, G., Iñesta, J.M.: Exploring the performance of genetic algorithms as polygonal approximators. In: 15th International Conference on Pattern Recognition, pp. 766–769 (2000)

    Google Scholar 

  7. Guanghui, L., Chuanbo, C.: A new approach for polygonal approximation of shape contours using genetic algorithms. In: Second IEEE Conference on Industrial Electronics and Applications, pp. 763–768 (2007)

    Google Scholar 

  8. Yin, P.Y.: Ant colony search algorithms for optimal polygonal approximation of plane curves. Pattern Recognition 36, 1783–1797 (2003)

    Article  MATH  Google Scholar 

  9. Dong, F., Xiao, R., Zhong, Y.: An approach to polygonal approximation of digital curves based on discrete particle swarm algorithm. Journal of Universal Computer Science 13(10), 1449–1461 (2007)

    Google Scholar 

  10. Yin, P.Y.: Genetic particle swarm optimization for polygonal approximation of digital curves. Image Processing, Analysis, Recognition and Understanding 16(2), 223–233 (2006)

    Article  Google Scholar 

  11. Yin, P.Y.: Vision Systems: Segmentation and Pattern Recognition. Polygonal Approximation of Digital Curves Using the State-of-the-art Metaheuristics, 451–464 (2007)

    Google Scholar 

  12. Fogel, L.J.: Intelligence through simulated evolution: forty years of evolutionary programming. John Wiley & Sons (1999)

    Google Scholar 

  13. Alvarado-Velazco, P.B., Ayala-Ramirez, V., Sanchez-Yanez, R.E.: Polygonal approximation of digital curves using evolutionary programming. Acta Universitaria 22(NE-1), 12–20 (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Electronics Engineering Department, Universidad de Guanajuato DICIS, Carr. Salamanca-Valle Km. 3.5+1.8, Salamanca, Mexico, 36700

    Paola Berenice Alvarado-Velazco & Victor Ayala-Ramirez

Authors
  1. Paola Berenice Alvarado-Velazco
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Victor Ayala-Ramirez
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Paola Berenice Alvarado-Velazco .

Editor information

Editors and Affiliations

  1. , Computer Science Department, CINVESTAV-IPN, Col. San Pedro Zacatenco 2508, Mexico City, 07360, Mexico

    Oliver Schütze

  2. , Computer Science Department, CINVESTAV-IPN, Col. San Pedro Zacatenco 2508, Mexico City, 07360, Mexico

    Carlos A. Coello Coello

  3. , Computer Science and Communications, University of Luxembourg, rue Richard Coudenhove-Kalergi 6, Luxembourg, 1359, Luxembourg

    Alexandru-Adrian Tantar

  4. Computer Science and Communications, Research Unit, University of Luxembourg, rue Richard Coudenhove-Kalergi 6, Luxembourg, L-1359, Luxembourg

    Emilia Tantar

  5. Computer Science, and Communications, University of Luxembourg, rue Richard Coudenhove-Kalergi 6, Luxembourg, L-1359, Luxembourg

    Pascal Bouvry

  6. Bordeaux Mathematical Institute, INRIA Bordeaux-Sud Ouest, Université Bordeaux I, cours de la Libération 351, Talence Cedex, 33405, France

    Pierre Del Moral

  7. Bâtiment Leyteire, UFR Sciences et Modélisation, Université Bordeaux II, 3ter place de la Victoire, Bordeaux, 33000, France

    Pierrick Legrand

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Alvarado-Velazco, P.B., Ayala-Ramirez, V. (2013). Comparison of Two Evolutionary Approaches for the Polygonal Approximation of Digital Curves. In: Schütze, O., et al. EVOLVE - A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation II. Advances in Intelligent Systems and Computing, vol 175. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31519-0_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31519-0_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31518-3

  • Online ISBN: 978-3-642-31519-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation