# A Robust Algorithm for Optimisation and Customisation of Fractal Dimensions of Time Series Modified by Nonlinearly Scaling Their Time Derivatives: Mathematical Theory and Practical Applications

Authors: Franz Konstantin Fuss
Journal: Computational and Mathematical Methods in Medicine
 (2013)

---

## Abstract

Standard methods for computing the fractal dimensions of time series are usually tested with continuous nowhere differentiable functions, but not benchmarked with actual signals. Therefore they can produce opposite results in extreme signals. These methods also use different scaling methods, that is, different amplitude multipliers, which makes it difficult to compare fractal dimensions obtained from different methods. The purpose of this research was to develop an optimisation method that computes the fractal dimension of a normalised (dimensionless) and modified time series signal with a robust algorithm and a running average method, and that maximises the difference between two fractal dimensions, for example, a minimum and a maximum one. The signal is modified by transforming its amplitude by a multiplier, which has a non-linear effect on the signal’s time derivative. The optimisation method identifies the optimal multiplier of the normalised amplitude for targeted decision making based on fractal dimensions. The optimisation method provides an additional filter effect and makes the fractal dimensions less noisy. The method is exemplified by, and explained with, different signals, such as human movement, EEG, and acoustic signals.


---

## Body

## 1. Introduction

The Hausdorff-Besicovitch dimension,DH, is defined by most efficient covering [1] of irregular curves and surface profiles, usually approximated by the box-counting, circle-counting, or yardstick methods. In these methods, an irregular curve is covered by N number of boxes of size r, circles of radius r, or rulers of length r. The Hausdorff dimension, DH, is then determined from
(1)DH=limr→0logNlog(1/r).This method dates back to Felix Hausdorff who coined the term “fractal dimension” (“gebrochene Dimension,” [2]) by extending Carathéodory’s [3] p-dimensional measure to noninteger values of p. It was reinvented by Richardson [4], for investigating the complexity and ruggedness of coastlines with yardstick methods, who empirically found the following equation:
(2)Σl∝l-α,wherel is the length of the yardstick (e.g., in km), Σl is the sum of all yardsticks covering the total length, and the exponent α characterises the irregularity of the coastline or the frontier. It was Mandelbrot [5] who recognised that this exponent corresponds to a fractal dimension, to be calculated from the gradient of logN against log1/r.Rewriting Richardson’s equation (2) in the form of
(3)Lr=λr1-D,whereL is the length of a curve (a coastline or frontier in Richardson’s cases), λ is a constant, and D=DH. Considering that L=Nr, (3) implies that
(4)N=λ(1r)D,(5)logN=logλ+Dlog1r,wherelogλ is the intercept and D is the gradient when plotting logN against log1/r, or
(6)-logNlog(r)=-logλlog(r)+D,which shows that plotting-logN/logr against logr delivers a reciprocal function of log r, with the asymptotic value of D, comparable to finite element convergence tests. In fact, increasing the number of elements N results in r→0.The Hausdorff dimensionDH is therefore conveniently explained as the asymptotic value of the ratio of log N to log1/r as r→0. The fact that D is the exponent in (4) links DH to the Hurst exponent H, considering that DH=2-H.In addition to the standard box-counting, circle-counting, or yardstick methods, more effective methods were developed, such as the methods by Katz [6], Higuchi [7], Sevcik [8], and Raghavendra and Dutt (multiresolution box-counting MRBC and multiresolution length-based MRL methods [9]). The choice of mathematical methods gained fresh momentum when Raghavendra and Dutt [9, 10] compared existing methods and found Katz’ method [6] to be highly inaccurate. They also demonstrated the bad correlation of a hypnogram with the corresponding sleep EEG’s fractal dimensions calculated with Katz’ method, whereas Higuchi’s method provided a good correlation [10]. Based on Raghavendra and Dutt’s [10] results, Castiglioni [11] investigated Katz’ method, identified flaws, and argued that Katz’ fractal dimension is “strongly influenced by amplitude, duration and units of measure of the waveform, resulting practically useless for any real biomedical application.” As Katz [6] calculates the Euclidean distance between consecutive points, Castiglioni [11] criticises the fact that this method “sums together terms with different units” (e.g., the unit of the time scale such as seconds and the unit of the signal amplitude such as millivolt). Castiglioni [11] suggests an alternative method, based on Mandelbrot’s [12] approach that considers a mono-dimensional space, that is, the signal amplitude only, instead of a two-dimensional approach (signal amplitude and time scale). Higuchi’s [7] method is also calculated in a monodimensional space. According to Blaszczyk and Klonowski [13], “…it is important that scaling of the signal amplitude, has no influence on the results, since it causes only parallel shifting of the regression line along theln(L(k))axis[annotation: ln(L(k))=logN in (5)], without changing its angular coefficient [annotation: angular coefficient = gradient D of (5)].” This refers to the principle of a mono-dimensional space, where only the signal amplitude is considered for calculating the fractal dimension. In contrast to that, scaling of the signal amplitude when using the Euclidean distance affects the fractal dimension (Castiglioni [11]).The problem of calculating the length of a signal through the Euclidean distance of amplitude and time dimensions is that quantities of different units, for example, milliVolt (mV) and seconds (s), are squared and summed up, and finally the sum is square rooted. This does not only apply to Katz’ [6] method but also to Raghavendra and Dutt’s [9] multiresolution length-based MRL method. Moreover, Raghavendra and Dutt’s [9] multiresolution box-counting MRBC method calculates the ratio of quantities of different units: the number of boxes required to cover the distance h between two consecutive data points is ceil(|h|/dt), where ceil is the ceiling function and dt is the reciprocal value of the sampling frequency. Subsequently, the amplitude of the next data point y(i+1) is updated by summing up the amplitude of the previous datum y(i), the distance h, and dt: y(i+1)=y(i)±|h|∓dt, thereby summing up different units (e.g., mV and s).These problems can be overcome when using Sevcik’s method [14], by normalising the amplitude of a signal to its range (ymax-ymin) and the time axis to the duration of the signal (tmax), thereby transforming the signal into a unit square. This procedure solves the problem of confounding different units but renders signals with different data ranges and periods incomparable. If two signals recorded at 100 Hz for periods of 5 s and 10 s are compared, then Δx of the unit square is 0.002 and 0.001, respectively. Assuming the signals have the same ymax and ymin, then signal 1 appears to be stretched by a factor of 2 in x-direction (former time scale) compared to signal 2, that is, the x-scale of signal 1 is multiplied by two. The same principle applies to equal period but different data range signals: if the data range of signal 2 is twice the one of signal 1, then Δy of the unit square of signal 1 is twice as large as Δy of signal 2, and the amplitude of signal 1 is multiplied by two (multiplier m=2) compared to signal 2. As already mentioned by Castiglioni [11], scaling of the signal’s amplitude, that is, applying different multipliers to x- and y-axes, results in different fractal dimensions when using the Euclidean distance for calculating the fractal dimensions. Whereas the unit square method appears to be a uniform method across all signals, Sevcik’s method in fact applies variable multipliers m to signal amplitudes y, namely, m=tmax/(ymax-ymin). However, in order to compare the fractal dimensions across signals, the multiplier m must be the same, when using the Euclidean distance for calculating the fractal dimensions. In contrast to that, when applying a mono-dimensional space, that is, Higuchi’s method, to determining the fractal dimension of a signal, then the multiplier m has no effect [13].The comparability problem when transforming a signal into a unit square could be overcome when using a normalisation factor that is common to all signals that are to be compared in terms of their fractal dimensions. Such normalisation factors could be as follows: (a) the resolution of the recording device (y-axis); (b) standard deviation of the signal; and (c) the window width (x-axis) used for a running average method. The disadvantage when using the resolution of the recording device is that different research teams might use recording devices with different resolution, or a company releases the next generation of recording devices with better resolution. In these cases, the fractal dimensions of signals are no longer comparable. The disadvantage when using the standard deviation of the signal is that the standard deviation is different in similar signals and even changes within the signal’s time series. The disadvantage when using the window width of a running average method is that the optimal window width has to be determined beforehand, for example, from sensitivity analysis, and fractal dimensions of a signal cannot be compared any more when introducing a second factor, the multiplier, together with, and in addition to, the window width. Doubling the window width corresponds to multiplying the x-axis by 0.5. The only way of avoiding scaling problems when normalising the signal as explained above and still obtaining a dimensionless number is to normalise the signal to unit amplitude and unit time. In the end, it does not matter which parameter the time series signal is normalised to, be it amplitude range, maximum, or resolution; time period or window width; unit amplitude and unit time; as the whole exercise serves only to transform the signal data into dimensionless values in both amplitude and time dimension. This means that a time series signal, measured in milliVolts (amplitude axis) and seconds (time axis), has its amplitude and time normalised to 1 mV and 1 s, respectively.The aim of this paper is to test Castiglioni’s [11] hypothesis, namely, that scaling of a signal, that is, applying different multipliers to normalised and dimensionless y- or x-axes, results in different fractal dimensions. Furthermore, it will be shown how scaling of a signal’s amplitude affects the Euclidean distance between data points and how this principle modifies the signal when viewed and assessed in a monodimensional space for calculating the modified signal’s fractal dimension with Higuchi’s method [7]. Finally, it will be explored whether scaling of normalised and dimensionless y- or x-axes provides an optimisation method for calculating fractal dimensions of the modified signal, which enables better decision making, classification, and quantification of events occurring throughout a time series. If decisions hinge on the fractal dimension of a biomedical signal (e.g., automatic detection of ventricular tachycardia), then the difference in fractal dimension between physiological and pathological signals (or more generally, between signals of different classes) should be as clear as possible. Thus, the question arises, whether we can “design” the fractal dimensions by scaling the amplitude of related signal classes such that the difference in fractal dimensions of the modified signal increases and becomes clearer and more pronounced? It has to be clearly stated at that point that the targeted exploration of the optimisation method for fractal dimensions refers to the fractal dimensions of a modified signal and no longer to the fractal dimensions of the original signal.


