Fourier–Bessel series

This article includes a list of general references, but it lacks sufficient corresponding inline citations. Please help to improve this article by introducing more precise citations. (February 2014) (Learn how and when to remove this message)

In mathematics, Fourier–Bessel series is a particular kind of generalized Fourier series (an infinite series expansion on a finite interval) based on Bessel functions.

Fourier–Bessel series are used in the solution to partial differential equations, particularly in cylindrical coordinate systems.

The Fourier–Bessel series of a function f(x) with a domain of [0, b] satisfying f(b) = 0

$${\displaystyle f:[0,b]\to \mathbb {R} }$$ is the representation of that function as a linear combination of many orthogonal versions of the same Bessel function of the first kind J_α, where the argument to each version n is differently scaled, according to ^[1][2] $${\displaystyle (J_{\alpha })_{n}(x):=J_{\alpha }\left({\frac {u_{\alpha ,n}}{b}}x\right)}$$ where u_α,n is a root, numbered n associated with the Bessel function J_α and c_n are the assigned coefficients:^[3] $${\displaystyle f(x)\sim \sum _{n=1}^{\infty }c_{n}J_{\alpha }\left({\frac {u_{\alpha ,n}}{b}}x\right).}$$

The Fourier–Bessel series may be thought of as a Fourier expansion in the ρ coordinate of cylindrical coordinates. Just as the Fourier series is defined for a finite interval and has a counterpart, the continuous Fourier transform over an infinite interval, so the Fourier–Bessel series has a counterpart over an infinite interval, namely the Hankel transform.

As said, differently scaled Bessel Functions are orthogonal with respect to the inner product

$${\displaystyle \langle f,g\rangle =\int _{0}^{b}xf(x)g(x)\,dx}$$

according to

$${\displaystyle \int _{0}^{b}xJ_{\alpha }\left({\frac {xu_{\alpha ,n}}{b}}\right)\,J_{\alpha }\left({\frac {xu_{\alpha ,m}}{b}}\right)\,dx={\frac {b^{2}}{2}}\delta _{mn}[J_{\alpha +1}(u_{\alpha ,n})]^{2},}$$

(where: ${\displaystyle \delta _{mn}}$ is the Kronecker delta). The coefficients can be obtained from projecting the function f(x) onto the respective Bessel functions:

$${\displaystyle c_{n}={\frac {\langle f,(J_{\alpha })_{n}\rangle }{\langle (J_{\alpha })_{n},(J_{\alpha })_{n}\rangle }}={\frac {\int _{0}^{b}xf(x)(J_{\alpha })_{n}(x)\,dx}{{\frac {1}{2}}(bJ_{\alpha \pm 1}(u_{\alpha ,n}))^{2}}}}$$

where the plus or minus sign is equally valid.

For the inverse transform, one makes use of the following representation of the Dirac delta function^[4]

$${\displaystyle {\frac {2x^{\alpha }y^{1-\alpha }}{b^{2}}}\sum _{k=1}^{\infty }{\frac {J_{\alpha }\left({\frac {xu_{\alpha ,k}}{b}}\right)\,J_{\alpha }\left({\frac {yu_{\alpha ,k}}{b}}\right)}{J_{\alpha +1}^{2}(u_{\alpha ,k})}}=\delta (x-y).}$$

Fourier–Bessel series coefficients are unique for a given signal, and there is one-to-one mapping between continuous frequency (${\displaystyle F_{n}}$) and order index ${\displaystyle (n)}$ which can be expressed as follows:

$${\displaystyle u_{n}={\frac {2\pi F_{n}L}{F_{s}}}}$$

Since, ${\displaystyle u_{n}=u_{n-1}+\pi \approx n\pi }$. So above equation can be rewritten as follows:

$${\displaystyle F_{n}={\frac {F_{s}n}{2L}}}$$

where ${\displaystyle L}$ is the length of the signal and ${\displaystyle F_{s}}$ is the sampling frequency of the signal.

For an image ${\displaystyle f(x,y)}$ of size M×N, the synthesis equations for order-0 2D-Fourier–Bessel series expansion is as follows:

$${\displaystyle f(x,y)=\sum _{m=1}^{M}\sum _{n=1}^{N}F(m,n)J_{0}{\bigg (}{\frac {u_{0,n}y}{N}}{\bigg )}J_{0}{\bigg (}{\frac {u_{0,m}x}{M}}{\bigg )}}$$

Where ${\displaystyle F(m,n)}$ is 2D-Fourier–Bessel series expansion coefficients whose mathematical expressions are as follows:

$${\displaystyle F(m,n)={\frac {4}{\alpha _{1}}}\sum _{x=0}^{M-1}\sum _{y=0}^{N-1}xyf(x,y)J_{0}{\bigg (}{\frac {u_{0,n}y}{N}}{\bigg )}J_{0}{\bigg (}{\frac {u_{0,m}x}{M}}{\bigg )}}$$

where, ${\displaystyle \alpha _{1}=(NM)^{2}(J_{1}(u_{0,m})J_{1}(u_{0,n}))^{2}}$

For a signal of length ${\displaystyle b}$, Fourier-Bessel based spectral entropy such as Shannon spectral entropy (${\displaystyle H_{\text{SSE}}}$), log energy entropy (${\displaystyle H_{\text{LLE}}}$), and Wiener entropy (${\displaystyle H_{\text{WE}}}$) are defined as follows:

$${\displaystyle H_{\text{SSE}}=-\sum _{n=1}^{b}P(n)~{\text{log}}_{2}\left(P(n)\right)}$$ $${\displaystyle H_{\text{WE}}=b{\frac {\sqrt {\displaystyle \prod _{n=1}^{b}E_{n}}}{\displaystyle \sum _{n=1}^{b}E_{n}}}}$$ $${\displaystyle H_{\text{LE}}=-\sum _{n=1}^{b}~{\text{log}}_{2}\left(P(n)\right)}$$

