Hilbert–Huang transform

The Hilbert–Huang transform (HHT) is a way to decompose a signal into so-called intrinsic mode functions (IMF) along with a trend, and obtain instantaneous frequency data. It is designed to work well for data that is nonstationary and nonlinear. In contrast to other common transforms like the Fourier transform, the HHT is more like an algorithm (an empirical approach) that can be applied to a data set, rather than a theoretical tool.

Introduction

The Hilbert–Huang transform (HHT), a NASA designated name, was proposed by Huang et al. (1996, 1998, 1999, 2003, 2012). It is the result of the empirical mode decomposition (EMD) and the Hilbert spectral analysis (HSA). The HHT uses the EMD method to decompose a signal into so-called intrinsic mode functions (IMF) with a trend, and applies the HSA method to the IMFs to obtain instantaneous frequency data. Since the signal is decomposed in time domain and the length of the IMFs is the same as the original signal, HHT preserves the characteristics of the varying frequency. This is an important advantage of HHT since real-world signal usually has multiple causes happening in different time intervals. The HHT provides a new method of analyzing nonstationary and nonlinear time series data.

Definition

Empirical Mode Decomposition (EMD)

The fundamental part of the HHT is the empirical mode decomposition (EMD) method. Breaking down signals into various components, EMD can be compared with other analysis methods such as Fourier transform and Wavelet transform. Using the EMD method, any complicated data set can be decomposed into a finite and often small number of components. These components form a complete and nearly orthogonal basis for the original signal. In addition, they can be described as intrinsic mode functions (IMF).[1]

Without leaving the time domain, EMD is adaptive and highly efficient. Since the decomposition is based on the local characteristic time scale of the data, it can be applied to nonlinear and nonstationary processes.

Intrinsic Mode Functions (IMF)

An IMF is defined as a function that satisfies the following requirements:

  1. In the whole data set, the number of extrema and the number of zero-crossings must either be equal or differ at most by one.
  2. At any point, the mean value of the envelope defined by the local maxima and the envelope defined by the local minima is zero.

It represents a generally simple oscillatory mode as a counterpart to the simple harmonic function. By definition, an IMF is any function with the same number of extrema and zero crossings, whose envelopes are symmetric with respect to zero. This definition guarantees a well-behaved Hilbert transform of the IMF.

Hilbert Spectral Analysis

Hilbert spectral analysis (HSA) is a method for examining each IMF's instantaneous frequency as functions of time. The final result is a frequency-time distribution of signal amplitude (or energy), designated as the Hilbert spectrum, which permits the identification of localized features.

Techniques

Empirical Mode Decomposition (EMD)

The EMD method is a necessary step to reduce any given data into a collection of intrinsic mode functions (IMF) to which the Hilbert spectral analysis can be applied.

IMF represents a simple oscillatory mode as a counterpart to the simple harmonic function, but it is much more general: instead of constant amplitude and frequency in a simple harmonic component, an IMF can have variable amplitude and frequency along the time axis.
The procedure of extracting an IMF is called sifting. The sifting process is as follows:

  1. Identify all the local extrema in the test data.
  2. Connect all the local maxima by a cubic spline line as the upper envelope.
  3. Repeat the procedure for the local minima to produce the lower envelope.

The upper and lower envelopes should cover all the data between them. Their mean is m1. The difference between the data and m1 is the first component h1:

Ideally, h1 should satisfy the definition of an IMF, since the construction of h1 described above should have made it symmetric and having all maxima positive and all minima negative. After the first round of sifting, a crest may become a local maximum. New extrema generated in this way actually reveal the proper modes lost in the initial examination. In the subsequent sifting process, h1 can only be treated as a proto-IMF. In the next step, h1 is treated as data:

After repeated sifting up to k times, h1 becomes an IMF, that is

Then, h1k is designated as the first IMF component of the data:

Stoppage Criteria of the Sifting Process

The stoppage criterion determines the number of sifting steps to produce an IMF. Following are the four existing stoppage criterion:

This criterion is proposed by Huang et al. (1998). It is similar to the Cauchy convergence test, and we define a sum of the difference, SD, as

Then the sifting process stops when SD is smaller than a pre-given value.

This criterion is based on the so-called S-number, which is defined as the number of consecutive siftings for which the number of zero-crossings and extrema are equal or at most differing by one. Specifically, an S-number is pre-selected. The sifting process will stop only if, for S consecutive siftings, the numbers of zero-crossings and extrema stay the same, and are equal or at most differ by one.

