Abstract
We study the problem of reconstructing hv-convex binary matrices from few projections. We solve a polynomial time case and we determine some properties of the hv-convex matrices. Since the problem is NP-complete, we provide an iterative approximation based on a longest path and a min-cost/max-flow model. The experimental results show that the reconstruction algorithm performs quite well.
Chapter PDF
Similar content being viewed by others
References
Barcucci, E., Del Lungo, A., Nivat, M., Pinzani, R.: Reconstructing convex polyominoes from their horizontal and vertical projections. Theoretical computer science 155(1), 321–347 (1996)
Batenburg, K.J.: An evolutionary algorithm for discrete tomography. Discrete applied mathematics 155(1), 36–54 (2005)
Boufkhad, Dubois, Nivat, M.: Reconstructing (h,v)-convex 2-dimensional patterns of objects from approximate horizontal and vertical projections. Theoretical Computer Science 290(3), 1647–1664 (2003)
Brualdi, R.A.: Matrices of zeros and ones with fixed row and column sum. Linear algebra and its applications 3, 159–231 (1980)
Chrobak, M., Dürr, C.: Reconstructing hv-convex polyominoes from orthogonal projection. Inform. Process. Lett. 69, 283–289 (1999)
Dahl, G., Fatberg, T.: Optimization and reconstruction of hv-convex (0,1)-matrices. Discrete applied mathematics 155(1), 93–105 (2005)
Gardner, R.J., Gritzmann, P., Prangenberg, D.: On the computational complexity of determining polyatomic structures by X-rays. Theoretical computer science 233, 91–106 (2000)
Goldberg, A.V.: An efficient implementation of a scaling minimum-cost flow algorithm. Journal of algorithms 22, 1–29 (1997)
Herman, G.T., Kuba, A.: Discrete Tomography: Foundations, Algorithms and Applications. Birkhäuser, Basel (1999)
Jarray, F.: Solving problems of discrete tomography. Applications in workforce scheduling, Ph.D. Thesis, University of CNAM, Paris (2004)
Picouleau, C.: Reconstruction of domino tiling from its two orthogonal projections. Theoretical computer science 255(1), 437–447 (2001)
Ryser, H.J.: Combinatorial Properties of Matrices of Zeros and Ones. Canad. J. Math 9, 371–377 (1957)
Wang, B., Zhang, F.: On the precise Number of (0,1)-Matrices in u(R,S). Discrete mathematics 187, 211–220 (1998)
Woeginger, G.J.: The reconstruction of polyominoes from their orthogonal projections. Information Processing Letters 77(5-6), 225–229 (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jarray, F., Costa, MC., Picouleau, C. (2008). Approximating hv-Convex Binary Matrices and Images from Discrete Projections. In: Coeurjolly, D., Sivignon, I., Tougne, L., Dupont, F. (eds) Discrete Geometry for Computer Imagery. DGCI 2008. Lecture Notes in Computer Science, vol 4992. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79126-3_37
Download citation
DOI: https://doi.org/10.1007/978-3-540-79126-3_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79125-6
Online ISBN: 978-3-540-79126-3
eBook Packages: Computer ScienceComputer Science (R0)