Higuchi dimension
In fractal geometry, the Higuchi dimension (or Higuchi fractal dimension (HFD)) is an approximate value for the box-counting dimension of the graph of a real-valued function or time series.
≈ 2 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In fractal geometry, the Higuchi dimension (or Higuchi fractal dimension (HFD)) is an approximate value for the box-counting dimension of the graph of a real-valued function or time series. This value is obtained via an algorithmic approximation so one also talks about the Higuchi method.
It has many applications in science and engineering and has been applied to subjects like characterizing primary waves in seismograms, clinical neurophysiology and analyzing changes in the electroencephalogram in Alzheimer's disease. L_m(k) = \frac{N-1}{\lfloor \frac{N-m}{k} \rfloor k^2} \sum_{i=1}^{\lfloor \frac{N-m}{k} \rfloor} |X_N(m+ik)-X_N(m+(i-1)k)|.
The length L(k) is defined by the average value of the k lengths L_1(k), \dots, L_k(k) , L(k) = \frac{1}{k} \sum_{m=1}^k L_m(k). The slope of the best-fitting linear function through the data points \left \{ \left ( \log \frac{1}{k} ,\log L(k) \right ) \right \} is defined to be the Higuchi fractal dimension of the time-series X . For a real-valued function f:[0,1] \to \mathbb{R} one can partition the unit interval [0,1] into N equidistantly intervals [t_j,t_{j+1}) and apply the Higuchi algorithm to the times series X(j) = f(t_j) . This results into the Higuchi fractal dimension of the function f . It was shown that in this case the Higuchi method yields an approximation for the box-counting dimension of the graph of f as it follows a geometrical approach (see Liehr & Massopust 2020 ).
Text derived from https://en.wikipedia.org/w/index.php?oldid=1316140666 under CC BY-SA 4.0; modifications have been made.