Processing math: 100%
World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

Accuracy of the box-counting algorithm for noisy fractals

    https://doi.org/10.1142/S0129183116501126Cited by:2 (Source: Crossref)

    The box-counting (BC) algorithm is applied to calculate fractal dimensions of four fractal sets. The sets are contaminated with an additive noise with amplitude γ=105101. The accuracy of calculated numerical values of the fractal dimensions is analyzed as a function of γ for different sizes of the data sample. In particular, it has been found that even in case of pure fractals (γ=0) as well as for tiny noise (γ105) one has considerable error for the calculated exponents of order 0.01. For larger noise the error is growing up to 0.1 and more, with natural saturation limited by the embedding dimension. This prohibits the power-like scaling of the error. Moreover, the noise effect cannot be cured by taking larger data samples.

    PACS Nos.: 05.45.Df
    You currently do not have access to the full text article.

    Recommend the journal to your library today!