An evolutionary algorithm for discrete tomography

DOI10.1016/J.DAM.2005.02.021MaRDI QIDQ2573237zbMATH OpenOpenAlexFDO

Authors K. Joost Batenburg

Publication date 7 November 2005

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2005.02.021

zbMATH Keywords

Discrete tomographyEvolutionary algorithmNetwork flow

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Analysis and optimization of an algorithm for discrete tomography
• An algorithm for discrete tomography
• Hybrid Diversification Operator-Based Evolutionary Approach Towards Tomographic Image Reconstruction
• Discrete tomography. Foundations, algorithms, and applications
• scientific article; zbMATH DE number 1551782
• A convex programming algorithm for noisy discrete tomography

Cites work

• scientific article; zbMATH DE number 3182201 (Why is no real title available?)
• scientific article; zbMATH DE number 1302201 (Why is no real title available?)
• scientific article; zbMATH DE number 1551772 (Why is no real title available?)
• scientific article; zbMATH DE number 1551778 (Why is no real title available?)
• scientific article; zbMATH DE number 1551779 (Why is no real title available?)
• scientific article; zbMATH DE number 1551786 (Why is no real title available?)
• A theorem on flows in networks
• An algorithm for discrete tomography
• Combinatorial Properties of Matrices of Zeros and Ones
• Discrete tomography. Foundations, algorithms, and applications
• Evolutionary computation. 2. Advanced algorithms and operators
• Generating convex polyominoes at random
• Network flows. Theory, algorithms, and applications.
• On the computational complexity of reconstructing lattice sets from their X-rays
• On the precise number of (0, 1)-matrices in \({\mathfrak A}(R,S)\)
• Optimization and reconstruction of hv-convex (0,1)-matrices
• Reconstructing convex polyominoes from horizontal and vertical projections
• Reconstruction of 4- and 8-connected convex discrete sets from row and column projections
• The discrete Radon transform and its approximate inversion via linear programming

Cited in

(11)

• Approximating hv-Convex Binary Matrices and Images from Discrete Projections
• Fast binary CT using Fourier null space regularization (FNSR)
• Reconstruction of Discrete Sets from Four Projections: Strong Decomposability
• Multivalued discrete tomography using dynamical system that describes competition
• A framework for generating some discrete sets with disjoint components by using uniform distributions
• A benchmark set for the reconstruction of \(hv\)-convex discrete sets
• Analysis on the strip-based projection model for discrete tomography
• Approximating Bicolored Images from Discrete Projections
• Discrete tomography with unknown intensity levels using higher-order statistics
• A full row-rank system matrix generated by the strip-based projection model in discrete tomography
• DISCRETE TOMOGRAPHIC RECONSTRUCTION OF BINARY IMAGES WITH DISJOINT COMPONENTS USING SHAPE INFORMATION

Describes a project that uses

Uses Software

• Tabu search
• RelaxIV
• MCFClass
• Genocop

This page was built for publication: An evolutionary algorithm for discrete tomography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2573237)