An improved YOLOv11 crack identification and quantification method for open-pit mine and its slope

By improving the YOLOv11 model and combining data preprocessing, feature extraction network improvement, and local threshold segmentation, the accuracy and computing resource consumption issues of slope crack identification in open-pit mines were resolved, achieving efficient and automated crack identification and quantification, and improving mine safety monitoring capabilities.

CN119540722BActive Publication Date: 2025-10-21KUNMING UNIV OF SCI & TECH
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202411616284.7
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-11-13
Publication Date
2025-10-21
Estimated Expiration
2044-11-13

AI Technical Summary

Technical Problem

Existing classic image processing methods are prone to missed detection and false detection in crack identification in open-pit mine slopes. Deep learning-based methods consume large computational resources and have limited application scope, making it difficult to efficiently identify and quantify cracks in complex environments.

Method used

An improved YOLOv11 model is used to accurately identify and quantify cracks through data preprocessing, feature extraction network improvement, data enhancement and adaptive local threshold segmentation method combined with morphological processing.

Benefits of technology

It improves the accuracy and efficiency of crack detection, reduces computing costs, reduces dependence on high-end hardware, realizes automated and intelligent crack identification and quantification, and enhances the safety monitoring capabilities of open-pit mines.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119540722B_ABST
    Figure CN119540722B_ABST
Patent Text Reader

Abstract

The application discloses an improved YOLOv11 crack identification and quantification method for an open-pit mine area and a slope thereof, which comprises data preprocessing, model improvement and adaptive adjustment, training of an initial identification model, crack detection by applying a target identification model, local area identification and post-processing. The application introduces a feature extraction network improvement method based on an AReLU function and an ACmix model, an adaptive local threshold segmentation algorithm based on a gray standard deviation and other technical means, and realizes efficient and accurate identification of cracks. The method not only improves the automation degree of crack detection, but also reduces the labor cost and time cost, and has important significance for safety monitoring of the open-pit mine area.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention belongs to the field of computer vision technology, and in particular relates to an improved YOLOv11 crack recognition and quantification method for open-pit mines and their slopes. Background Art

[0002] Mine slope safety is a core issue in open-pit mining operations. Slope stability is directly related to the safety of workers and the proper operation of equipment. Slope instability can trigger serious geological disasters. Early identification of cracks is a key component of slope safety management. Once cracks develop in mine slopes, they can lead to catastrophic events such as rock slides and collapses. Therefore, accurate and real-time crack identification and monitoring are crucial for preventing slope instability and ensuring safe mining operations.

[0003] Both classic image processing methods and deep learning-based crack recognition methods are widely used in this field. Classic image processing methods, such as edge detection and morphological processing, have the advantages of low computational complexity and simple implementation, but are prone to missed detections and false detections when dealing with complex backgrounds, varying illumination, and noise interference. In contrast, deep learning-based methods, such as object detection models and image segmentation models, have powerful feature extraction and pattern recognition capabilities, enabling accurate crack detection in complex environments. However, deep learning-based methods typically consume large amounts of computational resources, have high hardware requirements, and have a relatively limited scope of application.

[0004] Therefore, it is very necessary to develop an improved YOLOv11 crack identification and quantification method for open-pit mines and their slopes that can solve the above problems. Summary of the Invention

[0005] The object of the present invention is to provide an improved YOLOv11 crack identification and quantification method for open pit mines and their slopes.

[0006] The object of the present invention is achieved by comprising the following steps:

[0007] S100, data preprocessing: first, perform grayscale conversion on the original image, then apply Gaussian filtering to smooth the image, and then apply gamma transformation to enhance the image; since the grayscale mean of the image in the original data set is often uneven, the image is grayscale stretched. The present invention uses adaptive gamma transformation for grayscale stretching and realizes the adaptation of gamma transformation parameters; use bounding box annotation method to annotate the cracks in the image, and use two labels, "strip cracks" and "network cracks" respectively; divide the annotated data set into training set, validation set and test set, with the ratio of training set, validation set and test set being 70%, 15% and 15% respectively, and ensure that the two labels are evenly distributed in the three data sets;