## 2. Statement of the Problem

Figure1 shows an acceleration signal and the corresponding DH calculated with three different methods: Higuchi’s method [7], Raghavendra and Dutt’s MRBC [9], and the method and algorithm developed in this study. In some parts of the signal, the DH of all three methods are practically identical in magnitude and shape; in other parts, however, they diverge significantly. Figure 1 serves only the purpose of demonstrating these differences, without making a statement of which method is the best. In fact, as will be shown in Section 7 of this paper, all three DH are of the same quality and therefore valid and correct (with the exception of DH<1). The point here is not the identification of the best method but rather that method which serves best for one’s own means, such as for strategic decision making and improved signal classification.Figure 1
Acceleration of a wheelchair recorded at 60 Hz during a wheelchair rugby match (data from [15]) against time (bottom subfigure); fractal dimension DH (running average with a window width of 151 data points over 2.5 s) of the acceleration signal calculated with three different methods (middle subfigure): Higuchi’s [7] method, Raghavendra and Dutt’s [9] MRBC, and the method developed in this study (cf. Section 4); top subfigure: absolute difference in DH between the three methods.The principle of the MRBC method is to derive the number of boxes covering the signal amplitude changeΔh per time step Δt by making the ratio of Δh to Δt integer with a ceiling function and summing up the number of boxes. The principle of Higuchi’s method is to sum up the change in amplitude Δh normalised to the time step Δt. This principle is still comparable to box-counting methods, however, by using “boxes” with a “noninteger” height or side length. If a string of data consists only of 0 and 1 (positive and negative), with a device resolution of 1, that is, zero signal with a slight noise, then the number of boxes is zero if two consecutive data are equal. In the MRBC method, relatively small changes in amplitude (with respect to Δt) always deliver a single box.The problem for both methods is that a constant signal still has a length—in time direction, but not in amplitude direction. Nevertheless, both methods return zeroΔh in such cases. This accounts for zero number of “boxes” (integer or non-integer ones) despite the apparent length of the signal. This problem is not only imminent in longer segments with consecutively identical data, but also influences the DH if only two consecutive data points are of equal value.Summing up the number of boxes within a data window at frequencies off, f/2, and f/4, the gradient of logN against logf (Figure 2(a)) can be smaller than 1 in the MRBC method and even 2 in Higuchi’s method, even at high correlations (r>0.998). It has to be noted that in time series, 1≤DH≤2. From 369.6 s to 369.95 s in Figure 2, the average difference between Higuchi’s method and the MRBC method was 0.969 (Higuchi: 1.986, MRBC: 1.017) with a maximum difference of 0.99 (Higuchi: 2, MRBC: 1.01). It is surprising that two well-performing algorithms deliver opposite dimensions in extreme signals.(a)LogN against logf; N=sumofamplitudes (Higuchi’s method) or boxes (MRBC) of the signal at different frequencies; f=60 Hz (original recording frequency), 30 Hz, and 15 Hz; gradient of DH=0.79 (MRBC) was taken at 372.5 s in Figure 1; gradient of DH=1.95 (Higuchi’s method) was taken at 370 s in Figure 1; (b) logN against time (window width = 151 data).
(a)
(b)The reason for divergingDH values of Higuchi’s method and the MRBC method is explained as follows. If the ratio of Δh to Δt at the original sampling frequency f is slightly smaller than 1 (e.g., 0.92), then the number of boxes (N) in the MRBC method is 1, whereas the corresponding parameter (N) of Higuchi’s method remains at 0.92. The ratio of Δh to Δt at f/4 is close to 0.23(=0.92/4) in Higuchi’s method but still 1 in the MRBC method due to the ceiling function. Logarithming the sum of N derived at f leads to comparable data with MRBC and Higuchi’s methods (Figure 3(b)). However, logarithming the sum of N derived at f/4 results in far smaller data values when using Higuchi’s method than when applying the MRBC method. This is apparent in Figure 2(b) between seconds 385 and 404 where the data derived at f/4 diverge significantly. The larger the difference in logN data, the steeper the gradient is and thus the larger the fractal dimension is. This explains why Higuchi’s method can deliver a fractal dimension of 2, whereas the MRBC method produces a fractal dimension of 1 of the same part of the signal. The ceiling function of the MRBC method leads to different scaling factors at f, f/2, and f/4 if |Δh|/Δt is slightly smaller than 1, which consequently affects the fractal dimension.(a) Acceleration signal of Figure1 from 337 s-338 s; y=amplitude; (b) y-differential (time derivative of the signal) L=|Δy| (Higuchi’s method) and Euclidean distance L=m2Δy2+Δx2 at different m against time (L is normalised such that the average L and the area under the curves are identical in all 3 datasets); (c) Euclidean distance m2Δy2+Δx2 at different m against y-differential |Δy|.
(a)
(b)
(c)Esteller et al. [16] and Raghavendra and Dutt [9, 10] tested different fractal dimension algorithms with continuous nowhere differentiable functions (CNDFs, [17, 18]) of known and controllable fractal dimension DH and with specially designed waveforms (with difference in amplitude and frequency) but not with actual time series signals (biomedical, acoustic, etc.). Such CNDFs are the deterministic Weierstrass cosine, Weierstrass-Mandelbrot cosine, and the Knopp function, as well as the stochastic Brownian motion function. The best performing methods were the Higuchi’s method and Raghavendra and Dutt’s MRBC and MRL. This proves that these methods are perfectly applicable to the aforementioned CNDFs but not necessarily how well these methods behave in general time series.


