Abstract
The problem of reconstruction of two-dimensional discrete sets from their two projections is considered in different classes. The reconstruction algorithms and complexity results are summarized in the case of hv-convex sets, hv-convex polyominoes, hv-convex 8-connected sets, and directed h-convex sets. We show that the reconstruction algorithms used in the class of hv-convex 4-connected sets (polyominoes) can be used, with small modifications, for reconstructing hv-convex 8-connected sets. Finally, it is shown that the directed h-convex sets are uniquely reconstructible with respect to the row and column sum vectors.
Chapter PDF
Similar content being viewed by others
References
Barcucci, E., Del Lungo, A., Nivat, M., Pinzani, R.: Reconstructing convex polyominoes from horizontal and vertical projections. Theor. Comput. Sci.155 (1996) 321–347
Barcucci, E., Del Lungo, A., Nivat, M., Pinzani, R.: Medians of polyominoes: A property for the reconstruction. Int. J. Imaging Systems and Techn.9 (1998)-
Brualdi, R.A.: Matrices of zeros and ones with fixed row and column sum vectors. Lin. Algebra and Its Appl.33 (1980) 159–231
Brunetti, S., Del Lungo, A., Del Ristoro, F., Kuba, A., Nivat, M.: Reconstruction of 8-and 4-connected convex discrete sets from row and column projections. (1998) submitted for publication
Chang, S.-K.: The reconstruction of binary patterns from their projections. Commun. ACM14 (1971) 21–25
Chang, S.-K.: Algorithm 445. Binary pattern reconstruction from projections. Commun. ACM 16 (1973) 185–186
Chang, S.-K., Shelton, G. L.: Two algorithms for multiple-view binary pattern reconstruction. IEEE Trans. Systems, Man and Cybern. SMC-1 (1971) 90–94
Chrobak, M., Dürr, C: Reconstructing hv-convex polyominoes from orthogonal projections. (1998) submitted for publication
Crewe, A.V., Crewe, D.A.: Inexact reconstruction: Some improvements. Ultramicroscopy16 (1985) 33–40
Del Lungo, A.: Polyominoes defined by two vectors. Theor. Comput. Sci.127 (1994) 187–198
Del Lungo, A., Nivat, M., Pinzani, R.: The number of convex polyominoes reconstructible from their orthogonal projections. Discrete Math. 157 (1996) 65–78
Golomb, S.W.: Polyominoes. Schribner, New York (1965)
Herman, G.T., Kuba, A. (Eds.): Discrete Tomography, Special Issue. Int. J. Imaging Systems and Techn.9 (1998) No. 2/3
Huang, L.: The reconstruction of uniquely determined plane sets from two projections in discrete case. Techn. Report, University of Tokyo UTMS 95-29 (1995)
Kuba, A.: The reconstruction of two-directionally connected binary patterns from their two orthogonal projections. Comp. Vision, Graphics, and Image Proc.27 (1984) 249–265
Prause, G.M.P., Onnasch, D.G.W.: Binary reconstruction of the heart chambers from biplane angiographic image sequences. IEEE Trans. Medical ImagingMI-15 (1996) 532–546
Ryser, H.J.: Combinatorial properties of matrices of zeros and ones. Canad. J. Math.9 (1957) 371–377
Schilferstein, A.R., Chien, Y.T.: Switching components and the ambiguity problem in the reconstruction of pictures from their projections. Pattern Recognition10 (1978) 327–340
Woeginger, G.W.: The reconstruction of polyominoes from their orthogonal projections. Techn. Report, Technische Universität Graz 65 (1965)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kuba, A. (1999). Reconstruction in Different Classes of 2D Discrete Sets. In: Bertrand, G., Couprie, M., Perroton, L. (eds) Discrete Geometry for Computer Imagery. DGCI 1999. Lecture Notes in Computer Science, vol 1568. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49126-0_12
Download citation
DOI: https://doi.org/10.1007/3-540-49126-0_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65685-2
Online ISBN: 978-3-540-49126-2
eBook Packages: Springer Book Archive