Skip to Main Content
The problem of reconstructing binary patterns from their shadows or projections is treated. Two algorithms are formulated. For the two-view case, both algorithms give a perfect reconstruction if and only if the pattern is two-view unambiguous. It is also shown that n views are sufficient, but not necessary, to reconstruct any n Ã n binary pattern. Experimental results for the four-view reconstruction of 25 Ã 25 binary patterns indicate that one of the algorithms has good convergency behavior.