scispace - formally typeset
Open AccessJournal ArticleDOI

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 algorithms

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

Resolution of a Combinatorial Problem using Cultural Algorithms

TL;DR: The authors show that Japanese Puzzles are constrained combinatorial optimization problems, which can be solved using Cultural Algorithms, and features, such the use of a belief space involve many proposed solutions and local search heuristics; can be taught using these puzzles.
Book ChapterDOI

Approximating bicolored images from discrete projections

TL;DR: An approximating algorithm based on a max-flow technique for the general case of reconstructing bicolored images from their discrete projections that is the number of pixels of each color lying on each row and column is presented.

Tomographic reconstruction of isotropic materials using genetic algorithms with ultrasound time-of-flight projection data

TL;DR: An iterative algorithm that works on the principles of genetic algorithms is developed and used for the reconstruction and the results of simulation studies on the tomographic reconstructions using genetic algorithms for the identification of defects in isotropic materials are discussed.
Book ChapterDOI

A Novel Convex Relaxation for Non-Binary Discrete Tomography

TL;DR: In this paper, a convex relaxation and a corresponding inference algorithm for the non-binary discrete tomography problem is presented, that is, reconstructing discrete-valued images from few linear measurements.

RESEARCH ARTICLE Discrete Tomographic Reconstruction via Adaptive Weighting of Gradient Descents

TL;DR: In this article, an energy minimization approach is proposed for multivalued discrete tomography (MDDT) reconstruction, where the reconstruction is formulated as a non-destructive testing problem.
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

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

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

TL;DR: Combinatorial Optimization and Boltzmann Machines, Parallel Simulated Annealing Algorithms, and Neural Computing.