Scale-discretised ridgelet transform on the sphere

We revisit the spherical Radon transform, also called the Funk-Radon transform, viewing it as an axisymmetric convolution on the sphere. Viewing the spherical Radon transform in this manner leads to a straightforward derivation of its spherical harmonic representation, from which we show the spherical Radon transform can be inverted exactly for signals exhibiting antipodal symmetry. We then construct a spherical ridgelet transform by composing the spherical Radon and scale-discretised wavelet transforms on the sphere. The resulting spherical ridgelet transform also admits exact inversion for antipodal signals. The restriction to antipodal signals is expected since the spherical Radon and ridgelet transforms themselves result in signals that exhibit antipodal symmetry. Our ridgelet transform is defined natively on the sphere, probes signal content globally along great circles, does not exhibit blocking artefacts, supports spin signals and exhibits an exact and explicit inverse transform. No alternative ridgelet construction on the sphere satisfies all of these properties. Our implementation of the spherical Radon and ridgelet transforms is made publicly available. Finally, we illustrate the effectiveness of spherical ridgelets for diffusion magnetic resonance imaging of white matter fibers in the brain.Comment: 5 pages, 4 figures, matches version accepted by EUSIPCO, code available at http://www.s2let.or

Quantum Ridgelet Transform: Winning Lottery Ticket of Neural Networks with Quantum Computation

A significant challenge in the field of quantum machine learning (QML) is to establish applications of quantum computation to accelerate common tasks in machine learning such as those for neural networks. Ridgelet transform has been a fundamental mathematical tool in the theoretical studies of neural networks, but the practical applicability of ridgelet transform to conducting learning tasks was limited since its numerical implementation by conventional classical computation requires an exponential runtime $\exp(O(D))$ as data dimension $D$ increases. To address this problem, we develop a quantum ridgelet transform (QRT), which implements the ridgelet transform of a quantum state within a linear runtime $O(D)$ of quantum computation. As an application, we also show that one can use QRT as a fundamental subroutine for QML to efficiently find a sparse trainable subnetwork of large shallow wide neural networks without conducting large-scale optimization of the original network. This application discovers an efficient way in this regime to demonstrate the lottery ticket hypothesis on finding such a sparse trainable neural network. These results open an avenue of QML for accelerating learning tasks with commonly used classical neural networks.Comment: 27 pages, 4 figure

Curvelet and Ridgelet-based Multimodal Biometric Recognition System using Weighted Similarity Approach

Biometric security artifacts for establishing the identity of a person with high confidence have evoked enormous interest in security and access control applications for the past few years. Biometric systems based solely on unimodal biometrics often suffer from problems such as noise, intra-class variations and spoof attacks. This paper presents a novel multimodal biometric recognition system by integrating three biometric traits namely iris, fingerprint and face using weighted similarity approach. In this work, the multi-resolution features are extracted independently from query images using curvelet and ridgelet transforms, and are then compared to the enrolled templates stored in the database containing features of each biometric trait. The final decision is made by normalizing the feature vectors, assigning different weights to the modalities and fusing the computed scores using score combination techniques. This system is tested with the public unimodal databases such as CASIA–Iris-V3-Interval, FVC2004, ORL and self-built multimodal databases. Experimental results obtained shows that the designed system achieves an excellent recognition rate of 98.75 per cent and 100 per cent for the public and self-built databases respectively and provides ultra high security than unimodal biometric systems.Defence Science Journal, 2014, 64(2), pp. 106-114. DOI: http://dx.doi.org/10.14429/dsj.64.346

A discrete approach to monogenic analysis through Radon transform

8 pagesInternational audienceMonogenic analysis is gaining interest in the image processing community as a true signal processing tool for 2D signals. Unfortunately, it is only defined in the continuous case. We address this issue by proposing an innovative scheme that uses a discrete Radon transform based on discrete geometry. Radon domain signal processing and monogenic analysis is studied and performance is shown to be equivalent to the usual FFT-based algorithms. The advantage is that extensions to filterbanks and to higher dimensions are facilitated, thanks to the perfect invertibility and computational simplicity of the used Radon algorithm

Distance function wavelets - Part I: Helmholtz and convection-diffusion transforms and series

This report aims to present my research updates on distance function wavelets (DFW) based on the fundamental solutions and the general solutions of the Helmholtz, modified Helmholtz, and convection-diffusion equations, which include the isotropic Helmholtz-Fourier (HF) transform and series, the Helmholtz-Laplace (HL) transform, and the anisotropic convection-diffusion wavelets and ridgelets. The latter is set to handle discontinuous and track data problems. The edge effect of the HF series is addressed. Alternative existence conditions for the DFW transforms are proposed and discussed. To simplify and streamline the expression of the HF and HL transforms, a new dimension-dependent function notation is introduced. The HF series is also used to evaluate the analytical solutions of linear diffusion problems of arbitrary dimensionality and geometry. The weakness of this report is lacking of rigorous mathematical analysis due to the author's limited mathematical knowledge.Comment: Welcome any comments to [email protected]

Joint Group Invariant Functions on Data-Parameter Domain Induce Universal Neural Networks

