Reconstruction of 4- and 8-connected convex discrete sets from row and column projections

DOI10.1016/S0024-3795(01)00435-9zbMath1007.65108OpenAlexW2024837288MaRDI QIDQ5955124

Attila Kuba, Francesco Del Ristoro, Alberto del Lungo, Maurice Nivat, Sara Brunetti

Publication date: 7 February 2002

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

Full work available at URL: https://doi.org/10.1016/s0024-3795(01)00435-9

zbMATH Keywords

complexityalgorithmconvexitydiscrete tomographyexperimental resultsreconstruction from projections

Mathematics Subject Classification ID

Biomedical imaging and signal processing (92C55) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Radon transform (44A12) Numerical methods for integral transforms (65R10) Complexity and performance of numerical algorithms (65Y20)

Related Items (17)

A network flow algorithm for reconstructing binary images from discrete X-rays ⋮ 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 ⋮ Discrete tomography with unknown intensity levels using higher-order statistics ⋮ Binary image reconstruction from a small number of projections and the morphological skeleton ⋮ Analysis on the strip-based projection model for discrete tomography ⋮ A framework for generating some discrete sets with disjoint components by using uniform distributions ⋮ Reconstruction of binary matrices under fixed size neighborhood constraints ⋮ Reconstruction of convex lattice sets from tomographic projections in quartic time ⋮ A benchmark set for the reconstruction of \(hv\)-convex discrete sets ⋮ Reconstruction of 8-connected but not 4-connected \(hv\)-convex discrete sets ⋮ Comparison of algorithms for reconstructing \(hv\)-convex discrete sets ⋮ Further steps on the reconstruction of convex polyominoes from orthogonal projections ⋮ An evolutionary algorithm for discrete tomography ⋮ An experimental study of the stability problem in discrete tomography ⋮ Detection of the discrete convexity of polyominoes ⋮ Reconstruction of convex 2D discrete sets in polynomial time

Cites Work

• Unnamed Item
• Reconstructing convex polyominoes from horizontal and vertical projections
• Switching components and the ambiguity problem in the reconstruction of pictures from their projections
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• The discrete Radon transform and its approximate inversion via linear programming
• Reconstructing \((h,v)\)-convex \(2\)-dimensional patterns of objects from approximate horizontal and vertical projections.
• The reconstruction of polyominoes from their orthogonal projections
• Reconstructing \(hv\)-convex polyominoes from orthogonal projections
• Generating convex polyominoes at random
• The number of convex polyominoes reconstructible from their orthogonal projections
• Discrete tomography: Determination of finite sets by X-rays
• Comparison of algorithms for reconstructing \(hv\)-convex discrete sets

This page was built for publication: Reconstruction of 4- and 8-connected convex discrete sets from row and column projections