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
Journal ArticleDOI
SIMULATED ANNEALING AND BOLTZMANN MACHINES A Stochastic Approach to Combinatorial Optimization and Neural Computing
Journal ArticleDOI
Natural and Remote Sensing Image Segmentation Using Memetic Computing
TL;DR: The experimental results show that MISA outperforms its genetic version, the Fuzzy c-means algorithm, and K-mean algorithm in partitioning most of the test problems, and is an effective approach when compared with two state-ofthe-art image segmentation algorithms including an efficient graph-based algorithm and a spectral clustering ensemble-based algorithms.
Journal ArticleDOI
The economics of cancer care: longitudinal changes in provider efficiency.
TL;DR: Data envelopment analysis, and specifically a longitudinal Malmquist index over a 5-year period was applied to the major, specialized inpatient cancer centers to determine if these specialized centers achieve higher productivity over time, and if scale leads to higher operating efficiency.
A Discrete Tomography Approach to Japanese Puzzles
TL;DR: It is shown that the famous Japanese puzzles are a special case of a more general DT problem and an evolutionary algorithm for computing such reconstructions is applied.
References
More filters
RELAX-IV : a faster version of the RELAX code for solving minimum cost flow problems
TL;DR: RELAX-IV is a minimum cost flow code that combines the RELAX code of [BeT88a], [ beT88b] with an initialization based on a recently proposed auction/sequential shortest path algorithm, which is shown to be extremely helpful in speeding up the solution of difficult problems, involving for example long augmenting paths.
Journal ArticleDOI
A network flow approach to reconstruction of the left ventricle from two projections
TL;DR: A minimum cost capacitated network flow algorithm is discussed, which yields the optimal solution with respect to the priori information, and is shown that this method can also be used in the presence of observation noise.
Journal ArticleDOI
The discrete Radon transform and its approximate inversion via linear programming
TL;DR: Interior point LP’s give a polynomial and practical way to obtain the assertion of uniqueness when strong uniqueness obtains, and it is proved here that if S is not additive then there are many fuzzy sets with the given line sums, although there still may be only one actual sef.
Journal ArticleDOI
Reconstruction of 4- and 8-connected convex discrete sets from row and column projections
TL;DR: The problem of reconstructing a discrete two-dimensional set from its two orthogonal projection (H,V) when the set satisfies some convexity conditions can be solved in polynomial time also in a class of discrete sets which is larger than the class of convex polyominoes, namely, in theclass of 8-connected convex sets.