Time-Frequency and Time-Scale Analysis of Doppler Ultrasound Signals

Slides:



Advertisements
Similar presentations
Islamic university of Gaza Faculty of engineering Electrical engineering dept. Submitted to: Dr.Hatem Alaidy Submitted by: Ola Hajjaj Tahleel.
Advertisements

3-D Computational Vision CSc Image Processing II - Fourier Transform.
Time-frequency-domain modal identification of ambient vibration structures using Wavelet Transform Numerical example.
HILBERT TRANSFORM Fourier, Laplace, and z-transforms change from the time-domain representation of a signal to the frequency-domain representation of the.
Lecture 7: Basis Functions & Fourier Series
ACHIZITIA IN TIMP REAL A SEMNALELOR. Three frames of a sampled time domain signal. The Fast Fourier Transform (FFT) is the heart of the real-time spectrum.
Applications in Signal and Image Processing
DFT/FFT and Wavelets ● Additive Synthesis demonstration (wave addition) ● Standard Definitions ● Computing the DFT and FFT ● Sine and cosine wave multiplication.
Digital Signal Processing
1 Speech Parametrisation Compact encoding of information in speech Accentuates important info –Attempts to eliminate irrelevant information Accentuates.
Undecimated wavelet transform (Stationary Wavelet Transform)
A Confidence Limit for Hilbert Spectrum Through stoppage criteria.
Short Time Fourier Transform (STFT)
Introduction : Time-Frequency Analysis HHT, Wigner-Ville and Wavelet.
Lecture 19 The Wavelet Transform. Some signals obviously have spectral characteristics that vary with time Motivation.
Basic Concepts and Definitions Vector and Function Space. A finite or an infinite dimensional linear vector/function space described with set of non-unique.
Introduction to Wavelets
Wavelet-based Coding And its application in JPEG2000 Monia Ghobadi CSC561 project
The Analytic Function from the Hilbert Transform and End Effects Theory and Implementation.
Multiscale transforms : wavelets, ridgelets, curvelets, etc.
Spectral Analysis Spectral analysis is concerned with the determination of the energy or power spectrum of a continuous-time signal It is assumed that.
Spectra of random processes Signal, noise, smoothing and filters.
Fourier Transforms Revisited
Leakage & Hanning Windows
Integral Transform Dongsup Kim Department of Biosystems, KAIST Fall, 2004.
LE 460 L Acoustics and Experimental Phonetics L-13
Motivation Music as a combination of sounds at different frequencies
The Wavelet Tutorial: Part3 The Discrete Wavelet Transform
WAVELET TUTORIALS.
The Story of Wavelets.
Digital Image Processing Chapter # 4 Image Enhancement in Frequency Domain Digital Image Processing Chapter # 4 Image Enhancement in Frequency Domain.
The Wavelet Tutorial Dr. Charturong Tantibundhit.
Image Processing © 2002 R. C. Gonzalez & R. E. Woods Lecture 4 Image Enhancement in the Frequency Domain Lecture 4 Image Enhancement.
Module 2 SPECTRAL ANALYSIS OF COMMUNICATION SIGNAL.
1 Chapter 5 Image Transforms. 2 Image Processing for Pattern Recognition Feature Extraction Acquisition Preprocessing Classification Post Processing Scaling.
Wireless and Mobile Computing Transmission Fundamentals Lecture 2.
Advanced Digital Signal Processing
Wavelet transform Wavelet transform is a relatively new concept (about 10 more years old) First of all, why do we need a transform, or what is a transform.
Speech Signal Representations I Seminar Speech Recognition 2002 F.R. Verhage.
Lecture 7: Sampling Review of 2D Fourier Theory We view f(x,y) as a linear combination of complex exponentials that represent plane waves. F(u,v) describes.
Noninvasive Detection of Coronary Artery Disease John Semmlow and John Kostis Laboratory for Noninvasive Medical Instrumentation Rutgers University and.
1 Using Wavelets for Recognition of Cognitive Pattern Primitives Dasu Aravind Feature Group PRISM/ASU 3DK – 3DK – September 21, 2000.
“Digital stand for training undergraduate and graduate students for processing of statistical time-series, based on fractal analysis and wavelet analysis.
Wavelets and Multiresolution Processing (Wavelet Transforms)
Pre-Class Music Paul Lansky Six Fantasies on a Poem by Thomas Campion.
CCN COMPLEX COMPUTING NETWORKS1 This research has been supported in part by European Commission FP6 IYTE-Wireless Project (Contract No: )
1 Wavelet Transform. 2 Definition of The Continuous Wavelet Transform CWT The continuous-time wavelet transform (CWT) of f(x) with respect to a wavelet.
1 Chapter 02 Continuous Wavelet Transform CWT. 2 Definition of the CWT The continuous-time wavelet transform (CWT) of f(t) with respect to a wavelet 
The Wavelet Tutorial: Part2 Dr. Charturong Tantibundhit.
The Story of Wavelets Theory and Engineering Applications
Topics 1 Specific topics to be covered are: Discrete-time signals Z-transforms Sampling and reconstruction Aliasing and anti-aliasing filters Sampled-data.
Computer Graphics & Image Processing Chapter # 4 Image Enhancement in Frequency Domain 2/26/20161.
2D Fourier Transform.
Wavelets Introduction.
Oh-Jin Kwon, EE dept., Sejong Univ., Seoul, Korea: 2.3 Fourier Transform: From Fourier Series to Fourier Transforms.
All slides © S. J. Luck, except as indicated in the notes sections of individual slides Slides may be used for nonprofit educational purposes if this copyright.
Short Time Fourier Transform (STFT) CS474/674 – Prof. Bebis.
Convergence of Fourier series It is known that a periodic signal x(t) has a Fourier series representation if it satisfies the following Dirichlet conditions:
Complex demodulation Windowed Fourier Transform burst data Appropriate for burst data continuous data Questionable for continuous data (may miss important.
k is the frequency index
Spectral Analysis Spectral analysis is concerned with the determination of the energy or power spectrum of a continuous-time signal It is assumed that.
The Q Pipeline search for gravitational-wave bursts with LIGO
FFT-based filtering and the
Signals and Systems Networks and Communication Department Chapter (1)
Advanced Digital Signal Processing
FFTs, Windows, and Circularity
Wavelet transform Wavelet transform is a relatively new concept (about 10 more years old) First of all, why do we need a transform, or what is a transform.
k is the frequency index
Fourier Analyses Time series Sampling interval Total period
Windowed Fourier Transform
Presentation transcript:

Time-Frequency and Time-Scale Analysis of Doppler Ultrasound Signals Lecture 7: Time-Frequency and Time-Scale Analysis of Doppler Ultrasound Signals

Stationar/nonstationary signals Most biological signals are highly non-stationary and sometimes last only for a short time. Signal analysis methods which assume that the signal is stationary are not appropriate. Therefore time-frequency analysis of such signals is necessary.

Some nonstationary signals Some nonstationary signals. Forward (red) and reverse (blue) flow components are shown (after Hilbert transform process)

Typical audio Doppler signals

Time-Frequency Analysis... The time representation is usually the first description of a signal s(t) obtained by a receiver recording variations with time. The frequency representation, which is obtained by the well known Fourier transform (FT), highlights the existence of periodicity, and is also a useful way to describe a signal.

Time-Frequency Analysis... The relationship between frequency and time representations of a signal can be defined as no frequency information no time information

Time-Frequency Analysis A joint time-frequency representation is necessary to observe evolution of the signal both in time and frequency. Linear methods (Windowed Fourier Transform (WFT), and Wavelet Transform (WT)) Decomposes a signal into time-frequency atoms. Computationally efficient Time-frequency resolution trade-off Bilinear (quadratic) methods (Wigner-Ville distribution) Based upon estimating an instantaneous energy distribution using a bilinear operation on the signal. Computationally intense Arbitrarily high resolution in time-and frequncy Cross term interference

Windowed Fourier Transform... g(t): short time analysis window localised around t=0 and v=0

Windowed Fourier Transform... Segmenting a long signal into smaller sections with 128 point and 512 point Hanning window (criticaly sampled).

Windowed Fourier Transform... Assumes the signal is stationary within the analysis window. Time-frequency tiling is fixed The WFT is similar to a bank of band-pass filters with constant bandwidth. Three important WFT parameters for analysis of a particular signal need to be determined: Window type, window size, required overlap ratio

Window type... The FT makes an implicit assumption that the signal within the measured time is repetitive. Most real signals will have discontinuities at the ends of the measured time, and when the FFT assumes the signal repeats it will also assume discontinuities that are not there. Discontinuities will be eliminated by multiplying the signal with a window function.

Window type Some window types and corresponding power spectra

Window size... In a FFT process, there is a well known trade-off between frequency resolution (v) and time resolution (t), which can be expressed as where W is window length and vs is sampling frequency. To use the WFT one has to make a trade-off between time-resolution and frequency resolution.

Window size If no overlap is employed, processing NS length data by using W length analysis window will result in a time-frequency distribution having a dimension that almost equals to the dimension of the original signal space (critically sampled WFT). The actual dimension of the time-frequency distribution is The best combination of t and f depends on the signal being processed and best time-frequency resolution trade-off needs to be determined empirically.

Window overlap ratio... A short duration signal may be lost when a windowing function is used prior to the FFT. In this case an overlap ratio to some degree must be employed. In overlapped WFT, the data frames of length W are processed sequentially by sliding the window ‘W-OL’ times at each processing stage, where OL is the number of overlapped samples. Consequently, overlapping FFT windows produces higher dimensional WFTs. In an overlapped WFT process, the dimension of the resultant time-frequency distribution is

Window overlap ratio... The overlapping process introduces a predictable time shift on the actual location of a transient event on the time-frequency plane of the FFT. The duration of the time shift depends on the overlap ratio used, while the direction of the time shift is dictated by the way that the data are arranged prior to the FFT. Duration of the time shift can be estimated as ‘(number of overlapped samples/2)sampling time’. The time shift can be adjusted by adding zeros equally at both ends of the original data array. In this case the dimension of the overlapped WFT is

Window overlap ratio Segmenting a long signal into smaller sections with 512 point Hanning window (different overlap strategies).

TFDs with 16, 32, 64 ,128, 256, 256, 512 points windowing Normalised IP and energy with 16(black), 32(red), 64(green), 128(blue), 256(magenta), 512(cyan) windowing)

