7,924 research outputs found
Fast Computation of Orthogonal Polar Harmonic Transforms
International audienceThis paper presents a method for the computation of polar harmonic transforms that is fast and efficient. The method is based on the inherent recurrence relations among harmonic functions that are used in the definitions of the radial and angular kernels of the transforms. The employment of these relations leads to recursive strategies for fast computation of harmonic function-based kernels. Polar harmonic transforms were recently proposed and have shown nice properties for image representation and pattern recognition. The proposed method is 10-time faster than direct computation and five-time faster than fast computation of Zernike moments
A novel sampling theorem on the rotation group
We develop a novel sampling theorem for functions defined on the
three-dimensional rotation group SO(3) by connecting the rotation group to the
three-torus through a periodic extension. Our sampling theorem requires
samples to capture all of the information content of a signal band-limited at
, reducing the number of required samples by a factor of two compared to
other equiangular sampling theorems. We present fast algorithms to compute the
associated Fourier transform on the rotation group, the so-called Wigner
transform, which scale as , compared to the naive scaling of .
For the common case of a low directional band-limit , complexity is reduced
to . Our fast algorithms will be of direct use in speeding up the
computation of directional wavelet transforms on the sphere. We make our SO3
code implementing these algorithms publicly available.Comment: 5 pages, 2 figures, minor changes to match version accepted for
publication. Code available at http://www.sothree.or
A Fast and Accurate Algorithm for Spherical Harmonic Analysis on HEALPix Grids with Applications to the Cosmic Microwave Background Radiation
The Hierarchical Equal Area isoLatitude Pixelation (HEALPix) scheme is used
extensively in astrophysics for data collection and analysis on the sphere. The
scheme was originally designed for studying the Cosmic Microwave Background
(CMB) radiation, which represents the first light to travel during the early
stages of the universe's development and gives the strongest evidence for the
Big Bang theory to date. Refined analysis of the CMB angular power spectrum can
lead to revolutionary developments in understanding the nature of dark matter
and dark energy. In this paper, we present a new method for performing
spherical harmonic analysis for HEALPix data, which is a central component to
computing and analyzing the angular power spectrum of the massive CMB data
sets. The method uses a novel combination of a non-uniform fast Fourier
transform, the double Fourier sphere method, and Slevinsky's fast spherical
harmonic transform (Slevinsky, 2019). For a HEALPix grid with pixels
(points), the computational complexity of the method is , with an initial set-up cost of . This compares
favorably with runtime complexity of the current methods
available in the HEALPix software when multiple maps need to be analyzed at the
same time. Using numerical experiments, we demonstrate that the new method also
appears to provide better accuracy over the entire angular power spectrum of
synthetic data when compared to the current methods, with a convergence rate at
least two times higher
The curvelet transform for image denoising
We describe approximate digital implementations of two new mathematical transforms, namely, the ridgelet transform and the curvelet transform. Our implementations offer exact reconstruction, stability against perturbations, ease of implementation, and low computational complexity. A central tool is Fourier-domain computation of an approximate digital Radon transform. We introduce a very simple interpolation in the Fourier space which takes Cartesian samples and yields samples on a rectopolar grid, which is a pseudo-polar sampling set based on a concentric squares geometry. Despite the crudeness of our interpolation, the visual performance is surprisingly good. Our ridgelet transform applies to the Radon transform a special overcomplete wavelet pyramid whose wavelets have compact support in the frequency domain. Our curvelet transform uses our ridgelet transform as a component step, and implements curvelet subbands using a filter bank of a` trous wavelet filters. Our philosophy throughout is that transforms should be overcomplete, rather than critically sampled. We apply these digital transforms to the denoising of some standard images embedded in white noise. In the tests reported here, simple thresholding of the curvelet coefficients is very competitive with "state of the art" techniques based on wavelets, including thresholding of decimated or undecimated wavelet transforms and also including tree-based Bayesian posterior mean methods. Moreover, the curvelet reconstructions exhibit higher perceptual quality than wavelet-based reconstructions, offering visually sharper images and, in particular, higher quality recovery of edges and of faint linear and curvilinear features. Existing theory for curvelet and ridgelet transforms suggests that these new approaches can outperform wavelet methods in certain image reconstruction problems. The empirical results reported here are in encouraging agreement
- …