Boundary extraction through gradient-based evolutionary algorithm


  • Román Katz Departamento de Ingenieria Electrica y de Computadoras, Universidad Nacional del Sur, Bahia Blanca, ARGENTINA
  • Claudio Delrieux Departamento de Ingenieria Electrica y de Computadoras, Universidad Nacional del Sur, Bahia Blanca, ARGENTINA


Boundary Extraction, Pattern Recognition, Image Processing, Evolutionary Algorithms, Metaheuristics


Boundary extraction is an important procedure associated with recognition and interpretation tasks in digital image processing and computer vision. Most of the segmentation techniques are based on the detection of the local gradient, and then their application in noisy images is unstable and unreliable. Therefore global mechanisms are required, so that they can avoid falling into spurious solutions due to the noise. In this paper we present a gradient-based evolutionary algorithm as a heuristic mechanism to achieve boundary extraction in noisy digital images. Evolutionary algorithms explore the combinatory space of possible solutions by means of a process of selection of the best solutions (generated by mutation and crossover), followed by the evaluation of the new solutions (fitness) and the selection of a new set of solutions. Each possible solution is in our case a contour, whose fitness measures the variation of intensity accumulated along it. This process is repeated from a first approximation of the solution (the initial population)either a certain number of generations or until some appropriate halting criterion is reached. The uniform exploration of the space of solutions and the local minima avoidance induce to form better solutions through the gradual evolution of the populations.


Download data is not yet available.


[1] A. Blake and M. Isard. Active contours: the application of techniques from graphics, vision, control theory and statistics to visual tracking of shapes in motion. Springer-Verlag, 1998.
[2] D. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley,1989.
[3] Rafael Gonzalez and Richard Woods.´ Digital Image Processing. Addison-Wesley,1996.
[4] Anil Jain. Fundamentals of Digital Image Processing. Prentice-Hall,1996.
[5] Z. Michalewicz. Genetic Algorithms + Data Structures = Evolution Programs. Springer-Verlag, 1994.
[6] J. Park and J. M. Keller. Snakes on the Watershed. IEEE Transactions on Pattern Analysis and Machine Intelligence, 23(10):1201–1205, 2001.
[7] D. Pham and D. Karaboga. Intelligent Optimization Techniques: Genetic Algorithms, Tabu Search, Simulated Annealing, and Neural Networks. SpringerVerlag, 1998.
[8] V. J. Rayward-Smith, I. H. Osman, and C. R. Reeves. Modern Heuristic Search Methods. Wiley, 1996.
[9] I. Rechenberg. Evolution strategie: Optimierung technischer systeme nach prinzipien der biologischen evolution. Frommann-Holzboog, 1973.
[10] C. Xu and J. L. Prince. Snakes, Shapes, and Gradient Vector Flow,. IEEE Transactions on Image Processing, 28(3):359–369, 1998.




How to Cite

Katz, R., & Delrieux, C. (2003). Boundary extraction through gradient-based evolutionary algorithm. Journal of Computer Science and Technology, 3(01), p. 7–12. Retrieved from



Original Articles