Resolution analysis of inverting the generalized N-dimensional Radon transform in โ„^n from discrete data

02/17/2021
โˆ™
by   Alexander Katsevich, et al.
โˆ™
0
โˆ™

Let โ„› denote the generalized Radon transform (GRT), which integrates over a family of N-dimensional smooth submanifolds ๐’ฎ_แปนโŠ‚๐’ฐ, 1โ‰ค Nโ‰ค n-1, where an open set ๐’ฐโŠ‚โ„^n is the image domain. The submanifolds are parametrized by points แปนโŠ‚๐’ฑฬƒ, where an open set ๐’ฑฬƒโŠ‚โ„^n is the data domain. The continuous data are g=โ„› f, and the reconstruction is fฬŒ=โ„›^*โ„ฌ g. Here โ„›^* is a weighted adjoint of โ„›, and โ„ฌ is a pseudo-differential operator. We assume that f is a conormal distribution, supp(f)โŠ‚๐’ฐ, and its singular support is a smooth hypersurface ๐’ฎโŠ‚๐’ฐ. Discrete data consists of the values of g on a lattice แปน^j with the step size O(ฯต). Let fฬŒ_ฯต=โ„›^*โ„ฌ g_ฯต denote the reconstruction obtained by applying the inversion formula to an interpolated discrete data g_ฯต(แปน). Pick a generic pair (x_0,แปน_0), where x_0โˆˆ๐’ฎ, and ๐’ฎ_แปน_0 is tangent to ๐’ฎ at x_0. The main result of the paper is the computation of the limit f_0(xฬŒ):=lim_ฯตโ†’0ฯต^ฮบfฬŒ_ฯต(x_0+ฯตxฬŒ). Here ฮบโ‰ฅ 0 is selected based on the strength of the reconstructed singularity, and xฬŒ is confined to a bounded set. The limiting function f_0(xฬŒ), which we call the discrete transition behavior, allows computing the resolution of reconstruction.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset
Success!
Error Icon An error occurred

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×

Consider DeepAI Pro