11,237 research outputs found
On the computation of directional scale-discretized wavelet transforms on the sphere
We review scale-discretized wavelets on the sphere, which are directional and
allow one to probe oriented structure in data defined on the sphere.
Furthermore, scale-discretized wavelets allow in practice the exact synthesis
of a signal from its wavelet coefficients. We present exact and efficient
algorithms to compute the scale-discretized wavelet transform of band-limited
signals on the sphere. These algorithms are implemented in the publicly
available S2DW code. We release a new version of S2DW that is parallelized and
contains additional code optimizations. Note that scale-discretized wavelets
can be viewed as a directional generalization of needlets. Finally, we outline
future improvements to the algorithms presented, which can be achieved by
exploiting a new sampling theorem on the sphere developed recently by some of
the authors.Comment: 13 pages, 3 figures, Proceedings of Wavelets and Sparsity XV, SPIE
Optics and Photonics 2013, Code is publicly available at http://www.s2dw.org
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
ShearLab 3D: Faithful Digital Shearlet Transforms based on Compactly Supported Shearlets
Wavelets and their associated transforms are highly efficient when
approximating and analyzing one-dimensional signals. However, multivariate
signals such as images or videos typically exhibit curvilinear singularities,
which wavelets are provably deficient of sparsely approximating and also of
analyzing in the sense of, for instance, detecting their direction. Shearlets
are a directional representation system extending the wavelet framework, which
overcomes those deficiencies. Similar to wavelets, shearlets allow a faithful
implementation and fast associated transforms. In this paper, we will introduce
a comprehensive carefully documented software package coined ShearLab 3D
(www.ShearLab.org) and discuss its algorithmic details. This package provides
MATLAB code for a novel faithful algorithmic realization of the 2D and 3D
shearlet transform (and their inverses) associated with compactly supported
universal shearlet systems incorporating the option of using CUDA. We will
present extensive numerical experiments in 2D and 3D concerning denoising,
inpainting, and feature extraction, comparing the performance of ShearLab 3D
with similar transform-based algorithms such as curvelets, contourlets, or
surfacelets. In the spirit of reproducible reseaerch, all scripts are
accessible on www.ShearLab.org.Comment: There is another shearlet software package
(http://www.mathematik.uni-kl.de/imagepro/members/haeuser/ffst/) by S.
H\"auser and G. Steidl. We will include this in a revisio
ShearLab: A Rational Design of a Digital Parabolic Scaling Algorithm
Multivariate problems are typically governed by anisotropic features such as
edges in images. A common bracket of most of the various directional
representation systems which have been proposed to deliver sparse
approximations of such features is the utilization of parabolic scaling. One
prominent example is the shearlet system. Our objective in this paper is
three-fold: We firstly develop a digital shearlet theory which is rationally
designed in the sense that it is the digitization of the existing shearlet
theory for continuous data. This implicates that shearlet theory provides a
unified treatment of both the continuum and digital realm. Secondly, we analyze
the utilization of pseudo-polar grids and the pseudo-polar Fourier transform
for digital implementations of parabolic scaling algorithms. We derive an
isometric pseudo-polar Fourier transform by careful weighting of the
pseudo-polar grid, allowing exploitation of its adjoint for the inverse
transform. This leads to a digital implementation of the shearlet transform; an
accompanying Matlab toolbox called ShearLab is provided. And, thirdly, we
introduce various quantitative measures for digital parabolic scaling
algorithms in general, allowing one to tune parameters and objectively improve
the implementation as well as compare different directional transform
implementations. The usefulness of such measures is exemplarily demonstrated
for the digital shearlet transform.Comment: submitted to SIAM J. Multiscale Model. Simu
Fast directional continuous spherical wavelet transform algorithms
We describe the construction of a spherical wavelet analysis through the
inverse stereographic projection of the Euclidean planar wavelet framework,
introduced originally by Antoine and Vandergheynst and developed further by
Wiaux et al. Fast algorithms for performing the directional continuous wavelet
analysis on the unit sphere are presented. The fast directional algorithm,
based on the fast spherical convolution algorithm developed by Wandelt and
Gorski, provides a saving of O(sqrt(Npix)) over a direct quadrature
implementation for Npix pixels on the sphere, and allows one to perform a
directional spherical wavelet analysis of a 10^6 pixel map on a personal
computer.Comment: 10 pages, 3 figures, replaced to match version accepted by IEEE
Trans. Sig. Pro
Sparse image reconstruction on the sphere: analysis and synthesis
We develop techniques to solve ill-posed inverse problems on the sphere by
sparse regularisation, exploiting sparsity in both axisymmetric and directional
scale-discretised wavelet space. Denoising, inpainting, and deconvolution
problems, and combinations thereof, are considered as examples. Inverse
problems are solved in both the analysis and synthesis settings, with a number
of different sampling schemes. The most effective approach is that with the
most restricted solution-space, which depends on the interplay between the
adopted sampling scheme, the selection of the analysis/synthesis problem, and
any weighting of the l1 norm appearing in the regularisation problem. More
efficient sampling schemes on the sphere improve reconstruction fidelity by
restricting the solution-space and also by improving sparsity in wavelet space.
We apply the technique to denoise Planck 353 GHz observations, improving the
ability to extract the structure of Galactic dust emission, which is important
for studying Galactic magnetism.Comment: 11 pages, 6 Figure
Signal Flow Graph Approach to Efficient DST I-IV Algorithms
In this paper, fast and efficient discrete sine transformation (DST)
algorithms are presented based on the factorization of sparse, scaled
orthogonal, rotation, rotation-reflection, and butterfly matrices. These
algorithms are completely recursive and solely based on DST I-IV. The presented
algorithms have low arithmetic cost compared to the known fast DST algorithms.
Furthermore, the language of signal flow graph representation of digital
structures is used to describe these efficient and recursive DST algorithms
having points signal flow graph for DST-I and points signal flow
graphs for DST II-IV
- …