[0008] S200, Model Improvement and Adaptation: Use data augmentation methods to simulate various transformations in real-world scenarios; Based on the original architecture of YOLOv11, improve its feature extraction network;

[0009] The original architecture of YOLOv11 includes a backbone network (Backbone) for feature extraction, a neck (Neck) for feature fusion, and a head (Head) for final prediction; the backbone network generates multi-scale feature maps by stacking convolutional layers and modules, in which the C3k2 module is introduced to replace the C2f module of the previous version, using two smaller convolution kernels to improve computational efficiency; in addition, YOLOv11 retains the SPPF module and adds a C2PSA module, which enhances the attention of important areas of the feature map through the spatial attention mechanism; the neck structure aggregates features of different resolutions and passes them to the head for prediction, and is responsible for outputting the positioning and classification results of the object through the Detect layer.

[0010] Data augmentation methods include image rotation, scaling, translation, cropping, noise addition, and grayscale value adjustment to simulate various transformations in real-world scenarios. Adding data augmentation helps enhance the model's adaptability to different crack morphologies and scene changes.

[0011] S300, training an initial recognition model: performing model training, model verification, and model testing to obtain a target recognition model;

[0012] S400, applying a target recognition model to perform crack detection: applying data preprocessing to images collected from the open-pit mine area and the slope; performing crack detection on the images using the target recognition model, and outputting detection results to indicate whether cracks exist in the open-pit mine area and the slope;

[0013] S500, local region recognition: applying an adaptive local threshold segmentation method to the recognition results of the target recognition model to further identify crack textures and segment crack regions; performing connected domain screening based on regional area and regional average grayscale value, where the regional area threshold is positively correlated with the image size;

[0014] S600, post-processing: first perform morphological processing, then perform crack quantification to obtain crack parameters.

[0015] Preferably, the gamma transformation formula in step S100 is:

[0016] ,

[0017] Among them, P out (x, y) is the pixel value at (x, y) of the output; A is a constant used to adjust the range of output brightness; P in(x, y) is the pixel value at the input (x, y); γ, i.e., the gamma value, is a positive real number used to control the shape of the gamma curve;

[0018] The calculation formula for the gamma value γ is:

[0019] ,

[0020] where μ is the average gray value of the image; T is the standard gray value. When T = μ, the image remains unchanged; t is a control parameter used to prevent over-enhancement of the image; when the average gray value of the image is too low, using the calculated gamma value is too small, resulting in too high average gray value of the image after gamma transformation. Therefore, the parameter t is introduced. When μ < t, use to calculate the gamma value.

[0021] Preferably, in step S200, data augmentation is performed using geometric transformation, noise addition, and gray value adjustment to simulate various transformations in the real scene, so as to enhance the adaptability of the model to different crack morphologies and scene changes;

[0022] The specific improvement of the feature extraction network in step S200 is as follows:

[0023] S2021. Replace some of the original SiLU with AReLU, and learn the element-level residual through the attention module, making the network more flexible in the deep feature extraction stage; The original CBS structure of YOLOv11 is replaced with the CBA structure, including a convolutional layer, a batch normalization layer, and an AReLU activation function; AReLU includes:

[0024] An element-based attention mechanism model (ELement-wise Sign-based Attention, ELSA), the expression is:

[0025] , <​​​​​​​​​​​​​​​​​​​Compared with the traditional more complex attention model, AReLU only contains two learnable parameters, which makes the model structure simpler and the calculation process more efficient;

[0032] The gradient derivation of the AReLU function is as follows:

[0033] ,

[0034] AReLU can amplify and reduce the gradients of different data, allowing the network to reach the optimal state faster during training; this feature can effectively improve model performance and accelerate overall convergence speed;

[0035] S2022: Embed the ACmix self-attention and convolution hybrid model in the C3 module and SPPF layer to achieve more efficient local and global feature fusion and further enhance multi-scale object detection capabilities;

[0036] The specific process of step S2022 is:

