Reconstructing a binary matrix under timetabling constraints
References (9)
- et al.
Reconstructing convex polyominoes from horizontal and vertical projections
Theoritical Computer Science
(1996) - et al.
An algorithm reconstructing convex lattice sets
Theoritical Computer Science
(2003) The reconstruction of polyominoes from their orthogonal projections
Information Processing Letters
(2001)- et al.
Introduction to Algorithms
(2001)
There are more references available in the full text version of this article.
Cited by (6)
Binary image reconstruction based on prescribed numerical information
2015, Acta Mathematicae Applicatae SinicaReconstruction of bicolored images
2015, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)Discrete tomography reconstruction algorithms for images with a blocking component
2014, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)A new approach for the reconstruction of object-based images in discrete tomography
2014, Fundamenta InformaticaeAn object-based tomographic recostruction algorithm exploiting interest points in image projections
2013, International Symposium on Image and Signal Processing and Analysis, ISPAIntroduction
2007, Applied and Numerical Harmonic Analysis
Copyright © 2005 Elsevier B.V. All rights reserved.