2.2. CT Image Acquisition
To obtain the mesostructural information of asphalt concrete, CT scanning was performed on cylindrical asphalt concrete specimens. The CT scanning equipment employed was the Germany Diondo d2 universal (Diondo, Hattingen, Germany)micro nano focus CT system with a 270 kV and 72 µA X-ray source. A set of 2D slice images (stack) representing the asphalt concrete mesostructure was reconstructed using the software XMReconstructor coupled to the micro-CT system. The stack displayed different grayscales in its 2D slice images. The slice spacing was 0.1 mm, with a resolution of 78 µm/pixel, and a total of 750 slices were displayed at 3.94 MB per slice.
The complete sample information of the asphalt concrete specimen consisted of 750 8-bit slices of 1507 pixels × 914 pixels. In each CT slice, pixels of different grayscale intensity levels between 0 (black) and 255 (white) represent different components. Higher-density components tend to yield higher grayscale intensities. In this way, the distribution of materials in the sample can be well identified based on the grayscale intensity values.
2.3. Bilinear Interpolation Algorithm
To avoid the jagged distortion of the aggregate contours in CT slices during 2D image segmentation, the bilinear interpolation algorithm was used, which can increase the pixel density of an image without changing the image size. The interpolation process is shown in
Figure 1.
Assuming that the pixel number of the image after pixel filling is
k2 times the pixel number of the image before pixel filling:
where
is the grayscale value of the pixel point in the
nth slice before pixel interpolation;
is the grayscale value of the new pixel point in the
nth slice after pixel interpolation;
q + 1 is the number of pixels in horizontal or vertical orientation after pixel interpolation;
i is the x-axis pixel coordinate of the corresponding known pixel point;
j is the y-axis pixel coordinate of the known pixel point;
u is the x-axis coordinate of the new pixel point relative to the surrounding four known pixel points; and
v is the y-axis coordinate of the new pixel point relative to the surrounding four known pixel points.
2.4. Two-Dimensional Image Segmentation Algorithm
In this study, the OTSU method was used to separate the aggregate phase from the asphalt mortar matrix phase, and then the marker-based watershed splitting method was used to split the interconnected aggregates.
The OTSU method classifies the pixels in the grayscale image into two categories, target and background, according to the assumed threshold values, as shown in
Figure 2. It first uses the variance of the grayscale values of the two categories as the judgment index to obtain the best threshold value for this figure by an exhaustive search and then transforms the grayscale image into a binary image containing the two categories of target (aggregate phase) and background (asphalt mortar matrix phase) according to the best threshold value.
The grayscale values of CT grayscale images range from 0 to 255, with a total of 256 grayscale levels. It is assumed that the number of pixels corresponding to the grayscale value
i is
; the optimal threshold is
k; the grayscale value less than
k is the background class; and the grayscale value greater than or equal to
k is the target class. The interclass variance can be expressed as:
where
δ2(
k) is the corresponding interclass variance when the optimal threshold is assumed to be
k;
μ is the mean gray value of the whole CT slice;
μback(
k) is the mean gray value of the corresponding background class pixels when the optimal threshold is assumed to be
k;
μtarg(
k) is the mean gray value of the corresponding target class pixels when the optimal threshold is assumed to be
k;
ωback(
k) is the ratio of the total number of background class pixels to the total number of CT slice pixels when the optimal threshold is assumed to be
k;
ωtarg(
k) is the ratio of the total number of target class pixels to the total number of CT slice pixels when the optimal threshold is assumed to be
k; and
Pi is the ratio of pixels with gray value
i to the total number of CT slice pixels.
At the maximum value max[
δ2(
k)], the optimal threshold value
k is determined for this slice. At this point, the CT grayscale image will be transformed into a binary image containing only white (aggregate phase) and black (asphalt mortar phase):
where
φ(
x,y) is the binary value of the corresponding coordinate of the binary image after segmentation;
i(
x,y) is the gray value of the corresponding coordinate of the grayscale image before segmentation;
x is the horizontal coordinate corresponding to the pixel in the CT slice image; and
y is the vertical coordinate corresponding to the pixel in the CT slice image.
The marker-based watershed segmentation method was applied to segment the interconnected aggregates. By means of Matlab programming, the binary image was first subjected to limit erosion operations to obtain the internal markers of the aggregates. Then, the middle point of the aggregate-to-aggregate contact was calculated as the external markers using the distance function, and the 0-value pixels were used to connect the external markers at different locations as watershed ridges to obtain the watershed ridge segmentation layer. Finally, the watershed ridge segmentation layer was superimposed on the corresponding binary image to separate the inner markers and complete the segmentation of interconnected aggregates.
2.5. Developed Adjacent-Slice Pixel-Value-Correction Algorithms
From the pixel perspective, the pixel value distribution of the same aggregate in the CT slice set of asphalt concrete specimens has a natural similarity between adjacent CT slices due to the continuity of geometry. Based on this continuity of pixel values in adjacent layers in the CT slice set, two adjacent-slice pixel-value-correction algorithms are proposed in this paper.
Refer to the direction perpendicular to the CT slice plane as the CT acquisition direction, and define this direction as the Z-axis. Take the set of CT binary images that have experienced 2D image segmentation as the initial CT slice set, whose pixel information in each CT slice can be expressed as:
where
n is the serial number of the CT slice in the acquisition direction (Z-axis) (the value range is 1–750);
x is the coordinate of the horizontal corresponding to the pixel in the CT slice;
y is the coordinate of the vertical corresponding to the pixel in the CT slice.
Depending on the processing purpose, this paper provides two adjacent-slice pixel-correction algorithms. It should be noted that all slices in the initial slice set need to have a uniform image size and pixel density.
Algorithm 1: First, take the intersection of adjacent-slice aggregate phase pixels in the initial slice set. Then, process the intersection of adjacent-slice aggregate phase pixels by morphological expansion operations. Finally, record the processed results in a new slice.
Algorithm 2: Firstly, take the union of adjacent-slice aggregate phase pixels of the initial slice set. Then, process the union of adjacent-slice aggregate phase pixels by morphological erosion operations. Finally, record the processed results in a new slice.
Apply Algorithm 1 or Algorithm 2 to all adjacent slices in the initial slice set to obtain a new slice set with one round of correction completed. Algorithm 1 is suitable for removing model defects in the 3D mesostructural model of asphalt concrete that cannot be well handled in the 2D image segmentation process, e.g., interconnected aggregates, flaky aggregates, and incomplete aggregates. Algorithm 2 is suitable for repairing the loss of pixel information in the outer contours of aggregates during processing. A detailed description of the two adjacent slice pixel correction algorithms is given as follows.
2.5.1. Algorithm 1: First Take the Intersection and Then Perform Morphological Expansion (IMEX)
The intersection of the nth slice
φn and (
n + 1)th slice
φn+1 in the initial slice set is taken, and the result of the operation is recorded in a new slice
. The pixel values of this slice can be expressed as:
Figure 3 illustrates the computational process of the IMEX algorithm from the pixel level. It can be found that after performing the intersection-taking operation, the overlapping region of the aggregate phases in the adjacent slices is recorded into the new slice
, while the non-overlapping region is deleted. Therefore, the new slice
will lose a small amount of pixel information in the aggregate phase. In order to ensure the original volume fraction of aggregates in asphalt concrete without significant changes, it is necessary to take morphological expansion operations for the aggregate phase of the new slice, and the processed result is denoted as
. The 2D four-connected domain kernel function (0 1 0, 1 1 1, 0 1 0) was chosen as the morphological operator in this study.
2.5.2. Algorithm 2: First Take the Union and Then Perform Morphological Erosion (UMER)
The union of the
nth slice
φn and (
n + 1)th slice
φn+1 in the initial slice set is taken, and the result of the operation is recorded in a new slice
. The pixel values of this slice can be expressed as:
Figure 4 illustrates the computational process of the UMER algorithm from the pixel level. It can be found that after performing the union-taking operation, the overlapping region and non-overlapping region of the aggregate phases in the adjacent slices are recorded into the new slice
. Therefore, the new slice
will add a small amount of pixel information from the aggregate phase. To ensure the original volume fraction of the aggregates in the asphalt concrete and reduce the interconnected aggregates, it is necessary to take morphological erosion operations for the aggregate phase of the new slice. The processed result is denoted as
.
2.5.3. Multiple Correction
As described above, two adjacent-slice pixel-value-correction algorithms are proposed. After one round of correction processing, the aggregate phase in the new slice (
or
) integrates the aggregate phase morphological features of the
nth slice
φn and the (
n + 1)th slice
φn+1 in the initial slice set. Taking the IMEX algorithm as an example, the multiple-correction process is shown in
Figure 5. After two rounds of correction processing, the aggregate phase in the new slice
integrates the aggregate phase morphological features of
φn,
φn+1, and
φn+2 in the initial slice set. Therefore, it can be expected that as the number of multiple corrections (
i) increases, the new slice
obtained will integrate more information from the initial slice set and the recovery effect of the similarity of aggregate phase geometry between adjacent CT slices will be enhanced. However, 1-value pixels that distribute interruptedly along the acquisition direction in the slice set can become linear aggregates due to overcorrection. A limit should be set on the number of multiple corrections to avoid the appearance of linear aggregates. This limit is related to the slice spacing of the slice set, and the limit of multiple corrections is 10 in this paper.
It should be noted that after each round of correction processing, the pixel value of the slice at the end of the previous slice set is lost. The slice spacing chosen in this paper is 0.1 mm, i.e., the slice lost in each round of the correction process corresponds to the voxel value information of 0.1 mm thickness at the edge of the model. This model voxel loss is extremely small and thus negligible under the premise of limiting the number of multiple corrections.
2.5.4. Multi-Directional Multiple Correction
Based on the Matlab toolbox, the binary slice set of the asphalt concrete can be obtained from any other direction by using the numerical model re-slicing algorithm and the 3D voxel reconstruction algorithm to simulate the CT nondestructive scanning process.
As shown in
Figure 6, multi-directional multiple correction is a combination of single-directional multiple-correction processes in multiple new directions. The single-directional multiple-correction process is to first re-slice the asphalt concrete 3D voxel model along a new direction to obtain a new slice set. Then, a multiple-correction process, as described above, is applied to the new slice set to recover and strengthen the similarity of aggregate phase geometry between the adjacent new slices. Finally, to facilitate the implementation of the multiple corrections in the next new direction, the corrected new slice set is reconstructed in 3D to obtain the new asphalt concrete mesostructural model.
The numerical model re-slicing algorithm converts the voxel values
ψ(
x,
y,
z) with 3D coordinate information to the pixel values
φx(
y,
z),
φy(
x,
z) or
φz(
x,
y) with 2D coordinate information along a certain direction and then arranges the pixel values by coordinates to generate a 2D slice set. Conversely, the 3D voxel reconstruction algorithm converts the pixel values
φx(
y,
z),
φy(
x,
z), or
φz(
x,
y) along the acquisition direction to obtain the voxel values,
ψ(
x,
y,
z), and then arranges the voxel values by coordinates to generate a 3D model. The parameter relationships are as follows:
where
ψ is a voxel value with 3D coordinate information;
φx is a pixel value with 2D coordinate information in a slice perpendicular to the x-axis;
φy is a pixel value with 2D coordinate information in a slice perpendicular to the y-axis; and
φz is a pixel value with 2D coordinate information in a slice perpendicular to the z-axis.
2.6. Developed Procedure for the 3D Reconstruction of Asphalt Concrete Mesostructure
The bilinear interpolation algorithm introduced in
Section 2.3 was employed to improve the pixel density of 2D CT images and the average filtering algorithm was used to reduce the noise of CT images. Subsequently, the OTSU method described in
Section 2.4 was employed to separate the asphalt mortar matrix phase from the aggregate phase, and the watershed segmentation method based on markers was used to separate the interconnected aggregates. Finally, the IMEX and the UMER proposed in
Section 2.5.1 and
Section 2.5.2 was employed to recover the similarity of aggregate phase geometry between adjacent slices, and the recovery effect of geometric similarity was enhanced through the multi-directional multiple-correction method developed in
Section 2.5.4.
Figure 7 shows the details of the improved procedure for 3D reconstruction. It includes CT image preprocessing (image pixel interpolation and image filtering), 2D image segmentation (OTSU image segmentation, watershed segmentation, and image pixel density restoration), and multi-directional multiple correction (re-slicing, multiple correction, and voxel reconstruction).
The workstation configuration for performing the 3D reconstruction process included an Intel® Core TM i7-9700 3.0GHz processor (Dell, Lundrock, TX, USA), 64GB RAM (DDR4), and operating system version Windows 10 19044.2006 (Professional Edition), and the processing software version is Matlab 2021.
According to the new process of 3D reconstruction given in
Section 2.6, this study provides the processing results of each stage of 3D reconstruction, as shown in
Figure 8.
The CT image pre-processing process is shown in
Figure 8b–d. First, the CT slice set image information was read and the CT slice set was uniformly grayed out to obtain the CT grayscale slice set in order to avoid image format transformation due to file dumping.
Then, the pixel density of the CT grayscale slice set was increased based on the bilinear interpolation algorithm to prevent the contour distortion of the aggregate phase caused by image filtering and 2D image segmentation.
Finally, there was a loss of light intensity when the X-ray passes through the model because of the power limitation of CT. The overall grayscale of the CT grayscale image shows a distribution trend of low center and high surroundings (
Figure 9a), which will reduce the ability of the numerical algorithm to recognize pixels representing different materials in CT grayscale slices. In this study, the average filtering algorithm was selected to filter the CT grayscale slices with high pixel density, which enhanced the global contrast of the pixel grayscale values between the asphalt mortar matrix phase and the aggregate phase in the CT grayscale slice (
Figure 9c) and weakened the noise impact to improve the image segmentation quality of the OTSU algorithm for low-contrast images.
The 2D image segmentation process is shown in
Figure 8d–f. First, the optimal threshold of each slice of the CT grayscale slice set was calculated based on the OTSU method’s exhaustive calculation, and the grayscale image was segmented into a binary image containing only the asphalt mortar matrix phase and the aggregate phase according to the optimal threshold (
Figure 9d).
Then, the segmentation line layer was obtained by using the watershed segmentation method based on markers, and it was overlaid on the corresponding CT binary slice to complete the segmentation of the interconnected aggregates. At this time, a large number of randomly scattered 0-value or 1-value pixel blocks appeared in the CT binary slice, which mainly included fine aggregates with diameters less than 2.36 mm and erroneous data under the influence of noise could be removed using the image morphology method. The processing results are shown in
Figure 9e.
Finally, to ensure that the voxel model obtained from the subsequent 3D reconstruction is consistent with the dimensions of the original specimen, the pixel density of the CT binary slice set was restored based on the inverse operation of the bilinear interpolation algorithm after the 2D image segmentation was completed (
Figure 9f).
The multi-directional multiple-correction process of the asphalt concrete 3D voxel model is shown in
Figure 8g–m. Based on the multi-directional multiple-correction method proposed in
Section 2.5.4, the 3D voxel model of the asphalt concrete with model defects was corrected along the Z-axis, X-axis, and Y-axis successively.