A new algorithm to compute the discrete inverse Radon transform

From MaRDI portal





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.











This page was built for publication: A new algorithm to compute the discrete inverse Radon transform

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