Patent Publication Number: US-2023162341-A1

Title: Half-cast mark identification and damaged flatness evaluation and classification method for blastholes in tunnel blasting

Description:
CROSS REFERENCE TO RELATED APPLICATION 
     This patent application claims the benefit and priority of Chinese Patent Application No. 202111398003.1, filed with the China National Intellectual Property Administration on Nov. 24, 2021, the disclosure of which is incorporated by reference herein in its entirety as part of the present application. 
     TECHNICAL FIELD 
     The present disclosure relates to the field of image analysis in tunnel blasting, and in particular to a half-cast mark identification and damaged flatness evaluation and classification method for blastholes in tunnel blasting. 
     BACKGROUND 
     The contour forming quality and a half-cast mark rate in tunnel blasting are crucial to evaluate excavation quality of tunnel drilling and blasting and a utilization rate of blastholes, and are main factors to directly determine construction period and investment cost of the tunnel. 
     The conventional blasting evaluation method is implemented simply by identifying and determining apparent characteristics of a half-cast mark in site by naked eyes, and surveying the half-hole mark with a tape or a total station. The half-cast mark rate is calculated by only extracting data about remaining lengths of the blastholes, which does not take into account influences from an overall flatness of a certain region around the blastholes on the damage and is seriously affected by subjective consciousnesses of surveyors. Till now, there haven&#39;t been any reports concerning statistical classification of damaged flatness in different blasting methods. In the prior art, the damaged flatness is artificially identified, determined and classified in most cases, with large identification and classification errors, poor robustness and poor stability, which is far from satisfactory in production practices. Therefore, there is an urgent need to provide convenient and efficient half-cast mark identification and feature parameter extraction methods for blastholes in tunnel blasting as well as a damaged flatness and classification method for surrounding rock surface in different blasting plans, so as to scientifically select related parameters in the tunnel blasting and determine the blasting plan, thereby realizing the ideal tunnel blasting. 
     SUMMARY 
     In view of technical problems of artificial identification in the background, the present disclosure provides a half-cast mark identification and damaged flatness evaluation and classification method for blastholes in tunnel blasting. 
     A half-cast mark identification and damaged flatness evaluation and classification method for blastholes in tunnel blasting includes the following specific steps: 
     S 1 : photographing standard contrast images, a size of each of the standard contrast images being comprehensively determined by an analysis scale, and the standard contrast images including a first contrast image of surrounding rock surface with an ideal half-cast mark and a second contrast image that is unacceptable with excessive backbreak or overbreak; 
     S 2 : acquiring a half-cast mark image after actual blasting to serve as a third analysis image, a size and a photographing environment of the analysis image being consistent with those of the above contrast images; 
     S 3 : denoising the above three images by a two-dimensional (2D) Gaussian algorithm according to a characteristic that Gaussian noise in an acquired image obeys a normal distribution; 
     S 4 : performing gray-scale processing on three denoised images according to a preset threshold of an image histogram to reduce an original data volume in each of the images, thereby preventing image distortion to lose information; 
     S 5 : performing binary processing on gray-scale processed images, and setting an optimal binary threshold by maximum entropy thresholding, so as to extract boundary contours of the half-cast mark images; 
     S 6 : identifying a boundary and a related region of a half-cast mark in each of the images with a gradient vector flow (GVF)-Snake and active contour model (ACM) (GVF-Snake-ACM); 
     S 7 : importing each of three half-cast mark identified images to ImageJ software, and determining a ratio of an area of a half-cast mark region to a total area of the image as a flatness damage variable; 
     S 8 : normalizing an interval for an area ratio of a half-cast mark in each of the first contrast image and the second contrast image, and establishing a quantitative relation ω=(D) β  between a damage degree and a fractal dimension D, thereby determining a quantitative relation among the area ratio of the half-cast mark region, the damage variable and the fractal dimension; 
     S 9 : determining a damage value of the third analysis image through linear interpolation calculation on an area ratio of a half-cast mark; 
     S 10 : extracting, for each of a plurality of half-cast mark identified images with a gray-level co-occurrence matrix (GLCM) in 0°, 45°, 90°, and 135° directions or 180°, 225°, 270°, and 315° directions, five eigenvalues including an energy mean, an entropy mean, a contrast mean, a correlation mean, and a uniformity mean, thereby forming a five-dimensional (5D) eigenvector; 
     S 11 : respectively photographing 90 blasting images for a tunnel excavation surrounding rock surface in three blasting plans, which specifically include conventional blasting, presplit blasting and smooth blasting and employ a same explosive charge during tunneling, to form a set C={c 1 , c 2 , c 3 }, analyzing target matrices corresponding to the conventional blasting, the presplit blasting and the smooth blasting, and obtaining 5D eigenvectors F={f 1 , f 2 , f 3 , f 4 , f 5 }, in different blasting plans, where a feature attribute of each of the images is composed of a 5D eigenvector, including an energy mean, an entropy mean, a contrast mean, a correlation mean, and a uniformity mean, thereby obtaining a multi-dimensional digital information feature of the image; 
     S 12 : randomly selecting 5D eigenvectors of 60 images from the image set in the three different blasting plans as training data to input to a naive Bayes classifier (NBC), and calculating with five eigenvalues f i (i=1,2,3,4,5) of each of the images, a probability that a training image falls into a category c j (j=1,2,3) 
     
       
         
           
             
               
                 P 
                 ⁡ 
                 ( 
                 
                   
                     c 
                     j 
                   
                   / 
                   F 
                 
                 ) 
               
               = 
               
                 
                   
                     
                       P 
                       ⁡ 
                       ( 
                       
                         c 
                         j 
                       
                       ) 
                     
                     ⁢ 
                     
                       P 
                       ⁡ 
                       ( 
                       
                         
                           c 
                           j 
                         
                         / 
                         F 
                       
                       ) 
                     
                   
                   
                     P 
                     ⁡ 
                     ( 
                     F 
                     ) 
                   
                 
                 = 
                 
                   
                     
                       P 
                       ⁡ 
                       ( 
                       
                         c 
                         j 
                       
                       ) 
                     
                     ⁢ 
                     
                       P 
                       ⁡ 
                       ( 
                       
                         
                           f 
                           1 
                         
                         , 
                         
                           f 
                           2 
                         
                         , 
                         
                           f 
                           3 
                         
                         , 
                         
                           f 
                           4 
                         
                         , 
                         
                           
                             f 
                             5 
                           
                           / 
                           
                             c 
                             j 
                           
                         
                       
                       ) 
                     
                   
                   
                     P 
                     ⁡ 
                     ( 
                     F 
                     ) 
                   
                 
               
             
             , 
           
         
       
     
     where for an eigenvector F, a larger posterior probability P(c j /F) indicates a higher probability that the F falls into c j , and the category into which the F falls is calculated by: 
     
       
         
           
             
               
                 c 
                 ⁡ 
                 ( 
                 F 
                 ) 
               
               = 
               
                 arg 
                 ⁢ 
                     
                 max 
                 ⁢ 
                     
                 
                   P 
                   ⁡ 
                   ( 
                   
                     c 
                     j 
                   
                   ) 
                 
                 ⁢ 
                 
                   
                     ∏ 
                     
                       j 
                       = 
                       1 
                     
                     3 
                   
                     
                   
                     P 
                     ⁡ 
                     ( 
                     
                       
                         f 
                         i 
                       
                       ❘ 
                       
                         c 
                         j 
                       
                     
                     ) 
                   
                 
               
             
             , 
           
         
       
     
     and 
     after P(c j ) and P(c j /F) are calculated, a category with a maximum posterior probability is returned, thereby obtaining the category of the F; and 
     S 13 : inputting eigenvectors of remaining 30 images in the image set in the different blasting plans to a well-trained NBC, and determining a state with a maximum probability in different given categories c j (j=1,2,3) based on a maximum a posteriori (MAP) principle of the NBC to take as a final result for evaluation and classification of the blasting plans, thereby implementing classification on blasting effects of the conventional blasting, the presplit blasting and the smooth blasting and on damaged flatness of surrounding rock surfaces. 
     Preferably, in step S 3 , a Gaussian filter based model satisfies the following 2D Gaussian distribution: 
     
       
         
           
             
               G 
               ⁡ 
               ( 
               
                 x 
                 , 
                 y 
               
               ) 
             
             = 
             
               
                 1 
                 
                   2 
                   ⁢ 
                   
                     πσ 
                     2 
                   
                 
               
               ⁢ 
               
                 e 
                 
                   - 
                   
                     
                       
                         x 
                         2 
                       
                       + 
                       
                         y 
                         2 
                       
                     
                     
                       2 
                       ⁢ 
                       
                         σ 
                         2 
                       
                     
                   
                 
               
             
           
         
       
     
     where x and y are transverse and longitudinal sizes of the image, and σ 2  is a variance of the normal distribution. 
     Preferably, in step S 5 , the maximum entropy thresholding specifically includes: defining, according to a concept of a Shannon entropy, an entropy of an image having a gray scale in a range of 0, 1, 2, . . . , L−1 as 
     
       
         
           
             
               H 
               = 
               
                 
                   ∑ 
                   
                     i 
                     = 
                     0 
                   
                   
                     L 
                     - 
                     1 
                   
                 
                   
                 
                   iP 
                   i 
                 
               
             
             , 
           
         
       
     
     P i  being a probability that a pixel having a value of i occupies the whole image, and dividing the image into a target O and a background B according to a set threshold t, probabilities of the pixel in the target and the background being: 
     
       
         
           
             
               
                 region 
                 ⁢ 
                     
                 O 
                 : 
                     
                 
                   
                     P 
                     i 
                   
                   
                     P 
                     t 
                   
                 
               
               , 
               
                 i 
                 = 
                 0 
               
               , 
               1 
               , 
               … 
               , 
               t 
               , 
               where 
               , 
               
                 
                   
                     P 
                     t 
                   
                   = 
                   
                     
                       ∑ 
                       
                         i 
                         = 
                         0 
                       
                       t 
                     
                       
                     
                       P 
                       i 
                     
                   
                 
                 ; 
                 and 
               
             
             ⁢ 
             
 
             
               
                 region 
                 ⁢ 
                     
                 B 
                 : 
                     
                 
                   
                     P 
                     i 
                   
                   
                     1 
                     - 
                     
                       P 
                       t 
                     
                   
                 
               
               , 
               
                 i 
                 = 
                 
                   t 
                   + 
                   1 
                 
               
               , 
               … 
               , 
               
                 L 
                 - 
                 1. 
               
             
           
         
       
     
     Preferably, the target O and the background B each have the following entropy function: 
     
       
         
           
             
               
                 
                   H 
                   o 
                 
                 ( 
                 t 
                 ) 
               
               = 
               
                 
                   - 
                   
                     
                       ∑ 
                       
                         i 
                         = 
                         0 
                       
                       t 
                     
                       
                     
                       
                         
                           p 
                           i 
                         
                         
                           P 
                           t 
                         
                       
                       ⁢ 
                       ln 
                       ⁢ 
                       
                         
                           p 
                           i 
                         
                         
                           P 
                           t 
                         
                       
                     
                   
                 
                 = 
                 
                   
                     ln 
                     ⁢ 
                         
                     
                       P 
                       t 
                     
                   
                   + 
                   
                     
                       H 
                       t 
                     
                     
                       P 
                       t 
                     
                   
                 
               
             
             , 
             
               
                 
                   where 
                   ⁢ 
                       
                   
                     H 
                     t 
                   
                 
                 = 
                 
                   - 
                   
                     
                       ∑ 
                       
                         i 
                         = 
                         0 
                       
                       t 
                     
                       
                     
                       
                         p 
                         i 
                       
                       ⁢ 
                           
                       ln 
                       ⁢ 
                           
                       
                         p 
                         i 
                       
                     
                   
                 
               
               ; 
             
           
         
       
       
         
           
             
               
                 
                   H 
                   B 
                 
                 ( 
                 t 
                 ) 
               
               = 
               
                 
                   - 
                   
                     
                       ∑ 
                       
                         i 
                         = 
                         
                           t 
                           + 
                           1 
                         
                       
                       
                         L 
                         - 
                         1 
                       
                     
                       
                     
                       
                         
                           p 
                           i 
                         
                         
                           1 
                           - 
                           
                             P 
                             t 
                           
                         
                       
                       ⁢ 
                       ln 
                       ⁢ 
                       
                         
                           p 
                           i 
                         
                         
                           1 
                           - 
                           
                             P 
                             t 
                           
                         
                       
                     
                   
                 
                 = 
                 
                   
                     ln 
                     ⁡ 
                     ( 
                     
                       1 
                       - 
                       
                         P 
                         t 
                       
                     
                     ) 
                   
                   + 
                   
                     
                       H 
                       - 
                       
                         H 
                         t 
                       
                     
                     
                       1 
                       - 
                       
                         P 
                         t 
                       
                     
                   
                 
               
             
             , 
                                              
             
               
                 
                   where 
                   ⁢ 
                       
                   H 
                 
                 = 
                 
                   - 
                   
                     
                       ∑ 
                       
                         i 
                         = 
                         0 
                       
                       
                         L 
                         - 
                         1 
                       
                     
                       
                     
                       
                         p 
                         i 
                       
                       ⁢ 
                           
                       ln 
                       ⁢ 
                           
                       
                         p 
                         i 
                       
                     
                   
                 
               
               ; 
             
           
         
       
     
     a total entropy of the image is: 
     
       
         
           
             
               H 
               ⁡ 
               ( 
               t 
               ) 
             
             = 
             
               
                 
                   
                     H 
                     o 
                   
                   ( 
                   t 
                   ) 
                 
                 + 
                 
                   
                     H 
                     B 
                   
                   ( 
                   t 
                   ) 
                 
               
               = 
               
                 
                   ln 
                   ⁢ 
                       
                   
                     
                       P 
                       t 
                     
                     ( 
                     
                       1 
                       - 
                       
                         P 
                         t 
                       
                     
                     ) 
                   
                 
                 + 
                 
                   
                     H 
                     t 
                   
                   
                     P 
                     t 
                   
                 
                 + 
                 
                   
                     H 
                     - 
                     
                       H 
                       t 
                     
                   
                   
                     1 
                     - 
                     
                       P 
                       t 
                     
                   
                 
               
             
           
         
       
     
     the total entropy of the image is maximized through a maximum threshold T: 
     T=arg max(H(t)); and 
     the optimal binary threshold is determined according to a principle of maximizing the total entropy of the image. 
     Preferably, step S 6  specifically includes: 
     S 61 : acquiring pixel points on a row and a column of an initial image I m×n  (having a resolution of m×n) at a step length d=2, and performing downsampling for s times to obtain s+1 to-be-tested images (including the initial image I m×n ), where a resolution in kth sampling is 
     
       
         
           
             
               I 
               
                 
                   m 
                   
                     2 
                     k 
                   
                 
                 × 
                 
                   n 
                   
                     2 
                     k 
                   
                 
               
             
             ; 
           
         
       
     
     S 62 : preprocessing an image 
     
       
         
           
             
               I 
               
                 
                   m 
                   
                     2 
                     s 
                   
                 
                 × 
                 
                   n 
                   
                     2 
                     s 
                   
                 
               
             
             ; 
           
         
       
     
     in sth downsampling, performing edge detection with a Canny operator, defining an initial contour l s+1  on an edge image, a number of control points on the initial contour l s+1  being N s+1 , and calculating a GVF external force field, where due to a diffusivity of the GVF external force field in a smooth region, the initial contour l s+1  approaches continuously to an edge of the image; and when 0.98N s+1  control points on the initial contour l s+1  reach a target contour (a termination criterion), it is considered that an initial contour curve reaches a target edge, and iteration is stopped to obtain a target contour curve l s  at the resolution 
     
       
         
           
             
               
                 m 
                 
                   2 
                   s 
                 
               
               × 
               
                 n 
                 
                   2 
                   s 
                 
               
             
             ; 
           
         
       
     
     S 63 : preprocessing an image 
     
       
         
           
             I 
             
               
                 m 
                 
                   2 
                   
                     s 
                     - 
                     1 
                   
                 
               
               × 
               
                 n 
                 
                   2 
                   
                     s 
                     - 
                     1 
                   
                 
               
             
           
         
       
     
     in (s−1)th downsampling with the Canny operator, taking the contour curve l s  in the previous step as an initial contour curve, recalculating a GVF external force field on the image 
     
       
         
           
             
               I 
               
                 
                   m 
                   
                     2 
                     
                       s 
                       - 
                       1 
                     
                   
                 
                 × 
                 
                   n 
                   
                     2 
                     
                       s 
                       - 
                       1 
                     
                   
                 
               
             
             , 
           
         
       
     
     and obtaining a target contour curve l s−1  according to the termination criterion in step  62  under pushing of an external force; and 
     S 64 : repeating step S 63 , to until a target contour curve l of the identified image l m×n  is obtained. 
     Preferably, in step S 7 , the flatness damage variable is calculated by 
     
       
         
           
             
               ω 
               = 
               
                 
                   
                     A 
                     * 
                   
                   A 
                 
                 = 
                 
                   
                     n 
                     * 
                   
                   n 
                 
               
             
             , 
           
         
       
     
     where A* is the area of the identified half-cast mark region, A is the total area of the image, n* is a number of pixel points in the half-cast mark region of the image, and n is a total number of pixel points in the image. 
     Preferably, in step S 7 , ω=0 indicates that the half-cast mark is clear in a damage negligible state; ω=1 indicates that the half-cast mark is diffused in a completely damaged state; and 0&lt;ω&lt;1 indicates that the surrounding rock surface is damaged in different degrees. 
     Preferably, in step S 12 , a training number is set as 1,000 times; and the NBC is trained repeatedly with a plurality of sets of image data, until a classification error in training is less than 10 −3 . 
     The present disclosure has the following beneficial effects: 
     1. The present disclosure solves problems of half-cast mark identification and feature extraction for blastholes in tunnel blasting through combinational algorithms, implements scientific classification for damaged flatness of a surrounding rock surface in conventional blasting, presplit blasting and smooth blasting, and overcomes problems of poor precision and no adaptation of conventional half-cast mark identification and evaluation. 
     2. The present disclosure provides a half-cast mark identification method that meets future automatic, intelligent and delicate tunnel blasting requirements, and a damaged flatness classification method for the surrounding rock surface after the blasting, further provides a more complete and scientific feature digitalization solution for the half-cast mark of the blastholes in the tunnel blasting, solves the defects of poor surveying precision, poor operability and serious restriction from subjective idea of surveyors in the conventional artificial surveying method, and provides intelligent, convenient and efficient identification, evaluation and classification methods for dedicate blasting design and parameter optimization of the tunnel. 
     Other parts not mentioned in the method are the same as those in the prior art or can be implemented by the prior art. 
    
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         FIG.  1    is a flowchart of a half-cast mark identification and damaged flatness evaluation and classification method for blastholes in tunnel blasting according to the present disclosure; 
         FIG.  2    illustrates a layout of a blasthole of a typical tunnel blasting; 
         FIG.  3    illustrates a third analysis image for a half-cast mark in tunnel blasting; 
         FIG.  4    illustrates a first photographed contrast image of a surrounding rock surface with an ideal half-cast mark of a blasthole; 
         FIG.  5    illustrates a second photographed contrast image of an unacceptable surrounding rock surface with excessive backbreak or overbreak; 
         FIG.  6    illustrates a binary processing result of an analysis image; 
         FIG.  7    illustrates an identified result of a GVF-Snake; 
         FIG.  8    illustrates an identified result of an ACM model for a half-cast mark; 
         FIG.  9    illustrates calculation of a fractal box dimension of an analysis image; 
         FIG.  10    illustrates division of a feature extraction direction in a GLCM; 
         FIG.  11    illustrates an eigenvector value of an analysis image; 
         FIG.  12    is a flowchart of an NBC; 
         FIG.  13    illustrates an evaluation and classification result of an NBC; and 
         FIG.  14    illustrates a half-cast mark and flatness identified result for a group of blastholes. 
     
    
    
     DETAILED DESCRIPTION OF THE EMBODIMENTS 
     The technical solutions of the present disclosure are further described in detail below with reference to specific embodiments. 
     Referring to  FIGS.  1 - 14   , a half-cast mark identification and damaged flatness evaluation and classification method for blastholes in tunnel blasting includes the following specific steps: 
     S 1 : Photograph standard contrast images, a size of each of the standard contrast images being comprehensively determined by an analysis scale, and the standard contrast images including a first contrast image of a rock surface with an ideal half-hole mark and a second contrast image that is unacceptable with excessive backbreak or overbreak. 
     S 2 : Acquire a half-cast mark image after actual blasting to serve as a third analysis image, a size and a photographing environment of the analysis image being consistent with those of the above contrast images. 
     S 3 : Denoise the above three images by a 2D Gaussian algorithm according to a characteristic that Gaussian noise in an acquired image obeys a normal distribution. A Gaussian filter based model satisfies the following 2D Gaussian distribution: 
     
       
         
           
             
               
                 G 
                 ⁡ 
                 ( 
                 
                   x 
                   , 
                   y 
                 
                 ) 
               
               = 
               
                 
                   1 
                   
                     2 
                     ⁢ 
                     
                       πσ 
                       2 
                     
                   
                 
                 ⁢ 
                 
                   e 
                   
                     - 
                     
                       
                         
                           x 
                           2 
                         
                         + 
                         
                           y 
                           2 
                         
                       
                       
                         2 
                         ⁢ 
                         
                           σ 
                           2 
                         
                       
                     
                   
                 
               
             
             , 
           
         
       
     
     where x and y are transverse and longitudinal sizes of the image, and σ 2  is a variance of the normal distribution. 
     S 4 : Perform gray-scale processing on three denoised images according to a preset threshold of an image histogram to reduce an original data volume in each of the images, thereby preventing image distortion to lose information. 
     S 5 : Perform binary processing on gray-scale processed images, and set an optimal binary threshold by maximum entropy thresholding. The maximum entropy thresholding specifically includes: Define, according to a concept of a Shannon entropy, an entropy of an image having a gray scale in a range of 0, 1, 2, . . . , L−1 as 
     
       
         
           
             
               
                 ∑ 
                 
                   i 
                   = 
                   0 
                 
                 
                   L 
                   - 
                   1 
                 
               
                 
               
                 iP 
                 i 
               
             
             , 
           
         
       
     
     P i  being a probability that a pixel having a value of i occupies the whole image, and divide the image into a target O and a background B according to a set threshold t, probabilities of the pixel in the target and the background being: 
     
       
         
           
             
               
                 region 
                 ⁢ 
                     
                 O 
                 : 
                     
                 
                   
                     P 
                     i 
                   
                   
                     P 
                     t 
                   
                 
               
               , 
               
                 i 
                 = 
                 0 
               
               , 
               1 
               , 
               … 
               , 
               t 
               , 
               where 
               , 
               
                 
                   
                     P 
                     t 
                   
                   = 
                   
                     
                       ∑ 
                       
                         i 
                         = 
                         0 
                       
                       t 
                     
                       
                     
                       P 
                       i 
                     
                   
                 
                 ; 
                 and 
               
             
             ⁢ 
             
 
             
               
                 region 
                 ⁢ 
                     
                 B 
                 : 
                     
                 
                   
                     P 
                     i 
                   
                   
                     1 
                     - 
                     
                       P 
                       t 
                     
                   
                 
               
               , 
               
                 i 
                 = 
                 
                   t 
                   + 
                   1 
                 
               
               , 
               … 
               , 
               
                 L 
                 - 
                 1. 
               
             
           
         
       
     
     In the present disclosure, the target O and the background B each have the following entropy function: 
     
       
         
           
                             
             
               
                 
                   
                     H 
                     o 
                   
                   ( 
                   t 
                   ) 
                 
                 = 
                 
                   
                     - 
                     
                       
                         ∑ 
                         
                           i 
                           = 
                           0 
                         
                         t 
                       
                         
                       
                         
                           
                             p 
                             i 
                           
                           
                             P 
                             t 
                           
                         
                         ⁢ 
                         ln 
                         ⁢ 
                         
                           
                             p 
                             i 
                           
                           
                             P 
                             t 
                           
                         
                       
                     
                   
                   = 
                   
                     
                       ln 
                       ⁢ 
                           
                       
                         P 
                         t 
                       
                     
                     + 
                     
                       
                         H 
                         t 
                       
                       
                         P 
                         t 
                       
                     
                   
                 
               
               , 
               
                 
                   
                     where 
                     ⁢ 
                         
                     
                       H 
                       t 
                     
                   
                   = 
                   
                     - 
                     
                       
                         ∑ 
                         
                           i 
                           = 
                           0 
                         
                         t 
                       
                         
                       
                         
                           p 
                           i 
                         
                         ⁢ 
                             
                         ln 
                         ⁢ 
                             
                         
                           p 
                           i 
                         
                       
                     
                   
                 
                 ; 
               
             
           
         
       
       
         
           
             
               
                 
                   H 
                   B 
                 
                 ( 
                 t 
                 ) 
               
               = 
               
                 
                   - 
                   
                     
                       ∑ 
                       
                         i 
                         = 
                         
                           t 
                           + 
                           1 
                         
                       
                       
                         L 
                         ⁢ 
                         
                            
                           ⁢ 
                           311 
                         
                       
                     
                       
                     
                       
                         
                           p 
                           i 
                         
                         
                           1 
                           - 
                           
                             P 
                             t 
                           
                         
                       
                       ⁢ 
                       ln 
                       ⁢ 
                       
                         
                           p 
                           i 
                         
                         
                           1 
                           - 
                           
                             P 
                             t 
                           
                         
                       
                     
                   
                 
                 = 
                 
                   
                     ln 
                     ⁡ 
                     ( 
                     
                       1 
                       - 
                       
                         P 
                         t 
                       
                     
                     ) 
                   
                   + 
                   
                     
                       H 
                       - 
                       
                         H 
                         t 
                       
                     
                     
                       1 
                       - 
                       
                         P 
                         t 
                       
                     
                   
                 
               
             
             , 
             
               
                 
                   where 
                   ⁢ 
                       
                   H 
                 
                 = 
                 
                   - 
                   
                     
                       ∑ 
                       
                         i 
                         = 
                         0 
                       
                       
                         L 
                         - 
                         1 
                       
                     
                       
                     
                       
                         p 
                         i 
                       
                       ⁢ 
                           
                       ln 
                       ⁢ 
                           
                       
                         p 
                         i 
                       
                     
                   
                 
               
               ; 
             
           
         
       
     
     a total entropy of the image is: 
     
       
         
           
             
               H 
               ⁡ 
               ( 
               t 
               ) 
             
             = 
             
               
                 
                   
                     H 
                     o 
                   
                   ( 
                   t 
                   ) 
                 
                 + 
                 
                   
                     H 
                     B 
                   
                   ( 
                   t 
                   ) 
                 
               
               = 
               
                 
                   ln 
                   ⁢ 
                       
                   
                     
                       P 
                       t 
                     
                     ( 
                     
                       1 
                       - 
                       
                         P 
                         t 
                       
                     
                     ) 
                   
                 
                 + 
                 
                   
                     H 
                     t 
                   
                   
                     P 
                     t 
                   
                 
                 + 
                 
                   
                     H 
                     - 
                     
                       H 
                       t 
                     
                   
                   
                     1 
                     - 
                     
                       P 
                       t 
                     
                   
                 
               
             
           
         
       
     
     the total entropy of the image is maximized through a maximum threshold T: 
     T=arg max(H(t)); and 
     the optimal binary threshold is determined according to a principle of maximizing the total entropy of the image. 
     S 6 : Identify a boundary and a related region of a half-cast mark in each of the images with a GVF-Snake-ACM. 
     S 61 : Acquire pixel points on a row and a column of an initial image I m×n  (having a resolution of m×n) at a step length d=2, and perform downsampling for s times to obtain s+1 to-be-tested images (including the initial image I m×n ), where a resolution in kth sampling is 
     
       
         
           
             
               I 
               
                 
                   m 
                   
                     2 
                     k 
                   
                 
                 × 
                 
                   n 
                   
                     2 
                     k 
                   
                 
               
             
             . 
           
         
       
     
     S 62 : Preprocess an image 
     
       
         
           
             I 
             
               
                 m 
                 
                   2 
                   s 
                 
               
               × 
               
                 n 
                 
                   2 
                   s 
                 
               
             
           
         
       
     
     in sth downsampling, perform edge detection with a Canny operator, define an initial contour l s+1  on an edge image, a number of control points on the initial contour l s+1  being N s+1 , and calculate a GVF external force field, where due to a diffusivity of the GVF external force field in a smooth region, the initial contour l s+1  approaches continuously to an edge of the image; and when 0.98N s+1  control points on the initial contour l s+1  reach a target contour (a termination criterion), it is considered that an initial contour curve reaches a target edge, and iteration is stopped to obtain a target contour curve l s  at the resolution 
     
       
         
           
             
               m 
               
                 2 
                 s 
               
             
             × 
             
               
                 n 
                 
                   2 
                   s 
                 
               
               . 
             
           
         
       
     
     S 63 : Preprocess an image 
     
       
         
           
             I 
             
               
                 m 
                 
                   2 
                   
                     s 
                     - 
                     1 
                   
                 
               
               × 
               
                 n 
                 
                   2 
                   
                     s 
                     - 
                     1 
                   
                 
               
             
           
         
       
     
     in (s−1)th downsampling with the Canny operator, take the contour curve l s  in the previous step as an initial contour curve, recalculate a GVF external force field on the image 
     
       
         
           
             
               I 
               
                 
                   m 
                   
                     2 
                     
                       s 
                       - 
                       1 
                     
                   
                 
                 × 
                 
                   n 
                   
                     2 
                     
                       s 
                       - 
                       1 
                     
                   
                 
               
             
             , 
           
         
       
     
     and obtain a target contour curve l s−1  according to the termination criterion in Step S 62  under pushing of an external force. 
     S 64 : Repeat Step S 63 , to until a target contour curve l of the identified image l m×n  is obtained. 
     S 7 : Import each of three half-cast mark identified images to ImageJ software, and determine a ratio of an area of a half-cast mark region to a total area of the image as a flatness damage variable: The flatness damage variable is calculated by 
     
       
         
           
             
               ω 
               = 
               
                 
                   
                     A 
                     * 
                   
                   A 
                 
                 = 
                 
                   
                     n 
                     * 
                   
                   n 
                 
               
             
             , 
           
         
       
     
     where A* is the area of the identified half-cast mark region, A is the total area of the image, n* is a number of pixel points in the half-cast mark region of the image, and n is a total number of pixel points in the image. ω=0 indicates that the half-cast mark is clear in a damage negligible state; ω=1 indicates that the half-cast mark is diffused in a completely damaged state; and 0&lt;ω&lt;1 indicates that the surrounding rock surface is damaged in different degrees. 
     S 8 : Normalize an interval for an area ratio of a half-cast mark in each of the first contrast image and the second contrast image, and establish a quantitative relation ω=(D) β  between a damage degree and a fractal dimension D, thereby determining a quantitative relation among the area ratio of the half-cast mark region, the damage variable and the fractal dimension. 
     S 9 : Determine a damage value of the third analysis image through linear interpolation calculation on an area ratio of a half-cast mark. 
     S 10 : Extract, for each of a plurality of half-cast mark identified images with a GLCM in 0°, 45°, 90°, and 135° directions or 180°, 225°, 270°, and 315° directions, five eigenvalues including an energy mean, an entropy mean, a contrast mean, a correlation mean, and a uniformity mean, thereby forming a 5D eigenvector. 
     S 11 : Respectively photograph 90 blasting images for a tunnel excavation surrounding rock surface in three blasting plans, which specifically include conventional blasting, presplit blasting and smooth blasting and employ a same explosive charge during tunneling, to form a set C={c 1 , c 2 , c 3 }, analyze target matrices corresponding to the conventional blasting, the presplit blasting and the smooth blasting, and obtain 5D eigenvectors F={f 1 , f 2 , f 3 , f 4 , f 5 } in different blasting plans, where a feature attribute of each of the images is composed of a 5D eigenvector, including an energy mean, an entropy mean, a contrast mean, a correlation mean, and a uniformity mean, thereby obtaining a multi-dimensional digital information feature of the image. 
     S 12 : Randomly select 5D eigenvectors of 60 images from the image set in the three different blasting plans as training data to input to an NBC, and calculate, with five eigenvalues f i (i=1,2,3,4,5) of each of the images, a probability that a training image falls into a category c j (j=1,2,3) 
     
       
         
           
             
               
                 P 
                 ⁡ 
                 ( 
                 
                   
                     c 
                     j 
                   
                   / 
                   F 
                 
                 ) 
               
               = 
               
                 
                   
                     
                       P 
                       ⁡ 
                       ( 
                       
                         c 
                         j 
                       
                       ) 
                     
                     ⁢ 
                     
                       P 
                       ⁡ 
                       ( 
                       
                         
                           c 
                           j 
                         
                         / 
                         F 
                       
                       ) 
                     
                   
                   
                     P 
                     ⁡ 
                     ( 
                     F 
                     ) 
                   
                 
                 = 
                 
                   
                     
                       P 
                       ⁡ 
                       ( 
                       
                         c 
                         j 
                       
                       ) 
                     
                     ⁢ 
                     
                       P 
                       ⁡ 
                       ( 
                       
                         
                           f 
                           1 
                         
                         , 
                         
                           f 
                           2 
                         
                         , 
                         
                           f 
                           3 
                         
                         , 
                         
                           f 
                           4 
                         
                         , 
                         
                           
                             f 
                             5 
                           
                           / 
                           
                             c 
                             j 
                           
                         
                       
                       ) 
                     
                   
                   
                     P 
                     ⁡ 
                     ( 
                     F 
                     ) 
                   
                 
               
             
             , 
           
         
       
     
     where for an eigenvector F, a larger posterior probability P(c j /F) indicates a higher probability that the F falls into c j , and the category into which the F falls is calculated by: 
     
       
         
           
             
               
                 c 
                 ⁡ 
                 ( 
                 F 
                 ) 
               
               = 
               
                 arg 
                 ⁢ 
                 max 
                 ⁢ 
                 
                   P 
                   ⁡ 
                   ( 
                   
                     c 
                     j 
                   
                   ) 
                 
                 ⁢ 
                 
                   
                     ∏ 
                     
                       j 
                       = 
                       1 
                     
                     3 
                   
                   
                     P 
                     ⁡ 
                     ( 
                     
                       
                         f 
                         i 
                       
                       | 
                       
                         c 
                         j 
                       
                     
                     ) 
                   
                 
               
             
             , 
           
         
       
     
     and 
     after P(c j ) and P(c j /F) are calculated, a category with a maximum posterior probability is returned, thereby obtaining the category of the F. A training number is set as 1,000 times; and the NBC is trained repeatedly with a plurality of sets of image data, until a classification error in training is less than 10 −3 . 
     S 13 : Input eigenvectors of remaining 30 images in the image set in the different blasting plans to a well-trained NBC, and determine a state with a maximum probability in different given categories c j (j=1,2,3) based on an MAP principle of the NBC to take as a final result for evaluation and classification of the blasting plans, thereby implementing classification on blasting effects of the conventional blasting, the presplit blasting and the smooth blasting and on damaged flatness of surrounding rock surfaces. 
     The ImageJ software has a version of 1.8.0. The GLCM is implemented by extracting the eigenvalues in 0°, 45°, 90°, and 135° directions. 
     According to  FIG.  12   , the workflow of the NBC can be divided into a preparation stage, a training stage of the NBC, and an application stage. The preparation stage is to determine an eigenvector attribute F and obtain a training sample. The training stage is to determine P(F) for each category, and calculate conditional probabilities of all divisions for each eigenvector attribute. The application stage is to calculate P(c j )P(c j /F) for each category, and take a maximum term of the P(c j )P(c j /F) as the category to which the eigenvector attribute belongs. 
     The foregoing are merely descriptions of preferred specific embodiments of the present disclosure, but the protection scope of the present disclosure is not limited thereto. Any equivalent replacement or modification made within a technical scope of the present disclosure by a person skilled in the art according to the technical solutions of the present disclosure and inventive concepts thereof shall fall within the protection scope of the disclosure.