[0037] (1) The input features are linearly transformed through three 1×1 convolutional layers, and the projected features are divided into N groups of subsets, each of which contains three channels;

[0038] (2) The self-attention path and the convolution path are processed in parallel. The self-attention path uses the three feature maps in each subset as the query, key, and value, respectively, and introduces a multi-head self-attention mechanism. The convolution path processing includes using lightweight 3×3 convolution to process local features and performing multi-level pooling through the improved SPPF layer to better extract the local texture details of the cracks.

[0039] (3) The outputs of the self-attention path and the convolution path are weighted and summed according to the following formula:

[0040] ,

[0041] Among them, F att is the output of the self-attention path, F conv is the output of the convolution path, α and β are learnable weight parameters used to balance the contribution of the attention mechanism output and the convolution output.

[0042] Preferably, step S300 specifically includes:

[0043] S301. Model Training: Train the model using the training set, adjusting model parameters to capture patterns and relationships in the data. Initially, try a variety of model architectures, including neural network depths, the number of convolutional layers, and the use of pooling layers, to select the best-performing architecture. Based on prior knowledge of hyperparameters and evaluation results, use Bayesian methods to gradually approximate the optimal hyperparameter combination.

[0044] S302, Model Validation: Use the validation set to evaluate model performance, select the optimal model structure and hyperparameters, and determine when to stop training to avoid overfitting. After each training cycle, use the validation set to evaluate model performance. Performance evaluation metrics include accuracy, precision, recall, and F1 score.

[0045] S303, model testing: Use the test set to perform a final evaluation of the model, test its generalization ability, and obtain the final target recognition model.

[0046] Preferably, the adaptive local threshold segmentation method in step S500 includes the following steps:

[0047] S501. Calculate the improved difference entropy:

[0048] S5011, fitting the parameters of the adaptive local threshold segmentation algorithm based on the improved difference entropy;

[0049] S5012. Calculate the weighted difference between the central pixel and other pixels based on the sliding window and the Gaussian weight matrix. The probability density function of the two-dimensional Gaussian distribution is:

[0050] ,

[0051] Where X=[m,n] T is a two-dimensional random variable, θ is the mean vector, Σ is the covariance matrix, |Σ| represents the determinant of the covariance matrix;

[0052] S5013. Based on the grayscale difference matrix and weight matrix of each pixel, record the weight number of each difference in the grayscale difference matrix, that is, the weighted number of times, and then obtain the distribution X' of the grayscale value differences between each pixel of the image and its surrounding pixels;

[0053] S5014. Substitute the improved difference entropy formula into the formula. The calculation formula of the improved difference entropy H(d) is:

[0054] ,

[0055] Where i is the value of the difference, n is the number of gray levels, and P(d) is the distribution rate of the difference;

[0056] S502, parameter fitting:

[0057] S5021. Through local threshold segmentation parameter analysis experiments, obtain sufficient optimal sensitivity and optimal minimum standard deviation threshold data when the crack identification effect is best;

[0058] S5022. Based on the least squares fitting method, the experimental data is fitted with the difference entropy of each image, and a functional relationship is established;

[0059] S503, adaptive local threshold segmentation:

[0060] S5031. Using a sliding window of definable size, calculate the mean and standard deviation of the grayscale values ​​of pixels within the window;

[0061] S5032. Segment the foreground and background in the sliding window based on standard deviation segmentation and sensitivity parameters.

[0062] Preferably, the morphological processing in step S600 uses dilation and erosion operations to remove small noise points and connect broken parts of the cracks.

[0063] Preferably, in step S600 quantifying the cracks, the direction and length of the crack skeleton are calculated as the direction and length of the cracks.

[0064] Preferably, in step S600 , the crack width is calculated in the crack quantification by selecting uniformly spaced seed points along the skeleton, performing directional growth along the normal line, and calculating the average growth length, which is the crack width.

[0065] Beneficial effects of the present invention:

[0066] 1. Improved crack detection accuracy: The improved YOLOv11 model can accurately and specifically identify slope cracks, maintaining high accuracy even under complex lighting and background conditions;

