On the difference between solutions of discrete tomography problems

zbMATH Open1235.65024arXiv0806.3722MaRDI QIDQ2880102FDOQ2880102

Birgit van Dalen

Publication date: 12 April 2012

Published in: Journal of Combinatorics and Number Theory (Search for Journal in Brave)

Abstract: We consider the problem of reconstructing binary images from their horizontal and vertical projections. We present a condition that the projections must necessarily satisfy when there exist two disjoint reconstructions from those projections. More generally, we derive an upper bound on the symmetric difference of two reconstructions from the same projections. We also consider two reconstructions from two different sets of projections and prove an upper bound on the symmetric difference in this case.

Full work available at URL: https://arxiv.org/abs/0806.3722

Recommendations

• On the difference between solutions of discrete tomography problems. II
• Bounds on the Difference between Reconstructions in Binary Tomography
• Bounds for discrete tomography solutions
• Stability results for uniquely determined sets from two directions in discrete tomography
• DISCRETE TOMOGRAPHIC RECONSTRUCTION OF BINARY IMAGES WITH DISJOINT COMPONENTS USING SHAPE INFORMATION

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Lattices and convex bodies in (2) dimensions (aspects of discrete geometry) (52C05)

Cited In (10)

• Solution to the Mean King's Problem in Prime Power Dimensions Using Discrete Tomography
• A rounding theorem for unique binary tomographic reconstruction
• Title not available (Why is that?)
• Bounds on the quality of reconstructed images in binary tomography
• Quality bounds for binary tomography with arbitrary projection matrices
• Consistency Conditions for Discrete Tomography*
• Bounds on the Difference between Reconstructions in Binary Tomography
• Discrete tomography for inscribable lattice sets
• A solvable case of image reconstruction in discrete tomography
• Path puzzles: discrete tomography with a path constraint is hard

This page was built for publication: On the difference between solutions of discrete tomography problems

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