Discrete tomography on the triangular grid: a memetic approach

In this paper we present a memetic algorithm for the reconstruction of binary images represented on a triangular grid. We define the crossover and mutation evolutionary algorithm operators introduced on this grid. We propose a discrete tomography algorithm which uses a switch and compactness operators for the triangular grid to improve the quality of the image in each generation. The algorithm was tested on some images for its effectiveness.

[1]  Kees Joost Batenburg,et al.  A Network Flow Algorithm for Reconstructing Binary Images from Continuous X-rays , 2008, Journal of Mathematical Imaging and Vision.

[2]  G. Herman,et al.  Advances in discrete tomography and its applications , 2007 .

[3]  Vito Di Gesù,et al.  A Memetic Algorithm for Binary Image Reconstruction , 2008, IWCIA.

[4]  Benedek Nagy.  Distances with neighbourhood sequences in cubic and triangular grids , 2007, Pattern Recognit. Lett..

[5]  H. Ryser.  Combinatorial Properties of Matrices of Zeros and Ones , 1957, Canadian Journal of Mathematics.

[6]  Vito Di Gesù,et al.  A memetic approach to discrete tomography from noisy projections , 2010, Pattern Recognit..

[7]  Benedek Nagy,et al.  Shortest Paths in Triangular Grids with Neighbourhood Sequences , 2003 .

[8]  Benedek Nagy.  Finding shortest path with neighbourhood sequences in triangular grids , 2001, ISPA 2001. Proceedings of the 2nd International Symposium on Image and Signal Processing and Analysis. In conjunction with 23rd International Conference on Information Technology Interfaces (IEEE Cat..

[9]  Attila Kuba,et al.  Reconstruction of 8-connected but not 4-connected hv-convex discrete sets , 2005, Discret. Appl. Math..

[10]  Benedek Nagy.  GENERALISED TRIANGULAR GRIDS IN DIGITAL GEOMETRY , 2004 .

[11]  Kees Joost Batenburg,et al.  Network Flow Algorithms for Discrete Tomography , 2007 .

[12]  Dimitri P. Bertsekas,et al.  RELAX-IV : a faster version of the RELAX code for solving minimum cost flow problems , 1994 .