Abstract
A generalization of the classical discrete tomography problem is considered: Reconstruct binary matrices from their absorbed row and column sums. We show that this reconstruction problem can be linked to a 3SAT problem if the absorption is characterized with the constant \( \beta = ln\left( {\tfrac{{1 + \sqrt 5 }} {2}} \right) \).
Chapter PDF
Similar content being viewed by others
References
Brualdi, R.A.: Matrices of zeros and ones with fixed row and column sums. Linear Algebra and Its Applications 33 (1980) 159–231.
Herman, G.T., Kuba, A. (Eds.): Discrete Tomography: Foundations, Algorithms and Applications. Birkhäuser, Boston (1999).
Kuba, A., Nivat, M.: A Sufficient condition for non-uniqueness in binary tomography with absorption, Technical Report, University of Szeged (2001).
Kuba, A., Nivat, M.: Reconstruction of discrete sets with absorption, accepted for publication in Linear Algebra and its Applications (2001).
M. Chrobak, C. Dürr, Reconstructing hv-convex polyominoes from orthogonal projections, Information Processing Letters 69 (1999) 283–289.
Y. Boufkhad, O. Dubois, and M. Nivat, Reconstructing (h,v)-convex two-dimensional patterns of objects from approximate horizontal and vertical projections, to appear in Theoretical Computer Science.
O. Dubois, P. André, Y. Boufkhad, and J. Carlier, SAT versus UNSAT, in Second DIMACS Implementation Challenge, D. Johnson and M. A. Trick, eds., DIMACS Series in Discrete Mathematics and Theoretical Computer Science, AMS, 1993.
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
Balogh, E., Kuba, A., Del Lungo, A., Nivat, M. (2002). Reconstruction of Binary Matrices from Absorbed Projections. In: Braquelaire, A., Lachaud, JO., Vialard, A. (eds) Discrete Geometry for Computer Imagery. DGCI 2002. Lecture Notes in Computer Science, vol 2301. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45986-3_35
Download citation
DOI: https://doi.org/10.1007/3-540-45986-3_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43380-4
Online ISBN: 978-3-540-45986-6
eBook Packages: Springer Book Archive