## 3. Solution to the Problem

In order to assess the influence of scaling a signal on its fractal dimensionDH, DH has to be determined in a 2-dimensional space rather than in a mono-dimensional one. It is therefore required that the length of a signal is calculated from the Euclidean distance between data points of time series. This makes DH variable when scaling the amplitude [11], to be shown subsequently. The main question in this case is not “what is the correct method of calculating fractal dimensions?,” but rather “how can we maximise the information to be obtained from fractal dimensions?.” The term “maximising the information” is seen from an engineering point of view, that is, using the difference in DH of two signals (or parts thereof when using a sliding window method) for practical application, for example, for automated decision making. This would apply to classifying sleep stadia from EEG signals, or identifying arrhythmias from EKG signals, by setting off an alarm at the onset of the latter.As1≤DH≤2, two dimensions are anyway required, of the same physical quantity and measurement unit, as a DH of 2 does not apply to a mono-dimensional space. This is achieved when plotting signals on paper or on the screen, and then they become real two-dimensional objects. Coastlines, rivers, and the Brownian motion are 2D curves with the same units in the two orthogonal directions. Time series signals have different units (e.g., mV and s) and therefore have to be transformed into a dimensionless space by normalisation. The difficulties of normalisation were already pointed out in Section 1. Therefore, the normalisation suggested in Section 1 is applied:
(7)y=signalamplitude(e.g.mV)unitamplitude(e.g.mV),x=signalperiod(s)unittime(s),wherey and x are dimensionless and the reciprocal value of x equals the dimensionless frequency f0=1/x. The suggested normalisation to unit amplitude and unit time serves only for avoiding prescaling of the amplitude, which will be modified subsequently by a multiplier m. It is essential that this multiplier is the same across all signals to be compared.After normalisation, a variable multiplierm is applied to the signal’s amplitude for scaling purposes and for modifying the signal. As the Euclidean distance L between two data points is Δy2+Δx2 (where x and y are dimensionless and unitless), it becomes m2Δy2+Δx2 after applying the multiplier m. The smaller m is, the more L is dominated by Δx, the normalised and dimensionless time of (7). The larger m is, the more L is dominated by Δy, the normalised and dimensionless signal amplitude of (7). If m→∞, then L→mΔy, and the fractal dimension calculated from this modified signal corresponds to Higuchi’s fractal dimension of the original signal. As Higuchi’s fractal dimension is calculated in a mono-dimensional space, the data differential is |Δy|; the fractal dimension based on which is unaffected by scaling.In order to demonstrate how the signal is modified by scaling the amplitude with the multiplierm, the amplitude differential |Δy| and the Euclidean distance L=m2Δy2+Δx2 of the signal shown in Figure 3(a) are plotted in Figure 3(b). The difference between amplitude differentials at m=∞ and m=1 is extremely small, resulting in Higuchi’s fractal dimension if 1≤m≤∞ in this specific part of the signal. When reducing m, the normalised L (Figure 3(b)) below the average closes in on the normalised average L faster than the normalised L above the average. This non-linear scaling process is also shown in Figure 3(c). The time derivative of the original signal is therefore non-linearly modified when replacing the amplitude differential by the Euclidean distance. In other words, signal modification by replacing the amplitude differential by the Euclidean distance reduces the difference between mean amplitude differential and differential values below average faster than the difference between differential values above average and mean differential.If the amplitude multiplierm=∞, then the Euclidean distance is identical to the scaled amplitude differential |Δy|, and therefore the fractal dimensions of the modified signal are identical to Higuchi’s fractal dimensions. If the amplitude differential |Δy| is sufficiently large compared to Δx, then multipliers m between infinity and values far smaller than infinity (e.g., 1 in the signal shown in Figure 3(a)) deliver Euclidean distances very close to |Δy|, and therefore fractal dimensions are similar to the original signal. The smaller m is, the more the Euclidean distance approaches Δx, and the more the signal is converted to a horizontal line. The resulting fractal dimension of the modified signal is therefore 1 if m=0. Consequently, the fractal dimension DHm of the modified signal (at any m) ranges between the actual fractal dimension DHo of the original signal and unity: 1<DHm<DHo, where DHm applies to 0<m<∞, and DHo applies to m=∞, as DHm→DHo if m→∞.Determining and selecting the optimal multiplierm depends on the maximal difference between the fractal dimensions of two signals (modified by applying the amplitude multiplier m) to be compared for decision making. This optimisation process is explained subsequently, after specifying the algorithm and testing its accuracy with continuous nowhere differentiable functions (CNDFs, [17, 18]).


## 4. Robust Algorithm

