3.2. Complexity-Adaptive Box-Height Differential Box-Counting Method
In local calculations, conventional DBC employs a fixed box height along the gray-level dimension, making it difficult to simultaneously accommodate variations in fracture scale and local grayscale complexity. In the proposed method, three analysis windows of 7 × 7, 13 × 13, and 25 × 25 pixels are evaluated at every pixel, while only the box height along the gray-level dimension is adaptively refined according to local grayscale complexity. This leads to the proposed Complexity-Adaptive Box-Height Differential Box-Counting (CABH-DBC) method.
It should be emphasized that the local complexity is not used to select, discard, or weight individual window scales on a pixel-by-pixel basis. Instead, all three windows are fully evaluated and jointly form a fixed three-dimensional feature vector.
The implementation of CABH-DBC consists of four steps: (1) measurement of local grayscale complexity; (2) calculation of local fractal dimensions within multiscale windows; (3) orientation of local fractal responses; and (4) multiscale fractal feature fusion.
- (1)
Local Grayscale Complexity Measurement;
Let the preprocessed grayscale image be denoted by
. For an arbitrary pixel
, a 15 × 15 neighborhood
centered on that pixel is constructed. The local grayscale standard deviation is defined as:
where
denotes the mean grayscale value within the neighborhood and
. Because the input grayscale values have been normalized to [0,1],
is dimensionless and satisfies
. The value of
reflects the magnitude of local textural variation. Homogeneous regions generally exhibit relatively small values, whereas structurally varying regions, such as fracture edges, pore boundaries, and texture interfaces, tend to exhibit larger values.
It is important to distinguish the spatial meanings of these responses. High values of occur predominantly within transition zones between fractures and the surrounding background, whereas the low local fractal-dimension values discussed below primarily occur within the interior of the dark fracture bands. Thus, the two quantities characterize different parts of the fracture structure.
- (2)
Local Fractal-Dimension Calculation within Multiscale Windows;
Let the set of analysis-window sizes be . For each scale and each pixel , a analysis window centered at that pixel is constructed. When the window extends beyond the image boundary, the out-of-bound region is padded by replicating the nearest boundary pixel values.
Within each analysis window, the sub-block scale
s is varied. To adjust the quantization resolution along the gray-level dimension according to local grayscale complexity, the adaptive box height is defined as:
where
is the dimensionless normalized spatial scale,
is the dimensionless local grayscale standard deviation, and
is also a dimensionless parameter. Therefore,
represents the box height within the normalized grayscale domain and is expressed on the same normalized scale as the grayscale range used in the equation.
Because the actual differential box-counting procedure involves discrete rounding operations, variations in box height may alter the number of covering boxes at different scales and consequently change the estimated fractal dimension. Therefore, the proposed method does not assume a priori that adaptive box-height refinement necessarily improves fitting linearity or preserves the numerical value of the fractal dimension.
For each grid block within the window, the number of boxes required for coverage is calculated as:
where
and
are the maximum and minimum grayscale values within the corresponding grid block, respectively. The term +1 ensures that one box is still counted when the two extreme grayscale values fall within the same box.
Summing over all grid blocks within the analysis window yields
The sub-block scale is varied within each window according to . When more than six candidate scales are available, six scales are selected with logarithmically uniform spacing. The spatial scale is normalized as . Taking logarithms of the power-law relationship in Equation (2) gives Equation (3). Least-squares fitting in log-log coordinates then yields the local fractal dimension at pixel for window size .
By traversing the entire image and performing the calculation separately at the three window scales, three local fractal-dimension feature maps are obtained , and .
- (3)
Orientation of Local Fractal Responses;
DBC estimates the local box dimension of a grayscale surface. For a locally self-affine grayscale surface, the local roughness can be described by , where is the Hurst exponent. In the data analyzed in this study, fractures predominantly appear as continuous low-resistivity dark bands in the enhanced borehole images. Grayscale variations within these bands are relatively smooth, and their local fractal dimensions therefore tend to lie toward the lower end of the distribution for a given image. In contrast, background regions with more complex textures generally exhibit higher local fractal dimensions.
To ensure that larger responses consistently correspond to fractures in the subsequent classification procedure, the local fractal dimension at each scale is linearly inverted:
where
and
are the minimum and maximum local fractal dimensions, respectively, for the image at scale
.
This operation is an affine transformation with a slope of -1 and preserves the absolute difference in fractal dimension between any two pixels. After Z-score standardization of the feature matrix, the transformation is exactly equivalent to negating the standardized feature and therefore constitutes an isometric transformation in Euclidean space. Consequently, the partitions obtained by K-means and SOM based on Euclidean distance are unaffected by this transformation; only the assignment of which cluster is interpreted as the fracture cluster is changed.
The inversion itself introduces no additional discriminative information, and the features supplied to the SOM remain entirely derived from the local fractal dimensions. Grayscale information is introduced only as auxiliary information for the semantic determination of the final fracture clusters, as described in
Section 3.3.
The above criterion requires an analysis window to contain both a fracture and its adjacent background. When the fracture width exceeds the size of a small analysis window, the interior of the window may again become relatively homogeneous. The use of three fixed window sizes allows the larger windows to retain the possibility of spanning the boundary between a fracture and its neighboring background, thereby preserving structural information at different spatial scales.
Following response orientation, three local fractal response maps
are obtained for subsequent multiscale feature fusion. It should be noted that the full-interval fitting performed in
Section 4.1.1 directly uses the original
values without inversion.
- (4)
Multiscale Feature Fusion.
For each pixel
, the local fractal responses at the three scales are stacked to form a three-dimensional feature vector:
The entire image therefore produces a fractal feature matrix of size
, which serves as the input to the SOM described in
Section 3.3. All three scales are fully retained. No specific window scale is assumed a priori to dominate a particular complexity regime; instead, the subsequent SOM organizes the feature space according to the joint distribution of the three-dimensional fractal responses.
Figure 5 illustrates the overall workflow of the CABH-DBC algorithm. Through the above procedure, the inverted local fractal response maps are obtained and subsequently used as SOM input features for fracture identification.
In this study, a 15 × 15 neighborhood for local complexity estimation and multiscale windows of are fixed throughout the main experiments. The box-height adaptation parameter was fixed a priori at before the quantitative evaluation and was kept unchanged throughout the main experiments. The 15 × 15 neighborhood provides a balance between the stability of standard-deviation estimation and spatial locality. The three windows, which approximately follow a doubling progression, cover local structural scales ranging from several pixels to several tens of pixels and are designed to accommodate both narrow and relatively wide fractures in the pixel domain.
The parameter
controls the degree of box-height refinement. An excessively small
weakens the effect of complexity adaptation, whereas an excessively large value may increase sensitivity to local noise. The corresponding sensitivity analysis is presented in
Section 4.4.2.
3.3. Self-Organizing Map
The self-organizing map maps high-dimensional features onto a low-dimensional topological grid through competitive learning and neighborhood updating. For an input feature vector
, let
denote the weight vector of the
-th neuron. The best matching unit (BMU) is defined as:
where
denotes the index of the winning neuron.
After the BMUs of all samples have been determined, the network weights are updated in batch mode. The neighborhood-weighted sample mean for the
-th neuron is given by:
and the weight vector is updated as:
where the neighborhood function is defined as:
here,
denotes the link distance between neurons
and
on the hexagonal grid,
is the neighborhood radius, and
is the learning rate.
Equation (16) performs a convex combination based on the batch neighborhood-weighted mean, with the combination controlled by . Feature standardization, clustering, and fracture-cluster determination are all performed independently for each image, and no parameters are shared across different depth intervals.
Before the three-dimensional CABH-DBC feature vectors are supplied to the SOM, each feature dimension is standardized using Z-score normalization to eliminate scale differences among feature dimensions:
where
and
denote the mean and standard deviation of the
-th fractal feature dimension, respectively.
To obtain stable clustering results, a 5 × 5 hexagonal SOM is employed. The weights are initialized using principal components, followed by batch unsupervised training for 200 epochs. The neighborhood radius is geometrically decayed from 3 to 0.5, while the learning rate is geometrically decayed from 0.5 to 0.05.
After training, three statistics are calculated for each neuron-defined class: the proportion of pixels assigned to the class, the mean response of those pixels across the three Z-score-normalized feature dimensions, and the mean grayscale value of the corresponding pixels in the pre-enhancement grayscale image. Only classes with pixel proportions between 1% and 80% are retained, thereby excluding noise classes with excessively small areas and background classes with excessively large areas. This area-based screening range is fixed in the main experiments, and its sensitivity is evaluated in
Section 4.4.2.
For the retained classes, the latter two quantities are separately Z-score standardized across classes and denoted by
and
, respectively. A fracture-cluster score is then constructed as
. Since
and
are separately standardized, the coefficient 0.25 serves as a relative weighting factor. It was empirically set a priori and was not tuned using the ten evaluation intervals. The relatively small value was intended to keep the fractal response as the primary criterion while retaining grayscale information only as an auxiliary term for semantic fracture-cluster determination. After normalization of the scores, Otsu’s thresholding method [
51] is applied to distinguish candidate fracture classes from background classes. Candidate classes are then accumulated in descending order of
, subject to the constraint that the total area proportion of the finally selected classes does not exceed 80%. Because the features at each scale have already undergone linear inversion, no additional grayscale inversion is performed at this stage, as illustrated in
Figure 6.
In this study, the SOM is used to organize and partition the fractal feature space constructed by CABH-DBC rather than to replace the fractal feature extraction process. Through unsupervised topological mapping, it establishes an effective link between fractal characterization and automatic fracture identification.