Proposed by Rilling, Flandrin and Gonçalvés, threshold method set two threshold values to guaranteeing globally small fluctuations in the mean while taking in account locally large excursions.[2]

Proposed by Cheng, Yu and Yang, energy different tracking method utilized the assumption that the original signal is a composition of orthogonal signals, and calculate the energy based on the assumption. If the result of EMD is not an orthogonal basis of the original signal, the amount of energy will be different from the original energy.

Once a stoppage criterion is selected, the first IMF, c1, can be obtained. Overall, c1 should contain the finest scale or the shortest period component of the signal. We can, then, separate c1 from the rest of the data by Since the residue, r1, still contains longer period variations in the data, it is treated as the new data and subjected to the same sifting process as described above.

This procedure can be repeated for all the subsequent rj's, and the result is

The sifting process finally stops when the residue, rn, becomes a monotonic function from which no more IMF can be extracted. From the above equations, we can induce that

Thus, a decomposition of the data into n-empirical modes is achieved. The components of the EMD are usually physically meaningful, for the characteristic scales are defined by the physical data. Flandrin et al. (2003) and Wu and Huang (2004) have shown that the EMD is equivalent to a dyadic filter bank.[3]

Hilbert Spectral Analysis

Having obtained the intrinsic mode function components, the instantaneous frequency can be computed using the Hilbert transform. After performing the Hilbert transform on each IMF component, the original data can be expressed as the real part, Real, in the following form:

Current Applications

Limitations

Chen and Feng [2003] proposed a technique to improve the HHT procedure.[14] The authors noted that the EMD is limited in distinguishing different components in narrow-band signals. The narrow band may contain either (a) components that have adjacent frequencies or (b) components that are not adjacent in frequency but for which one of the components has a much higher energy intensity than the other components. The improved technique is based on beating-phenomenon waves.

Datig and Schlurmann [2004] [15] conducted a comprehensive study on the performance and limitations of HHT with particular applications to irregular waves. The authors did extensive investigation into the spline interpolation. The authors discussed using additional points, both forward and backward, to determine better envelopes. They also performed a parametric study on the proposed improvement and showed significant improvement in the overall EMD computations. The authors noted that HHT is capable of differentiating between time-variant components from any given data. Their study also showed that HHT was able to distinguish between riding and carrier waves.

Huang and Zu [2008] [16] reviewed applications of the Hilbert–Huang transformation emphasizing that the HHT theoretical basis is purely empirical, and noting that "one of the main drawbacks of EMD is mode mixing". They also outline outstanding open problems with HHT, which include: End effects of the EMD, Spline problems, Best IMF selection and uniqueness. Although the ensemble EMD (EEMD) may help mitigate the latter.

End Effect

End effect occurs at the beginning and end of the signal because there is no point before the first data point and after the last data point to be considered together. In most cases, these end points are not the extreme value of the signal. While doing the EMD process of the HHT, the extreme envelope will diverge at the end points and cause significant error. This error distorts the IMF waveform at its endpoints. Furthermore, the error in the decomposition result accumulates through each repetition of the sifting process.[17] Various methods are proposed to solve the end effect in HHT:

Mode Mixing Problem

Mode mixing problem happens during the EMD process. Straightforward implementation of sifting procedure produces mode mixing due to IMF mode rectification. Specific signal may not be separated into the same IMFs every time. This problem makes it hard to implement feature extraction, model training and pattern recognition since the feature is no longer fixed in one labeling index. Mode mixing problem can be avoided by including an intermittence test during the HHT process.[18]

Ensemble Empirical Mode Decomposition(EEMD)

The proposed Ensemble Empirical Mode Decomposition is developed as follows:

  1. add a white noise series to the targeted data;
  2. decompose the data with added white noise into IMFs;
  3. repeat step 1 and step 2 again and again, but with different white noise series each time;and
  4. obtain the (ensemble) means of corresponding IMFs of the decompositions as the final result.

The effects of the decomposition using the EEMD are that the added white noise series cancel each other, and the mean IMFs stays within the natural dyadic filter windows, significantly reducing the chance of mode mixing and preserving the dyadic property.

Comparison with Other Transforms

Transform Fourier Wavelet Hilbert
Basis a priori a priori adaptive
Frequency convolution: global, uncertainty convolution: regional, uncertainty differentiation: local, certainty
Presentation energy-frequency energy-time-frequency energy-time-frequency
Nonlinear no no yes
Non-stationary no yes yes
Feature Extraction no discrete: no, continuous: yes yes
Theoretical Base theory complete theory complete empirical

See also

