Abstract
One of the basic problems in discrete tomography is the reconstruction of discrete sets from few projections. Assuming that the set to be reconstructed fulfils some geometrical properties is a commonly used technique to reduce the number of possibly many different solutions of the same reconstruction problem. Since the reconstruction from two projections in the class of so-called hv-convex sets is NP-hard this class is suitable to test the efficiency of newly developed reconstruction algorithms. However, until now no method was known to generate sets of this class from uniform random distribution and thus only ad hoc comparison of several reconstruction techniques was possible. In this paper we first describe a method to generate some special hv-convex discrete sets from uniform random distribution. Moreover, we show that the developed generation technique can easily be adapted to other classes of discrete sets, even for the whole class of hv-convexes. Several statistics are also presented which are of great importance in the analysis of algorithms for reconstructing hv-convex sets.
Chapter PDF
Similar content being viewed by others
Keywords
References
Balázs, P.: A decomposition technique for reconstructing discrete sets from four projections. Image and Vision Computing, accepted.
Balázs, P.: On the ambiguity of reconstructing hv-convex binary matrices with decomposable configurations. Acta Cybernetica, submitted.
Balázs, P.: Reconstruction of discrete sets from their projections using geometrical priors. Doctoral Dissertation at the University of Szeged (in preparation)
Barcucci, E., Del Lungo, A., Nivat, M., Pinzani, R.: Reconstructing convex polyominoes from horizontal and vertical projections. Theor. Comput Sci. 155, 321–347 (1996)
Batenburg, K.J.: An evolutionary approach for discrete tomography. Discrete Applied Mathematics 151, 36–54 (2005)
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)
Dahl, G., Flatberg, T.: Optimization and reconstruction of hv-convex (0,1)-matrices. Discrete Appl. Math. 151, 93–105 (2005)
Delest, M.P., Viennot, G.: Algebraic languages and polyominoes enumeration. Theor. Comput. Sci. 34, 169–206 (1984)
Gessel, I.: On the number of convex polyominoes. Ann. Sci. Math. Québec 24, 63–66 (2000)
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. Applied and Numerical Harmonic Analysis. Birkhäuser, Basel (2007)
Hochstättler, W., Loebl, M., Moll, C.: Generating convex polyominoes at random. Discrete Math. 153, 165–176 (1996)
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., Nagy, A., Balogh, E.: Reconstruction of hv-convex binary matrices from their absorbed projections. Discrete Applied Mathematics 139, 137–148 (2004)
Shoup, V.: NTL: A library for doing number theory, http://www.shoup.net/ntl
Sloane, N.J.A.: The on-line encyclopedia of integer sequences, http://www.research.att.com/~njas/sequences/
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
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Balázs, P. (2007). Generation and Empirical Investigation of hv-Convex Discrete Sets. In: Ersbøll, B.K., Pedersen, K.S. (eds) Image Analysis. SCIA 2007. Lecture Notes in Computer Science, vol 4522. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73040-8_35
Download citation
DOI: https://doi.org/10.1007/978-3-540-73040-8_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73039-2
Online ISBN: 978-3-540-73040-8
eBook Packages: Computer ScienceComputer Science (R0)