Characterization of Binary Patterns and Their Projections
Author:
- 1 October 1975
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-24 (10) , 1032-1035
Abstract
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.Keywords
This publication has 8 references indexed in Scilit:
- The Reconstruction of Three-Dimensional Objects from Two Orthogonal Projections and its Application to Cardiac CineangiographyIEEE Transactions on Computers, 1973
- Reconstruction of patterns by block-projectionInformation Sciences, 1972
- Reconstruction of pictures from their projectionsCommunications of the ACM, 1971
- The reconstruction of binary patterns from their projectionsCommunications of the ACM, 1971
- Computer recognition of figures through decompositionInformation and Control, 1968
- Recognition of Printed Chinese CharactersIEEE Transactions on Electronic Computers, 1966
- Pseudo-Boolean Methods for Bivalent ProgrammingLecture Notes in Mathematics, 1966
- Combinatorial Mathematics1963