Two Algorithms for Multiple-View Binary Pattern Reconstruction
- 1 January 1971
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics
- Vol. SMC-1 (1) , 90-94
- https://doi.org/10.1109/tsmc.1971.5408614
Abstract
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.Keywords
This publication has 7 references indexed in Scilit:
- The reconstruction of binary patterns from their projectionsCommunications of the ACM, 1971
- INVARIANT RECOGNITION OF GEOMETRIC SHAPES**The research reported herein was supported by the U. S. Army Research Office — Durham under Grant DA-ARO-D-31-124-G776 and Contract DAHC04-67-C-0046.Published by Elsevier ,1969
- Computer recognition of figures through decompositionInformation and Control, 1968
- A Character-Recognition StudyIBM Journal of Research and Development, 1960
- Some communication aspects of character-sensing systemsPublished by Association for Computing Machinery (ACM) ,1959
- An optimum character recognition system using decision functionsIRE Transactions on Electronic Computers, 1957
- Automatic input for business data-processing systemsPublished by Association for Computing Machinery (ACM) ,1957