A rounding theorem for unique binary tomographic reconstruction (Q2274077)

A large class of tomographic problems concerns the reconstruction of unknown objects by means of partial data coming from their projections. In order to find an exact solution, in this paper the binary grid model is used in which X-rays are discrete lattice lines. The projections are obtained by counting the number of lattice points intercepted by X-rays taken in the assigned directions. The theoretical considerations presented in this paper are based on a result that allows uniqueness of reconstruction ``in the grid with just four suitably selected X-ray directions. In this framework, the structure of the allowed ghosts is studied and described. This leads to a new result, stating that the unique binary solution can be explicitly and exactly retrieved from the minimum Euclidean norm solution by means of a rounding method based on some special entries, which are precisely determined.'' The proposed approach was implemented as a recursive Binary Reconstruction Algorithm. From the performed experiments, presented in this paper, one can see that this algorithm, after an appropriately large number of iterations, leads to the unique binary solution.