Symmetric Discrete Orthonormal Stockwell Transform

Similar documents
On the Use of the Stockwell Transform for Image Compression

FAST DISCRETE ORTHONORMAL STOCKWELL TRANSFORM

THE GENERALIZATION OF DISCRETE STOCKWELL TRANSFORMS

A basis for efficient representation of the S-transform

SEISMIC WAVE PROPAGATION. Lecture 2: Fourier Analysis

Power Supply Quality Analysis Using S-Transform and SVM Classifier

Efficient Stockwell Transform with Applications to Image Processing

Fundamentals of the DFT (fft) Algorithms

Elec4621 Advanced Digital Signal Processing Chapter 11: Time-Frequency Analysis

Lecture Notes 5: Multiresolution Analysis

Sparse linear models

BME 50500: Image and Signal Processing in Biomedicine. Lecture 2: Discrete Fourier Transform CCNY

Multiresolution Analysis

Fourier Transform for Continuous Functions

where =0,, 1, () is the sample at time index and is the imaginary number 1. Then, () is a vector of values at frequency index corresponding to the mag

CS Sampling and Aliasing. Analog vs Digital

Wavelet Transform. Figure 1: Non stationary signal f(t) = sin(100 t 2 ).

An Analysis of Stockwell Transforms, with Applications to Image Processing

Ch. 15 Wavelet-Based Compression

Digital Image Processing

Invariant Scattering Convolution Networks

Introduction to Biomedical Engineering

Time Localised Band Filtering Using Modified S-Transform

L29: Fourier analysis

2D Wavelets. Hints on advanced Concepts

The Efficient Discrete Tchebichef Transform for Spectrum Analysis of Speech Recognition

An Introduction to Wavelets and some Applications

A Machine Intelligence Approach for Classification of Power Quality Disturbances

Lecture 7 January 26, 2016

Introduction to Discrete-Time Wavelet Transform

FILTERING IN THE FREQUENCY DOMAIN

Wavelets and Multiresolution Processing

Digital Image Processing

The Hilbert Transform

Imitating quantum mechanics: Qubit-based model for simulation

Comparative study of different techniques for Time-Frequency Analysis

Which wavelet bases are the best for image denoising?

2.161 Signal Processing: Continuous and Discrete Fall 2008

Correlator I. Basics. Chapter Introduction. 8.2 Digitization Sampling. D. Anish Roshi

Medical Image Processing Using Transforms

Review: Continuous Fourier Transform

Introduction to Wavelet. Based on A. Mukherjee s lecture notes

THE problem of phase noise and its influence on oscillators

Defining the Discrete Wavelet Transform (DWT)

Analysis of Redundant-Wavelet Multihypothesis for Motion Compensation

1 The Continuous Wavelet Transform The continuous wavelet transform (CWT) Discretisation of the CWT... 2

Lecture 4 Filtering in the Frequency Domain. Lin ZHANG, PhD School of Software Engineering Tongji University Spring 2016

ELEG 3124 SYSTEMS AND SIGNALS Ch. 5 Fourier Transform

Scientific Computing: An Introductory Survey

Multiresolution Models of Time Series

COMPLEX WAVELET TRANSFORM IN SIGNAL AND IMAGE ANALYSIS

Digital Image Processing

CONTROL SYSTEMS, ROBOTICS, AND AUTOMATION Vol. VI - System Identification Using Wavelets - Daniel Coca and Stephen A. Billings

L6: Short-time Fourier analysis and synthesis

Statistical Geometry Processing Winter Semester 2011/2012

Layer thickness estimation from the frequency spectrum of seismic reflection data

Continuous Fourier transform of a Gaussian Function

ECG782: Multidimensional Digital Signal Processing

Multiresolution schemes

AN INVERTIBLE DISCRETE AUDITORY TRANSFORM

6.869 Advances in Computer Vision. Bill Freeman, Antonio Torralba and Phillip Isola MIT Oct. 3, 2018

FOURIER TRANSFORM METHODS David Sandwell, January, 2013

Multiresolution analysis

Empirical Mean and Variance!

Acoustic holography. LMS Test.Lab. Rev 12A

Extraction of Individual Tracks from Polyphonic Music

PART 1. Review of DSP. f (t)e iωt dt. F(ω) = f (t) = 1 2π. F(ω)e iωt dω. f (t) F (ω) The Fourier Transform. Fourier Transform.

