Nicolas Le Bihan

NA
h-index7
6papers
257citations
Novelty50%
AI Score30

6 Papers

NAAug 7, 2012
Instantaneous frequency and amplitude of complex signals based on quaternion Fourier transform

Nicolas Le Bihan, Stephen J. Sangwine, Todd A. Ell

The ideas of instantaneous amplitude and phase are well understood for signals with real-valued samples, based on the analytic signal which is a complex signal with one-sided Fourier transform. We extend these ideas to signals with complex-valued samples, using a quaternion-valued equivalent of the analytic signal obtained from a one-sided quaternion Fourier transform which we refer to as the hypercomplex representation of the complex signal. We present the necessary properties of the quaternion Fourier transform, particularly its symmetries in the frequency domain and formulae for convolution and the quaternion Fourier transform of the Hilbert transform. The hypercomplex representation may be interpreted as an ordered pair of complex signals or as a quaternion signal. We discuss its derivation and properties and show that its quaternion Fourier transform is one-sided. It is shown how to derive from the hypercomplex representation a complex envelope and a phase. A classical result in the case of real signals is that an amplitude modulated signal may be analysed into its envelope and carrier using the analytic signal provided that the modulating signal has frequency content not overlapping with that of the carrier. We show that this idea extends to the complex case, provided that the complex signal modulates an orthonormal complex exponential. Orthonormal complex modulation can be represented mathematically by a polar representation of quaternions previously derived by the authors. As in the classical case, there is a restriction of non-overlapping frequency content between the modulating complex signal and the orthonormal complex exponential. We show that, under these conditions, modulation in the time domain is equivalent to a frequency shift in the quaternion Fourier domain. Examples are presented to demonstrate these concepts.

NAJun 24, 2010
The hyperanalytic signal

Nicolas Le Bihan, Stephen J. Sangwine

The concept of the analytic signal is extended from the case of a real signal with a complex analytic signal to a complex signal with a hypercomplex analytic signal (which we call a hyperanalytic signal) The hyperanalytic signal may be interpreted as an ordered pair of complex signals or as a quaternion signal. The hyperanalytic signal contains a complex orthogonal signal and we show how to obtain this by three methods: a pair of classical Hilbert transforms; a complex Fourier transform; and a quaternion Fourier transform. It is shown how to derive from the hyperanalytic signal a complex envelope and phase using a polar quaternion representation previously introduced by the authors. The complex modulation of a real sinusoidal carrier is shown to generalize the modulation properties of the classical analytic signal. The paper extends the ideas of properness to deterministic complex signals using the hyperanalytic signal. A signal example is presented, with its orthogonal signal, and its complex envelope and phase.

MLJan 20, 2025
Beyond R-barycenters: an effective averaging method on Stiefel and Grassmann manifolds

Florent Bouchard, Nils Laurent, Salem Said et al.

In this paper, the issue of averaging data on a manifold is addressed. While the Fréchet mean resulting from Riemannian geometry appears ideal, it is unfortunately not always available and often computationally very expensive. To overcome this, R-barycenters have been proposed and successfully applied to Stiefel and Grassmann manifolds. However, R-barycenters still suffer severe limitations as they rely on iterative algorithms and complicated operators. We propose simpler, yet efficient, barycenters that we call RL-barycenters. We show that, in the setting relevant to most applications, our framework yields astonishingly simple barycenters: arithmetic means projected onto the manifold. We apply this approach to the Stiefel and Grassmann manifolds. On simulated data, our approach is competitive with respect to existing averaging methods, while computationally cheaper.

LGFeb 24, 2021
Two-way kernel matrix puncturing: towards resource-efficient PCA and spectral clustering

Romain Couillet, Florent Chatelain, Nicolas Le Bihan

The article introduces an elementary cost and storage reduction method for spectral clustering and principal component analysis. The method consists in randomly "puncturing" both the data matrix $X\in\mathbb{C}^{p\times n}$ (or $\mathbb{R}^{p\times n}$) and its corresponding kernel (Gram) matrix $K$ through Bernoulli masks: $S\in\{0,1\}^{p\times n}$ for $X$ and $B\in\{0,1\}^{n\times n}$ for $K$. The resulting "two-way punctured" kernel is thus given by $K=\frac{1}{p}[(X \odot S)^{\sf H} (X \odot S)] \odot B$. We demonstrate that, for $X$ composed of independent columns drawn from a Gaussian mixture model, as $n,p\to\infty$ with $p/n\to c_0\in(0,\infty)$, the spectral behavior of $K$ -- its limiting eigenvalue distribution, as well as its isolated eigenvalues and eigenvectors -- is fully tractable and exhibits a series of counter-intuitive phenomena. We notably prove, and empirically confirm on GAN-generated image databases, that it is possible to drastically puncture the data, thereby providing possibly huge computational and storage gains, for a virtually constant (clustering of PCA) performance. This preliminary study opens as such the path towards rethinking, from a large dimensional standpoint, computational and storage costs in elementary machine learning models.

NAMar 24, 2006
Fast complexified quaternion Fourier transform

Salem Said, Nicolas Le Bihan, Stephen J. Sangwine

A discrete complexified quaternion Fourier transform is introduced. This is a generalization of the discrete quaternion Fourier transform to the case where either or both of the signal/image and the transform kernel are complex quaternion-valued. It is shown how to compute the transform using four standard complex Fourier transforms and the properties of the transform are briefly discussed.

NAMar 10, 2006
Quaternion Singular Value Decomposition based on Bidiagonalization to a Real Matrix using Quaternion Householder Transformations

Stephen J. Sangwine, Nicolas Le Bihan

We present a practical and efficient means to compute the singular value decomposition (svd) of a quaternion matrix A based on bidiagonalization of A to a real bidiagonal matrix B using quaternionic Householder transformations. Computation of the svd of B using an existing subroutine library such as lapack provides the singular values of A. The singular vectors of A are obtained trivially from the product of the Householder transformations and the real singular vectors of B. We show in the paper that left and right quaternionic Householder transformations are different because of the noncommutative multiplication of quaternions and we present formulae for computing the Householder vector and matrix in each case.