Related papers: Exact and fast inversion of the approximate discre…
Radiative transfer modeling of spectral lines including partial redistribution (PRD) effects requires the evaluation of the ratio of the emission to the absorption profile. This quantity requires a large amount of computational work if one…
In this article we study the fan-beam Radon transform ${\cal D}_m $ of symmetrical solenoidal 2D tensor fields of arbitrary rank $m$ in a unit disc $\mathbb D$ as the operator, acting from the object space ${\mathbf L}_{2}(\mathbb D; {\bf…
We consider weighted Radon transforms $R_W$ along hyperplanes in $R^3$ with strictly positive weights $W$. We construct an example of such a transform with non-trivial kernel $\mathrm{Ker}R_W$ in the space of infinitely smooth compactly…
The monograph contains a systematic treatment of a circle of problems in analysis and integral geometry related to inversion of the Radon transform on the space of real rectangular matrices. This transform assigns to a function $f$ on the…
Radon transform and its inverse operation are important techniques in medical imaging tasks. Recently, there has been renewed interest in Radon transform for applications such as content-based medical image retrieval. However, all studies…
The well-known discrete Fourier transform (DFT) can easily be generalized to arbitrary nodes in the spatial domain. The fast procedure for this generalization is referred to as nonequispaced fast Fourier transform (NFFT). Various…
The transform considered in the paper averages a function supported in a ball in $\RR^n$ over all spheres centered at the boundary of the ball. This Radon type transform arises in several contemporary applications, e.g. in thermoacoustic…
Hyperplane is a set of non-injectivity of the spherical Radon transform (SRT) in the space of continuous functions in R^d. In this article, for the reconstruction of an unknown function f from C(R^3) (the support can be non-compact), using…
The Radon transform and its adjoint, the back-projection operator, can both be expressed as convolutions in log-polar coordinates. Hence, fast algorithms for the application of the operators can be constructed by using FFT, if data is…
A low-complexity 8-point orthogonal approximate DCT is introduced. The proposed transform requires no multiplications or bit-shift operations. The derived fast algorithm requires only 14 additions, less than any existing DCT approximation.…
The Radon cumulative distribution transform (R-CDT) exploits one-dimensional Wasserstein transport and the Radon transform to represent prominent features in images. It is closely related to the sliced Wasserstein distance and facilitates…
Diffusion inversion is the problem of taking an image and a text prompt that describes it and finding a noise latent that would generate the exact same image. Most current deterministic inversion techniques operate by approximately solving…
We study integral transforms mapping a function on the Euclidean space to the family of its integration on some hypersurfaces, that is, a function of hypersurfaces. The hypersurfaces are given by the graphs of functions with fixed axes of…
In this paper we consider the so-called crystallographic Radon transform (or crystallographic $X$-ray transform) and totally geodesic Radon transform on the group of rotations SO(3). As we show both of these transforms naturally appear in…
The integro-differential formulation of the RTE and its solution by iterations on the source has been extended here to handle anisotropic scattering. The iterative part of the method is O(N ln N ), thanks to an efficient use of H-matrices.…
In this work we consider the Conical Radon Transform, which integrates a function on $\R^n$ over families of circular cones. Transforms of this type are known to arise naturally as models of Compton camera imaging and single-scattering…
This paper introduces a factorization for the inverse of discrete Fourier integral operators that can be applied in quasi-linear time. The factorization starts by approximating the operator with the butterfly factorization. Next, a…
Nonlinear parametric inverse problems appear in many applications and are typically very expensive to solve, especially if they involve many measurements. These problems pose huge computational challenges as evaluating the objective…
This paper develops projection pursuit for discrete data using the discrete Radon transform. Discrete projection pursuit is presented as an exploratory method for finding informative low dimensional views of data such as binary vectors,…
We present a novel algorithm, named the 2D-FFAST, to compute a sparse 2D-Discrete Fourier Transform (2D-DFT) featuring both low sample complexity and low computational complexity. The proposed algorithm is based on mixed concepts from…