References

  1. ↑ Lambert, Max; Engroff, Andrew; Dyer, Matt; Byer, Ben. "Empirical Mode Decomposition".
  2. ↑ Rilling, Gabriel; Flandrin, Patrick; Gon¸calv`es, Paulo (2003). "ON EMPIRICAL MODE DECOMPOSITION AND ITS ALGORITHMS" (PDF).
  3. ↑ Flandrin, P.; Rilling, G.; Gonçalves, P. (2003). "Empirical Mode Decomposition as a Filterbank" (pdf). IEEE Signal Processing Letters. 11 (2): 112–114. doi:10.1109/LSP.2003.821662.
  4. ↑ Pachori, R.B. (2008). "Discrimination between ictal and seizure-free EEG signals using empirical mode decomposition",". Research Letters in Signal Processing. 2008 (Article ID 293056): 1–5. doi:10.1155/2008/293056.
  5. ↑ Pigorini, A.; Casali, A.G.; Casarotto, S.; Ferrarelli, F.; Baselli, G.; Mariotti, M.; Massimini, M.; Rosanova, M.C.E. (2011). "Time-frequency spectral analysis of TMS-evoked EEG oscillations by means of Hilbert-Huang transform". J Neurosci Methods. 198 (2): 236–245. doi:10.1016/j.jneumeth.2011.04.013.
  6. ↑ Hariharan H.; Gribok, A.; Abidi, M. A.; Koschan, A. (2006). "Image Fusion and Enhancement via Empirical Mode Decomposition" (pdf). Journal of Pattern Recognition Research. 1 (1): 16–31. doi:10.13176/11.6.
  7. ↑ Chang, J. C.; Huang, M. Y.; Lee, J. C.; Chang, C. P.; Tu, T. M. (2009). "Iris Recognition with an Improved Empirical Mode Decomposition Method". Optical Engineering. 48 (4): 047007–047007–15. doi:10.1117/1.3122322.
  8. ↑ Hong, J.; et al. (2010). "Surface layer similarity in the nocturnal boundary layer: The application of Hilbert-Huang transform" (pdf). Biogeosciences. 7 (4): 1271–1278. doi:10.5194/bg-7-1271-2010.
  9. ↑ Nakariakov, V. M.; et al. (2010). "Oscillatory processes in solar flares". Plasma Physics and Controlled Fusion. 52 (12): 124009. doi:10.1088/0741-3335/52/12/124009.
  10. ↑ Barnhart, B. L.; Eichinger, W. E. (2011). "Analysis of Sunspot Variability Using the Hilbert-Huang Transform". Solar Physics. 269 (2): 439–449. doi:10.1007/s11207-010-9701-6.
  11. ↑ Parey, A.; Pachori, R.B. (2012). "Variable cosine windowing of intrinsic mode functions: Application to gear fault diagnosis". Measurement. 45 (3): 415–426. doi:10.1016/j.measurement.2011.11.001.
  12. ↑ Huang, H.; Pan, J. (2006). "Speech pitch determination based on Hilbert-Huang transform" (pdf). Signal Processing. 86 (4): 792–803. doi:10.1016/j.sigpro.2005.06.011.
  13. ↑ Bellini; et al. (2014). "Final results of Borexino Phase-I on low-energy solar neutrino spectroscopy". Physical Review D. 89 (112007). doi:10.1103/PhysRevD.89.112007.
  14. ↑ Chen, Y.; Feng M.Q. (2003). "A technique to improve the empirical mode decomposition in the Hilbert-Huang transform" (PDF). Earthquake Engineering and Engineering Vibration. 2 (1): 75–85. doi:10.1007/BF02857540.
  15. ↑ Dätig, Marcus; Schlurmann, Torsten. "Performance and limitations of the Hilbert–Huang transformation (HHT) with an application to irregular water waves". Ocean Engineering. 31 (14-15): 1783–1834. doi:10.1016/j.oceaneng.2004.03.007.
  16. ↑ Huang, N. E.; Wu Z. (2008). "A review on Hilbert-Huang transform: Method and its applications to geophysical studies,". Rev. Geophys. 46. Bibcode:2008RvGeo..46.2006H. doi:10.1029/2007RG000228.
  17. ↑ Guang, Y.; Sun, X.; Zhang, M.; Li, X.; Liu, X. (2014). "Study on Ways to Restrain End Effect of Hilbert-Huang Transform" (PDF). Journal of Computers. 25.
  18. ↑ Hilbert-Huang Transform and Its Applications
This article is issued from Wikipedia - version of the 8/29/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.