Coarse-graining and the Haar wavelet transform for multiscale analysis

Abstract

Abstract Background Multiscale entropy (MSE) has become increasingly common as a quantitative tool for analysis of physiological signals. The MSE computation involves first decomposing a signal into multiple sub-signal ‘scales’ using a coarse-graining algorithm. Methods The coarse-graining algorithm averages adjacent values in a time series to produce a coarser scale time series. The Haar wavelet transform convolutes a time series with a scaled square wave function to produce an approximation which is equivalent to averaging points. Results Coarse-graining is mathematically identical to the Haar wavelet transform approximations. Thus, multiscale entropy is entropy computed on sub-signals derived from approximations of the Haar wavelet transform. By describing coarse-graining algorithms properly as Haar wavelet transforms, the meaning of ‘scales’ as wavelet approximations becomes transparent. The computed value of entropy is different with different wavelet basis functions, suggesting further research is needed to determine optimal methods for computing multiscale entropy. Conclusion Coarse-graining is mathematically identical to Haar wavelet approximations at power-of-two scales. Referring to coarse-graining as a Haar wavelet transform motivates research into the optimal approach to signal decomposition for entropy analysis.