A signal (Figure4(a)) with amplitude y (dimensionless) is recorded at frequency f0 (dimensionless) over a window width of w data points.Frequency reduction of a signal; (a) original signal atf=60 Hz; (b) signal reduced to f=30 Hz with two solutions (insert): every other even point (red) and every other odd point (green); insert: ↔= 2nd half of that green segment which precedes the first green line connecting points 2 and 4; (c) signal reduced to f=15 Hz with four solutions; (d) magnified part of Figure 4(c); the signal starts at 14.5 s; red, yellow, green, and blue lines start at points 1, 2, 3, and 4, respectively; therefore, 1/4, 1/2, and 3/4 of the preceding yellow, green, and blue segments, respectively, have to be included such that each coloured signal starts at 14.5 s exactly.
(a)
(b)
(c)
(d)For modifying the signal, the magnitude of the amplitudey is multiplied by the multiplier m. This method will be subsequently referred to as modified amplitude fractal dimension method (MAFDM).The Euclidean distanceL between two data points is
(8)Li=m2Δy2+Δx2=m2(yi+1-yi)2+(1f0)2,whereyi is the normalised amplitude of an ith data point.The relative lengthR of distance L normalised to Δx is
(9)Ri=LiΔx=f0m2(yi+1-yi)2+(1f0)2.The relative length over window widthw starting at datum i results from
(10)Rw=(Ri+Ri+1+⋯+Ri+w-1)=∑i=1i+w-1Ri.Reducing the signal to halff0 (Figure 4(b)) by taking every other datum yields
(11)Li=m2(yi+2-yi)2+(2f0)2,Ri=f02m2(yi+2-yi)2+(2f0)2.The relative length over window widthw starting at datum i delivers
(12)Rw=(Ri+Ri+1+⋯+Ri+w-2)+Ri-1(1/2)+Ri+w-2+1(1/2)2=∑i=1i+w-2Ri+Ri-1(1/2)+Ri+w-2+1(1/2)2.Equation (12) is divided by two as Rw is the average of two solutions (Figure 4(b)), resulting from taking every other even datum or every other odd datum (insert in Figure 4(b)). Both solutions are embedded in ΣRi in (12). The terms 0.5Ri-1 and 0.5Ri+w-2+1 are due to the fact that the first green L in Figure 4(b) starts only at point no. 2 (insert in Figure 4(b)), and the last green L ends at the point preceding the last one of the shown window. This means that half-L segments were missing before point 2 (↔ in Figure 4(b)/insert) and after the second last point, if they were not included in the first place.Reducing the signal to a quarterf0 (Figure 4(c)) yields
(13)Li=m2(yi+4-yi)2+(4f0)2,Ri=f04m2(yi+4-yi)2+(4f0)2.The relative length over window widthw starting at datum i delivers
(14)Rw=((Ri+Ri+1+⋯+Ri+w-4)+Ri-134+Ri-224+Ri-314+Ri+w-4+134+Ri+w-4+224+Ri+w-4+314)×(4)-1,(15)Rw=(∑i=1i+w-4Ri+Ri-134+Ri-224+Ri-314+Ri+w-4+134+Ri+w-4+224+Ri+w-4+314∑i=1i+w-4Ri)×(4)-1.Equation (15) is divided by four as Rw is the average of four solutions (Figure 4(c)). The terms 0.75Ri-1, 0.75Ri+w-4+1, 0.5Ri-2, 0.5Ri+w-4+2, 0.25Ri-3, and 0.25Ri+w-4+3 are required because three-quarters of the preceding blue L have to be added to the first blue L (which starts at point 4; Figure 4(d)), half of the preceding green L has to be added to the first green L (which starts at point 3), and a quarter of the preceding yellow L has to be added to the first yellow L (which starts at point 2, whereas the first red L starts at point 2).Generalising the procedure, withw = window width, j = start datum of window, and n=multiplier of Δx (if n=4, then 4Δx=4/f0), i and l are counters. Note that
(16)Rj,w,n=(∑i=jj+w-nRi+∑l=1nRj-ln-ln+∑l=1nRj+w-n+ln-ln)×(n)-1=(∑i=jj+w-nRi+∑l=1nn-ln(Rj-l+Rj+w-n+l))(4)-1,where(17)Ri=f0Lin,Li=m2(yi+n-yi)2+(nf0)2.Ifn=1, (16) reduces to Rj,w,n=∑i=jj+w-nRi, that is, to (10).It is important to consider equal distribution ofn on a logarithmic scale, that is, n=1,2,4,8…, or n=1,3,9…, and not n=1,2,3,4,5, as in the latter case n is weighted towards smaller frequencies.The fractal dimension of the modified signal,DHm, results from
(18)logRj,w,n=DHmlogf0n+I,whereDHm is the gradient and I is the intercept.In summary, the new method is characterised by the following:(1)
multiplierm applied to modifying the signal’s amplitude y;(2)
Euclidean distanceL between data points;(3)
different time resolutions and frequencies(f0,Δx=original,2Δx=simulatedhalffrequency,…,Δx=1/f0);(4)
averaging of sum of distances for smaller frequencies (half frequency results in 2 datasets of distances);(5)
running the average ofDHm versus x;(6)
DHm is gradient of -log(ΣLΔx) versus log(Δx) or log(ΣLΔx) versus log(f0) checked by the goodness of fit (correlation coefficient), considering that there are no higher sampling frequencies available other than the original f0;(7)
equidistant lower frequencies such as1,2,4,8,16…(not1,2,3,4,5…) or 1,3,9,27… on a log scale.


## 5. Influence of the Signal Amplitude onDHm