Degrees-of-freedom estimation in the Student-t noise model.

Lab Fourier Analysis Do prelab before lab starts. PHSX 262 Spring 2011 Lecture 5 Page 1. Based with permission on lectures by John Getty

Fourier Transform with Rotations on Circles and Ellipses in Signal and Image Processing

Sparse Time-Frequency Transforms and Applications.

ω 0 = 2π/T 0 is called the fundamental angular frequency and ω 2 = 2ω 0 is called the

THE FOURIER TRANSFORM (Fourier series for a function whose period is very, very long) Reading: Main 11.3

Tutorial 2 - Learning about the Discrete Fourier Transform

A Class of Image Metrics Based on the Structural Similarity Quality Index

Fast and Robust Phase Retrieval

Identification and Classification of High Impedance Faults using Wavelet Multiresolution Analysis

Review of Linear Systems Theory

MATHEMATICAL METHODS AND APPLIED COMPUTING

SPARSE signal representations have gained popularity in recent

Topic 3: Fourier Series (FS)

Engine fault feature extraction based on order tracking and VMD in transient conditions

Discrete Fourier transform

Comparison of ICA and WT with S-transform based method for removal of ocular artifact from EEG signals

Multiresolution schemes

Introduction to time-frequency analysis Centre for Doctoral Training in Healthcare Innovation

Fall 2011, EE123 Digital Signal Processing

Advanced Computational Methods for VLSI Systems. Lecture 4 RF Circuit Simulation Methods. Zhuo Feng

Design of Image Adaptive Wavelets for Denoising Applications

Multiresolution image processing

! Circular Convolution. " Linear convolution with circular convolution. ! Discrete Fourier Transform. " Linear convolution through circular

ECG782: Multidimensional Digital Signal Processing

arxiv:gr-qc/ v1 24 Dec 2004

7 The Waveform Channel

WE begin by briefly reviewing the fundamentals of the dual-tree transform. The transform involves a pair of

5742 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 55, NO. 12, DECEMBER /$ IEEE

arxiv: v1 [math.ca] 6 Feb 2015

Introduction to Wavelets and Wavelet Transforms

DESIGN OF MULTI-DIMENSIONAL DERIVATIVE FILTERS. Eero P. Simoncelli

Discrete Simulation of Power Law Noise

Transcription:

Symmetric Discrete Orthonormal Stockwell Transform Yanwei Wang and Jeff Orchard Department of Applied Mathematics; David R. Cheriton School of Computer Science, University Avenue West, University of Waterloo, Waterloo, Ontario, Canada NL 3G Abstract. The Stockwell transform (ST) is a time-frequency signal decomposition that is gaining in popularity, likely because of its direct relation with the Fourier Transform (FT). A discrete and non-redundant version of the ST, denoted the Discrete Orthonormal Stockwell Transform (DOST), has made the use of the ST more feasible. However, the matrix multiplication required by the DOST can still be a formidable computation, especially for high-dimensional data. Moreover, the symmetric property of the ST and FT is not present in the DOST. In this paper, we investigate a new Symmetric Discrete Orthonormal Stockwell Transform (SDOST) that still keeps the non-redundant multiresolution features of the DOST, while maintaining a symmetry property similar to that of the FT. First, we give a brief introduction for the ST and the DOST. Then we analyze the DOST coefficients and modify the transform to get a symmetric version. A small experiment shows that the SDOST has kept the abilities of the DOST and demonstrates the advantage of symmetry when applying the SDOST. Keywords: Stockwell transform, DOST, symmetric DOST PACS: PACS Category..7.Hm INTRODUCTION The Stockwell transform (ST) is a multiresolution transform that represents a time signal in a time-frequency domain, and its coefficients are conjugate symmetric for a real-valued input signal. However, the Discrete Orthonormal Stockwell Transform (DOST) looses the symmetry because of how the time-frequency space is partitioned, making it difficult to manipulate the coefficients for some applications. A non-redundant time-frequency transform that maintains the symmetry property would make the application of the transform easier to apply, and faster to compute for realvalued input signals. In this paper, we present a simple change to the current definition of the DOST, and propose the Symmetric DOST (SDOST). REVIEW OF THE STOCKWELL TRANSFORM AND THE DOST The Stockwell transform, proposed in 996 [,, 3], gives a full time-frequency decomposition of a signal. Consider a one-dimensional function h(t). The Stockwell transform of h(t) is defined as the FT of the product between h(t) and a Gaussian window function, S(τ, f) = h(t) f e (τ t) f e iπ ft dt, () π where f is the frequency, and t and τ are both time. In this way, the ST decomposes a signal into temporal (τ) and frequency ( f ) components. By the integral properties of the Gaussian function, the relation between S(τ, f) and H( f) (the Fourier transform of h(t)) is S(τ, f)dτ = H( f). () That is, the accumulation of the Stockwell decomposition over time yields the Fourier coefficients of the signal, highlighting a special feature of the Stockwell transform. Hence, the original function h(t) can be recovered by calculating the inverse Fourier transform of H( f).

