A benchmark set for the reconstruction of hv-convex discrete sets

Authors:
Péter Balázs
Affiliations:
Department of Image Processing and Computer Graphics, University of Szeged, Árpád tér 2., H-6720 Szeged, Hungary
Venue:
Discrete Applied Mathematics
Year:
2009

Citing 17
Cited 0

Polyominoes defined by two vectors

Theoretical Computer Science
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
Generation and reconstruction of hv-convex 8-connected discrete sets

Acta Cybernetica
Watermelon uniform random generation with applications

Theoretical Computer Science - Random generation of combinatorial objects and bijective combinatorics
Reconstruction of 8-connected but not 4-connected hv-convex discrete sets

Discrete Applied Mathematics - Special issue: Advances in discrete geometry and topology (DGCI 2003)
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 genetic algorithm for discrete tomography reconstruction

Genetic Programming and Evolvable Machines
A framework for generating some discrete sets with disjoint components by using uniform distributions

Theoretical Computer Science
On the ambiguity of reconstructing hv-convex binary matrices with decomposable configurations

Acta Cybernetica
On the number of hv-convex discrete sets

IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
A memetic algorithm for binary image reconstruction

IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis

Quantified Score

Hi-index	0.04

Visualization

Abstract

In this paper we summarize the most important generation methods developed for the subclasses of hv-convex discrete sets. We also present some new generation techniques to complement the former ones thus making it possible to design a complete benchmark set for testing the performance of reconstruction algorithms on the class of hv-convex discrete sets and its subclasses. By using this benchmark set the paper also collects several statistics on hv-convex discrete sets, which are of great importance in the analysis of algorithms for reconstructing such kinds of discrete sets.