Stationary wavelet transform

Last updated

The stationary wavelet transform (SWT) [1] is a wavelet transform algorithm designed to overcome the lack of translation-invariance of the discrete wavelet transform (DWT). Translation-invariance is achieved by removing the downsamplers and upsamplers in the DWT and upsampling the filter coefficients by a factor of in the th level of the algorithm. [2] [3] [4] [5] The SWT is an inherently redundant scheme as the output of each level of SWT contains the same number of samples as the input – so for a decomposition of N levels there is a redundancy of N in the wavelet coefficients. This algorithm is more famously known as "algorithme à trous" in French (word trous means holes in English) which refers to inserting zeros in the filters. It was introduced by Holschneider et al. [6]

Contents

Definition

The basic discrete wavelet transform (DWT) algorithm is adapted to yield a stationary wavelet transform (SWT) which is independent of the origin. The approach of the SWT is simple, which is by applying suitable high-pass and low-pass filters to the data at each level, resulting in the generation of two sequences at the subsequent level. Without employment of downsampling techniques, the length of the new sequences is maintained to be the same as the original sequences. Rather than employing decimation similar to the standard wavelet transform which removes elements, the filters at each level are adjusted by augmenting them with zero-padding, as explained in the following: [7]

where is the operator that intersperses a given sequence with zeros, for all integers .

is the binary decimation operator

is a filter with weights

is a filter with weights

The design of the filters and involve of inserting a zero between every adjacent pair of elements in the filter and respectively.

The designation of as the original sequence is required before defining the stationary wavelet transform.

where

Implementation

The following block diagram depicts the digital implementation of SWT.

A 3 level SWT filter bank Wavelets - SWT Filter Bank.png
A 3 level SWT filter bank

In the above diagram, filters in each level are up-sampled versions of the previous (see figure below).

SWT filters Wavelets - SWT Filters.png
SWT filters

Applications

A few applications of SWT are specified below.

Image enhancement

The SWT can be used to perform image resolution enhancement to provide a better image quality. The main drawback from enhancing image resolution through conventional method, interpolation, is the loss of the high frequency components. [8] This results in the smoothing of interpolation, providing a blurry image with the absence or reduced presence of fine details, sharp edges. Information of high frequency components (edges) are crucial for achieving better image quality of super-resolved image.

It first decomposes the input image into various subband images by applying a one-level DWT. There are three subband images to capture the high frequency components of the input image. After that is the implementation of SWT, its purpose is to mitigate the information loss produced by the downsampling in each DWT subband. Fortified and corrected high frequency subbands are formed by summing up the high frequency subbands from DWT and SWT, and as a result, the output image is with sharpen edges.

Signal denoising

The traditional denoising procedure mainly consist of first transforming the signal to another domain, then apply thresholding, and lastly perform inverse transformation to reconstruct the original signal. Stationary wavelet transform is introduced to resolve the Gibbs phenomenon brought by the shifting process in discrete wavelet transform. This phenomenon affects the image quality (noises) after the reconstruction process. The modified procedure is simple, by first perform stationary wavelet transform to the signal, thresholding, and finally transforming back. A brief explanation is shown as following:

Unlike the discrete wavelet transform, SWT does not downsample the signal at each level. Instead, it maintains the original sampling rate throughout the decomposition process, and this ensures the encapsulation of high, low-frequency components in an effective way. As the noise is often spread across all scales, with small contribution in magnitude, thresholding is implemented as the next step to the wavelet coefficients. Coefficients below a certain threshold level are set to zero or reduced, resulting in the separation of the signal from the noise. After removing or suppression of the noise coefficients, which the reconstruction progress does not consider them, the denoised signal is clearer.

Signal denoising is also commonly used in biomedical signal denoising (ECG), [9] image denoising. The effectiveness of SWT in signal denoising makes it a valuable tool in real-world applications in various fields.

Code Example

Here is an example of applying the stationary wavelet transform to the chirp signal, coded with python3:

  1. Install required packages to python
    pipinstallnumpypipinstallmatplotlibpipinstallpywt
  2. Import libraries in python
    importnumpyasnpimportmatplotlib.pyplotaspltimportpywt
  3. Main code
    # Generating a chirp signalt=np.linspace(0,1,1000,endpoint=False)frequency=10+20*tchirp_signal=np.sin(2*np.pi*frequency*t)# Perform Stationary Wavelet Transform (SWT)wavelet='db1'# Daubechies waveletlevel=3# Decomposition levelcoeffs=pywt.swt(chirp_signal,wavelet,level)# Coefficients# Plot the original chirp signalplt.figure(figsize=(12,6))plt.subplot(level+2,1,1)plt.plot(t,chirp_signal)plt.title('Original Chirp Signal')plt.legend()# Plot the SWT Coefficientsforiinrange(level):plt.subplot(level+2,1,i+2)plt.plot(t,coeffs[i][0])plt.plot(t,coeffs[i][1])plt.title(f'SWT Coefficients - Level {i}')plt.tight_layout()plt.show()
  4. Output
    Plot of the code output.png

