An evolutionary algorithm for discrete tomography
Kees Joost Batenburg
- Vol. 151, Iss: 1, pp 36-54
Reads0
Chats0
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
Proceedings ArticleDOI
Solving Japanese puzzles with logical rules and depth first search algorithm
TL;DR: Experimental results show that the proposed puzzle solving algorithm can solve Japanese puzzles successfully, and the processing speed is significantly faster than that of DFS.
Book ChapterDOI
A neural network approach to real-time discrete tomography
TL;DR: A new reconstruction method is presented, which is based on a feed-forward neural network, which can compute reconstructions extremely fast, making it suitable for real-time tomography.
Book ChapterDOI
An energy minimization reconstruction algorithm for multivalued discrete tomography
TL;DR: A new algorithm for multivalued discrete tomogra phy, that reconstructs images from few projections by approximating the minimum of a suitably constructed energy function with a deterministic optimization method is proposed.
Journal ArticleDOI
A decomposition technique for reconstructing discrete sets from four projections
TL;DR: This paper studies the class of decomposable discrete sets and gives an efficient reconstruction algorithm for this class using four projections and shows that in a subclass of hv-convex discrete sets the reconstruction from four projections can also be solved in polynomial time.
Journal ArticleDOI
Statistical analysis of tomographic reconstruction algorithms by morphological image characteristics
TL;DR: In this article, a procedure for quantitative quality control of tomographic reconstruction algorithms is proposed to monitor accurate reproduction of a variety of locally defined critical image features within tomograms such as interface positions and microstructures, debonding, cracks and pores.
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.