Approximating hv-Convex Binary Matrices and Images from Discrete Projections
We study the problem of reconstructing hv-convex binary matrices from few projections. We solve a polynomial time case and we determine some properties of the hv-convex matrices. Since the problem is NP-complete, we provide an iterative approximation based on a longest path and a min-cost/max-flow model. The experimental results show that the reconstruction algorithm performs quite well.
KeywordsDiscrete Tomography hv-convex Image Reconstruction
- 10.Jarray, F.: Solving problems of discrete tomography. Applications in workforce scheduling, Ph.D. Thesis, University of CNAM, Paris (2004)Google Scholar