The reconstruction of two-directionally connected binary patterns from their two orthogonal projections.

Research output: Contribution to journalArticle

72 Citations (Scopus)

Abstract

A heuristic reconstruction algorithm is described, by which binary matrices can be produced from their two orthogonal projections. It is necessary for proper reconstruction that the binary pattern corresponding to the binary matrix be x- and y-directionally connected. By this method a large class of binary matrices can be reconstructed. It is proved that after a finite number of iterative steps this algorithm produces all the x- and y-directionally connected binary patterns belonging to the given two projections. Finally, some remarks on the implementation of this algorithm and results are presented.-Author

Original languageEnglish
Pages (from-to)249-265
Number of pages17
JournalComputer Vision, Graphics, & Image Processing
Volume27
Issue number3
DOIs
Publication statusPublished - Jan 1 1984

ASJC Scopus subject areas

  • Environmental Science(all)
  • Engineering(all)
  • Earth and Planetary Sciences(all)

Fingerprint Dive into the research topics of 'The reconstruction of two-directionally connected binary patterns from their two orthogonal projections.'. Together they form a unique fingerprint.

  • Cite this