[0067] 2. Reduced computing costs and hardware requirements: The improved YOLOv11 model combines a local threshold segmentation algorithm while maintaining high accuracy. This not only optimizes inference computing efficiency but also reduces dependence on high-end computing resources, allowing the model to be deployed on a wider range of devices.

[0068] 3. Improved automation: The automated crack identification and quantification method of the present invention reduces manual intervention, improves the efficiency of the detection process, and reduces labor and time costs;

[0069] 4. Safety monitoring significance: For open-pit mine safety monitoring, the present invention can monitor crack development in real time and promptly warn of potential safety hazards, thereby improving the safety of mining operations;

[0070] 5. Quantitative analysis capability: The present invention provides a reliable means of crack quantification, which facilitates detailed crack analysis and subsequent treatment;

[0071] 6. Promote intelligent management of open-pit mines: The technical solution of the present invention provides strong technical support for the intelligent management of open-pit mines, and helps to realize automated and intelligent smart mine safety management. BRIEF DESCRIPTION OF THE DRAWINGS

[0072] Figure 1 Schematic diagram of the process of the present invention;

[0073] Figure 2 Schematic diagram of the original network architecture of YOLOv11;

[0074] Figure 3 Schematic diagram of the CBA structure that introduces AReLU;

[0075] Figure 4 Schematic diagram of the SPPF and Bottleneck structures introduced into the ACmix model;

[0076] Figure 5 Schematic diagram of the improved YOLOv11 network architecture;

[0077] Figure 6 Schematic diagram of the process of adaptive local threshold segmentation method;

[0078] Figure 7 Schematic diagram for crack quantification. DETAILED DESCRIPTION

[0079] The present invention is further described below with reference to the embodiments and drawings, but the present invention is not limited in any way. Any changes or substitutions made based on the teachings of the present invention fall within the scope of protection of the present invention.

[0080] Example 1

[0081] As attached Figures 1 to 7 As shown, the improved YOLOv11 crack identification and quantification method for open-pit mines and their slopes in this embodiment includes the following steps:

[0082] S100, data preprocessing: first perform grayscale conversion on the original image, then apply Gaussian filtering to smooth the image, and then apply gamma transformation to enhance the image;

[0083] The gamma transform formula is:

[0084] ,

[0085] Among them, P out(x, y) is the pixel value at the output (x, y); A is a constant used to adjust the range of the output brightness; P in (x, y) is the pixel value at the input (x, y); γ, the gamma value, is a positive real number used to control the shape of the gamma curve;

[0086] The calculation formula for the gamma value γ is:

[0087] ,

[0088] where μ is the average gray value of the image; T is the standard gray value. When T = μ, the image remains unchanged; when the average gray value of the image is too low, the gamma value calculated using is too small, resulting in an overly high average gray value of the image after gamma transformation. Therefore, the parameter t is introduced. t is a control parameter used to prevent over-enhancement of the image. When μ < t, is used to calculate the gamma value;

[0089] The bounding box annotation method is used to annotate the cracks in the image, and two labels, "strip cracks" and "mesh cracks", are used respectively; the annotated dataset is divided into a training set, a validation set, and a test set, with the proportions of the training set, validation set, and test set being 70%, 15%, and 15% respectively, and ensuring that the two labels are evenly distributed in the three datasets;

[0090] S200, Model improvement and adaptability adjustment: Based on the original architecture of YOLOv11 (see attachment Figure 2 ), data augmentation methods are used to simulate various transformations in the real scenario. Among them, data augmentation uses geometric transformation, noise addition, and gray value adjustment to enhance the model's adaptability to different crack morphologies and scene changes; then the feature extraction network is improved;