Using the equivalent frequency domain definition of the Stockwell transform, the discrete Stockwell transform (DST) [] can be written [ n ] N [ m+n ] S jt, = NT H e π m /n e iπm j/n, (3) NT for n, and for the n = voice, m= S[ jt,] = N N h[mt], (4) m= which is analogous to the DC value of the FT. The Stockwell transform has been applied in many fields such as geography [4, 5], engineering [6], and medical imaging for human functional brain mapping [7]. From (), it is obvious that the Stockwell transform is an overcomplete representation. For a signal of length N, there are N DST coefficients, but each one takes O(N) to compute, suggesting that computing all N coefficients of the DST has computational complexity of O(N 3 ). That makes the Stockwell transform expensive to be applied to higher-dimensional cases. A more efficient basis is needed to pursue this time-frequency decomposition. The DOST is a pared-down version of the fully redundant ST [8]. Since lower frequencies have longer periods, it stands to reason that lower frequencies can cope with lower sampling rates. Hence, the DOST subsamples the low frequencies. Similarly, spans of high frequencies have higher sample rates. The DOST basis vectors are defined as f=ν β/ S(kT) [ν,β,τ] = ν+β/ β for k =,,N, which can be summed analytically to exp (iπ kn ) f exp ( iπ τβ ) f exp( iπτ), (5) S(kT) [ν,β,τ] = ie iπτ e iα(ν β/ /) e iα(ν+β/ /), (6) β sinα where α = π(k/n τ/β) is the center of the temporal window and ν indicates the center of each frequency band voice with a bandwidth of β. To make the family of basis vectors in (6) orthonormal, the parameters, β, ν and τ have to be chosen suitably [8]. Thus a signal of length N can be represented by the DOST with N complex coefficients. SYMMETRIC DOST Unlike the FFT, the DOST coefficients of a real-valued input signal are not conjugate symmetric. This means that in real applications we have to calculate the positive frequency coefficients and the negative part as well. To make the idea more clear, Fig. shows how the parameters ν,β & τ partition the time-frequency domain. The partition corresponding to the DOST is shown in Fig. (a). Note that we are proposing a slightly different parameterization than in [8], using non-integer values for ν. We discovered that we can achieve conjugate symmetry by modifying the DOST basis slightly, still maintaining its orthogonality. We call this modified DOST the symmetric DOST (SDOST) in this paper. For real-valued signals, half of the computation can be avoided if we use the symmetric DOST. If we impose the conjugate symmetry requirement on our DOST coefficients, then the basis functions for the SDOST are s [ν,β,τ] = ( s [ ν,β,τ] ), (7) S(kT) [ν,β,τ] = ie iπτ e iα(ν β/) e iα(ν+β/), (8) β sinα where α = π(k/n τ/β) is the center of the temporal window. Equivalently, this change of definition amounts to shifting the time-frequency partitions by / sample along the frequency axis. To implement this alternative, we replace ν by ν + / and use the same definition of the DOST as

