Algorithms for linear time reconstruction by discrete tomography II

Silvia Maria Carla Pagani, Matthew Ceko, Rob Tijdeman

Research output: Contribution to journalArticlepeer-review

Abstract

The reconstruction of an unknown function $f$ from its line sums is the aim of discrete tomography. However, two main aspects prevent reconstruction from being an easy task. In general, many solutions are allowed due to the presence of the switching functions. Even when uniqueness conditions are available, results about the NP-hardness of reconstruction algorithms make their implementation inefficient when the values of $f$ are in certain sets. We show that this is not the case when $f$ takes values in a field or a unique factorization domain, such as $R$ or $Z$. We present a linear time reconstruction algorithm (in the number of directions and in the size of the grid), which outputs the original function values for all points outside of the switching domains. Freely chosen values are assigned to the other points, namely, those with ambiguities. Examples are provided.
Original languageEnglish
Pages (from-to)7-20
Number of pages14
JournalDiscrete Applied Mathematics
Volume298
DOIs
Publication statusPublished - 2021

Keywords

  • Discrete tomography
  • Ghost
  • Lattice direction
  • Reconstruction algorithm
  • Switching function

Fingerprint Dive into the research topics of 'Algorithms for linear time reconstruction by discrete tomography II'. Together they form a unique fingerprint.

Cite this