Synonyms

See also

Related Research Articles

Digital signal processing (DSP) is the use of digital processing, such as by computers or more specialized digital signal processors, to perform a wide variety of signal processing operations. The digital signals processed in this manner are a sequence of numbers that represent samples of a continuous variable in a domain such as time, space, or frequency. In digital electronics, a digital signal is represented as a pulse train, which is typically generated by the switching of a transistor.

<span class="mw-page-title-main">Wavelet</span> Function for integral Fourier-like transform

A wavelet is a wave-like oscillation with an amplitude that begins at zero, increases or decreases, and then returns to zero one or more times. Wavelets are termed a "brief oscillation". A taxonomy of wavelets has been established, based on the number and direction of its pulses. Wavelets are imbued with specific properties that make them useful for signal processing.

In digital signal processing, a quadrature mirror filter is a filter whose magnitude response is the mirror image around of that of another filter. Together these filters, first introduced by Croisier et al., are known as the quadrature mirror filter pair.

<span class="mw-page-title-main">Daubechies wavelet</span> Orthogonal wavelets

The Daubechies wavelets, based on the work of Ingrid Daubechies, are a family of orthogonal wavelets defining a discrete wavelet transform and characterized by a maximal number of vanishing moments for some given support. With each wavelet type of this class, there is a scaling function which generates an orthogonal multiresolution analysis.

<span class="mw-page-title-main">Discrete wavelet transform</span> Transform in numerical harmonic analysis

In numerical analysis and functional analysis, a discrete wavelet transform (DWT) is any wavelet transform for which the wavelets are discretely sampled. As with other wavelet transforms, a key advantage it has over Fourier transforms is temporal resolution: it captures both frequency and location information.

<span class="mw-page-title-main">Filter bank</span> Tool for Digital Signal Processing

In signal processing, a filter bank is an array of bandpass filters that separates the input signal into multiple components, each one carrying a sub-band of the original signal. One application of a filter bank is a graphic equalizer, which can attenuate the components differently and recombine them into a modified version of the original signal. The process of decomposition performed by the filter bank is called analysis ; the output of analysis is referred to as a subband signal with as many subbands as there are filters in the filter bank. The reconstruction process is called synthesis, meaning reconstitution of a complete signal resulting from the filtering process.

The fast wavelet transform is a mathematical algorithm designed to turn a waveform or signal in the time domain into a sequence of coefficients based on an orthogonal basis of small finite waves, or wavelets. The transform can be easily extended to multidimensional signals, such as images, where the time domain is replaced with the space domain. This algorithm was introduced in 1989 by Stéphane Mallat.

A multiresolution analysis (MRA) or multiscale approximation (MSA) is the design method of most of the practically relevant discrete wavelet transforms (DWT) and the justification for the algorithm of the fast wavelet transform (FWT). It was introduced in this context in 1988/89 by Stephane Mallat and Yves Meyer and has predecessors in the microlocal analysis in the theory of differential equations and the pyramid methods of image processing as introduced in 1981/83 by Peter J. Burt, Edward H. Adelson and James L. Crowley.

In signal processing, the second-generation wavelet transform (SGWT) is a wavelet transform where the filters are not designed explicitly, but the transform consists of the application of the Lifting scheme. Actually, the sequence of lifting steps could be converted to a regular discrete wavelet transform, but this is unnecessary because both design and application is made via the lifting scheme. This means that they are not designed in the frequency domain, as they are usually in the classical transforms such as the DWT and CWT). The idea of moving away from the Fourier domain was introduced independently by David Donoho and Harten in the early 1990s.

Originally known as optimal subband tree structuring (SB-TS), also called wavelet packet decomposition, is a wavelet transform where the discrete-time (sampled) signal is passed through more filters than the discrete wavelet transform (DWT).

The complex wavelet transform (CWT) is a complex-valued extension to the standard discrete wavelet transform (DWT). It is a two-dimensional wavelet transform which provides multiresolution, sparse representation, and useful characterization of the structure of an image. Further, it purveys a high degree of shift-invariance in its magnitude, which was investigated in. However, a drawback to this transform is that it exhibits redundancy compared to a separable (DWT).

<span class="mw-page-title-main">Wavelet transform</span> Mathematical technique used in data compression and analysis

In mathematics, a wavelet series is a representation of a square-integrable function by a certain orthonormal series generated by a wavelet. This article provides a formal, mathematical definition of an orthonormal wavelet and of the integral wavelet transform.

