Abstract
A generalization of a classical discrete tomography problem is considered: Reconstruct binary matrices from their absorbed row and columns sums, i.e., when some known absorption is supposed. It is math-ematically interesting when the absorbed projection of a matrix element is the same as the absorbed projection of the next two consecutive el-ements together. We show that, in this special case, the non-uniquely determined matrices contain a certain configuration of 0s and 1s, called alternatively corner-connected components. Furthermore, such matrices can be transformed into each other by switchings the 0s and 1s of these components.
Download to read the full chapter text
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 139
Herman, G. T., Kuba, A. (Eds.): Discrete Tomography: Foundations, Algorithms and Applications. Birkhäuser, Boston (1999) 148
Kuba, A., Herman, G. T.: Discrete tomography: A historical overview. In [2] (1999) 3–34 139
Kuba, A., Nivat, M.: Reconstruction of discrete sets from projections in the case of absorption. Technical Reports, Institute of Informatics, University of Szeged (2000) 139, 141, 146, 147
Lothaire, M.: Combinatorics on Words. Cambridge University Press, Cambridge (1997) 138
Ryser, H. J.: Combinatorial properties of matrices of zeros and ones. Canad. J. Math. 9 (1957) 371–377 147
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Attila, K., Maurice, N. (2000). Reconstruction of Discrete Sets with Absorption. In: Borgefors, G., Nyström, I., di Baja, G.S. (eds) Discrete Geometry for Computer Imagery. DGCI 2000. Lecture Notes in Computer Science, vol 1953. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44438-6_12
Download citation
DOI: https://doi.org/10.1007/3-540-44438-6_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41396-7
Online ISBN: 978-3-540-44438-1
eBook Packages: Springer Book Archive