By Topic

Two Algorithms for Multiple-View Binary Pattern Reconstruction

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
S. K. Chang ; IBM Thomas J. Watson Res. Center, Yorktown Heights, N. Y. 10598 ; G. L. Shelton

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.

Published in:

IEEE Transactions on Systems, Man, and Cybernetics  (Volume:SMC-1 ,  Issue: 1 )