Particle swarm optimization approach to discrete tomography reconstruction problems of binary matrices

In this paper binary matrices are reconstructed from two orthogonal projections. In the reconstruction process particle swarm optimization is used. Since most of the reconstruction problems are NP-hard, the use of a global optimization process gave promising results. The task is to adjust the particle swarm algorithm to the problem of the reconstruction of binary matrices. The main focus is on the reconstruction of hv-convex matrices which consist of either one or more connected components. At the end of the paper the results are shown and the appropriate conclusions are drawn.