Polyominoes defined by two vectors
Theoretical Computer Science
Computer Vision and Image Understanding
Reconstructing convex polyominoes from horizontal and vertical projections
Theoretical Computer Science
The number of convex polyominoes reconstructible from their orthogonal projections
Proceedings of the 6th conference on Formal power series and algebraic combinatorics
Reconstructing hv-convex polyominoes from orthogonal projections
Information Processing Letters
Algorithm 445: Binary pattern reconstruction from projections
Communications of the ACM
The reconstruction of polyominoes from their orthogonal projections
Information Processing Letters
Reconstruction of convex 2D discrete sets in polynomial time
Theoretical Computer Science
A decomposition technique for reconstructing discrete sets from four projections
Image and Vision Computing
Reconstruction of Binary Images with Few Disjoint Components from Two Projections
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing, Part II
Reconstruction of Canonical hv-Convex Discrete Sets from Horizontal and Vertical Projections
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
On the number of hv-convex discrete sets
IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
A memetic approach to discrete tomography from noisy projections
Pattern Recognition
A memetic island model for discrete tomography reconstruction
WILF'11 Proceedings of the 9th international conference on Fuzzy logic and applications
The number of line-convex directed polyominoes having the same orthogonal projections
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
Reconstruction of decomposable discrete sets from four projections
DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
An island strategy for memetic discrete tomography reconstruction
Information Sciences: an International Journal
Solving Multicolor Discrete Tomography Problems by Using Prior Knowledge
Fundamenta Informaticae - Strategies for Tomography
Hi-index | 0.00 |
The reconstruction of 8-connected but not 4-connected hv-convex discrete sets from few projections is considered. An algorithm is given with worst case complexity of O(mnmin{m,n}) to reconstruct all sets with given horizontal and vertical projections. Experimental results are also presented. It is shown, that using also the diagonal projections the algorithm can be speeded up having complexity of O(mn) and in this case the solution is uniquely determined. Finally, we consider the possible generalizations of our results to solve the problem in more general classes.