The symmetry and geometry of input data are considered to be encoded in the internal data representation inside the neural network, but the specific encoding rule has been less investigated. In this study, we present a systematic method to induce a generalized neural network and its right inverse operator, called the ridgelet transform, from a joint group invariant function on the data-parameter domain. Since the ridgelet transform is an inverse, (1) it can describe the arrangement of parameters for the network to represent a target function, which is understood as the encoding rule, and (2) it implies the universality of the network. Based on the group representation theory, we present a new simple proof of the universality by using Schur's lemma in a unified manner covering a wide class of networks, for example, the original ridgelet transform, formal deep networks, and the dual voice transform. Since traditional universality theorems were demonstrated based on functional analysis, this study sheds light on the group theoretic aspect of the approximation theory, connecting geometric deep learning to abstract harmonic analysis.Comment: NeurReps 202

Directional edge and texture representations for image processing

An efficient representation for natural images is of fundamental importance in image processing and analysis. The commonly used separable transforms such as wavelets axe not best suited for images due to their inability to exploit directional regularities such as edges and oriented textural patterns; while most of the recently proposed directional schemes cannot represent these two types of features in a unified transform. This thesis focuses on the development of directional representations for images which can capture both edges and textures in a multiresolution manner. The thesis first considers the problem of extracting linear features with the multiresolution Fourier transform (MFT). Based on a previous MFT-based linear feature model, the work extends the extraction method into the situation when the image is corrupted by noise. The problem is tackled by the combination of a "Signal+Noise" frequency model, a refinement stage and a robust classification scheme. As a result, the MFT is able to perform linear feature analysis on noisy images on which previous methods failed. A new set of transforms called the multiscale polar cosine transforms (MPCT) are also proposed in order to represent textures. The MPCT can be regarded as real-valued MFT with similar basis functions of oriented sinusoids. It is shown that the transform can represent textural patches more efficiently than the conventional Fourier basis. With a directional best cosine basis, the MPCT packet (MPCPT) is shown to be an efficient representation for edges and textures, despite its high computational burden. The problem of representing edges and textures in a fixed transform with less complexity is then considered. This is achieved by applying a Gaussian frequency filter, which matches the disperson of the magnitude spectrum, on the local MFT coefficients. This is particularly effective in denoising natural images, due to its ability to preserve both types of feature. Further improvements can be made by employing the information given by the linear feature extraction process in the filter's configuration. The denoising results compare favourably against other state-of-the-art directional representations

Gravimetric evidences of active faults and underground structure of the Cheliff seismogenic basin (Algeria)

International audienceThe Cheliff basin (ex El Asnam) is known as one of the most seismic active zone in Algeria and the West Mediterranean region. We can cite the El Asnam earthquake which occurred in 10.10.01980 with magnitude of 7.3. It was generated by a thrust fault with NE–SW sinistral component. Until now, there is a little information about existence of deep active faults, which generate this strong activity. The gravity field is an important resource of information on crustal structure. The aim of this work is giving a reliable geometry of the major faults relative to the kinematics of this region.The results obtained from various filtered maps (derivatives, upward continuation) of the gravity data, were used to generate a structural map of the studied area. Whilst the continuous wavelet transform method can help in automatic detection of elongated structures in 3-D, to estimate their strike direction, shape and depth. It gives a 3-D image or a model of the region and confirms the existence of several faults, localized or inferred, from former geological studies

Fast Fourier Transform at Nonequispaced Nodes and Applications

The direct computation of the discrete Fourier transform at arbitrary nodes requires O(NM) arithmetical operations, too much for practical purposes. For equally spaced nodes the computation can be done by the well known fast Fourier transform (FFT) in only O(N log N) arithmetical operations. Recently, the fast Fourier transform for nonequispaced nodes (NFFT) was developed for the fast approximative computation of the above sums in only O(N log N + M log 1/e), where e denotes the required accuracy. The principal topics of this thesis are generalizations and applications of the NFFT. This includes the following subjects: - Algorithms for the fast approximative computation of the discrete cosine and sine transform at nonequispaced nodes are developed by applying fast trigonometric transforms instead of FFTs. - An algorithm for the fast Fourier transform on hyperbolic cross points with nonequispaced spatial nodes in 2 and 3 dimensions based on the NFFT and an appropriate partitioning of the hyperbolic cross is proposed. - A unified linear algebraic approach to recent methods for the fast computation of matrix-vector-products with special dense matrices, namely the fast multipole method, fast mosaic-skeleton approximation and H-matrix arithmetic, is given. Moreover, the NFFT-based summation algorithm by Potts and Steidl is further developed and simplified by using algebraic polynomials instead of trigonometric polynomials and the error estimates are improved. - A new algorithm for the characterization of engineering surface topographies with line singularities is proposed. It is based on hard thresholding complex ridgelet coefficients combined with total variation minimization. The discrete ridgelet transform is designed by first using a discrete Radon transform based on the NFFT and then applying a dual-tree complex wavelet transform. - A new robust local scattered data approximation method is introduced. It is an advancement of the moving least squares approximation (MLS) and generalizes an approach of van den Boomgard and van de Weijer to scattered data. In particular, the new method is space and data adaptive