(a) Unified DOST. (b) Symmetric DOST FIGURE. Partition diagram of the time-frequency domain. Each solid block corresponds to one DOST coefficient. The arrows in (a) show where we have modified the DOST by relaxing the integer constraint for ν. In (b), the coefficients for the SDOST are shifted along the frequency axis by. (6). We have verified that the orthonormal property is held for the basis vector of the symmetric DOST. The partition over the time-frequency domain of SDOST is shown in Fig. (b). We find that, by taking advantage of the FFT, the DOST coefficients can be calculated faster than by direct calculation (normally ten times faster). The strategy for this speedup is showed in Fig. (a). We also find that the SDOST can be calculated in a similar way (Fig. (b)) by multiplying the signal by a phase ramp. Note that the system matrix is slightly different for SDOST than for DOST. However, this transformation matrix is block-diagonal in both cases. Despite the fact that the SDOST corresponds to a /-sample shift along the frequency axis, there is no loss of information to resampling because the shift is implemented (either implicitly or explicitly) using the Fourier shift theorem. (a) DOST. (b) SDOST FIGURE. Calculation strategies of the DOST and the SDOST. The SDOST is equivalent to the shifted version of the DOST with a different transfer matrix. AN APPLICATION USING THE SYMMETRIC DOST We designed an experiment to test our method on a common signal-processing task, denoising. We constructed a signal by combining sine waves. The signal starts with a sinusoid with amplitude and a high frequency f hi, followed by a period of low frequency f lo, and ending with the same high frequency f hi. During the low frequency phase, we added high frequency noise with frequency f hi. Our goal was to remove the high frequency noise without disturbing the high frequency parts at the beginning and end. We used filters on the FFT, the DOST and the SDOST coefficients to try to remove the noise. From Fig. 3, we can see that the FFT has failed because the frequency content of the noise is similar to that of part of our desired signal. Due to the temporally localized nature of the frequency information, the DOST and the SDOST have both succeeded by returning almost the same denoised signal. If we compare the denoised signal from the DOST to the SDOST more closely, the amplitude of the signal denoised by DOST is diminished to.955, while the corresponding amplitude for SDOST is.968. Why? Manipulation of the DOST coefficients during the filtering stage causes the reconstructed signal to no longer be real-valued; some of the energy of the original signal has been dispersed to the imaginary part of the signal. It is not clear how one would

implement a filter on the DOST coefficients so that the reconstructed signal was real-valued. However, for the SDOST, we can assign the coefficients to zero symmetrically and get a real-valued signal after the reconstruction..5.5.5.5 5 5 5 (a) Original signal..5.5.5.5 5 5 5 (b) SDOST denoised signal..5.5.5.5 5 5 5 (c) DOST denoised signal..5.5.5.5 5 5 5 (d) FFT denoised signal. FIGURE 3. Original signal and different versions of denoised signal. FURTHER WORK To compute the SDOST of a real-valued signal, we need to compute only half of the coefficients because the other half can be derived very easily from the symmetry property. Moreover, the DOST coefficients can be computed as a sparse linear mapping on the FFT of the data. While the computational complexity with these improvements is still O(N ), they may speedup computation of the DOST to a point where it is feasible in many more genres of application. REFERENCES. Stockwell, R. G., Mansinha, L., and Lowe, R. P., Localization of complex spectrum: the S transform, IEEE Transactions on Signal Processing 44, 998 (April 996).. Mansinha, L., Stockwell, R. G., Lowe, R., Eramian, M., and Schincariol, R. A., Local S-spectrum analysis of -D and -D data, Phys. Earth Planet. Inter. 3, 39ĺC336 (November 997). 3. Eramian, M., Schincariol, R. A., Stockwell, R. G., Lowe, R. P., and Mansinha, L., Review of applications of D and D S-transforms, Proc. SPIE 378, 558 568 (April 997). 4. Merzlyakov, E. G., Portnyagin, Y. I., Jacobi, C., Mitchell, N. J., Muller, H. G., Manson, A. H., Fachrutdinova, A. N., Singer, W., and Hoffmann, P., On the longitudinal structure of the transient day-to-day variation of the semidiurnal tide in the mid-latitude lower thermosphere i. Winter season, Ann. Geophys. 9, 545 56 (). 5. Oldenborger, G. A., Schincariol, R. A., and Mansinha, L., Space-local spectral texture segmentation applied to characterizing the heterogeneity of hydraulic conductivity, Water Resouces Research 38(8), 54 57 (). 6. Dash, P., Panigrahi, B., and Panda, G., Power quality analysis using S-transform, IEEE Transactions on Power Dilivery 8 (April 3). 7. Andino, S., Menendez, R., Lantz, C., Blank, O., Michel, C., and Landis, T., Non-stationary distributed source approximation: An alternative to improve localization procedures, Human Brain Mapping 4, 8 95 (July ).

8. Stockwell, R. G., A basis for efficient representation of the S-transform, Digital Signal Processing 7, 37 393 (January 7).