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.
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… (More)