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
Journal ArticleDOI
Reconstructing convex polyominoes from horizontal and vertical projections
TL;DR: Some operations for recontructing convex polyominoes by means of vectors H's and V's partial sums allows a new algorithm to be defined whose complexity is less than O(n2m2).
Journal ArticleDOI
On the computational complexity of reconstructing lattice sets from their x-rays
TL;DR: It turns out that for all d ⩾ 2 and for a prescribed but arbitrary set of m ⩽ 2 pairwise nonparallel lattice directions, the problems are solvable in polynomial time if m = 2 and are NP-complete (or NP-equivalent) otherwise.
Journal ArticleDOI
An approach to quantitative high-resolution transmission electron microscopy of crystalline materials
TL;DR: In this paper, lattice images are used to measure the variation of the projected potential in crystalline solids in any projection, with no knowledge of the imaging conditions, which is applicable to many solids with atoms residing entirely on coherent lattices, in which interfacial topography or changes in composition are of interest.
Journal ArticleDOI
Mapping projected potential, interfacial roughness, and composition in general crystalline solids by quantitative transmission electron microscopy.
Peter Schwander,Christian Kisielowski,Michael Seibt,Frieder H. Baumann,Young-Jin Kim,Abbas Ourmazd +5 more
TL;DR: The first atomic-level topographic map of a Si/SiO 2 interface in plan view, and the first microscopic compositional map of an Si/GeSi/Si quantum well in cross section are presented.