We show that for sets with the Hausdorff–Besicovitch dimension equal zero the box counting algorithm commonly used to calculate Renyi exponents (dq) can exhibit perfect scaling suggesting non zero dq’s. Properties of these pathological sets (pseudofractals) are investigated. Numerical, as well as analytical estimates for dq’s are obtained. A simple indicator is given to distinguish pseudofracta...

An optimal box-counting algorithm for estimating the fractal dimension of a nonempty set which changes over time is given. This nonstationary environment is characterized by the insertion of new points into the set and in many cases the deletion of some existing points from the set. In this setting, the issue at hand is to update the box-counting result at appropriate time intervals with low co...

The southern CfA2 galaxy data are used to investigate the scaling properties of the galaxy number distribution. We construct two volume-limited samples with galaxy magnitudesMB(0) ≤ −19.42 andMB(0) ≤ −20.00, and calculate the secondto ninth-order moments with the box-counting method. On scales from 5 to 27 h−1 Mpc, the moments exhibit multifractal scalings. From the exponents of the scalings, w...

The objective of this paper is to examine the development of the urban form of the city of Olomouc since the 1920s in terms of fractal dimension, and to link the observation with two other descriptors of shape – area and perimeter. The fractal dimension of built-up areas and fractal dimension of the boundary of the city are calculated employing the box-counting method; the possibilities of thei...

In this paper, we study the application of the box counting method (BCM) to estimate the fractal dimension of 3D plant foliage. We use artificial crowns with known theoretical fractal dimension to characterize the accuracy of the BCM and we extend the approach to 3D digitized plants. In particular, errors are experimentally characterized for the estimated values of the fractal dimension. Result...

The box counting method for fractal dimension estimation had not been applied to large or colour images thus far due to the processing time required. In this letter we present a fast, easy to implement and very easily expandable to any number of dimensions variation, the box merging method. It is applied here in RGB images which are considered as sets in 5-D space.

Most of the existing box-counting methods for measuring fractal features are only applicable to square images or images with each dimension equal to the power of 2 and require that the box at the top of the box stack of each image block is of the same height as that of other boxes in the same stack, which gives rise to inaccurate estimation of fractal dimension. In this paper, we propose a more...

Box-counting dimension is one of the most widely used fractal dimensions, because it is relatively easy for empirical estimation. Unfortunately, the task is simple only if one operates on oneor twodimensional data. Otherwise, the amount of computation grows exponentially with the number of space coordinates.A newmethod of estimation of the box-counting dimension of multivariate objects using sp...

We discuss a number of techniques for determining the Minkowski dimension of bounded subsets of some Euclidean space of any dimension, including: the box-counting dimension and equivalent definitions based on various box-counting functions; the similarity dimension via the Moran equation (at least in the case of self-similar sets); the order of the (box-)counting function; the classic result on...