An evolutionary algorithm for discrete tomography
Kees Joost Batenburg
- Vol. 151, Iss: 1, pp 36-54
TLDR
This paper presents an evolutionary algorithm for finding the reconstruction which maximises an evaluation function, representing the ''quality'' of the reconstruction, and shows that the algorithm can be successfully applied to a wide range of evaluation functions.Abstract:
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 algorithmsread more
Citations
More filters
Journal ArticleDOI
Evolutionary algorithms for a mixed stereovision uncalibrated 3D reconstruction
TL;DR: This paper proposes an original 3D shape reconstruction which is a mixture of the passive and active stereovision systems, and Evolutionary Algorithms are designed to calculate the depth of the detected POIs.
Book ChapterDOI
Discrete tomography reconstruction through a new memetic algorithm
TL;DR: Discrete tomography is a particular case of computerized tomography that deals with the reconstruction of objects made of just one homogeneous material, where it is sometimes possible to reduce the number of projections to no more than four.
Journal ArticleDOI
A Full Row-Rank System Matrix Generated by the Strip-Based Projection Model in Discrete Tomography
Jiehua Zhu,Xiezhang Li +1 more
TL;DR: The cost of an image reconstruction from F u = k ˜ is reduced and consequently the linear dependency of the rows of C is studied in this paper.
Proceedings ArticleDOI
Maximum flow minimum cost algorithm for reconstruction of images represented on the triangular grid
TL;DR: The algorithm takes into consideration the three natural projections on the triangular grid and uses the maximum flow minimum cost algorithm for the reconstruction of the image.
Journal ArticleDOI
Hybridisation of genetic algorithms and tabu search approach for reconstructing convex binary images from discrete orthogonal projections
TL;DR: A new hybrid optimisation algorithm combining the techniques of genetic algorithms and tabu search methods is proposed to find an optimal or an approximate solution for RCBIH, V problem, and its performance is evaluated and compared with other optimisation techniques.
References
More filters
Book
Genetic Algorithms + Data Structures = Evolution Programs
TL;DR: GAs and Evolution Programs for Various Discrete Problems, a Hierarchy of Evolution Programs and Heuristics, and Conclusions.
Book
Network Flows: Theory, Algorithms, and Applications
TL;DR: In-depth, self-contained treatments of shortest path, maximum flow, and minimum cost flow problems, including descriptions of polynomial-time algorithms for these core models are presented.
Book
Tabu Search
Fred Glover,Manuel Laguna +1 more
TL;DR: This book explores the meta-heuristics approach called tabu search, which is dramatically changing the authors' ability to solve a host of problems that stretch over the realms of resource planning, telecommunications, VLSI design, financial analysis, scheduling, spaceplanning, energy distribution, molecular engineering, logistics, pattern classification, flexible manufacturing, waste management,mineral exploration, biomedical analysis, environmental conservation and scores of other problems.
Book
New Ideas In Optimization
David Corne,Marco Dorigo,Fred Glover,Dipankar Dasgupta,Pablo Moscato,Riccardo Poli,Kenneth V. Price +6 more
TL;DR: The techniques treated in this text represent research as elucidated by the leaders in the field and are applied to real problems, such as hilllclimbing, simulated annealing, and tabu search.
Book
Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing
Emile H. L. Aarts,Jan Korst +1 more
TL;DR: Combinatorial Optimization and Boltzmann Machines, Parallel Simulated Annealing Algorithms, and Neural Computing.