On the mathematical validity of the Higuchi method
From MaRDI portal
Abstract: In this paper, we discuss the Higuchi algorithm which serves as a widely used estimator for the box-counting dimension of the graph of a bounded function . We formulate the method in a mathematically precise way and show that it yields the correct dimension for a class of non-fractal functions. Furthermore, it will be shown that the algorithm follows a geometrical approach and therefore gives a reasonable estimate of the fractal dimension of a fractal function. We conclude the paper by discussing the robustness of the method and show that it can be highly unstable under perturbations.
Recommendations
- Higuchi's method for fractional dimension
- A method for evaluating the fractal dimension in the plane, using coverings with crosses
- Is a two-dimensional generalization of the higuchi algorithm really necessary?
- A new box-counting method for fractal dimension
- Error Bounds on the Estimation of Fractal Dimension
Cites work
- scientific article; zbMATH DE number 1994007 (Why is no real title available?)
- Approach to an irregular time series on the basis of the fractal theory
- Fractal functions, fractal surfaces, and wavelets
- Interpolation and approximation with splines and fractals
- On the geometry of random Cantor sets and fractal percolation
This page was built for publication: On the mathematical validity of the Higuchi method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2222754)