Abstract
One important class of discrete sets where the reconstruction from two given projections can be solved in polynomial time is the class of hv-convex 8-connected sets. The worst case complexity of the fastest algorithm known so far for solving the problem is of O(mn· min { m 2,n 2} ) [2]. However, as it is shown, in the case of 8-connected but not 4-connected sets we can give an algorithm with worst case complexity of O(mn· min { m,n} ) by identifying the so-called \({\cal S}_4\)-components of the discrete set. Experimental results are also presented in order to investigate the average execution time of our algorithm.
Chapter PDF
Similar content being viewed by others
References
Balázs, P., Balogh, E., Kuba, A.: Reconstruction of 8-connected but not 4-connected discrete sets, Technical Report at the University of Szeged (2002), http://www.inf.u-szeged.hu/~pbalazs/research/research.html
Balogh, E., Kuba, A., Dévényi, C., Del Lungo, A.: Comparison of algorithms for reconstructing hv-convex discrete sets. Lin. Alg. and Its Appl. 339, 23–35 (2001)
Barcucci, E., Del Lungo, A., Nivat, M., Pinzani, R.: Reconstructing convex polyominoes from horizontal and vertical projections. Theor. Comput. Sci. 155, 321–347 (1996)
Brunetti, S., Daurat, A.: Reconstruction of discrete sets from two or more X-rays in any direction. In: Proceedings of the seventh International Workshop on Combinatorial Image Analysis, pp. 241–258 (2000)
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. Lin. Alg. and Its Appl. 339, 37–57 (2001)
Chrobak, M., Dürr, C.: Reconstructing hv-convex polyominoes from orthogonal projections. Information Processing Letters 69(6), 283–289 (1999)
Del Lungo, A., Nivat, M., Pinzani, R.: The number of convex polyominoes reconstructible from their orthogonal projections. Discrete Math. 157, 65–78 (1996)
Herman, G.T., Kuba, A. (eds.): Discrete Tomography, Special Issue. Int. J. Imaging Systems and Techn. 9(2/3) (1998)
Herman, G.T., Kuba, A. (eds.): Discrete Tomography: Foundations. Algorithms and Applications. Birkhäuser, Boston (1999)
Kuba, A.: The reconstruction of two-directionally connected binary patterns from their two orthogonal projections. Comp. Vision, Graphics, and Image Proc. 27, 249–265 (1984)
Kuba, A.: Reconstruction in different classes of 2D discrete sets. In: Bertrand, G., Couprie, M., Perroton, L. (eds.) DGCI 1999. LNCS, vol. 1568, pp. 153–163. Springer, Heidelberg (1999)
Kuba, A., Balogh, E.: Reconstruction of convex 2D discrete sets in polynomial time. Theor. Comput. Sci. 283, 223–242 (2002)
Latecki, L., Eckhardt, U., Rosenfeld, A.: Well-Composed Sets. Computer Vision and Image Understanding 61(1), 70–83 (1995)
Ryser, H.J.: Combinatorial properties of matrices of zeros and ones. Canad. J. Math. 9, 371–377 (1957)
Woeginger, G.W.: The reconstruction of polyominoes from their orthogonal projections. Information Processing Letters 77, 225–229 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Balázs, P., Balogh, E., Kuba, A. (2003). A Fast Algorithm for Reconstructing hv-Convex 8-Connected but Not 4-Connected Discrete Sets. In: Nyström, I., Sanniti di Baja, G., Svensson, S. (eds) Discrete Geometry for Computer Imagery. DGCI 2003. Lecture Notes in Computer Science, vol 2886. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39966-7_37
Download citation
DOI: https://doi.org/10.1007/978-3-540-39966-7_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20499-2
Online ISBN: 978-3-540-39966-7
eBook Packages: Springer Book Archive