A calculus for the random generation of labelled combinatorial structures
Theoretical Computer Science
Generating convex polyominoes at random
FPSAC '93 Proceedings of the 5th conference on Formal power series and algebraic combinatorics
Reconstructing convex polyominoes from horizontal and vertical projections
Theoretical Computer Science
Reconstructing hv-convex polyominoes from orthogonal projections
Information Processing Letters
The reconstruction of polyominoes from their orthogonal projections
Information Processing Letters
An algorithm reconstructing convex lattice sets
Theoretical Computer Science
Reconstruction of hv-convex binary matrices from their absorbed projections
Discrete Applied Mathematics - The 2001 international workshop on combinatorial image analysis (IWCIA 2001)
Stability in discrete tomography: some positive results
Discrete Applied Mathematics - Special issue: Advances in discrete geometry and topology (DGCI 2003)
Random generation of Q-convex sets
Theoretical Computer Science
An evolutionary algorithm for discrete tomography
Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
Optimization and reconstruction of hv-convex (0, 1)-matrices
Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
Advances in Discrete Tomography and Its Applications (Applied and Numerical Harmonic Analysis)
Advances in Discrete Tomography and Its Applications (Applied and Numerical Harmonic Analysis)
A decomposition technique for reconstructing discrete sets from four projections
Image and Vision Computing
Fast filling operations used in the reconstruction of convex lattice sets
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
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
Solving Nonograms by combining relaxations
Pattern Recognition
A benchmark set for the reconstruction of hv-convex discrete sets
Discrete Applied Mathematics
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
| Hi-index | 5.25 |
Discrete tomography deals with the reconstruction of discrete sets from few projections. Assuming that the set to be reconstructed belongs to a certain class of discrete sets with some geometrical properties is a commonly used technique to reduce the number of possibly many different solutions of the same reconstruction problem. The average performance of reconstruction algorithms are often tested on such classes by choosing elements of a given class from uniform random distributions. This paper presents a general framework for generating discrete sets with disjoint connected components using uniform distributions. Especially, the uniform random generation of hv-convex discrete sets and Q-convex discrete sets according to the size of the minimal bounding rectangle are discussed.