[0091] Attachment Figure 2 In, the original architecture of YOLOv11 includes a backbone network (Backbone) for feature extraction, a neck (Neck) for feature fusion, and a head (Head) for final prediction; the backbone network generates multi-scale feature maps by stacking convolutional layers and modules, where the C3k2 module is introduced to replace the C2f module in the previous version, and two smaller convolutional kernels are used to improve the calculation efficiency; in addition, YOLOv11 retains the SPPF module and adds a new C2PSA module, which enhances the attention to important regions of the feature map through the spatial attention mechanism; the neck structure aggregates features of different resolutions and passes them to the head for prediction, and the Detect layer is responsible for outputting the object's location and classification results;

[0092] Specifically, the improvement of the feature extraction network is as follows:

[0093] S2021, replace part of the original SiLU with AReLU (attached Figure 3 ), learning element-level residuals through the attention module makes the network more flexible in the deep feature extraction stage; Figure 3 In YOLOv11, the original CBS structure is replaced by the CBA structure, including convolutional layers, batch normalization layers and AReLU activation functions; AReLU includes:

[0094] The element-wise Sign-based Attention model (ELSA) is expressed as:

[0095] ,

[0096] Among them, x i is the input of the current layer, α and β are learnable parameters, C() is used to limit the input variables to (0.01, 0.99), and σ is the sigmoid function.

[0097] The original ReLU function is expressed as:

[0098] ,

[0099] Add the ELSA attention mechanism model to the Relu function to get the AReLU function:

[0100] ,

[0101] Compared with the traditional more complex attention model, AReLU only contains two learnable parameters, which makes the model structure simpler and the calculation process more efficient.

[0102] The gradient derivation of the AReLU function is as follows:

[0103] ,

[0104] AReLU can amplify and reduce the gradient of different data, allowing the network to reach the optimal state faster during training. This feature can effectively improve model performance and accelerate overall convergence speed;

[0105] S2022, embed ACmix self-attention and convolution hybrid model in C3 module and SPPF layer (attached Figure 4 ) to achieve more efficient local and global feature fusion and further enhance multi-scale target detection capabilities; Figure 4In the [1], the ACmix model uses parallel inference convolution and self-attention mechanism modules and performs weighted summation to improve feature extraction efficiency and enhance model stability. The SPPF layer and the pre-convolution layer of the Bottleneck module are then replaced with ACmix to improve the model's recognition ability in complex scenarios. Figure 5 It is an improved YOLOv11 network architecture;

[0106] The specific process of step S2022 is:

[0107] (1) The input features are linearly transformed through three 1×1 convolutional layers, and the projected features are divided into N groups of subsets, each of which contains three channels;

[0108] (2) The self-attention path and the convolution path are processed in parallel. The self-attention path uses the three feature maps in each subset as the query, key, and value, respectively, and introduces a multi-head self-attention mechanism. The convolution path processing includes using lightweight 3×3 convolution to process local features and performing multi-level pooling through the improved SPPF layer to better extract the local texture details of the cracks.

[0109] (3) The outputs of the self-attention path and the convolution path are weighted and summed according to the following formula:

[0110] ,

[0111] Among them, F att is the output of the self-attention path, F conv is the output of the convolution path, α and β are learnable weight parameters used to balance the contribution of the attention mechanism output and the convolution output;

[0112] S300, training an initial recognition model: performing model training, model verification, and model testing to obtain a target recognition model;

[0113] S301. Model Training: Train the model using the training set, adjusting model parameters to capture patterns and relationships in the data. Initially, try a variety of model architectures, including neural network depths, the number of convolutional layers, and the use of pooling layers, to select the best-performing architecture. Based on prior knowledge of hyperparameters and evaluation results, use Bayesian methods to gradually approximate the optimal hyperparameter combination.

[0114] S302, Model Validation: Use the validation set to evaluate model performance, select the optimal model structure and hyperparameters, and determine when to stop training to avoid overfitting. After each training cycle, use the validation set to evaluate model performance. Performance evaluation metrics include accuracy, precision, recall, and F1 score.

[0115] S303, model testing: Use the test set to perform a final evaluation of the model, test its generalization ability, and obtain the final target recognition model.

[0116] S400, applying a target recognition model to perform crack detection: applying data preprocessing to images collected from the open-pit mine area and the slope; performing crack detection on the images using the target recognition model, and outputting detection results to indicate whether cracks exist in the open-pit mine area and the slope;

