# Reconstruction of Two-Valued Functions and Matrices

• Attila Kuba
Part of the Applied and Numerical Harmonic Analysis book series (ANHA)

## Abstract

The reconstruction of a two-valued function from its two projections is considered. It is shown that this problem can be transformed into the solved problem of the reconstruction of characteristic functions (i.e., functions with values 0 and 1). Necessary and sufficient conditions are given to decide the existence and the uniqueness of a two-valued function if its projections and the two values are known. These conditions can also be applied if the two values are not given in advance. It is proved that merely the knowledge of the projections (i.e., without the two values) is not enough for the unique reconstruction of a two-valued function. However, on the basis of two given functions it is possible to decide whether they are the projections of a uniquely reconstructible two-valued function. Also the corresponding values can be determined in this way. The reconstruction of two-valued matrices from their row and column sums (projections) is also considered. It is shown that this problem can be transformed into the solved problem of the reconstruction of (0,1)-matrices. In the same way as in the case of two-valued functions, necessary and sufficient conditions are given to decide the existence and the uniqueness of a two-valued matrix if its projections and the two values are known. It is proved that, generally, there is only a finite number of solutions even if the two values are not fixed. Finally, an algorithm is given to reconstruct two-valued matrices from two projections.

## Keywords

Admissible Pair Reconstruction Problem Half Line Uniqueness Pair Vertical Projection
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

## References

1. 
G. G. Lorentz, “A problem of plane measure,” Amer. J. Math, 71, 417–426 (1949).
2. 
H. G. Kellerer, “Masstheoretische Marginalprobleme,” Math. Annalen, 153, 168–198 (1964).
3. 
A. Kuba and A. Volcic, “Characterization of measurable plane sets which are reconstructable from their two projections,” Inverse Problems, 4, 513–527 (1988).
4. 
P. C. Fishburn, J. C. Lagarias, J. A. Reeds, and L. A. Shepp, “Sets uniquely determined by projections on axes,” Discrete Mathematics, 91, 149–159 (1991).
5. 
A. Kuba, “Reconstruction of measurable plane sets from their two projections taken in arbitrary directions,” Inverse Problems, 7, 101–107 (1991).
6. 
D. Gale, “Theorem on flows in networks,” Pacific. J. Math., 7, 1073–1082 (1957).
7. 
H. J. Ryser, “Combinatorial properties of matrices of zeros and ones,” Ganad. J. Math., 9, 371–377 (1957).
8. 
R. A. Brualdi, “Matrices of zeros and ones with fixed row and column sum vectors,” Linear Algebra and Its Applications, 33, 159–231 (1980).
9. 
L. Mirsky, “Combinatorial theorems and integral matrices,” J. Comb. Theory, 5, 30–44 (1968).
10. 
R. Aharoni, G. T. Herman, and A. Kuba, “Binary vectors partially determined by linear equation system,” Discrete Math,. 171, 1–16 (1997).
11. 
P. C. Fishburn, P. Schwander, L. A. Shepp, and J. Vanderbei, “The discrete Radon transform and its approximate inversion via linear programming,” Discrete Appl. Math., 75, 39–61 (1997).
12. 
S. K. Chang and C. K. Chow, “The reconstruction of three-dimensional objects from two orthogonal projections and its application to cardiac cineangiography,” IEEE Trans. Comp., C-22, 18–28 (1973).
13. 
G. P. M. Prause and D. G. W. Onnasch, “Binary reconstruction of the heart chambers from biplane angiographic image sequence,” IEEE Trans. Medical Imaging, 15, 532–559 (1996).
14. 
J. H. B. Kemperman and A. Kuba, “Reconstruction of two-valued matrices from their two projections,” Int. J. Imaging Systems and Technology, 9, 110–117 (1998).
15. 
A. Kuba and A. Volcic, “The structure of the class of non-uniquely reconstructible sets,” Acta Sci. Szeged, 58, 363–388 (1993).Google Scholar
16. 
Y. R. Wang, “Characterization of binary patterns and their projections,” IEEE Trans. Comput., C-24, 1032–1035 (1995). 