Characterization of Binary Patterns and Their Projections

DOI10.1109/T-C.1975.224121zbMATH Open0324.68066MaRDI QIDQ4088320FDOQ4088320

Authors:

Publication date: 1975

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Algorithms in computer science (68W99)

Cited In (9)

• Discrete tomography determination of bounded lattice sets from four X-rays
• Reconstructing \((h,v)\)-convex \(2\)-dimensional patterns of objects from approximate horizontal and vertical projections.
• An algorithm to detect linearly separable clusters of binary patterns
• Switching components and the ambiguity problem in the reconstruction of pictures from their projections
• Reconstructing convex polyominoes from horizontal and vertical projections
• Stability results for uniquely determined sets from two directions in discrete tomography
• The number of convex polyominoes reconstructible from their orthogonal projections
• Polyominoes defined by their vertical and horizontal projections
• Reconstructing convex matrices by integer programming approaches

This page was built for publication: Characterization of Binary Patterns and Their Projections

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4088320)