Comparison of algorithms for reconstructing \(hv\)-convex discrete sets

DOI10.1016/S0024-3795(01)00430-XzbMath0990.65143MaRDI QIDQ5955123

Attila Kuba, Emese Balogh, Csaba Dévényi, Alberto del Lungo

Publication date: 7 February 2002

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

Radon transformdiscrete tomographycomparison of algorithmsreconstruction from projectionsworst time complexity

Mathematics Subject Classification ID

Biomedical imaging and signal processing (92C55) Radon transform (44A12) Numerical methods for integral transforms (65R10)

Related Items (12)

DISCRETE TOMOGRAPHIC RECONSTRUCTION OF BINARY IMAGES WITH DISJOINT COMPONENTS USING SHAPE INFORMATION ⋮ Complexity results for reconstructing binary images with disjoint components from horizontal and vertical projections ⋮ A framework for generating some discrete sets with disjoint components by using uniform distributions ⋮ Reconstruction of hv-convex sets by their coordinate X-ray functions ⋮ A benchmark set for the reconstruction of \(hv\)-convex discrete sets ⋮ Reconstruction of 8-connected but not 4-connected \(hv\)-convex discrete sets ⋮ Reconstruction of 4- and 8-connected convex discrete sets from row and column projections ⋮ An experimental study of the stability problem in discrete tomography ⋮ Reconstruction of Discrete Sets from Four Projections: Strong Decomposability ⋮ Discrete Reconstruction Techniques ⋮ Detection of the discrete convexity of polyominoes ⋮ A short scientific biography of Maurice Nivat

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reconstructing convex polyominoes from horizontal and vertical projections
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• Discrete tomography. Foundations, algorithms, and applications
• The reconstruction of polyominoes from their orthogonal projections
• Reconstruction of convex 2D discrete sets in polynomial time
• Reconstructing \(hv\)-convex polyominoes from orthogonal projections
• Generating convex polyominoes at random
• Combinatorial Properties of Matrices of Zeros and Ones
• Reconstruction of 4- and 8-connected convex discrete sets from row and column projections

This page was built for publication: Comparison of algorithms for reconstructing \(hv\)-convex discrete sets