Discrete tomographic reconstruction of binary matrices using branch and bound method

In this paper we show a new method for reconstructing binary matrices. We focus on the reconstruction of hv-convex matrices. We show that our algorithm finds all the solutions, and sort out the ones that do not comply to the hv-convex criteria. We also show that this algorithm works best for smaller matrices up to size 20times20 pixels. We make some notes on the possible speed-up strategies too.