Approximating hv-Convex Binary Matrices and Images from Discrete Projections
From MaRDI portal
Publication:5458909
DOI10.1007/978-3-540-79126-3_37zbMath1138.68575OpenAlexW1496685379MaRDI QIDQ5458909
Fethi Jarray, Marie-Christine Costa, Christophe Picouleau
Publication date: 24 April 2008
Published in: Discrete Geometry for Computer Imagery (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-79126-3_37
Related Items (2)
A simulated annealing for reconstructing hv-convex binary matrices ⋮ Reconstructing convex matrices by integer programming approaches
Cites Work
- Reconstructing convex polyominoes from horizontal and vertical projections
- Matrices of zeros and ones with fixed row and column sum vectors
- Reconstructing \((h,v)\)-convex \(2\)-dimensional patterns of objects from approximate horizontal and vertical projections.
- On the computational complexity of determining polyatomic structures by X-rays
- Discrete tomography. Foundations, algorithms, and applications
- On the precise number of (0, 1)-matrices in \({\mathfrak A}(R,S)\)
- The reconstruction of polyominoes from their orthogonal projections
- Reconstructing \(hv\)-convex polyominoes from orthogonal projections
- Solving problems of discrete tomography application in workforce scheduling
- An evolutionary algorithm for discrete tomography
- Optimization and reconstruction of \(hv\)-convex (0,1)-matrices
- Combinatorial Properties of Matrices of Zeros and Ones
- Reconstruction of domino tiling from its two orthogonal projections
This page was built for publication: Approximating hv-Convex Binary Matrices and Images from Discrete Projections
