𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new algorithm to compute the discrete inverse radon transform

✍ Scribed by Joseph Segman

Publisher
Springer US
Year
1992
Tongue
English
Weight
283 KB
Volume
3
Category
Article
ISSN
0923-6082

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the algorithmic inversion of the disc
On the algorithmic inversion of the discrete Radon transform
✍ Peter Gritzmann; Sven de Vries πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 157 KB

The present paper deals with the computational complexity of the discrete inverse problem of reconstructing ΓΏnite point sets and more general functionals with ΓΏnite support that are accessible only through some of the values of their discrete Radon transform. It turns out that this task behaves quit

Discrete Radon transform and its approxi
Discrete Radon transform and its approximate inversion via the EM algorithm
✍ Y. Vardi; D. Lee πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 825 KB

The problem of reconstructing a binary function, f, de-0 or 1 with 0 Β°f (z) Β°1, and (b) using a linear programming fined on a finite subset of a lattice ‫,ήšβ€¬ from an arbitrary collection of (LP) method to search for a feasible solution to Equation (1) its partial-sums is considered. The approach we

A BSP Recursive Divide and Conquer Algor
A BSP Recursive Divide and Conquer Algorithm to Compute the Inverse of a Tridiagonal Matrix
✍ Joan-Josep Climent; Leandro Tortosa; Antonio Zamora πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 253 KB

In this paper we discuss a recursive divide and conquer algorithm to compute the inverse of an unreduced tridiagonal matrix. It is based on the recursive application of the Sherman Morrison formula to a diagonally dominant tridiagonal matrix to avoid numerical stability problems. A theoretical study