Binary image reconstruction from a small number of projections and the morphological skeleton
From MaRDI portal
Publication:499725
DOI10.1007/s10472-014-9440-8zbMath1341.68303OpenAlexW2104502022MaRDI QIDQ499725
Norbert Hantos, Péter Balázs, Szabolcs Iván, Kálmán Palágyi
Publication date: 6 October 2015
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-014-9440-8
Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Optimization by Simulated Annealing
- Reconstructing convex polyominoes from horizontal and vertical projections
- Medial representations. Mathematics, algorithms and applications
- A benchmark set for the reconstruction of \(hv\)-convex discrete sets
- The reconstruction of polyominoes from their orthogonal projections
- Generating convex polyominoes at random
- Discrete tomography by convex--concave regularization and D.C. programming
- 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.
- The Reconstruction of Polyominoes from Horizontal and Vertical Projections and Morphological Skeleton is NP-complete
- Combinatorial Properties of Matrices of Zeros and Ones
- Three-dimensional Statistical Data Security Problems
- Binary Image Reconstruction from Two Projections and Skeletal Information
- Reconstruction of 4- and 8-connected convex discrete sets from row and column projections
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Binary image reconstruction from a small number of projections and the morphological skeleton