where ${\displaystyle P_{n}}$ is the normalized energy distribution which is mathematically defined as follows:

$${\displaystyle P(n)={\frac {E_{n}}{\displaystyle \sum _{n=1}^{b}E_{n}}}}$$

${\displaystyle E_{n}}$ is energy spectrum which is mathematically defined as follows:

$${\displaystyle E_{n}={\frac {c_{n}^{2}b^{2}[J_{1}(u_{1,n})]^{2}}{2}}}$$

The Empirical wavelet transform (EWT) is a multi-scale signal processing approach for the decomposition of multi-component signal into intrinsic mode functions (IMFs).^[5] The EWT is based on the design of empirical wavelet based filter bank based on the segregation of Fourier spectrum of the multi-component signals. The segregation of Fourier spectrum of multi-component signal is performed using the detection of peaks and then the evaluation of boundary points.^[5] For non-stationary signals, the Fourier Bessel Series Expansion (FBSE) is the natural choice as it uses Bessel function as basis for analysis and synthesis of the signal. The FBSE spectrum has produced the number of frequency bins same as the length of the signal in the frequency range [0, ${\displaystyle {\frac {F_{s}}{2}}}$]. Therefore, in FBSE-EWT, the boundary points are detected using the FBSE based spectrum of the non-stationary signal. Once, the boundary points are obtained, the empirical wavelet based filter-bank is designed in the Fourier domain of the multi-component signal to evaluate IMFs. The FBSE based method used in FBSE-EWT has produced higher number of boundary points as compared to FFT part in EWT based method. The features extracted from the IMFs of EEG and ECG signals obtained using FBSE-EWT based approach have shown better performance for the automated detection of Neurological and cardiac ailments.

For a discrete time signal, x(n), the FBSE domain discrete Stockwell transform (FBSE-DST) is evaluated as follows:$${\displaystyle T(n,l)=\sum _{m=1}^{L}Y{\Big (}m+l{\Big )}g(m,l)J_{0}{\Big (}{\frac {\lambda _{l}}{N}}n{\Big )}}$$where Y(l) are the FBSE coefficients and these coefficients are calculated using the following expression as

$${\displaystyle Y(l)={\frac {2}{N^{2}[J_{1}(\lambda _{l})]^{2}}}\sum _{n=0}^{N-1}nx(n)J_{0}{\Big (}{\frac {\lambda _{l}}{N}}n{\Big )}}$$

The ${\displaystyle \lambda _{l}}$ is termed as the ${\displaystyle l^{th}}$ root of the Bessel function, and it is evaluated in an iterative manner based on the solution of ${\displaystyle J_{0}(\lambda _{l})=0}$ using the Newton-Raphson method. Similarly, the g(m,l) is the FBSE domain Gaussian window and it is given as follows :

$${\displaystyle g(m,l)={\text{e}}^{-{\frac {2\pi ^{2}\lambda _{m}^{2}}{\lambda _{l}^{2}}}},~{\{l,m=1,2,...L}\}}$$

For multicomponent amplitude and frequency modulated (AM-FM) signals, the discrete energy separation algorithm (DESA) together with the Gabor's filtering is a traditional approach to estimate the amplitude envelope (AE) and the instantaneous frequency (IF) functions.^[6] It has been observed that the filtering operation distorts the amplitude and phase modulations in the separated monocomponent signals.

The Fourier–Bessel series expansion does not require use of window function in order to obtain spectrum of the signal. It represents real signal in terms of real Bessel basis functions. It provides representation of real signals it terms of positive frequencies. The basis functions used are aperiodic in nature and converge. The basis functions include amplitude modulation in the representation. The Fourier–Bessel series expansion spectrum provides frequency points equal to the signal length.

The Fourier–Bessel series expansion employs aperiodic and decaying Bessel functions as the basis. The Fourier–Bessel series expansion has been successfully applied in diversified areas such as Gear fault diagnosis,^[7] discrimination of odorants in a turbulent ambient,^[8] postural stability analysis, detection of voice onset time, glottal closure instants (epoch) detection, separation of speech formants, speech enhancement,^[9] and speaker identification.^[10] The Fourier–Bessel series expansion has also been used to reduce cross terms in the Wigner–Ville distribution.

A second Fourier–Bessel series, also known as Dini series, is associated with the Robin boundary condition $${\displaystyle bf'(b)+cf(b)=0,}$$ where ${\displaystyle c}$ is an arbitrary constant. The Dini series can be defined by $${\displaystyle f(x)\sim \sum _{n=1}^{\infty }b_{n}J_{\alpha }(\gamma _{n}x/b),}$$

where ${\displaystyle \gamma _{n}}$ is the n-th zero of ${\displaystyle xJ'_{\alpha }(x)+cJ_{\alpha }(x)}$.

The coefficients ${\displaystyle b_{n}}$ are given by $${\displaystyle b_{n}={\frac {2\gamma _{n}^{2}}{b^{2}(c^{2}+\gamma _{n}^{2}-\alpha ^{2})J_{\alpha }^{2}(\gamma _{n})}}\int _{0}^{b}J_{\alpha }(\gamma _{n}x/b)\,f(x)\,x\,dx.}$$

• Orthogonality
• Generalized Fourier series
• Hankel transform
• Kapteyn series
• Neumann polynomial
• Schlömilch's series

• "Fourier-Bessel series", Encyclopedia of Mathematics, EMS Press, 2001 [1994]
• Weisstein, Eric. W. "Fourier-Bessel Series". From MathWorld--A Wolfram Web Resource.
• Fourier–Bessel series applied to Acoustic Field analysis on Trinnov Audio's research page