Advertisement

Reconstruction of Binary Images Represented on Equilateral Triangular Grid Using Evolutionary Algorithms

  • Elisa Valentina Moisi
  • Vladimir Ioan Cretu
  • Benedek Nagy
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 195)

Abstract

In this paper we study the problem of reconstructing a binary hexagonal image represented on an equilateral triangular grid from its projections. We propose an evolutionary algorithm for reconstructing this images from its projections in three directions. We will consider three projections as the points in the grid are triangles and by the symmetry of the grid there are three natural directions. Genetic operators, e.g., crossover and mutation operators are defined, as well as an operator based on the switch operator from discrete tomography. We use a compactness operator to eliminate the isolated points of an image and improve the quality of the image. The initial population and the children images are generated using the network flow algorithm with some restrictions due to the equilateral triangular grid and point shape and type. Some artificial binary images were used to test the efficiency of the algorithm.

Keywords

discrete tomography triangular grid genetic algorithm memetic algorithm 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Balázs, P., Balogh, E., Kuba, A.: Reconstruction of 8-connected but not 4-connected hv-convex discrete sets. Discrete Applied Mathematics 147, 149–168 (2005)MathSciNetMATHCrossRefGoogle Scholar
  2. 2.
    Batenburg, K.J.: Network Flow Algorithms for Discrete Tomography. PhD thesis (2006)Google Scholar
  3. 3.
    Batenburg, K.J.: An evolutionary algorithm for discrete tomography. Discrete Applied Mathematics 151, 36–54 (2005)MathSciNetMATHCrossRefGoogle Scholar
  4. 4.
    Bertsekas, D., Tseng, P.: RELAX-IV: a faster version of the RELAX code for solving minimum cost flow problems. LIDS Technical Report LIDS-P-2276, MIT (1994)Google Scholar
  5. 5.
    Bertsekas, D., Frangioni, A., Gentile, C.: Relax IV, The MCF Class Project (2004), http://www.di.unipi.it/di/groups/optimize/Software/MCF.html
  6. 6.
    Di Gesù, V., Lo Bosco, G., Millonzi, F., Valenti, C.: A Memetic Algorithm for Binary Image Reconstruction. In: Brimkov, V.E., Barneva, R.P., Hauptman, H.A. (eds.) IWCIA 2008. LNCS, vol. 4958, pp. 384–395. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  7. 7.
    Goldberg, D.E.: Genetic Algorithms in Search Optimization and Machine Learning. Addison Wesley (1989)Google Scholar
  8. 8.
    Lukic, T., Nagy, B.: Energy-minimization based Discrete Tomography Reconstruction Method for Images on Triangular Grid. In: 15th International Workshop on Combinatorial Image Analysis, IWCIA 2012 (accepted for publication, 2012)Google Scholar
  9. 9.
    Moisi, E., Nagy, B.: Discrete Tomography on the Triangular Grid: a Memetic Approach. In: 7th International Symposium on Image and Signal Processing and Analysis (ISPA 2011), Dubrovnik, Croatia, pp. 579–584 (2011)Google Scholar
  10. 10.
    Nagy, B.: Finding Shortest Path with Neighborhood Sequences in Triangular Grids. In: 2nd IEEE R8-EURASIP International Symposium on Image and Signal Processing and Analysis (ITI-ISPA 2001), Pula, Croatia, pp. 55–60 (2001)Google Scholar
  11. 11.
    Nagy, B.: Shortest Path in Triangular Grids with Neighbourhood Sequences. Journal of Computing and Information Technology 11, 111–122 (2003)CrossRefGoogle Scholar
  12. 12.
    Nagy, B.: Generalised triangular grids in digital geometry. Acta Mathematica Academiae Paedagogicae Nyíregyháziensis 20, 63–78 (2004)MATHGoogle Scholar
  13. 13.
    Nagy, B.: Distances with Neighbourhood Sequences in Cubic and Triangular Grids. Pattern Recognition Letters 28, 99–109 (2007)CrossRefGoogle Scholar
  14. 14.
    Spears, W.M.: Evolutionary Algorithms: The Role of the Mutation and recombination. Springer (2000)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Elisa Valentina Moisi
    • 1
  • Vladimir Ioan Cretu
    • 2
  • Benedek Nagy
    • 3
  1. 1.Department of Computer Science and Information Technology, Faculty of Electrical Engineering and Information TechnologyUniversity of OradeaOradeaRomania
  2. 2.Department of Computer and Software Engineering“Politehnica” University of TimisoaraTimisoaraRomania
  3. 3.Department of Computer Science, Faculty of InformaticsUniversity of DebrecenDebrecenHungary

Personalised recommendations