A new algorithm to compute the discrete inverse Radon transform (Q1199105)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new algorithm to compute the discrete inverse Radon transform |
scientific article; zbMATH DE number 93422
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new algorithm to compute the discrete inverse Radon transform |
scientific article; zbMATH DE number 93422 |
Statements
A new algorithm to compute the discrete inverse Radon transform (English)
0 references
16 January 1993
0 references
The author considers the well known Radon transform \([Rf](W,d)\) over \(S^{n-1}\times\mathbb{R}\) and first introduces a generalized Radon transform \([Pf](\vec U,s)\) over \(\mathbb{R}^ n\) under different measure. The inverse of \(P\) is explicitly evaluated. Now the two-dimensional case is focused with two corresponding transforms \(P_ i\), \(i=1,2\). The Fourier transform \(\hat f(k/(NT),l/(NT))\) is given in terms of \([P_ if](k/l,nT)\). The two equations enable the author to reconstruct \(f(x,y)\) using the one-dimensional discrete Fourier transform followed by the two-dimensional inverse fast Fourier transform where no backprojection and no interpolation between polar and Cartesian coordinates is needed. However, the sampling over the Radon domain becomes nonuniform, because the Cartesian grid over the Fourier domain is uniform. No numerical results are included.
0 references
discrete inverse Radon transform
0 references
tomography
0 references
Radon transform
0 references
discrete Fourier transform
0 references
fast Fourier transform
0 references
0.96672326
0 references
0.93112814
0 references
0.9291926
0 references
0.91990364
0 references
0.91030777
0 references
0.9049714
0 references