Related papers: Fast Azimuthally Anisotropic 3D Radon Transform by…
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…
We study efficient and reliable methods of capturing and sparsely representing anisotropic structures in 3D data. As a model class for multidimensional data with anisotropic features, we introduce generalized three-dimensional cartoon-like…
In clinical imaging, magnetic resonance (MR) image volumes are often acquired as stacks of 2D slices with decreased scan times, improved signal-to-noise ratio, and image contrasts unique to 2D MR pulse sequences. While this is sufficient…
We consider a one-dimensional Radon transform on the group SO(3) which is motivated by texture goniometry. In particular we will derive several inversion formulae and compare them with the inversion of the one-dimensional spherical Radon…
In [J. Bures, R. Lavicka, V. Soucek, Elements of quaternionic analysis and Radon transform, Textos de Matematica 42, Departamento de Matematica, Universidade de Coimbra, 2009], the authors describe a link between holomorphic functions…
We study constructions of $k \times n$ matrices $A$ that both (1) satisfy the restricted isometry property (RIP) at sparsity $s$ with optimal parameters, and (2) are efficient in the sense that only $O(n\log n)$ operations are required to…
We introduce Soft Anisotropic Diagrams (SAD), an explicit and differentiable image representation parameterized by a set of adaptive sites in the image plane. In SAD, each site specifies an anisotropic metric and an additively weighted…
The manuscript describes fast and scalable architectures and associated algorithms for computing convolutions and cross-correlations. The basic idea is to map 2D convolutions and cross-correlations to a collection of 1D convolutions and…
The approximate discrete Radon transform (ADRT) is a hierarchical multiscale approximation of the Radon transform. In this paper, we factor the ADRT into a product of linear transforms that resemble convolutions and derive an explicit…
In this paper we consider the generalized Radon transform $\mathcal R$ in the plane. Let $f$ be a piecewise smooth function, which has a jump across a smooth curve $\mathcal S$. We obtain a formula, which accurately describes view aliasing…
The generalized spherical Radon transform associates the mean values over spherical tori to a function $f$ defined on $\mathbb{S}^3 \subset \mathbb{H}$, where the elements of $\mathbb{S}^3$ are considered as quaternions representing…
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…
Dispersive Fourier transformation is a powerful technique in which spectral information is mapped into the time domain using chromatic dispersion. It replaces a spectrometer with an electronic digitizer, and enables real-time spectroscopy.…
We report on a new algorithm for detection of crystallographic information in 3D, as retained in Atom Probe Tomography (APT), with improved robustness and signal detection performance. The algorithm is underpinned by 1D distribution…
We study the inversion of the conical Radon which integrates a function in three-dimensional space from integrals over circular cones. The conical Radon recently got significant attention due to its relevance in various imaging applications…
We give an exact inversion formula for the approximate discrete Radon transform introduced in [Brady, SIAM J. Comput., 27(1), 107--119] that is of cost $O(N \log N)$ for a square 2D image with $N$ pixels and requires only partial data.
We develop a new, efficient, and accurate method to simulate frequency-domain borehole electromagnetic (EM) measurements acquired in the presence of three-dimensional (3D) variations of the anisotropic subsurface conductivity. The method is…
The one-dimensional (1D) fractional Fourier transform (FRFT) generalizes the Fourier transform, offering significant advantages in the time-frequency analysis of non-stationary signals. While various 2D extensions exist, such as the 2D…
We present an efficient algorithm for the all-electron periodic Coulomb matrix based on the Ewald summation combined with the Fourier-transformed Coulomb method. The short-range contributions involving compact densities are evaluated in…
A key problem in approximation theory is the recovery of high-dimensional functions from samples. In many cases, the functions of interest exhibit anisotropic smoothness, and, in many practical settings, the nature of this anisotropy may be…