In a triangular signal (Figure5) of constant amplitude h (unity) and Δx=1/f0, the amplitude h is varied by the multiplier m.Figure 5
Triangular signal with amplitudeh against normalised time x and normalised time resolution k, where k=nΔx.The time resolution is odd, that is,k=1Δx,3Δx,5Δx,7Δx,9Δx…nΔx.The length of diagonal atn=3,5,7,9… is
(19)Lk>1Δx=(mh)2+(nf0)2.The corresponding length of the original signal(k=1Δx) up to n is
(20)Lk=1Δx=n(mh)2+(1f0)2.The square root is multiplied byn as the total signal length corresponds to a time period the length of which is nΔx. For example, at n=11 (Figure 5), the original triangular signal (k=1Δx) consists of 11 segments, whereas the green diagonal (k=1Δx, Figure 5) consists of a single line.The relative lengthR is defined as follows:
(21)Rk>1Δx=f0n(mh)2+(nf0)2,Rk=1Δx=f0n(mh)2+(1f0)2.The slopeDHm of a line connecting two points, with the first point defined by relative length Rk=1Δx and frequency f0=1/(1Δx) and the second point defined by Rk>1Δx and f0=1/(nΔx) with n=3,5,7…, is calculated from
(22)DHm=(log(f0n(mh)2+(1f0)2)-log(f0n(mh)2+(nf0)2))×(log(f0)-log(f0n))-1,(23)A1,2=limm→0m→∞((-log((f0n)(mh)2+(nf0)2))log(f0n(mh)2+(1f0)2)-log(f0n(mh)2+(nf0)2))×(log(f0)-log(f0n))-1(-log((f0n)(mh)2+(nf0)2))log(f0n(mh)2+(1f0)2)),whereA1,2 are the asymptotic values at m→0 and m→∞, respectively. Note that
(24)A1,2=limm→0m→∞(log(f0n(mh)2+(1/f0)2(f0/n)(mh)2+(n/f0)2)×(logf0f0/n)-1(f0n(mh)2+(1/f0)2(f0/n)(mh)2+(n/f0)2)).Cancelling outf0 and calculating each A individually,
(25)A1=limm→0(log(n2(mh)2+(1/f0)2(mh)2+(n/f0)2)×(log(n))-1(mh)2+(1/f0)2(mh)2+(n/f0)2),A1=log(n2((1/f0)2/(n/f0)2))log(n)=log(n2(1/f0)(n/f0))×(log(n))-1=log(n2(f0/f0n))log(n)=log(n)log(n)=1.This result corresponds to the fractal dimension of a straight line (asm, and thus the amplitude, is 0), which has a DHm of 1. Note that
(26)A2=limm→∞(log(n2(mh)2+(1/f0)2(mh)2+(n/f0)2)×(log(n))-1(n2(mh)2+(1/f0)2(mh)2+(n/f0)2)),A2=log(n2C)log(n),where(27)C=limm→∞(mh)2+(1/f0)2(mh)2+(n/f0)2=1.Thus,(28)A2=log(n2)log(n)=2lognlogn=2.This result corresponds to a densely filled area asΔx becomes relatively small with respect to amplitude of m→∞; the DHm of such an area equals 2.Ifm→0 and m→∞, then DHm asymptotes to 1 and 2, respectively, in this specific triangular signal (Figure 5), the DHo of which calculated with Higuchi’s method equals 2. Scaling the amplitude via m corresponds to stretching or compressing the signal between an area and a straight horizontal line, respectively. This proves that the multiplier m of the amplitude decisively influences the signal’s fractal dimension which varies between 1 and 2 (Figure 6) in this triangular signal and spans, in general, the range between DHo and 1 in different parts of a time series. Figure 6 shows the spectrum of DHm, calculated from (22), against the multiplier m. This spectrum (with a positive gradient) must not be confused with the fractal spectrum (with a negative gradient), calculated from generalised Rényi’s entropy (cf. Kulish et al. [19]). The DHm spectrum (Figure 6) is decisive for the new (modified amplitude fractal dimension method) MAFDM as it enables the selection of m for optimisation and customisation purposes, to be explained further later.Figure 6
Amplitude spectrum of the fractal dimensionDHm of the triangular signal of Figure 5 at different time resolutions and different multipliers m of the signal amplitude.


## 6. Accuracy of the Proposed Algorithm

The accuracy of the algorithm for the MAFDM, (16)–(18) at m=1, was tested with four CNDFs [17, 18] in order to benchmark it against the performances of Higuchi’s and MRBC methods, as reported by Raghavendra and Dutt [9, 10].(
1) Knopp Function
K
(
t
):
(29)K(t)=∑k=1∞ak〈〈bkt〉〉=∑k=1∞ak|bkt-⌊bkt+0.5⌋|,where〈〈x〉〉 denotes a triangular wave function, that is, the distance from x to the nearest integer, and ⌊x⌋ denotes the floor function; 0.5≤a≤1, b>1, and ab≥1.If0≤t≤1, then the Minkowski-Bouligand dimension DMB is
(30)DMB=log4alogb.Keepingb constant and calculating a as a function of DMB(31)a=bDMB4.Thus,(32)K(t,DMB)=∑k=1∞(bDMB4)k〈〈bkt〉〉.D
MB
=
D
H if the fractal is strictly self-similar. b was set to 2, k was limited to 50, and K(t,DMB) was calculated for one second at a frequency of 1 kHz. The results are shown in Figure 7(a). For the proposed algorithm of the MAFDM, DHm is over/underestimated at small (close to 1) and large (close to 2) theoretical DH. The MAFDM is more accurate than Higuchi’s and MRBC methods, except for DH≥1.9.Accuracy of the newamplitude spectrum fractal dimension method (MAFDM; red curves; m = 1) compared to Higuchi’s method and the MRBC method, tested with the following continuous nowhere differentiable functions (CNDFs): Knopp/Takagi function (a); Weierstrass cosine function (b); Weierstrass-Mandelbrot function (c); Brownian motion (d).
(a)
(b)
(c)
(d)(
2
) Weierstrass Cosine Function
W
(
t
,
H
):
(33)W(t,H)=∑k=0∞γ-kHcos(2πγkt)k,whereγ>1 and H is the Hurst exponent (=2-DH). γ was set to 5, k was limited to 50, and W(t,H) was calculated for one second at a frequency of 1 kHz. The results are shown in Figure 7(b). At medium DH, the MAFDM is marginally less accurate (maximally by 2.5% of the theoretical DH) than Higuchi’s and MRBC.(
3
) Weierstrass-Mandelbrot Function
W
m
(
t
,
H
):
(34)Wm(t,H)=∑k=-∞∞1-cos(bkt)bHk.For comparative reasons,b was set to 1.5, k was limited to 50, and Wm(t,H) was calculated for one second at a frequency of 1 kHz. The results are shown in Figure 7(c). The MAFDM has the same accuracy as the MRBC method and performs better than Higuchi’s method.(
4
)
Brownian Motion Function. The time series was calculated in Matlab R2010b (by MathWorks, Natick, MA, USA) with the command wbfm(H,n), where H is the Hurst exponent (=2-DH) and n is the number of data generated. As the Brownian motion function is stochastic, the shapes of the curves are not identical, and therefore ten different fractal curves were tested for each DH (from 1 to 2, in 0.1 increments). The results are shown in Figure 7(d). The MAFDM has roughly the same performance as the MRBC method and Higuchi’s method.In summary (Figure8), the MAFDM did not show any disadvantage compared to the MRBC method and Higuchi’s method, delivered comparable results, and is therefore considered sufficiently accurate. The multiplier m was set to 1 in order to compare DHm of the unscaled signal to DHo of Higuchi’s method. DHm, however, is m dependent (Figure 9(a)), and the DHm values at m=1 are at the beginning of the right-hand asymptotic segment. The sampling frequency of CNDFs influences the accuracy as well (Figure 9(b)); the higher the frequency is, the closer the theoretical DH to the estimated one is. In contrast to that, DHm is relatively insensitive to window widths (Figure 9(b)). The DHm data obtained from the 10 Hz signal are generally higher than the ones of the 100 Hz signal. The reason for this is that the deterministic CNDFs achieve a higher DHm by increasing the amplitude of their higher harmonics. The smaller the sampling frequency, the more irregular (“chaotic”) is the signal and the higher is the estimated DHm.Figure 8
Summary of the accuracy of themodified amplitude fractal dimension method (MAFDM; m=1) tested with the four CNDFs (nowhere differentiable functions).(a)DHm of Knopp function against log m; (b) DH of Knopp function against sampling frequency at different number of samples [window width ww]; 10 Hz:ww=100,1000,10000 data; 100 Hz:ww=100,1000 data; 1000 Hz:ww=1000,10000 data; 10000 Hz:ww=10000 data.
(a)
(b)


