Reconstruction Of Binary Matrices Satisfying Neighborhood Constraints By Simulated Annealing
Divyesh Patel, Tanuja Srivastava · Zenodo (CERN European Organization for Nuclear Research) · 2014
This paper considers the NP-hard problem of reconstructing binary matrices satisfying exactly-1-4-adjacency constraint from its row and column projections. This problem is formulated into a maximization problem. The objective function gives a measure of adjacency constraint for the binary matrices. The maximization problem is solved by the simulated annealing algorithm and experimental results are presented.