Abstract
We are concerned with binary matrix reconstruction from their orthogonal projections. To the basic problem we add new kinds of constraints. In the first problems we study the ones of the matrix must be isolated: All the neighbors of a one must be a zero. Several types of neighborhoods are studied. In our second problem, every one has to be horizontally not isolated. Moreover, the number of successive zeros in a horizontal rank must be bounded by a fixed parameter. Complexity results and polynomial-time algorithms are given.
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
Ahuja, R.K., Magnanti, T.L., and Orlin, J.B.: Network Flows. Prentice Hall, Englewood Cliffs, NJ (1993).
Alfares, H.K.: Four day workweek scheduling with two or three consecutive days off. J. Math. Modeling Algorithms, 2, 67–80 (2003).
Alfares, H.K.: Survey, categorization, and comparison of recent tour scheduling literature. Annals of Operations Research, 127, 147–177 (2004).
Barcucci, E., Del Lungo, A, Nivat, M., Pinzani, R.: Reconstructing convex polyominoes from horizontal and vertical projections. Theor. Comp. Sci., 155, 321–347 (1996).
Baxter, R.J.: Planar lattice gases with nearest-neighbour exclusion. Annals of Combinatorics, 3, 191–203 (1999).
Brunetti, S., Daurat, A.: An algorithm reconstructing convex lattice sets. Theor. Comp. Sci., 304, 35–57 (2003).
Brunetti, S., Del Lungo, A., Del Ristoro, F., Kuba, A., Maurice, N.: Reconstruction of 4-and 8-connected convex discrete sets from row and column projections. Lin. Algebra Appl., 339, 37–57 (2001).
Burns, R.N., Narasimhan, R., Smith, L.D.: A set processing algorithm for scheduling staff on 4-day or 3-day work weeks. Naval Research Logistics, 45, 839–853 (1998).
Calkin, N.J., Wilf, H.S.: The number of independent sets in a grid graph. SIAM J. Discr. Math., 11, 54–60 (1998).
Chan, M.T., Herman, G.T., Levitan, E.: Bayesian image reconstruction using image-modeling Gibbs priors. Int. J. Imaging Systems Techn., 9, 85–98 (1998).
Chrobak, M., Couperus, P., Dürr, C., Woeginger, G.: A note on tiling under tomographic constraints. Theor. Comp. Sci., 290, 2125–2136 (2003).
Chrobak, M., Dürr, C.: Reconstructing hv-convex polyominoes from orthogonal projections. Inform. Process. Lett., 69, 283–289 (1999).
Chrobak, M., Dürr, C.: Reconstructing polyatomic structures from X-rays: NP-completeness proof for three atoms. Theor. Comp. Sci., 259, 81–98 (2001).
Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms. 2nd edition, MIT Press, Cambridge, MA (2001).
Del Lungo, A., Frosini, A., Nivat, M., Vuillon, L.: Reconstruction under periodicity constraints. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.), Automata, Languages and Programming, Springer, Berlin, Germany, pp. 38–56 (2002).
Del Lungo, A., Nivat, M.: Reconstruction of connected sets from two projections. In Herman, G.T., Kuba, A. (eds.), Discrete Tomography: Foundations, Algorithms, and Applications, Birkhäuser, Boston, MA, pp. 163–188 (1999).
Herman, G.T., Kuba, A. (eds.): Discrete Tomography: Foundations, Algorithms, and Applications. Birkhäuser, Boston, MA (1999).
Hung, R.: Single-shift off-day scheduling of a hierarchical workforce with variable demands. European J. Operational Research, 78, 49–57 (1994).
Jarray F.: Résolution de problèmes de tomographie discrète. Applications à la planification de personnel. Ph.D. Thesis, CNAM, Paris, France (2004).
Kuba, A., Balogh, E.: Reconstruction of convex 2D discrete sets in polynomial time. Theor. Comput. Sci., 283, 223–242 (2000).
Picouleau, C.: Reconstruction of domino tiling from its two orthogonal projections. Theor. Comp. Sci., 255, 437–447 (2001).
Ryser, H.J.: Combinatorial properties of matrices of zeros and ones. Canad. J. Math., 9, 371–377 (1957).
Ryser, H.: Combinatorial Mathematics, Mathematical Association of America, Washington, DC (1963).
Woeginger, G.J.: The reconstruction of polyominoes from their orthogonal projections. Info. Process. Lett., 77, 225–229 (2001).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Birkhäuser Boston
About this chapter
Cite this chapter
Brunetti, S., Costa, M., Frosini, A., Jarray, F., Picouleau, C. (2007). Reconstruction of Binary Matrices under Adjacency Constraints. In: Herman, G.T., Kuba, A. (eds) Advances in Discrete Tomography and Its Applications. Applied and Numerical Harmonic Analysis. Birkhäuser Boston. https://doi.org/10.1007/978-0-8176-4543-4_7
Download citation
DOI: https://doi.org/10.1007/978-0-8176-4543-4_7
Publisher Name: Birkhäuser Boston
Print ISBN: 978-0-8176-3614-2
Online ISBN: 978-0-8176-4543-4
eBook Packages: EngineeringEngineering (R0)