[0117] S500, local region recognition: applying an adaptive local threshold segmentation method to the recognition results of the target recognition model to further identify crack textures and segment crack regions; performing connected domain screening based on regional area and regional average grayscale value, where the regional area threshold is positively correlated with the image size;

[0118] The adaptive local threshold segmentation method includes the following steps:

[0119] S501. Calculate the improved difference entropy:

[0120] S5011, fitting the parameters of the adaptive local threshold segmentation algorithm based on the improved difference entropy;

[0121] S5012. Calculate the weighted difference between the central pixel and other pixels based on the sliding window and the Gaussian weight matrix. The probability density function of the two-dimensional Gaussian distribution is:

[0122] ,

[0123] Where X=[m,n] T is a two-dimensional random variable, θ is the mean vector, Σ is the covariance matrix, |Σ| represents the determinant of the covariance matrix;

[0124] S5013. Based on the grayscale difference matrix and weight matrix of each pixel, record the weight number of each difference in the grayscale difference matrix, that is, the weighted number of times, and then obtain the distribution X' of the grayscale value differences between each pixel of the image and its surrounding pixels;

[0125] S5014. Substitute the improved difference entropy formula into the formula. The calculation formula of the improved difference entropy H(d) is:

[0126] ,

[0127] Where i is the value of the difference, n is the number of gray levels, and P(d) is the distribution rate of the difference;

[0128] S502, parameter fitting:

[0129] S5021. Through local threshold segmentation parameter analysis experiments, obtain sufficient optimal sensitivity and optimal minimum standard deviation threshold data when the crack identification effect is best;

[0130] S5022. Based on the least squares fitting method, the experimental data is fitted with the difference entropy of each image, and a functional relationship is established;

[0131] S503, adaptive local threshold segmentation:

[0132] S5031. Using a sliding window of definable size, calculate the mean and standard deviation of the grayscale values ​​of pixels within the window;

[0133] S5032. Segment the foreground and background in the sliding window based on standard deviation segmentation and sensitivity parameters;

[0134] S600, post-processing: first perform morphological processing, then perform crack quantification to obtain crack parameters;

[0135] Morphological processing uses dilation and erosion operations to remove small noise points and connect the broken parts of the cracks.

[0136] In crack quantification, the crack skeleton direction and length are calculated as the crack direction and length;

[0137] In crack quantification, the width of the crack is calculated as follows: uniformly spaced seed points are selected along the skeleton, directional growth is performed along the normal, and the average growth length is calculated, which is the crack width.

Claims

