Abstract
The problem of reconstructing some special hv-convex discrete sets from their two orthogonal projections is considered. In general, the problem is known to be NP-hard, but it is solvable in polynomial time if the discrete set to be reconstructed is also 8-connected. In this paper, we define an intermediate class – the class of hv-convex canonical discrete sets – and give a constructive proof that the above problem remains computationally tractable for this class, too. We also discuss some further theoretical consequences and present experimental results as well.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Balázs, P.: A framework for generating some discrete sets with disjoint components by using uniform distributions. Theor. Comput. Sci. 406, 15–23 (2008)
Balázs, P., Balogh, E., Kuba, A.: Reconstruction of 8-connected but not 4-connected hv-convex discrete sets. Discr. Appl. Math. 147, 149–168 (2005)
Balogh, E., Kuba, A., Dévényi, C., Del Lungo, A.: Comparison of algorithms for reconstructing hv-convex discrete sets. Lin. Alg. 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., Del Lungo, A., Del Ristoro, F., Kuba, A., Nivat, M.: Reconstruction of 4- and 8-connected convex discrete sets from row and column projections. Lin. Algebra Appl. 339, 37–57 (2001)
Chrobak, M., Dürr, C.: Reconstructing hv-convex polyominoes from orthogonal projections. Inform. Process. Lett. 69, 283–289 (1999)
Del Lungo, A.: Polyominoes defined by two vectors. Theoret. Comput. Sci. 127, 187–198 (1994)
Herman, G.T., Kuba, A. (eds.): Discrete Tomography: Foundations, Algorithms and Applications. Birkhäuser, Boston (1999)
Herman, G.T., Kuba, A. (eds.): Advances in Discrete Tomography and Its Applications. Birkhäuser, Boston (2007)
Kak, A.C., Slaney, M.: Principles of Computerized Tomographic Imaging. IEEE Press, New York (1988)
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)
Woeginger, G.W.: The reconstruction of polyominoes from their orthogonal projections. Inform. Process. Lett. 77, 225–229 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Balázs, P. (2009). Reconstruction of Canonical hv-Convex Discrete Sets from Horizontal and Vertical Projections. In: Wiederhold, P., Barneva, R.P. (eds) Combinatorial Image Analysis. IWCIA 2009. Lecture Notes in Computer Science, vol 5852. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10210-3_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-10210-3_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10208-0
Online ISBN: 978-3-642-10210-3
eBook Packages: Computer ScienceComputer Science (R0)