Iterative algorithm for discrete tomography

✍ Scribed by S. K. Patch

• Publisher: John Wiley and Sons
• Year: 1998
• Tongue: English
• Weight: 86 KB
• Volume: 9
• Category: Article
• ISSN: 0899-9457
• DOI: 10.1002/(sici)1098-1098(1998)9:2/3<132::aid-ima10>3.0.co;2-z

✦ Synopsis

The general limited-angle problem is underdetermined and verts Å ((a / d / g), (b / e / h), (c / f / i)). This in discrete tomography. However, electron microscopy of crystals is a terminology is used in the following theorem.

much more specific problem, and is subject to stringent mathematical conditions. Using a constructive argument, we show that under these Theorem 1. Let the imaging object be a set of 1s contained in physically reasonable conditions, data from only two discrete tomoan N 1 N lattice, where the other lattice points are 0 and the graphic views are required to reconstruct the lattice. ᭧ 1998