<span class="mw-page-title-main">Lifting scheme</span> Technique for wavelet analysis

The lifting scheme is a technique for both designing wavelets and performing the discrete wavelet transform (DWT). In an implementation, it is often worthwhile to merge these steps and design the wavelet filters while performing the wavelet transform. This is then called the second-generation wavelet transform. The technique was introduced by Wim Sweldens.

In mathematics, Fourier–Bessel series is a particular kind of generalized Fourier series based on Bessel functions.

Ali Naci Akansu is a Turkish-American professor of electrical & computer engineering and scientist in applied mathematics.

Contourlets form a multiresolution directional tight frame designed to efficiently approximate images made of smooth regions separated by smooth boundaries. The contourlet transform has a fast implementation based on a Laplacian pyramid decomposition followed by directional filterbanks applied on each bandpass subband.

In signal processing it is useful to simultaneously analyze the space and frequency characteristics of a signal. While the Fourier transform gives the frequency information of the signal, it is not localized. This means that we cannot determine which part of a signal produced a particular frequency. It is possible to use a short time Fourier transform for this purpose, however the short time Fourier transform limits the basis functions to be sinusoidal. To provide a more flexible space-frequency signal decomposition several filters have been proposed. The Log-Gabor filter is one such filter that is an improvement upon the original Gabor filter. The advantage of this filter over the many alternatives is that it better fits the statistics of natural images compared with Gabor filters and other wavelet filters.

This article provides a short survey of the concepts, principles and applications of Multirate Filter Banks and Multidimensional Directional Filter Banks.

Wavelets are often used to analyse piece-wise smooth signals. Wavelet coefficients can efficiently represent a signal which has led to data compression algorithms using wavelets. Wavelet analysis is extended for multidimensional signal processing as well. This article introduces a few methods for wavelet synthesis and analysis for multidimensional signals. There also occur challenges such as directivity in multidimensional case.

References

  1. James E. Fowler: The Redundant Discrete Wavelet Transform and Additive Noise, contains an overview of different names for this transform.
  2. A.N. Akansu and Y. Liu, On Signal Decomposition Techniques, Optical Engineering, pp. 912-920, July 1991.
  3. M.J. Shensa, The Discrete Wavelet Transform: Wedding the A Trous and Mallat Algorithms, IEEE Transactions on Signal Processing, Vol 40, No 10, Oct. 1992.
  4. M.V. Tazebay and A.N. Akansu, Progressive Optimality in Hierarchical Filter Banks, Proc. IEEE International Conference on Image Processing (ICIP), Vol 1, pp. 825-829, Nov. 1994.
  5. M.V. Tazebay and A.N. Akansu, Adaptive Subband Transforms in Time-Frequency Excisers for DSSS Communications Systems, IEEE Transactions on Signal Processing, Vol 43, No 11, pp. 2776-2782, Nov. 1995.
  6. M. Holschneider, R. Kronland-Martinet, J. Morlet and P. Tchamitchian. A real-time algorithm for signal analysis with the help of the wavelet transform. In Wavelets, Time-Frequency Methods and Phase Space, pp. 289–297. Springer-Verlag, 1989.
  7. Nason, G. P.; Silverman, B. W. (1995), "The Stationary Wavelet Transform and some Statistical Applications", Wavelets and Statistics, New York, NY: Springer New York, pp. 281–299, doi:10.1007/978-1-4612-2544-7_17, ISBN   978-0-387-94564-4 , retrieved 2023-12-26
  8. Demirel, H.; Anbarjafari, G. (2011). "IMAGE Resolution Enhancement by Using Discrete and Stationary Wavelet Decomposition". IEEE Transactions on Image Processing. 20 (5): 1458–1460. Bibcode:2011ITIP...20.1458D. doi:10.1109/TIP.2010.2087767. PMID   20959267 . Retrieved 2023-12-26.
  9. Kumar, Ashish; Tomar, Harshit; Mehla, Virender Kumar; Komaragiri, Rama; Kumar, Manjeet (2021-08-01). "Stationary wavelet transform based ECG signal denoising method". ISA Transactions. 114: 251–262. doi:10.1016/j.isatra.2020.12.029. ISSN   0019-0578. PMID   33419569. S2CID   230588417.
  10. Zhang, Y. (2010). "Feature Extraction of Brain MRI by Stationary Wavelet Transform and its Applications". Journal of Biological Systems. 18 (s1): 115–132. doi:10.1142/S0218339010003652.
  11. Dong, Z. (2015). "Magnetic Resonance Brain Image Classification via Stationary Wavelet Transform and Generalized Eigenvalue Proximal Support Vector Machine". Journal of Medical Imaging and Health Informatics. 5 (7): 1395–1403. doi:10.1166/jmihi.2015.1542.