Ghassen Tlig

A simulated annealing for reconstructing hv-convex binary matrices

We consider a variant of the NP-hard problem of reconstructing hv-convex binary matrices from two projections. This variant is reformulated as an integer programming problem and approximated by simulated annealing approach.

Reconstructing Convex Matrices by Integer Programming Approaches

We consider the problem of reconstructing two-dimensional convex binary matrices from their row and column sums with adjacent ones. Instead of requiring the ones to occur consecutively in each row and column, we maximize the number of adjacent ones. We reformulate the problem by using integer programming and we develop approximate solutions based on linearization and convexification techniques.

Approximating bicolored images from discrete projections

We study the problem of reconstructing bicolored images from their discrete projections that is the number of pixels of each color lying on each row and column. The problem is well known to be NP-complete so, we study a restricted case (with bounded projections) and present an approximating algorithm based on a max-flow technique for the general case.

Reconstruction of Bicolored Images

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

A Greedy Algorithm for Reconstructing Binary Matrices with Adjacent 1s

c_1

Hybridisation of genetic algorithms and tabu search approach for reconstructing convex binary images from discrete orthogonal projections

and

A Tabu Approach for Reconstructing Non-Interior Holes Binary Images.

c_2