Abstract
This paper studies the problem of reconstructing binary matrices that are only accessible through few evaluations of their discrete X-rays. Such question is prominently motivated by the demand in material science for developing a tool for the reconstruction of crystalline structures from their images obtained by high-resolution transmission electron microscopy. Various approaches have been suggested for solving the general problem of reconstructing binary matrices that are given by their discrete X-rays in a number of directions, but more work have to be done to handle the ill-posedness of the problem. We can tackle this ill-posedness by limiting the set of possible solutions, by using appropriate a priori information, to only those which are reasonably typical of the class of matrices which contains the unknown matrix that we wish to reconstruct. Mathematically, this information is modelled in terms of a class of binary matrices to which the solution must belong. Several papers study the problem on classes of binary matrices on which some connectivity and convexity constraints are imposed.
We study the reconstruction problem on some new classes consisting of binary matrices with periodicity properties, and we propose a polynomial-time algorithm for reconstructing these binary matrices from their orthogonal discrete X-rays.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
A. Alpers, P. Gritzmann and L. Thorens, Stability and Instability in Discrete Tomography, Lecture Notes in Computer Sciece 2243, Digital and Image Geometry, G. Bertrand, A. Imiya, R. Klette (eds.), (2002) 175–186.
R. P. Anstee, Invariant sets of arcs in network flow problems, Discrete Applied Mathematics, 13 1–7 (1986).
B. Aspvall, M.F. Plass and R.E. Tarjan, A linear-time algorithm for testing the truth of certain quantified Boolean formulas, Information Processing Letters, 8 (1979) 121–123.
E. Barcucci, A. Del Lungo, M. Nivat and R. Pinzani, Reconstructing convex po-lyominoes from their horizontal and vertical projections, Theoretical Computer Science, 155 (1996) 321–347.
E. Barcucci, S. Brunetti, A. Del Lungo and M. Nivat, Reconstruction of lattice sets from their horizontal, vertical and diagonal X-rays, Discrete Mathematics 241 (2001) 65–78.
S. Brunetti, A. Daurat, Reconstruction of Discrete Sets From Two or More Projections in Any Direction, to appear in Theoretical Computer Science.
S. Brunetti, A. Daurat and A. Del Lungo, Approximate X-rays reconstruction of special lattice sets, Pure Mathematics and Applications, vol. 11, No. 3, (2000) 409–425.
R. A. Brualdi, Matrices of zeros and ones with fixed row and column sum vectors, Lin. Algebra and Its Applications 33, 159–231 (1980).
J. A. Browne, M. Koshy and J. H. Stanley, On the application of discrete tomography to CT-assisted engineering and design, International Journal Imaging Systems and Technology, vol. 9 n. 2/3 (1998) 85–98.
M. Chrobak, C. Dürr, Reconstructing hv-Convex Polyominoes from Orthogonal Projections, Information Processing Letters, 69 (1999) 283–289.
A. Del Lungo and M. Nivat, Reconstruction of connected sets from two projections, in Discrete Tomography: Foundations, Algorithms and Applications, G.T. Herman and A. Kuba (eds.), Birkhauser, Boston, MA, USA, (1999) 85–113.
P. Fishburn, P. Schwander, L. Shepp and R. J. Vanerbei, The discrete Radon tranform and its approximate inversion via linear programming, Discrete Applied Mathematics, 75 (1997) 39–61.
D. Gale, A theorem on flows in networks, Pacif. J. Math., 7 (1957) 1073–1082.
R. J. Gardner, P. Gritzmann and D. Prangenberg, On the computational complexity of reconstructing lattice sets from their X-rays, Discrete Mathematics, 202 (1999) 45–71.
R.J. Gardner and P. Gritzmann, Discrete tomography: determination of finite sets by X-rays, Trans. Amer. Math. Soc. 349 2271–2295 (1997).
S. W. Golomb, Polyominoes, Revised and Expanded Edition, (Princeton University Press), 1994.
P. Gritzmann, Title of the talk: Recent results, open problems and future challenges, Workshop Discrete Tomography: Algoritms and Applications, Siena, Italy, 2000 (see http://www.cs.gc.cuny.edu/ gherman/index2new.html).
P. Gritzmann, S. de Vries and M. Wingelmann, Approximating binary images from discrete X-rays, SIAM J. Optimizat., 11, No. 2, (2000) 522–546.
G.T. Herman, Title of the talk: Bayesian binary tomography with Gibbs distributions as priors, Workshop Discrete Tomography: Algoritms and Applications; Siena, Italy, 2000 (see http://www.cs.gc.cuny.edu/gherman/index2new.html).
G. T. Herman and A. Kuba (eds.), Discrete Tomography: Foundations, Algorithms and Applications, Birkhauser Boston, Cambridge, MA (1999).
R. W. Irving and M. R. Jerrum, Three-dimensional statistical data security problems, SIAM Journal of Computing, 23 (1994) 170–184.
C. Kiesielolowski, P. Schwander, F. H. Baumann, M. Seibt, Y. Kim and A. Our-mazd, An approach to quantitative hight-resolution transmission electron microscopy of crystalline materials, Ultramicroscopy, 58 (1995) 131–155.
D. Kölzov, A. Kuba and A. Volcic, An algorithm for reconstructing convex bodies from their projections, Disc. & Comp. Geom. 4 205–237 (1989).
S. Matej, A. Vardi, G. T. Hermann and E. Vardi, Binary tomography using Gibbs priors, in discrete tomography: foundations, algorithms and applications, G.T. Herman and A. Kuba (eds.), Birkhauser, Boston, MA, USA, (1999) 191–212.
G. P. M. Prause and D. G. W. Onnasch, Binary reconstruction of the heart chambers from biplane angiographic image sequence, IEEE Transactions Medical Imaging, 15 (1996) 532–559.
H. Ryser, Combinatorial Mathematics, The Carus Mathematical Monographs, Vol. 14, Math. Assoc. America, 1963.
P. Schwander, C. Kiesielolowski, M. Seibt, F. H. Baumann, Y. Kim and A. Our-mazd, Mapping projected potential, interfacial roughness, and composition in general crystalline solids by quantitative transmission electron microscopy, Physical Review Letters, 71 (1993) 4150–4153.
L. A. Shepp and B. F. Logan, The Fourier reconstruction of a head, IEEE Trans. Nucl. Sci., NS-21 (1974) 21–43.
L. A. Shepp and J. B. Kruskal, Computerized tomography: the new medical X-ray technology, Amer. Math. Montly, 85 (1978) 420–439.
A. R. Shliferstein and Y. T. Chien, Switching components and the ambiguity problem in the reconstruction of pictures from their projections, Pattern Recognition, 10 (1978) 327–340.
R. Tijdeman and L. Hajdu, An algorithm for discrete tomography, Linear Algebra and Its Applications, 339 (2001) 147–169.
Y. Vardi and D. Lee, Discrete Radon transform and its approximate inversion via the EM algorithm, Int. J. Imaging Sci. Tech., 9 (1998) 155–173.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Del Lungo, A., Frosini, A., Nivat, M., Vuillon, L. (2002). Discrete Tomography: Reconstruction under Periodicity Constraints. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds) Automata, Languages and Programming. ICALP 2002. Lecture Notes in Computer Science, vol 2380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45465-9_5
Download citation
DOI: https://doi.org/10.1007/3-540-45465-9_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43864-9
Online ISBN: 978-3-540-45465-6
eBook Packages: Springer Book Archive