## 7. Optimisation and Customisation Method

The optimisation method serves for improved decision making. For example, for automated distinction between a physiological signal and a pathological one (possibly due to a life-threatening condition), theirDHm must not overlap, that is, must not result in false positive or false negative diagnoses. Therefore, the DHm of the physiological signal must be as small as possible and the one of the pathological on as large as possible (or vice versa). This is achieved by optimising the amplitude multiplier m. The optimal multiplier m is neither selected arbitrarily nor subjectively but rather follows engineering optimisation methods, namely,(i)
maximising the difference between maximal and minimalDHm of signals or parts thereof;(ii)
maximising the difference between maximal and averageDHm;(iii)
maximising the ratio of maximal to averageDHm.Maximally separating theDHm of physiological and pathological signals is achieved by plotting the m-dependent DHm spectra of both signals, and by identifying the maximal DHm differential,
(35)ΔDHm=DHmmax-DHmmin,whereDHmmin and DHmmax are the average DHm of the physiological and the pathological signals, respectively, if the pathological signal is expected to have the higher DHm, which anyway results from the spectra. For identification of events within a signal, it depends on the number of events and whether they are relatively evenly distributed. If there are more than two different events and none of them is extremely rare, then those parts of the signal that are expected to have the smallest and largest DHm are identified and their ΔDHm is maximised according to (35). This is exemplified in Figure 10, in the same signal shown in Figure 2.Acceleration of a wheelchair recorded at 60 Hz during a wheelchair rugby match (data from [15]) against time (c); the two arrows refer to the time data with the lowest and highest DH used for determining the amplitude spectrum of Figure 11; (b) fractal dimension DHm (running average with a window width of 151 data points over 2.5 s) of the acceleration signal calculated for different amplitude multipliers m (cf. Figure 11); note that the fractal dimension at m→∞ corresponds to the one calculated with Higuchi’s method in Figure 2; (a) optimised DHm at m=0.8.
(a)
(b)
(c)Figure10 shows the spectrum across different m values against the time, as well as the events that were considered to have minimal and maximal DHm. The maximal ΔDHm is identified from Figure 11, where minimal and maximal DHm were plotted against the logarithm of m and the optimised value of m was determined from maximal ΔDHm. At m→0 and m→∞, both the highest and smallest DH asymptote to one and two, respectively. The maximal DHm range amounts to ΔDHm = 0.78. In this specific case, it turned out that the optimal m is close to 1, that is, m=0.8, which means that the original signal is coincidentally close to the optimised one. The unit of the unnormalised acceleration signal is g (9.81 m/s2). If the signal was recorded in m/s2, then m would have been 0.08, and ΔDHm at m=0.8 would have been reduced to one-third of ΔDHmmax. When transforming the signal into a unit square, that is, using Sevcik’s unit square method [14], the multiplier of the normalised y-amplitude would have been m=43.3 (logm=1.64, Figure 11, amplitude range 4.62g, time period 200 s, m=200/4.62), and ΔDHm would have been reduced to 6.5% of ΔDHmmax. When using Higuchi’s method [7], the multiplier would have been m>1000, and ΔDHo would have been reduced to zero (Figures 10 and 11). The multiplier m of Higuchi’s method results from not calculating the Euclidean distance and thereby reducing the normalised time dimension to zero, which in turn causes m→∞. The multiplier m of Sevcik’s method results from transforming the signal to a unit square, thereby stretching the normalised amplitude axis with respect to the normalised time axis.Figure 11
Fractal dimensionDHm against the amplitude multiplier m; DHmmax=DHm with the highest value (at 371.1 s ±75 data of Figure 10, window width of 2.5s=151data); DHmmin=DHm with the smallest value (at 423.5s±75 data of Figure 10); DHmmax-DHmmin=ΔDHm, the DHm differential; optimal amplitude multiplier m is defined at the peak of the DHm differential (maximal DHm distance between DHmmax and DHmmin).Plotting theDHm values at different m against time reveals the influence of m on the magnitude of DHm. In Figure 10, DHm coloured in lime corresponds to the maximal DHm range. For DHm coloured in red (maximal DHm across the signal) or purple (minimal DHm), the range approaches zero and is therefore not ideal for distinguishing different events. This is due to the fact that the highest and smallest DHm of this specific signal asymptote to one and two, respectively. At this point, it has to be noted that, whereas DHm values at m→0 always asymptote to one, DHm values at m→∞ asymptote to DHo, the fractal dimension of the original unmodified signal. Therefore, the asymptotic value of DHmmax at m→∞ is not necessarily larger than the one of DHmmin (as will be shown in Section 8). Before reaching their asymptotic values, DHmmax>DHmmin, but at larger m, they can converge and even switch their position. This complicates the usage of Higuchi’s method for obtaining clearly separated data of different signals (or parts thereof), as shown in Figures 2 and 10.If there are only two different events (e.g., physiological and pathological) embedded in a signal, with the latter being rare, then the averageDHm of the entire signal, DHmavg, is compared to DHm of the rare event (DHmmax if the rare event produces a higher DHm than the rest of the signal). DHm of the rare event should not significantly influence the average DHm. ΔDHm then results from
(36)ΔDHm=DHmmax-DHmavg.In order to suppressDHmavg further, thereby accentuating DHmmax, DHm can be optimised as to the DHm ratio as follows:
(37)DHmratio=DHmmax-1DHmavg-1.The three different optimisation methods, (35)–(37) facilitate that the DHm of the different signals are clearly separated by applying a zooming effect to the signals. It will be shown in Section 8, that this zooming effect also provides a filter effect.The basic principle of optimising the amplitude of signals is to find the largest possible difference betweenDHm of different signals or parts thereof. The optimisation methods are exemplified by, and explained in, four different cases in Section 8. The DHm is calculated with the MAFDM in all four cases.


## 8. Results

