Simulated annealing & boltzmann Machines: a stochastic approach to combinatorialoptimization & neural computing
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Generating convex polyominoes at random
FPSAC '93 Proceedings of the 5th conference on Formal power series and algebraic combinatorics
Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic algorithms + data structures = evolution programs (3rd ed.)
Reconstructing convex polyominoes from horizontal and vertical projections
Theoretical Computer Science
The discrete Radon transform and its approximate inversion via linear programming
Discrete Applied Mathematics
On the precise number of (0,1)-matrices in U(R,S)
Discrete Mathematics
On the computational complexity of reconstructing lattice sets from their x-rays
Discrete Mathematics
New ideas in optimization
Tabu Search
Efficient Algorithms for Reconstruction of 2D-Arrays from Extended Parikh Images
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing, Part II
An Evolutionary Approach for Object-Based Image Reconstruction Using Learnt Priors
SCIA '09 Proceedings of the 16th Scandinavian Conference on Image Analysis
Generation and empirical investigation of hv-convex discrete sets
SCIA'07 Proceedings of the 15th Scandinavian conference on Image analysis
Discrete tomography reconstruction through a new memetic algorithm
Evo'08 Proceedings of the 2008 conference on Applications of evolutionary computing
Approximating hv-convex binary matrices and images from discrete projections
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
On the number of hv-convex discrete sets
IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
A memetic approach to discrete tomography from noisy projections
Pattern Recognition
Natural and remote sensing image segmentation using memetic computing
IEEE Computational Intelligence Magazine
Approximating bicolored images from discrete projections
IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis
A memetic island model for discrete tomography reconstruction
WILF'11 Proceedings of the 9th international conference on Fuzzy logic and applications
A neural network approach to real-time discrete tomography
IWCIA'06 Proceedings of the 11th international conference on Combinatorial Image Analysis
A cultural algorithm for the representation of mitochondrial population
Advances in Artificial Intelligence - Special issue on Artificial Intelligence Applications in Biomedicine
An island strategy for memetic discrete tomography reconstruction
Information Sciences: an International Journal
Hi-index | 0.00 |
One of the main problems in discrete tomography is the reconstruction of binary matrices from their projections in a small number of directions. In this paper we consider a new algorithmic approach for reconstructing binary matrices from only two projections. This problem is usually underdetermined and the number of solutions can be very large. We present an evolutionary algorithm for finding the reconstruction which maximises an evaluation function, representing the ''quality'' of the reconstruction, and show that the algorithm can be successfully applied to a wide range of evaluation functions. We discuss the necessity of a problem-specific representation and tailored search-operators for obtaining satisfactory results. Our new search-operators can also be used in other discrete tomography algorithms.