Normalised IP and energy with 16(black), 32(red), 64(green), 128(blue), 256(magenta), 512(cyan) hanning windowing TFDs with 16, 32, 64 ,128, 256, 256, 512 points hanning windowing

An example of possible embolic signal at the edges of two consecutive frames and related 3d spectrum without a window and with a Hannig window function

Linear and Logarithmic sonogram displays of a Doppler signal with possible embolic signal using different overlap ratios

Time-Scale Analysis (Wavelet Transform) *(t) is the analysing wavelet. a (>0) controls the scale of the wavelet. b is the translation and controls the position of the wavelet. Can be computed directly by convolving the signal with a scaled and dilated version of the wavelet (Frequency domain implementation may increase computational efficiency). Discrete WT is a special case of the continuous WT when a=a0j and b=n.a0j. Dyadic wavelet bases are obtained when a0=2 Wavelets are ideally suited for the analysis of sudden short duration signal changes (non-stationary signals). Decomposes a time series into time-scale space, creating a three dimensional representation (time, wavelet scale and amplitude of the WT coefficients). Time-frequency (scale) tiling is logarithmic.

The wavelet transform properties It is a linear transformation, It is covariant under translations: It is covariant under dilations: If W(a,b) is the WT of a signal s(t), then s(t) can be restored using the formula: providing that the Fourier transform of wavelet (t), denoted (v) satisfies the following admissibility condition: , which shows that (t), has to oscillate and decay.

Morlet Wavelet One of the original wavelet functions is the Morlet wavelet, which is a locally periodic wavetrain. It is obtained by taking a complex sine wave, and localising it with a Gaussian envelope. Real (blue) and imaginary (red) componets of Morlet wavelet.

Morlet wavelet where v0 is nondimensional frequency and ususally assumed to be 5 to 6 to satisfy the admissibility condition. Fourier transform and corresponding Fourier wavelength of Morlet wavelet are H(v) =1 if v>0, H(v)=0 otherwise

The basic difference between the WT and the WFT is that when the scale factor a is changed, the duration and the bandwidth of the wavelet are both changed but its shape remains the same. The WT uses short windows at high frequencies and long windows at low frequencies in contrast to the WFT, which uses a single analysis window. This partially overcomes the time resolution limitation of the WFT.

Long (a) and short (b) duration embolic signals and corresponding 2d and 3d plots of the FFT and the CWT results. The FFT window size was 128 point (17.9 ms) with Hanning window and the 64 scales Morlet wavelet was used for the CWT. A low intensity embolic signal and corresponding 2d and 3d plots of the WFT and the CWT results (- indicates reverse flow direction) for (a) the 128 point FFT and 64 scales CWT, (b) the 32 point FFT and 32 scale CWT.