Case 1 (assessment of emotional reactions with EEG).
Fuss and Kulish (unpublished data) recorded the EEG of test persons during watching short movies with unexpected scary events (the so-called prank videos or screamers) in order to measure the intensity of the emotional pressure. By quickly plotting theDHm at different m, it becomes evident that the DHm correlates with the emotional pressure during the aftermath of startling. It is therefore advisable to suppress the magnitude of the small DHm, by keeping the one of the maximal DHm. The aim is therefore to maximise the DHm range between the highest DHm and the average DHm (Figure 12). The average DHm is calculated across the entire signal and is, in this example, smaller than the average of the highest and smallest DHm. This can be achieved by maximising the DHm differential of highest DHm, and average DHm whereas keeping the DHm differential of average DHm and smallest DHm as small as possible. Alternatively, the DHm ratio of highest DHm minus 1 to average DHm minus 1 can be calculated according to (37). Figure 13 shows the DHm at the original signal amplitude, the range optimised DHm and the DHm optimised to the maximal range between the highest DHm and the average DHm. The effect of the latter is that the magnitude of the highest peak is kept, whereas the magnitude of smaller DHm is reduced. A further effect is that the noise level of the DHm decreases, specifically at small DHm. The optimisation method therefore provides an additional filter effect. The DHm ratio increases as m decreases and finally asymptotes at small m. The optimal m is located at the beginning of the asymptotic segment: m=0.001. The maximal DHm at this multiplier is no longer located at 24.2 s (Figure 13) but rather at 21.9 s, where the EEG signal has its maximal amplitude. Also the DHm noise before and after startling is reduced to a minimum.Figure 12
Fractal dimensionDHm against the amplitude multiplier m; DHmmax=DHm with the highest value (at 24.2s±127 data of Figure 13, window width of 1s=255data); DHmmin=DHm with the smallest value (at 5.5s±127 data of Figure 13); DHm average (avg)=DH averaged over 60 s; max-min, max-avg, and avg-min=DHm differentials; (max-1)/(avg-1)=DHm ratio.Figure 13
EEG signal recorded at 256 Hz against time (bottom subfigure); the two arrows refer to the time data with the lowest and highestDH used for determining the amplitude spectrum of Figure 12; top subfigure: fractal dimension DHm (running average with a window width of 255 data points over 1 s) of the EEG signal calculated for different amplitude multipliers m (cf. Figure 12).Case 2 (comparison of the same signal recorded with different sensors).
Fuss and Chua (unpublished data) investigated the sensors influence onDHm. They recorded the acceleration signal of a rugby wheelchair at different activities (collisions, pushing, coast down, and zero activity) at 100 Hz with three different sensors mounted on the frame of the chair (3G Apple iPhone, 4G Apple iPod Touch, and Minimax by Catapult). For the smart phones, it is evident that the generation number (3G and 4G) was decisive and not whether the device was an iPhone or an iPod Touch. Subsequently, the signal was reduced to 50 Hz by taking every other point. Both signals were range optimised (Figures 14 and 15), the results of which are shown in Table 1.Table 1
Optimal multipliersm of the normalised acceleration amplitude of the three different devices tested.
Optimalm at 100 Hz
Optimalm at 50 Hz
4G iPod Touch
1.0
2.0
3G iPhone
0.4
1.0
Minimax
1.2
2.5Fractal dimensionDHm against the amplitude multiplier m; DHmdifferential=DHmmax-DHmmin; left subfigure: original signal at 100 Hz; right subfigure: frequency reduced to 50 Hz.
(a)
(b)Wheelchair acceleration signal recorded with three different devices at 100 Hz against time (a); the two arrows refer to the time data with the lowest and highestDHm values used for determining the amplitude spectrum of Figure 14; (b): unoptimised fractal dimension DHm of the 100 Hz signal (m=1, running average with a window width of 251 data points over 2.5 s); (c): optimised fractal dimension DHm of the 100 Hz signal; (d): fractal dimension DHo of the original 100 Hz signal at m=1000; (e): optimised fractal dimension DHm of the signal reduced to 50 Hz (running average with a window width of 125 data points over 2.5 s) calculated for different amplitude multipliers m (cf. Figure 14 and Table 1).
(a)
(b)
(c)
(d)
(e)The unoptimisedDHm of the 100 Hz signals (Figure 15(b)) showed pronounced differences between the DHm values. This could be due to the different device resolutions: 3G iPhone: 0.018112g, Minimax: 0.006g, and 4G iPod Touch: 0.000015g. The high resolution of the iPod Touch could be a result of data averaging or filtering. The DHm of the 3G iPhone signal is higher, on average, compared to the two other signals. After optimisation, the DHm of the 3G iPhone signal dropped and fell within the range of the DHm of other two signals. Reducing the frequency to one half merely increases DHm but does not markedly change the trend.Furthermore, theDHm optimisation diagram (Figure 14) shows an interesting result: the two m-spectrum curves intersect, as the DHm of minimal activity at maximal m is higher than the one of maximal activity at maximal m. After the intersection point, the DHm difference is negative. This does not only explain the high values of Higuchi’s method (Figure 15(d)) at near-zero values of the acceleration signal, but also does this justify the optimisation procedure: select those parts of the signal which should provide different DHm and increase the DHm differential to a maximum through optimisation. Higuchi’s method would have been useless in this specific case (Figure 15(d); m=1000), as collisions and low activity would have produced DHm in the same range, and the noise would have also been more pronounced. In fact, it reflects the result of Higuchi’s method shown in Figures 2 and 10, namely, that Higuchi’s method produces maximal DHm in acceleration signals of low-level activity.Case 3 (acoustic signature of a ball impact).
Fuss [20] recorded the impact sound of golf balls at 11.025 kHz and correlated it to the hardness of the balls. In addition to FFT (for determining the power spectrum and the frequencies of the impact sound), the fractal dimension of the impact sound can be calculated. Figure 16 shows the range optimisation diagram with the optimal m at 0.2. Reducing the original amplitude to one-fifth results in a smoother signal, spanning a larger DHm range (Figure 17). Again, the filter effect is apparent.Figure 16
Fractal dimensionDHm against the amplitude multiplier m.Figure 17
Acoustic signal recorded at 11.025 kHz against time (bottom subfigure); top subfigure: fractal dimensionDHm (running average with a window width of 55 data points over 5 ms) of the acoustic signal calculated for different amplitude multipliers m (cf. Figure 16).Case 4 (quality of noise).
Fard, Subic, Lo and Fuss (unpublished data, submitted) recorded the acoustic sound pressure levels of a car seat at different excitation frequencies (27, 31, and 35 Hz). TheDHm of the acoustic signal of the rattling seat suggested that the frequency of 31 Hz produces the highest DHm, whereas the DHm values of the signal after 27 and 35 Hz excitation were almost identical. The difference in DHm between the three signals was optimized, and the average m-value of the maximal range between the 31 Hz excitation and 27&35 Hz excitations was selected (Figure 18). For comparative reasons, m must be the same for all three signals. Even before optimisation, the DHm values of the three excitation frequencies were significantly different at P<0.05 (due to the high recording frequency of 10 kHz).
Figure19 shows the DHm of the original signal (m=1) and the optimised signal amplitude (m=0.0135). Signal amplitude optimisation not only separates the DHm levels of the three different signals but also clearly exhibits a filter effect. DHm at the original signal amplitude suggests a periodic change of DHm only in the 31 Hz excitation signal, whereas the 27 and 35 Hz excitations signals are far from periodic and rather noisy and chaotic in nature. After applying the optimised m value, all signals are clearly periodic.Figure 18
Fractal dimensionDHm (calculated from the mean of the running average) of the three signals against the amplitude multiplier m.Acoustic signals and their corresponding fractal dimensionsDHm (running average with a window width of 201 data points over 20 ms) recorded at 10 kHz against time; SPL: sound pressure level in Pascal; mSPL: SPL multiplied by amplitude multiplier m; (a) fractal dimensions DHm of the acoustic signal calculated from original signals (amplitude multiplier m=1; DHm≈DHo) with mean DHm values of 27 Hz: 1.377, 35 Hz: 1.394, and 31 Hz: 1.441; (b) fractal dimensions DHm calculated from amplitude multiplier m=0.0135 (cf. Figure 18) with mean DHm values of 27 Hz: 1.057, 35 Hz: 1.109, and 31 Hz: 1.348.
(a)
(b)


