โ Scribed by Attila Kuba
No coin nor oath required. For personal study only.
A heuristic reconstruction algorithm is described, by which binary matrices can be produced from their two orthogonal projections. It is necessary for proper reconstruction that the binary pattern corresponding to the binary matrix be x-and y-directionally connected. By this method a large class of binary matrices can be reconstructed. It is proved that after a finite number of iterative steps this algorithm produces all the x-and y-directionally connected binary patterns belonging to the given two projections. Finally, some remarks on the implementation of this algorithm and results are presented. *The author is presently with the Lehrstuhl fur Informatik 5, Universitat Erlangen, Federal Republic of Germany, as a research fellow of the Alexander von Humboldt Foundation.
๐ SIMILAR VOLUMES
A matrix is said to be two-valued if its elements assume unknown subset S of Q from the following two projections of its at most two different values. We studied the problem of recondensity function g(i, j) on M 1 N: structing a two-valued matrix from its marginals-that is, from its row sums and col