A benchmark set for the reconstruction of hv-convex discrete sets
From MaRDI portal
Publication:967404
DOI10.1016/J.DAM.2009.02.019zbMATH Open1186.68488OpenAlexW2067384205MaRDI QIDQ967404FDOQ967404
Authors: Péter Balázs 
Publication date: 28 April 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2009.02.019
Recommendations
- scientific article; zbMATH DE number 1911999
- Comparison of algorithms for reconstructing \(hv\)-convex discrete sets
- Reconstruction of 4- and 8-connected convex discrete sets from row and column projections
- Reconstruction of convex 2D discrete sets in polynomial time
- Reconstruction of canonical \(hv\)-convex discrete sets from horizontal and vertical projections
Cites Work
- The On-Line Encyclopedia of Integer Sequences
- Discrete tomography. Foundations, algorithms, and applications
- Algebraic languages and polyominoes enumeration
- Reconstructing \(hv\)-convex polyominoes from orthogonal projections
- Advances in discrete tomography and its applications. Some papers based on the presentations at the workshop on discrete tomography and its applications, New York, NY, USA, June 13--15, 2005.
- Checker Boards and Polyominoes
- Reconstructing convex polyominoes from horizontal and vertical projections
- A calculus for the random generation of labelled combinatorial structures
- Polyominoes defined by two vectors
- The reconstruction of polyominoes from their orthogonal projections
- Reconstruction of 8-connected but not 4-connected \(hv\)-convex discrete sets
- Optimization and reconstruction of \(hv\)-convex (0,1)-matrices
- Comparison of algorithms for reconstructing \(hv\)-convex discrete sets
- Reconstruction of 4- and 8-connected convex discrete sets from row and column projections
- A framework for generating some discrete sets with disjoint components by using uniform distributions
- Generating convex polyominoes at random
- Combinatorial image analysis. 12th international workshop, IWCIA 2008, Buffalo, NY, USA, April 7--9, 2008. Proceedings
- Watermelon uniform random generation with applications
- On directed-convex polyominoes in a rectangle
- On the number of convex polyominoes.
- An evolutionary algorithm for discrete tomography
- On the ambiguity of reconstructing \(hv\)-convex binary matrices with decomposable configurations
- Title not available (Why is that?)
Cited In (6)
- Comparison of algorithms for reconstructing \(hv\)-convex discrete sets
- A framework for generating some discrete sets with disjoint components by using uniform distributions
- Reconstruction of hv-convex sets by their coordinate X-ray functions
- Binary image reconstruction from a small number of projections and the morphological skeleton
- Title not available (Why is that?)
- Reconstructing convex matrices by integer programming approaches
Uses Software
This page was built for publication: A benchmark set for the reconstruction of \(hv\)-convex discrete sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q967404)
