This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Characterization of Binary Patterns and Their Projections
October 1975 (vol. 24 no. 10)
pp. 1032-1035
Y.R. Wang, Department of Computer Science, University of Nebraska
Algorithms for reconstruction of a two-dimensional binary pattern Z from its row-projection vector A and column-projection vector B have been developed by Chang. The projection set (A,B) is said to be unique, nonunique, or inconsistent if it determines one binary pattern, more than one binary pattern, or no binary pattern. A binary patern Z is said to be ambiguous if there exists another pattern with the same projections, otherwise it is unambiguous. Two characterization questions of binary patterns and their projections are posed. First, given Z what is the necessary and sufficient condition for Z to be ambiguous, or unambiguous? Second, given (A,B), what is the necessary and sufficient condition for (A,B) to be unique, nonunique, or inconsistent? These two combinational questions are discussed and efficient algorithms to answer them are derived from some ideas of Ryser.
Index Terms:
Assignment and update, block projection method, canonical forms, iterative deletions, projection set, switching Components.
Citation:
Y.R. Wang, "Characterization of Binary Patterns and Their Projections," IEEE Transactions on Computers, vol. 24, no. 10, pp. 1032-1035, Oct. 1975, doi:10.1109/T-C.1975.224121
Usage of this product signifies your acceptance of the Terms of Use.