Multiresolution Fourier transform
Multiresolution Fourier Transform is an integral fourier transform that represents a specific wavelet-like transform with a fully scalable modulated window, but not all possible translations.[1]
Comparison of Fourier transform and wavelet transform
The Fourier transform is one of the most common approaches when it comes to digital signal processing and signal analysis. It represents a signal through sine and cosine functions thus[further explanation needed] transforming the time-domain into frequency-domain. A disadvantage of the Fourier transform is that both sine and cosine function are defined in the whole time plane, meaning that there is no time resolution. Certain variants of Fourier transform, such as Short Time Fourier Transform (STFT) utilize a window for sampling, but the window length is fixed meaning that the results will be satisfactory only for either low or high frequency components. Fast fourier transform (FFT) is used often because of its computational speed, but shows better results for stationary signals.[1]
On the other hand, the wavelet transform can improve all the aforementioned downsides. It preserves both time and frequency information and it uses a window of variable length, meaning that both low and high frequency components will be derived with higher accuracy than the Fourier transform[citation needed]. The wavelet transform also shows better results in transient states[citation needed]. Multiresolution Fourier Transform leverages the advantageous properties of the wavelet transform and uses them for Fourier transform.[1]
Definition
Let [math]\displaystyle{ f(t) }[/math] be a function that has its Fourier transform defined as
- [math]\displaystyle{ F(\omega)=\int_{-\infty}^{\infty} f(t) \cos (\omega t) d t-j \int_{-\infty}^{\infty} f(t) \sin (\omega t) d t }[/math]
The time line can be split by intervals of length π/ω with centers at integer multiples of π/ω
- [math]\displaystyle{ I_{n}=I_{n}(\omega)=\left[\frac{(2 n-1) \pi}{2 \omega}, \frac{(2 n+1) \pi}{2 \omega}\right), n=0, \pm 1, \pm 2, \ldots }[/math]
Then, new transforms of function [math]\displaystyle{ f(t) }[/math] can be introduced
- [math]\displaystyle{ F_{\Psi}\left(\omega, b_{n}\right)=\int_{-\infty}^{\infty} f(t) \Psi_{\omega, b_{n}} d t }[/math]
- [math]\displaystyle{ F_{\Psi}(0,0)=\int_{-\infty}^{\infty} f(t) d t }[/math]
and
- [math]\displaystyle{ F_{\varphi}\left(\omega, b_{n}\right)=\int_{-\infty}^{\infty} f(t) \varphi_{\omega, b_{n}} d t }[/math]
- [math]\displaystyle{ F_{\varphi}(0,0)=0 }[/math]
where [math]\displaystyle{ b_{n}=b_{n}(\omega)=\frac{\pi}{\omega} n }[/math], when n is an integer.
Functions [math]\displaystyle{ F_{\Psi} }[/math] and [math]\displaystyle{ F_{\varphi} }[/math] can be used in order to define the complex Fourier transform
- [math]\displaystyle{ F(\omega)=\sum_{n=-\infty}^{\infty}(-1)^{n} F_{\Psi}\left(\omega, b_{n}\right)-\sum_{n=-\infty}^{\infty}(-1)^{n} F_{\varphi}\left(\omega, b_{n}\right) }[/math]
Then, set of points in the frequency-time plane is defined for the computation of the introduced transforms
- [math]\displaystyle{ B=\left\{\left(\omega, b_{n}\right) ; \omega \in(-\infty, \infty), b_{n}=n \frac{\pi}{\omega}, n=0, \pm 1, \pm 2, \ldots, \pm \mathrm{N}(\omega)\right\} }[/math]
where [math]\displaystyle{ N(0)=0 }[/math], and [math]\displaystyle{ N(\omega) }[/math] is the infinite in general, or a finite number if the function [math]\displaystyle{ f(t) }[/math] has a finite support. The defined representation of [math]\displaystyle{ f(t) }[/math] with the functions [math]\displaystyle{ F_{\Psi} }[/math] and [math]\displaystyle{ F_{\varphi} }[/math] is called the B-wavelet transform, and is used to define the integral Fourier transform.
The cosine and sine B-wavelet transforms are:
- [math]\displaystyle{ f(t) \rightarrow\left\{F_{\psi}\left(\omega, b_{n}\right),\left(\omega, b_{n}\right) \in B\right\} }[/math]
- [math]\displaystyle{ f(t) \rightarrow\left\{F_{\varphi}\left(\omega, b_{n}\right),\left(\omega, b_{n}\right) \in B\right\} }[/math]
B-wavelet doesn't need to be calculated across the whole range of frequency-time points, but only in the points of set B. The integral Fourier transform can then be defined from B-wavelet transform using.[1]
Now Fourier transform can be represented via two integral wavelet transforms sampled by only translation parameter:
- [math]\displaystyle{ T_{\Psi}(\omega, \mathrm{b})=\int_{-\infty}^{\infty} f(t) \Psi_{\omega, \mathrm{b}} d t }[/math]
- [math]\displaystyle{ T_{\varphi}(\omega, \mathrm{b})=\int_{-\infty}^{\infty} f(t) \varphi_{\omega, \mathrm{b}} d t }[/math]
Applications
Multiresolution Fourier Transform is applied in fields such as image and audio signal analysis,[2] curve and corner extraction,[3] and edge detection.[4]
See also
References
- ↑ 1.0 1.1 1.2 1.3 Grigoryan, A. M. (2005). "Multiresolution of the Fourier Transform". Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005. 4. pp. 577–580. doi:10.1109/ICASSP.2005.1416074. ISBN 0-7803-8874-7.
- ↑ Wilson, R. (March 1992). "A generalized wavelet transform for Fourier analysis: the multiresolution Fourier transform and its application to image and audio signal analysis". IEEE Transactions on Information Theory 38 (2): 674–690. doi:10.1109/18.119730.
- ↑ Davies, A. R. (1992). "Curve and corner extraction using the multiresolution Fourier transform". International Conference on Image Processing and Its Applications: 282–285.
- ↑ Li, Chang-Tsun (1999). "Edge detection based on the multiresolution Fourier transform". 1999 IEEE Workshop on Signal Processing Systems. SiPS 99. Design and Implementation (Cat. No.99TH8461). pp. 686–693. doi:10.1109/SIPS.1999.822376. ISBN 0-7803-5650-0.
 |  |
