Reconstruction of bicolored images

Abstract

In this paper, we present an integer programming approach to estimating a discrete bi-colored image from its two-color horizontal and vertical projections. The two-color projections basically refer to the number of pixels per column having colors c1and c2, and likewise for each row as well. The aim of the integer programming approach is to minimize the number of conflict pixels, i.e. the number of pixels that have color c1 as well as c2. Since the problem is NP-complete, we give a survey of the literature and we propose a new integer programming formulation of this problem.