## 9. Discussion

This paper introduces a method for optimising the fractal dimensionDHm of a signal for improved decision making by scaling the signal amplitude after normalising amplitude and time axes to dimensionless values, such that the Euclidean distance between consecutive data points can be calculated. Scaling time series signals for calculating DHm is not new.(
1
) Scaling was applied by Sevcik [14] when normalising the signal to the amplitude range and maximal time period, thereby transforming the signal into a unit square, such that amplitude and time axes have the same length of 1. This scaling method is chosen arbitrarily and is therefore a subjective method. The fractal dimension DH of this transformed signal is only applicable to its unit square, but DH of signals with different amplitude ranges and/or different time periods cannot be compared any more due to different amplitude multipliers (m = time period/amplitude range).(
2
) Scaling is applied by mono-dimensional methods such as Higuchi’s method [7]. As the time dimension of the signal is not considered, the signal is transformed into a vertically oriented rectangle with horizontal side length of zero, thereby transforming the signal into a vertical line. The same effect is achieved by multiplying the amplitude axis of the signal by a very large number (m→∞) such that the time axis becomes comparatively infinitesimally small and approaches zero.As there is no rule for scaling—otherwise Sevcik’s and Higuchi’s methods would stand in contrast to each other—any scaling method can be applied, provided that it is neither arbitrary nor subjective. The method introduced in this paper follows an engineering optimisation approach, by maximising the difference between the smallest and largestDHm values across signals to be compared, or across parts of a signal. This is achieved by applying an optimised multiplier m to the normalised amplitude of the signals, and this multiplier must be the same in all signals (or parts thereof) to be compared. In most cases, Higuchi’s method narrows down the difference between the smallest and largest DHm values and therefore is not suitable for decision making. In most cases, the optimal multiplier m of the normalised amplitude y is smaller than 1 (depending on the original unit if the recorded data); the smaller m is, the less noisy the DHm dataset is (obtained from a sliding window method) and the more regular the DHm of periodic signals is due to the filter effect of small m-values. The proposed optimisation technique enables the researcher to customise the normalised signal amplitude such that maximal information is obtained, specifically for improved decision making and this with an additional filtering option.It is suggested that the normalised amplitudey, and not the normalised time x, is scaled by m. Increasing the normalised frequency f0 by a factor of m(=reducingΔx/m) delivers the same DHm as increasing the amplitude y by a factor of m. This explains the effect of Higuchi’s method, which does not calculate the Euclidean distance between data points and is therefore unaffected by Δx. Reducing Δx to zero means that m→∞. Therefore, Higuchi’s method delivers the asymptotic value on the right side of the range spectrum, at maximal m (Figures 11 and 14, with the effect seen in Figures 2, 10, and 15(d)). In fact, DHo calculated from Higuchi’s method is identical to the maximal DHm in Figure 10. Scaling the frequency f0 via m instead of the amplitude, however, is not advisable, as f0 is connected to the actual sampling frequency of the measurement device.It is evident that the multiplierm of the normalised signal amplitude must be the same in all related signals for comparative reasons. For example, this applies to parts of a signal which are compared, as well as to signal data related to a therapeutic period (of one or more patients) or to a specific pathology across a cohort of patients. This is not the case in Sevcik’s unit square method, as different multipliers result if the amplitude range and/or time periods of signals to be compared are not identical. If DHm is determined as a function of normalised time with a running average analysis, then the window width has to be taken care of. If the window width is widened, then the DHm of the signal is less noisy, the valleys become narrower (and the peaks wider) along the time axis, and the valleys become shallower (and the peaks flatter) along the amplitude axis. The optimal multiplier m has to be determined at the same window width (e.g., Figure 18) as subsequently used for the optimised fractal dimension analysis (e.g., Figure 19). For the optimisation procedure, the DHm averaged over time or over the window width is used (e.g., Figure 18). Different recording devices are likely to deliver different DHm if their sensor specifications do not match. Optimisation of the DHm signal can mitigate the problem.Finally, it has to be pointed out again that the fractal dimensionDHm, obtained after modifying the signal by multiplying its amplitude by the multiplier m, is no longer the fractal dimension DHo of the original signal but rather the fractal dimension DHm of the modified or transformed signal. DHm serves only for comparing two or more signals (or parts of the same signal) for the purpose of decision making and for classifying or quantifying the intensity of events occurring throughout the time series signal. Thus, DHm does not serve for accurate evaluation of the fractal dimension DHo of the original signal. Yet, fractal dimensions of signals are often compared in order to draw conclusions, the practical applications of which ultimately result in decision making. The latter is optimised with the method described and presented in this study.


## 10. Conclusions

Different, usually well-performing, methods for computing the fractal dimensions of time series can produce opposite results in extreme signals, namely, dimensions of 1 (or even <1) and 2. These results can be reproduced when calculating the Euclidean distance between data points andmodifying their amplitude by a multiplier. Equally, standard methods for computing fractal dimensions use different scaling methods, that is, different amplitude multipliers, which makes it difficult to compare fractal dimensions obtained from different methods.In order to overcome this problem, a fractal dimension optimisation method is proposed that computes the fractal dimension of a normalised (dimensionless) and modified time series signal with a robust algorithm and a running average method, and maximises the difference between two fractal dimensions, for example, a minimum and a maximum one.The optimisation method developed in this study is essential for decision making, particularly when the decision hinges on the condition that two different signals (or parts of a signal) have different fractal dimensions. The optimisation method is applied to calculating the maximal fractal dimension differential, as a function of the amplitude multiplier. Alternatively, the fractal dimension differential between maximal dimension and average dimension can be maximised. This optimisation method enhances fractal dimensions above average and suppresses those below average. Maximising the ratio of maximal to average dimension provides a further optimisation effect.The smaller the amplitude multiplier, the stronger is the filter effect on the fractal dimension. Large multipliers result in a very noisy fractal dimension signal. The filter effect even reveals periodic events of a signal and enhances larger fractal dimensions.The fractal dimensionDHm, obtained after modifying the signal by multiplying its amplitude by the multiplier m, is no longer the fractal dimension DHo of the original signal but rather the fractal dimension DHm of the modified signal only, used solely for the purpose of decision making and for classifying or quantifying the intensity of events occurring throughout the time series signal.



---

*Source: 178476-2013-09-17.xml*