1. An improved YOLOv11 crack identification and quantification method for open-pit mines and their slopes, characterized by The following steps are involved: S100, data preprocessing: first perform grayscale conversion on the original image, then apply Gaussian filtering to smooth the image, and then apply gamma transformation to enhance the image; Use bounding box annotation to mark cracks in the image; Divide the labeled dataset into training set, validation set and test set; S200, Model Improvement and Adaptation: Use data augmentation methods to simulate various transformations in real-world scenarios; Based on the original architecture of YOLOv11, its feature extraction network is improved; S300, training an initial recognition model: performing model training, model verification, and model testing to obtain a target recognition model; S400, applying the target recognition model to crack detection: applying data preprocessing to the images collected from the open pit mine area and the slope; Use the target recognition model to detect cracks in the image and output the detection results to indicate whether there are cracks in the open-pit mine area and slope; S500, local region recognition: applying an adaptive local threshold segmentation method to the recognition results of the target recognition model to further identify crack textures and segment crack regions; performing connected domain screening based on regional area and regional average grayscale value, where the regional area threshold is positively correlated with the image size; S600, post-processing: first perform morphological processing, then perform crack quantification to obtain crack parameters; The improvement of the feature extraction network in step S200 is as follows: S2021, replace part of the original SiLU with AReLU, and learn element-level residuals through the attention module; S2022. Embed the ACmix self-attention and convolution hybrid model in the C3 module and SPPF layer to fuse local and global features and enhance multi-scale object detection capabilities; The adaptive local threshold segmentation method in step S500 includes the following steps: S501. Calculate the improved difference entropy: S5011, fitting the parameters of the adaptive local threshold segmentation algorithm based on the improved difference entropy; S5012. Calculate the weighted difference between the central pixel and other pixels based on the sliding window and the Gaussian weight matrix. The probability density function of the two-dimensional Gaussian distribution is: , Where X=[m,n] T is a two-dimensional random variable, θ is the mean vector, Σ is the covariance matrix, |Σ| represents the determinant of the covariance matrix; S5013. Based on the grayscale difference matrix and weight matrix of each pixel, record the weight number of each difference in the grayscale difference matrix, that is, the weighted number of times, and then obtain the distribution X' of the grayscale value differences between each pixel of the image and its surrounding pixels; S5014. Substitute the improved difference entropy formula into the formula. The calculation formula of the improved difference entropy H(d) is: , Where i is the value of the difference, n is the number of gray levels, and P(d) is the distribution rate of the difference; S502, parameter fitting: S5021. Through local threshold segmentation parameter analysis experiments, obtain sufficient optimal sensitivity and optimal minimum standard deviation threshold data when the crack identification effect is best; S5022. Based on the least squares fitting method, the experimental data is fitted with the difference entropy of each image, and a functional relationship is established; S503, adaptive local threshold segmentation: S5031. Using a sliding window of definable size, calculate the mean and standard deviation of the grayscale values ​​of pixels within the window; S5032. Segment the foreground and background in the sliding window based on standard deviation segmentation and sensitivity parameters.

2. The improved YOLOv11 crack identification and quantification method for open-pit mines and their slopes according to claim 1 is characterized in that The gamma transform formula for step S100 is: , Among them, P out (x, y) is the pixel value at (x, y) of the output; A is used to adjust the range of output brightness; P in (x, y) is the pixel value at the input (x, y); γ is the gamma value, which is used to control the shape of the gamma curve; The calculation formula of gamma value γ is: , Among them, μ is the average gray value of the image; T is the standard gray value, when T=μ, the image does not change; t is the control parameter.

3. The improved YOLOv11 crack identification and quantification method for open-pit mines and their slopes according to claim 1 is characterized in that The specific steps of S300 are: S301. Model Training: Train the model using the training set, adjusting model parameters to capture patterns and relationships in the data. Initially, try a variety of model architectures, including neural network depths, the number of convolutional layers, and the use of pooling layers, to select the best performing architecture. Based on prior knowledge of hyperparameters and evaluation results, use Bayesian methods to gradually approximate the optimal hyperparameter combination. S302, Model Validation: Use the validation set to evaluate model performance, select the optimal model structure and hyperparameters, and determine when to stop training to avoid overfitting. After each training cycle, use the validation set to evaluate model performance. Performance evaluation metrics include accuracy, precision, recall, and F1 score. S303, model testing: Use the test set to perform a final evaluation of the model, test its generalization ability, and obtain the final target recognition model.

4. The improved YOLOv11 crack identification and quantification method for open-pit mines and their slopes according to claim 1, characterized in that The morphological processing in step S600 uses dilation and erosion operations to remove small noise points and connect the broken parts of the cracks.

5. The improved YOLOv11 crack identification and quantification method for open-pit mines and their slopes according to claim 1, characterized in that In step S600 , the crack skeleton direction and length are calculated as the crack direction and length during crack quantification.

6. The improved YOLOv11 crack identification and quantification method for open-pit mines and their slopes according to claim 1, characterized in that Step S600 calculates the crack width in crack quantification by selecting uniformly spaced seed points along the skeleton, performing directional growth along the normal, and calculating the average growth length, which is the crack width.

Citation Information

Patent Citations

  • Unmanned aerial vehicle and method for identifying small cracks of strip mine slope

    CN117360822A

  • Highway bridge crack and rust mark detection method based on improved YOLOv5 algorithm

    CN118015471A