# The Use of Intelligent Sensing Algorithm for Internet of Things and Hash Spatial Information Location Technology

Authors: Shaobo Wang; Yujia Liu
Journal: Wireless Communications and Mobile Computing
 (2021)

---

## Abstract

This exploration is aimed at quickly obtaining the spatial position information of microseismic focal points and increasing the accuracy of microseismic rapid positioning, to take timely corresponding measures. A microseismic focal point location system completely different from the traditional microseismic location method is proposed. The search engine technology is introduced into the system, which can locate the microseismic focal point quickly and accurately. First, the propagation characteristics of microseismic signals in coal and rock layers are analyzed, and the focal position information is obtained. However, the collected microseismic signal of the coal mine contains noise, so it is denoised at first. Then, a waveform database is established for the denoised waveform data and focal point position. The structure and mathematical model of the location-sensitive hash (LSH) based onP stable distribution are introduced and improved, and the optimized algorithm multiprobe LSH is obtained. The microseismic location model is established according to the characteristics of microseismic data. The values of three parameters, hash table number, hash function family dimension, and interval size, are determined. The experimental data of the parameters of the search engine algorithm are analyzed. The results show that when the number of hash tables is 6, the dimension k of the hash function family is 14, and the interval size W is 8000, the retrieval time reaches a relatively small value, the recall rate reaches a large value, and the proportion of retrieved candidates is large; the parameters of the search engine algorithm of the measured coal mine microseismic data are analyzed. It is obtained that when the number of hash tables is 4, the dimension k of the hash function family is 6, and the interval size W is 500, the retrieval time reaches a relatively small value, the recall rate obtains a large value, and the proportion of retrieved candidates is large. The contents studied are of great significance to the evaluation of destructive mine earthquakes and impact risk.


---

## Body

## 1. Introduction

In recent years, with the rapid progress of the Internet of things (IoT) technology, intelligent sensing algorithm, and computer vision, accurate and fast search of large-scale spatial data has become a major problem perplexing researchers worldwide. The key point of searching large-scale high-dimensional spatial data is to convert the data points. In this way, the distance between the data points and the query can be approximately regarded as the distance between compact codes based on efficient calculation, so as to shorten the time required for retrieval.The advantage of using this kind of retrieval technology is that it can find large-scale data accurately without compressing it [1, 2]. Combining this technology with microseismic focal point location can realize the balance between microseismic focal point calculation efficiency and positioning accuracy, providing a feasible scheme for fast microseismic focal point location. The application of the location-sensitive hash (LSH) algorithm to the establishment of the microseismic search engine can quickly find and interpret the waveform data most similar to the input microseismic waveform in the built complete database. The spatial position of the microseismic focal point can be accurately located [3–5] through this method. LSH is involved in computing problems in multiple fields, such as computer vision, language computing statistics, drug design, and text clustering. Therefore, massive scholars have studied the specific problems in its application. Some researchers verify the entropy-based LSH by querying the adjacent data points of randomly generated disturbance points. Finally, the data result of the query point and its set will be returned. This method can reduce the number of hash tables, improve the utilization of hash tables, and save storage space [6]. LSH is also widely used in the fields of audio and image search in China. However, its main application is to detect the repeatability and approximation of web pages to reduce the cost of web page indexing.Today, LSH technology has encountered a bottleneck problem. Traditional LSH technology usually needs massive hash tables to ensure precision and recall. However, too many hash tables will lead to too much memory, causing some difficulties in storing indexes [7, 8]. Thereby, the structure of the LSH algorithm is designed based on P stable distribution, and the multiprobe LSH algorithm is improved, which improves the accuracy of microseismic rapid location and increases the recall rate. Therefore, it is of great significance to study the application of the approximate proximity algorithm of LSH in microseismic focal point location.


## 2. Materials and Methods

### 2.1. Principle of Microseismic Monitoring Technology

#### 2.1.1. Generation Principle of Microseismic Signal in Coal Mine Strata [9–11]

Microseismic refers to the destruction of rock structures under the influence of mining behavior, which produces a kind of elastic energy. When the generated energy continues to accumulate and reaches a limit, it will be released and propagated in the form of an elastic wave. Figure1 is its schematic diagram.Figure 1
Schematic diagram of microseismic signal propagation.Mine microseism is determined by the damage stress of rock mass and the accumulation ability of rock mass to elastic properties. There is a positive correlation between the stress causing damage to the rock mass and the strength of the rock mass. The greater the stress required for damage to the rock mass is, the greater the strength of the rock mass is. The Mohr-Coulomb criterion considers the failure criterion of matrix rock block and the weak structural plane of a broken body under compressive shear stress, expressed as(1)τ=σtanϕ+C,where τ,σ are shear stress and normal stress on the failure surface of rock mass, ϕ is the angle when friction is caused inside the rock mass, tanϕ is the internal friction coefficient, and C is cohesion force in rock mass.Figure2 displays the causes of microseismic in coal and rock mass.Figure 2
Causes of microseismic in coal and rock mass.


#### 2.1.2. Propagation of Microseismic Signal in Coal Mine Strata

The vibration wave generated by the coal and rock stratum propagates in the form of an elastic stress wave between coal and rock mass. Therefore, the theoretical basis for deriving the propagation equation of vibration wave in coal and rock stratum medium is the relevant theory of stress wave [12–14]. The specific derivation process is as follows.It is assumed that there is a force shown in equation (2) in any microunit dv=dxdydz of coal and rock mass:
(2)FiFx=F′xrdv,Fy=F′yrdv,Fz=F′zrdv.uiux,uy,uz represents displacement. The equation reads
(3)ui=gradΦ+rotΨ,where Φ,Ψ are the scalar potential and vector potential. In addition to the force shown in equation (2), there are the surface force and inertial force in the microunit of coal and rock mass. Equation (4) can represent the density component of inertial force:
(4)ρ∂2ux∂t2,ρ∂2uy∂t2,ρ∂2uz∂t2.Differential equation (5) when the microunit in coal and rock mass moves can be obtained as follows:
(5)∂σx∂x+∂τyx∂y+∂τzx∂z+Fx=ρ∂2ux∂t2,∂σy∂x+∂τzy∂y+∂τxy∂z+Fy=ρ∂2uy∂t2,∂σz∂x+∂τxz∂y+∂τyz∂z+Fz=ρ∂2uz∂t2.Equations (6)–(9) are geometric and physical equations in elasticity.Geometric equations:(6)εx=∂u∂x,εy=∂u∂y,εz=∂ω∂y,(7)γxy=∂v∂x+∂v∂x,γzx=∂u∂z+∂ω∂x,γyz=∂v∂z+∂ω∂y.Physical equations:(8)εx=1Eσx−μσy+σz,εy=1Eσy−μσx+σz,εz=1Eσz−μσx+σy,(9)γxy=21+μEτxy,γyz=21+μEτyz,γzx=21+μEτzx.Equations (6)–(9) are brought into equation (5), so that the differential equation of elastic wave propagation in coal and rock stratum is obtained as
(10)λ+μ∂e∂x+μ∇2ux+Fx=ρ∂2ux∂t2,λ+μ∂e∂x+μ∇2uy+Fy=ρ∂2uy∂t2,λ+μ∂e∂z+μ∇2uz+Fz=ρ∂2uz∂t2,(11)λ=Ev21+v1−2v,(12)μ=E21+v,(13)∇2=∂∂x2+∂∂y2+∂∂z2,(14)e=∂∂x+∂∂y+∂∂z,where λ is constant, v is Poisson’s ratio, E is Young’s modulus, and μ is shear modulus.IfFi=0, equation (15) can be obtained by deriving equation (10):
(15)∂2ux∂t2=λ+2μρ∇2ux,∂2uy∂t2=λ+2μρ∇2uy,∂2uz∂t2=λ+2μρ∇2uz.If the rotor can replaceui, equation (16) can be obtained:
(16)∂2rotui∂t2=μρ∇2rotui.Equations (15) and (16) can, respectively, describe the deformation caused by microseism on the volume and position of coal and rock stratum. They can be written as
(17)∂2Φ∂t2=λ+2μρ∇2Φ=Vp2∇2Φ,(18)∂2ψ∂t2=μρ∇2ψ=Vs2∇2ψ.The above equations display that the force propagating in coal and rock stratum will propagate in two different forms: shear wave (S wave) and longitudinal wave (P wave). P wave propagates faster than S wave in coal and rock strata [15–17]. Its velocity expression reads
(19)Vp=E1−vρ1+v1−2v.The propagation direction of the S wave differs from that of the P wave. It is perpendicular to the vibration direction of coal and rock stratum. The velocity expression of the S wave reads(20)Vs=E2ρ1+v,whereρ is density of coal and rock stratum and v is Poisson’s ratio.


### 2.2. Principle and Method of Microseismic Monitoring and Positioning

Figure3 shows the distribution of focal points and sensors.Figure 3
Distribution of focal point and sensor.If the microseismic focal point in Figure3 is Xx0,y0,z0,t0 and the sensor is represented by Tixi,yi,zi,ti, x,y,z represent the spatial position and t is time [18–21]. Unlike S wave, picking up P wave is relatively simple. Equation (21) can be used to locate focal points at different time points:
(21)vti−t0=xi−x02+yi−y02+zi−z02,where all parameters except x0,y0,z0,t0 are known.One of the methods to locate the microseismic focal point is the simplex method, as shown in Figure4.Figure 4
Iterative tetrahedron diagram of the simplex method.Equation (22) is the functional expression of the method:
(22)w=∑i=1nti−xi−x0+yi−y0+zi−z0v−t0,where i is the number of microseismic sensors is v is set velocity of vibration wave.It is assumed thatA,B,C,andD in the left figure of Figure 4 are the occurrence points of microseisms. First, the w values of the four points are calculated by equation (22), and the point with the largest function value among the four points is found and removed according to the calculation results. It is assumed that the maximum value of the function is point A. After the removal of point A and some operations such as shrinking and stretching the graph, vertex S is selected to finally form a new tetrahedron SBCD. Then, the above operations are repeated until the limit of the objective function or the constraint of the number of iterations is reached, and the process is over. At this time, the minimum point of the function value is the occurrence point of microseisms [22, 23].


### 2.3. Introduction of the Microseismic Monitoring System

The proposed microseismic focal point location method completely differs from the original location method. The advantage of building a search engine based on the LSH algorithm is that iterative calculation is not required when determining the focal point position, so as to reduce the damage caused by rockburst to rock mass [24].Microseismic focal point location technology mainly determines the spatial position of the focal point through the vibration wave released by coal and rock mass. It can detect mine seismic activities in real time, determine the spatial position of the focal point, and calculate microseismic energy to judge the microseismic strength of coal and rock strata [25–27]. Figure 5 is a schematic diagram of the microseismic monitoring system.Figure 5
Schematic diagram of the microseismic monitoring system.There are 10 geophones in the mining area studied. Figure6 shows their spatial coordinates.Figure 6
Coordinate diagram of geophones.Mainly, the underground geophone is powered by the ground acquisition station. Each geophone will receive 37-42 V safety voltage from the acquisition station, and the acquisition station contains a fault indicator light, which can monitor the faults of underground lines in real time. The downhole environment is quite complex, so it is essential to protect the geophone sensor. Figure7 is a schematic diagram of its protection device.Figure 7
Protection device diagram of geophone sensor.


### 2.4. Scheme Design of Ensemble Empirical Mode Decomposition (EEMD) Wavelet Threshold Denoising Algorithm for Coal Mine Microseismic Waveform

The mining process is often affected by other construction, resulting in a lot of noise in the signals collected by the microseismic focal point monitoring system. Therefore, it is essential to denoise the collected microseismic signals. However, the traditional denoising methods are not suitable for the nonlinear, nonstationary, and non-Gaussian signals generated by microseisms. Empirical mode decomposition (EMD) can process such a signal because of its adaptive nature, but its disadvantage is that there will be mode aliasing. Thereby, the EMD algorithm is improved to EEMD, which has all the advantages of the EMD algorithm. EEMD can decompose the collected signal according to its own characteristics without setting the basis function [28, 29]. Figure 8 is the algorithm flow chart.Figure 8
Flow chart of EEMD algorithm.


#### 2.4.1. Selection of EEMD Algorithm Parameters

The parameters of the EEMD algorithm mainly include the amplitude of white noise and the average number of integration. The amplitude of white noise is mainly selected by experience. The data difference may affect the reliability of the results, and the sensitivity of signals with different frequencies to noise is also different. The signal fluctuation will become stronger when the noise is too large. At this time, it is beneficial to decompose the high-frequency signal, but it will destroy the arrangement of extreme points of low-frequency components, resulting in mode aliasing; however, when the added noise is small, mode aliasing of low-frequency signals will be prevented. Since there is a wide frequency band in the high-frequency signal, the noise does not have a strong pulling ability for the high-frequency signal, resulting in multiple high-frequency signals mixed in multiple IMF, and mode aliasing also occurs. The standard deviation of the added noise amplitude is set to 0.2 according to relevant research. The amplitude shall be appropriately reduced when there are many high-frequency signals in the processed signals. Otherwise, the amplitude shall be increased.Relevant literature review shows that when the noise is decomposed based on the EEMD algorithm, the average number of integrations shall meet(23)ε=αN,where N is average times of integration, α is the amplitude standard deviation ratio between the added white noise and the signal to be processed, and ε is maximum relative error. After massive experiments, relevant scholars believe that the value range of 100-300 can give full play to the advantages of the EEMD algorithm.


#### 2.4.2. Wavelet Threshold Denoising Based on EEMD

The high-frequency IMF is not directly proposed but denoised by the wavelet threshold algorithm based on EEMD to retain some effective information in the high-frequency signal [30, 31]. Before denoising the high-frequency signal, the dividing point of high-frequency and low-frequency IMF needs to be determined by using the continuous mean square error criterion. First, the reconstructed signal is set by
(24)y~k=∑j=knIMFjt+rnt,k=1,2,⋯,n−1,where IMFjt is the jth order IMF component after denoising, N is the total IMF component, and rnt is the residual IMF component.Equation (25) can be obtained according to the continuous mean square error criterion:
(25)CMSEy~k,y~k+1=1N∑i=1Ny~kti−y~k+1ti2=1N∑i=1NIMFkti2.In (25), N is signal length and IMFjti is the kth order IMF component after denoising.The minimum value of the objective function is obtained through equation (26) to obtain the dividing point of high- and low-frequency IMF:
(26)js=argmin1≤k≤n−1CMSEy~k,y~k+1.The IMF component before the dividing point, that is,IMFj′j=1,2,⋯,m, is obtained after denoising the obtained dividing point and the high-frequency IMF before the dividing point by the wavelet threshold algorithm. Then, the remaining low-frequency components, IMFj′j=1,2,⋯,m, and res are reconstructed to obtain the denoised signal, expressed as
(27)x′t=∑j=1mIMF′jt+∑j=4nIMFjt+rnt.Figure9 is the algorithm flow chart of denoising based on the EEMD wavelet threshold.Figure 9
Flow chart of the denoising process.


### 2.5. The Framework of Microseismic Search Engine

#### 2.5.1. Theoretical Framework

The microseismic search engine can accurately and quickly determine the microseismic focal point location. The signal waveform generated by microseism changes with time, which is similar to sound signals [32]. In the determination of the focal point position, it is assumed that a waveform very similar to the input signal is found in the waveform database; then, the found waveform microseismic location is the place of this microseismic occurrence. Figure 10 shows the steps of microseismic search.Figure 10
Steps of microseismic search engine.


#### 2.5.2. Fast Retrieval Algorithm

Finding the waveform similar to the input microseismic waveform from the microseismic database is a crucial step of the microseismic search engine. In short, it is to search for the similarity of the microseismic waveform. At present, the local sensitive hash algorithm has been applied in image and audio retrieval, text retrieval, and other aspects. It can effectively detect high-dimensional data with a short time and high accuracy.Based on the local sensitive hash function, the local sensitive hash algorithm defines the function mapped fromSn to B set as F. Any hash function f is selected from the hash function family, and any two points a and b are analyzed to make fa=fb.It is assumed that pointsa and b meet the conditions in
(28)Ifa−b≤S,thenPrFfa=fb≥P1,Ifa−b≤cS,thenPrFfa=fb≤P2.In general,c>1,P1>P2.


### 2.6. The Local Sensitive Hash Algorithm Based onP Stable Distribution

#### 2.6.1.P Stable Distribution

U is assumed to be a distribution in the set of real numbers R. If there is an integer not less than 0, any real number S1,S2,⋯,Sn and random variable T1,T2,⋯,Tn are independently and identically distributed in U, the distributions of variables ∑isiTi and ∑isip1/pT are consistent, and T is a random variable subject to U. U satisfies P stable distribution.WhenP values are 1 and 2, they are 1 stable distribution and 2 stable distribution, respectively. Equation (29) is its probability density function:
(29)cx=1π11+x2,gx=12πe−x2/2.


#### 2.6.2. Algorithm Description

P stable distribution first needs to define the hash function, as shown in
(30)hm=s⋅m+KW,where s is the vector, subject to standard normal distribution; m is the vector formed by dataset; K is a random number; and W is segment length on the straight line.For any two vectorsm1andm2, if the value of m1−m2 is small, the two vectors are very likely to collide. If the distance between two vectors is far, the two vectors will not collide. The distance between two high-dimensional data can be kept unchanged by equally dividing and labeling the real number axis.k functions are selected from the hash function h1,h2,⋯,hn to form the function gx, expressed as
(31)gx=h1x,h2x,⋯,hkx.L functions gx form g1x,⋯,gLx. Any function can map a dataset to a hash table. The vector Si=S1,S2,⋯,Sdi=1,2,⋯,k is used as a projection vector to map the point mi in the dataset to the hash bucket gmi=h1mi,h2mi,⋯,hkmi. The projection values of points in the same hash bucket are the same. The specific process of the algorithm based on P stable distribution is as follows.L,k,K,W,m and dataset dimension d have been given. L∗kd-dimensional vectors L∗k are randomly generated to map the dataset, and equation (32) is obtained:
(32)g1mi=h11mi,h12mi,⋯,h1kmii=1,⋯,k⋯gLmi=hL1mi,hL2mi,⋯,hLkmii=1,⋯,k.The query points are mapped to the random space to obtain(33)xhiq=him,i=1,2,⋯,L.Approximate points similar to query points are obtained.


#### 2.6.3. Local Sensitive Hash Algorithm Based on Multisearch

Figure11 shows the steps of the multisearch local sensitive hash algorithm.Figure 11
Specific steps of microseismic search engine.Equation (34) is a hash function based on P stable distribution:
(34)hsij,Kijm=sij⋅m+KijW.This function indicates thatm is projected in the direction of Sij and divided into the slot of W width.


#### 2.6.4. LSH Microseismic Search Engine Model Based on Multisearch

Figure11 shows the specific steps of the LSH microseismic search engine based on multisearch.In this experiment, ten groups of microseismic events are selected as the parameter set of the LSH algorithm. Each set of parameters is tested 10 times, and the average value is calculated to ensure the accuracy of the parameter results. When the search engine algorithm is used to query the input data, the query results must meet the corresponding conditions. The two indicators of recall and precision can judge the quality of query results. The calculation equations of recall rate and precision read(35)recall=Aa∩TaAa,(36)precision=Aa∩TaTa,where a is the query point, Ta is the set of query results, and Aa is the set of results satisfying the conditions.The performance of the LSH algorithm largely depends on three parameters: dimensionk of hash function family, number L of hash tables, and interval size L. Therefore, the above three parameters need to be determined first. Equation (37) displays the probability of collision between the two vectors after hash:
(37)pu=Pra,bha,bp=ha,bq=∫0w1ufstu1−twdt.k functions are selected optionally from the hash function family and mapped, represented by
(38)gx=h1x,⋯,hkx.L hash functions are selected optionally from the k-dimensional hash function family. Equation (39) is the probability of collision of vectors after projection:
(39)qu,k,L=1−1−pukL.The purpose of the waveform query is to obtain all waveforms with a Euclidean distance less than the query rangeu0 from the database. After the collision probability and density function of the vector are obtained, the calculation equations of recall rate and precision read
(40)Rk,L=∫0N0fuqu,k,Ldu∫0N0fudu,(41)Pk,L=∫0N0fuqu,k,Ldu∫0∞fuqu,k,Ldu.An important index to evaluate the retrieval process is the retrieval time. While ensuring the recall rate and precision, the shorter the time spent in the retrieval process is, the better the retrieval efficiency is. When the three parametersk,L,andW remain unchanged, the number of hash tables will exert a certain impact on the retrieval time, so the selected number of hash tables L should be appropriate.


## 2.1. Principle of Microseismic Monitoring Technology

### 2.1.1. Generation Principle of Microseismic Signal in Coal Mine Strata [9–11]

Microseismic refers to the destruction of rock structures under the influence of mining behavior, which produces a kind of elastic energy. When the generated energy continues to accumulate and reaches a limit, it will be released and propagated in the form of an elastic wave. Figure1 is its schematic diagram.Figure 1
Schematic diagram of microseismic signal propagation.Mine microseism is determined by the damage stress of rock mass and the accumulation ability of rock mass to elastic properties. There is a positive correlation between the stress causing damage to the rock mass and the strength of the rock mass. The greater the stress required for damage to the rock mass is, the greater the strength of the rock mass is. The Mohr-Coulomb criterion considers the failure criterion of matrix rock block and the weak structural plane of a broken body under compressive shear stress, expressed as(1)τ=σtanϕ+C,where τ,σ are shear stress and normal stress on the failure surface of rock mass, ϕ is the angle when friction is caused inside the rock mass, tanϕ is the internal friction coefficient, and C is cohesion force in rock mass.Figure2 displays the causes of microseismic in coal and rock mass.Figure 2
Causes of microseismic in coal and rock mass.


### 2.1.2. Propagation of Microseismic Signal in Coal Mine Strata

The vibration wave generated by the coal and rock stratum propagates in the form of an elastic stress wave between coal and rock mass. Therefore, the theoretical basis for deriving the propagation equation of vibration wave in coal and rock stratum medium is the relevant theory of stress wave [12–14]. The specific derivation process is as follows.It is assumed that there is a force shown in equation (2) in any microunit dv=dxdydz of coal and rock mass:
(2)FiFx=F′xrdv,Fy=F′yrdv,Fz=F′zrdv.uiux,uy,uz represents displacement. The equation reads
(3)ui=gradΦ+rotΨ,where Φ,Ψ are the scalar potential and vector potential. In addition to the force shown in equation (2), there are the surface force and inertial force in the microunit of coal and rock mass. Equation (4) can represent the density component of inertial force:
(4)ρ∂2ux∂t2,ρ∂2uy∂t2,ρ∂2uz∂t2.Differential equation (5) when the microunit in coal and rock mass moves can be obtained as follows:
(5)∂σx∂x+∂τyx∂y+∂τzx∂z+Fx=ρ∂2ux∂t2,∂σy∂x+∂τzy∂y+∂τxy∂z+Fy=ρ∂2uy∂t2,∂σz∂x+∂τxz∂y+∂τyz∂z+Fz=ρ∂2uz∂t2.Equations (6)–(9) are geometric and physical equations in elasticity.Geometric equations:(6)εx=∂u∂x,εy=∂u∂y,εz=∂ω∂y,(7)γxy=∂v∂x+∂v∂x,γzx=∂u∂z+∂ω∂x,γyz=∂v∂z+∂ω∂y.Physical equations:(8)εx=1Eσx−μσy+σz,εy=1Eσy−μσx+σz,εz=1Eσz−μσx+σy,(9)γxy=21+μEτxy,γyz=21+μEτyz,γzx=21+μEτzx.Equations (6)–(9) are brought into equation (5), so that the differential equation of elastic wave propagation in coal and rock stratum is obtained as
(10)λ+μ∂e∂x+μ∇2ux+Fx=ρ∂2ux∂t2,λ+μ∂e∂x+μ∇2uy+Fy=ρ∂2uy∂t2,λ+μ∂e∂z+μ∇2uz+Fz=ρ∂2uz∂t2,(11)λ=Ev21+v1−2v,(12)μ=E21+v,(13)∇2=∂∂x2+∂∂y2+∂∂z2,(14)e=∂∂x+∂∂y+∂∂z,where λ is constant, v is Poisson’s ratio, E is Young’s modulus, and μ is shear modulus.IfFi=0, equation (15) can be obtained by deriving equation (10):
(15)∂2ux∂t2=λ+2μρ∇2ux,∂2uy∂t2=λ+2μρ∇2uy,∂2uz∂t2=λ+2μρ∇2uz.If the rotor can replaceui, equation (16) can be obtained:
(16)∂2rotui∂t2=μρ∇2rotui.Equations (15) and (16) can, respectively, describe the deformation caused by microseism on the volume and position of coal and rock stratum. They can be written as
(17)∂2Φ∂t2=λ+2μρ∇2Φ=Vp2∇2Φ,(18)∂2ψ∂t2=μρ∇2ψ=Vs2∇2ψ.The above equations display that the force propagating in coal and rock stratum will propagate in two different forms: shear wave (S wave) and longitudinal wave (P wave). P wave propagates faster than S wave in coal and rock strata [15–17]. Its velocity expression reads
(19)Vp=E1−vρ1+v1−2v.The propagation direction of the S wave differs from that of the P wave. It is perpendicular to the vibration direction of coal and rock stratum. The velocity expression of the S wave reads(20)Vs=E2ρ1+v,whereρ is density of coal and rock stratum and v is Poisson’s ratio.


## 2.1.1. Generation Principle of Microseismic Signal in Coal Mine Strata [9–11]

Microseismic refers to the destruction of rock structures under the influence of mining behavior, which produces a kind of elastic energy. When the generated energy continues to accumulate and reaches a limit, it will be released and propagated in the form of an elastic wave. Figure1 is its schematic diagram.Figure 1
Schematic diagram of microseismic signal propagation.Mine microseism is determined by the damage stress of rock mass and the accumulation ability of rock mass to elastic properties. There is a positive correlation between the stress causing damage to the rock mass and the strength of the rock mass. The greater the stress required for damage to the rock mass is, the greater the strength of the rock mass is. The Mohr-Coulomb criterion considers the failure criterion of matrix rock block and the weak structural plane of a broken body under compressive shear stress, expressed as(1)τ=σtanϕ+C,where τ,σ are shear stress and normal stress on the failure surface of rock mass, ϕ is the angle when friction is caused inside the rock mass, tanϕ is the internal friction coefficient, and C is cohesion force in rock mass.Figure2 displays the causes of microseismic in coal and rock mass.Figure 2
Causes of microseismic in coal and rock mass.


## 2.1.2. Propagation of Microseismic Signal in Coal Mine Strata

The vibration wave generated by the coal and rock stratum propagates in the form of an elastic stress wave between coal and rock mass. Therefore, the theoretical basis for deriving the propagation equation of vibration wave in coal and rock stratum medium is the relevant theory of stress wave [12–14]. The specific derivation process is as follows.It is assumed that there is a force shown in equation (2) in any microunit dv=dxdydz of coal and rock mass:
(2)FiFx=F′xrdv,Fy=F′yrdv,Fz=F′zrdv.uiux,uy,uz represents displacement. The equation reads
(3)ui=gradΦ+rotΨ,where Φ,Ψ are the scalar potential and vector potential. In addition to the force shown in equation (2), there are the surface force and inertial force in the microunit of coal and rock mass. Equation (4) can represent the density component of inertial force:
(4)ρ∂2ux∂t2,ρ∂2uy∂t2,ρ∂2uz∂t2.Differential equation (5) when the microunit in coal and rock mass moves can be obtained as follows:
(5)∂σx∂x+∂τyx∂y+∂τzx∂z+Fx=ρ∂2ux∂t2,∂σy∂x+∂τzy∂y+∂τxy∂z+Fy=ρ∂2uy∂t2,∂σz∂x+∂τxz∂y+∂τyz∂z+Fz=ρ∂2uz∂t2.Equations (6)–(9) are geometric and physical equations in elasticity.Geometric equations:(6)εx=∂u∂x,εy=∂u∂y,εz=∂ω∂y,(7)γxy=∂v∂x+∂v∂x,γzx=∂u∂z+∂ω∂x,γyz=∂v∂z+∂ω∂y.Physical equations:(8)εx=1Eσx−μσy+σz,εy=1Eσy−μσx+σz,εz=1Eσz−μσx+σy,(9)γxy=21+μEτxy,γyz=21+μEτyz,γzx=21+μEτzx.Equations (6)–(9) are brought into equation (5), so that the differential equation of elastic wave propagation in coal and rock stratum is obtained as
(10)λ+μ∂e∂x+μ∇2ux+Fx=ρ∂2ux∂t2,λ+μ∂e∂x+μ∇2uy+Fy=ρ∂2uy∂t2,λ+μ∂e∂z+μ∇2uz+Fz=ρ∂2uz∂t2,(11)λ=Ev21+v1−2v,(12)μ=E21+v,(13)∇2=∂∂x2+∂∂y2+∂∂z2,(14)e=∂∂x+∂∂y+∂∂z,where λ is constant, v is Poisson’s ratio, E is Young’s modulus, and μ is shear modulus.IfFi=0, equation (15) can be obtained by deriving equation (10):
(15)∂2ux∂t2=λ+2μρ∇2ux,∂2uy∂t2=λ+2μρ∇2uy,∂2uz∂t2=λ+2μρ∇2uz.If the rotor can replaceui, equation (16) can be obtained:
(16)∂2rotui∂t2=μρ∇2rotui.Equations (15) and (16) can, respectively, describe the deformation caused by microseism on the volume and position of coal and rock stratum. They can be written as
(17)∂2Φ∂t2=λ+2μρ∇2Φ=Vp2∇2Φ,(18)∂2ψ∂t2=μρ∇2ψ=Vs2∇2ψ.The above equations display that the force propagating in coal and rock stratum will propagate in two different forms: shear wave (S wave) and longitudinal wave (P wave). P wave propagates faster than S wave in coal and rock strata [15–17]. Its velocity expression reads
(19)Vp=E1−vρ1+v1−2v.The propagation direction of the S wave differs from that of the P wave. It is perpendicular to the vibration direction of coal and rock stratum. The velocity expression of the S wave reads(20)Vs=E2ρ1+v,whereρ is density of coal and rock stratum and v is Poisson’s ratio.


## 2.2. Principle and Method of Microseismic Monitoring and Positioning

Figure3 shows the distribution of focal points and sensors.Figure 3
Distribution of focal point and sensor.If the microseismic focal point in Figure3 is Xx0,y0,z0,t0 and the sensor is represented by Tixi,yi,zi,ti, x,y,z represent the spatial position and t is time [18–21]. Unlike S wave, picking up P wave is relatively simple. Equation (21) can be used to locate focal points at different time points:
(21)vti−t0=xi−x02+yi−y02+zi−z02,where all parameters except x0,y0,z0,t0 are known.One of the methods to locate the microseismic focal point is the simplex method, as shown in Figure4.Figure 4
Iterative tetrahedron diagram of the simplex method.Equation (22) is the functional expression of the method:
(22)w=∑i=1nti−xi−x0+yi−y0+zi−z0v−t0,where i is the number of microseismic sensors is v is set velocity of vibration wave.It is assumed thatA,B,C,andD in the left figure of Figure 4 are the occurrence points of microseisms. First, the w values of the four points are calculated by equation (22), and the point with the largest function value among the four points is found and removed according to the calculation results. It is assumed that the maximum value of the function is point A. After the removal of point A and some operations such as shrinking and stretching the graph, vertex S is selected to finally form a new tetrahedron SBCD. Then, the above operations are repeated until the limit of the objective function or the constraint of the number of iterations is reached, and the process is over. At this time, the minimum point of the function value is the occurrence point of microseisms [22, 23].


## 2.3. Introduction of the Microseismic Monitoring System

The proposed microseismic focal point location method completely differs from the original location method. The advantage of building a search engine based on the LSH algorithm is that iterative calculation is not required when determining the focal point position, so as to reduce the damage caused by rockburst to rock mass [24].Microseismic focal point location technology mainly determines the spatial position of the focal point through the vibration wave released by coal and rock mass. It can detect mine seismic activities in real time, determine the spatial position of the focal point, and calculate microseismic energy to judge the microseismic strength of coal and rock strata [25–27]. Figure 5 is a schematic diagram of the microseismic monitoring system.Figure 5
Schematic diagram of the microseismic monitoring system.There are 10 geophones in the mining area studied. Figure6 shows their spatial coordinates.Figure 6
Coordinate diagram of geophones.Mainly, the underground geophone is powered by the ground acquisition station. Each geophone will receive 37-42 V safety voltage from the acquisition station, and the acquisition station contains a fault indicator light, which can monitor the faults of underground lines in real time. The downhole environment is quite complex, so it is essential to protect the geophone sensor. Figure7 is a schematic diagram of its protection device.Figure 7
Protection device diagram of geophone sensor.


## 2.4. Scheme Design of Ensemble Empirical Mode Decomposition (EEMD) Wavelet Threshold Denoising Algorithm for Coal Mine Microseismic Waveform

The mining process is often affected by other construction, resulting in a lot of noise in the signals collected by the microseismic focal point monitoring system. Therefore, it is essential to denoise the collected microseismic signals. However, the traditional denoising methods are not suitable for the nonlinear, nonstationary, and non-Gaussian signals generated by microseisms. Empirical mode decomposition (EMD) can process such a signal because of its adaptive nature, but its disadvantage is that there will be mode aliasing. Thereby, the EMD algorithm is improved to EEMD, which has all the advantages of the EMD algorithm. EEMD can decompose the collected signal according to its own characteristics without setting the basis function [28, 29]. Figure 8 is the algorithm flow chart.Figure 8
Flow chart of EEMD algorithm.


### 2.4.1. Selection of EEMD Algorithm Parameters

The parameters of the EEMD algorithm mainly include the amplitude of white noise and the average number of integration. The amplitude of white noise is mainly selected by experience. The data difference may affect the reliability of the results, and the sensitivity of signals with different frequencies to noise is also different. The signal fluctuation will become stronger when the noise is too large. At this time, it is beneficial to decompose the high-frequency signal, but it will destroy the arrangement of extreme points of low-frequency components, resulting in mode aliasing; however, when the added noise is small, mode aliasing of low-frequency signals will be prevented. Since there is a wide frequency band in the high-frequency signal, the noise does not have a strong pulling ability for the high-frequency signal, resulting in multiple high-frequency signals mixed in multiple IMF, and mode aliasing also occurs. The standard deviation of the added noise amplitude is set to 0.2 according to relevant research. The amplitude shall be appropriately reduced when there are many high-frequency signals in the processed signals. Otherwise, the amplitude shall be increased.Relevant literature review shows that when the noise is decomposed based on the EEMD algorithm, the average number of integrations shall meet(23)ε=αN,where N is average times of integration, α is the amplitude standard deviation ratio between the added white noise and the signal to be processed, and ε is maximum relative error. After massive experiments, relevant scholars believe that the value range of 100-300 can give full play to the advantages of the EEMD algorithm.


### 2.4.2. Wavelet Threshold Denoising Based on EEMD

The high-frequency IMF is not directly proposed but denoised by the wavelet threshold algorithm based on EEMD to retain some effective information in the high-frequency signal [30, 31]. Before denoising the high-frequency signal, the dividing point of high-frequency and low-frequency IMF needs to be determined by using the continuous mean square error criterion. First, the reconstructed signal is set by
(24)y~k=∑j=knIMFjt+rnt,k=1,2,⋯,n−1,where IMFjt is the jth order IMF component after denoising, N is the total IMF component, and rnt is the residual IMF component.Equation (25) can be obtained according to the continuous mean square error criterion:
(25)CMSEy~k,y~k+1=1N∑i=1Ny~kti−y~k+1ti2=1N∑i=1NIMFkti2.In (25), N is signal length and IMFjti is the kth order IMF component after denoising.The minimum value of the objective function is obtained through equation (26) to obtain the dividing point of high- and low-frequency IMF:
(26)js=argmin1≤k≤n−1CMSEy~k,y~k+1.The IMF component before the dividing point, that is,IMFj′j=1,2,⋯,m, is obtained after denoising the obtained dividing point and the high-frequency IMF before the dividing point by the wavelet threshold algorithm. Then, the remaining low-frequency components, IMFj′j=1,2,⋯,m, and res are reconstructed to obtain the denoised signal, expressed as
(27)x′t=∑j=1mIMF′jt+∑j=4nIMFjt+rnt.Figure9 is the algorithm flow chart of denoising based on the EEMD wavelet threshold.Figure 9
Flow chart of the denoising process.


## 2.4.1. Selection of EEMD Algorithm Parameters

The parameters of the EEMD algorithm mainly include the amplitude of white noise and the average number of integration. The amplitude of white noise is mainly selected by experience. The data difference may affect the reliability of the results, and the sensitivity of signals with different frequencies to noise is also different. The signal fluctuation will become stronger when the noise is too large. At this time, it is beneficial to decompose the high-frequency signal, but it will destroy the arrangement of extreme points of low-frequency components, resulting in mode aliasing; however, when the added noise is small, mode aliasing of low-frequency signals will be prevented. Since there is a wide frequency band in the high-frequency signal, the noise does not have a strong pulling ability for the high-frequency signal, resulting in multiple high-frequency signals mixed in multiple IMF, and mode aliasing also occurs. The standard deviation of the added noise amplitude is set to 0.2 according to relevant research. The amplitude shall be appropriately reduced when there are many high-frequency signals in the processed signals. Otherwise, the amplitude shall be increased.Relevant literature review shows that when the noise is decomposed based on the EEMD algorithm, the average number of integrations shall meet(23)ε=αN,where N is average times of integration, α is the amplitude standard deviation ratio between the added white noise and the signal to be processed, and ε is maximum relative error. After massive experiments, relevant scholars believe that the value range of 100-300 can give full play to the advantages of the EEMD algorithm.


## 2.4.2. Wavelet Threshold Denoising Based on EEMD

The high-frequency IMF is not directly proposed but denoised by the wavelet threshold algorithm based on EEMD to retain some effective information in the high-frequency signal [30, 31]. Before denoising the high-frequency signal, the dividing point of high-frequency and low-frequency IMF needs to be determined by using the continuous mean square error criterion. First, the reconstructed signal is set by
(24)y~k=∑j=knIMFjt+rnt,k=1,2,⋯,n−1,where IMFjt is the jth order IMF component after denoising, N is the total IMF component, and rnt is the residual IMF component.Equation (25) can be obtained according to the continuous mean square error criterion:
(25)CMSEy~k,y~k+1=1N∑i=1Ny~kti−y~k+1ti2=1N∑i=1NIMFkti2.In (25), N is signal length and IMFjti is the kth order IMF component after denoising.The minimum value of the objective function is obtained through equation (26) to obtain the dividing point of high- and low-frequency IMF:
(26)js=argmin1≤k≤n−1CMSEy~k,y~k+1.The IMF component before the dividing point, that is,IMFj′j=1,2,⋯,m, is obtained after denoising the obtained dividing point and the high-frequency IMF before the dividing point by the wavelet threshold algorithm. Then, the remaining low-frequency components, IMFj′j=1,2,⋯,m, and res are reconstructed to obtain the denoised signal, expressed as
(27)x′t=∑j=1mIMF′jt+∑j=4nIMFjt+rnt.Figure9 is the algorithm flow chart of denoising based on the EEMD wavelet threshold.Figure 9
Flow chart of the denoising process.


## 2.5. The Framework of Microseismic Search Engine

### 2.5.1. Theoretical Framework

The microseismic search engine can accurately and quickly determine the microseismic focal point location. The signal waveform generated by microseism changes with time, which is similar to sound signals [32]. In the determination of the focal point position, it is assumed that a waveform very similar to the input signal is found in the waveform database; then, the found waveform microseismic location is the place of this microseismic occurrence. Figure 10 shows the steps of microseismic search.Figure 10
Steps of microseismic search engine.


### 2.5.2. Fast Retrieval Algorithm

Finding the waveform similar to the input microseismic waveform from the microseismic database is a crucial step of the microseismic search engine. In short, it is to search for the similarity of the microseismic waveform. At present, the local sensitive hash algorithm has been applied in image and audio retrieval, text retrieval, and other aspects. It can effectively detect high-dimensional data with a short time and high accuracy.Based on the local sensitive hash function, the local sensitive hash algorithm defines the function mapped fromSn to B set as F. Any hash function f is selected from the hash function family, and any two points a and b are analyzed to make fa=fb.It is assumed that pointsa and b meet the conditions in
(28)Ifa−b≤S,thenPrFfa=fb≥P1,Ifa−b≤cS,thenPrFfa=fb≤P2.In general,c>1,P1>P2.


## 2.5.1. Theoretical Framework

The microseismic search engine can accurately and quickly determine the microseismic focal point location. The signal waveform generated by microseism changes with time, which is similar to sound signals [32]. In the determination of the focal point position, it is assumed that a waveform very similar to the input signal is found in the waveform database; then, the found waveform microseismic location is the place of this microseismic occurrence. Figure 10 shows the steps of microseismic search.Figure 10
Steps of microseismic search engine.


## 2.5.2. Fast Retrieval Algorithm

Finding the waveform similar to the input microseismic waveform from the microseismic database is a crucial step of the microseismic search engine. In short, it is to search for the similarity of the microseismic waveform. At present, the local sensitive hash algorithm has been applied in image and audio retrieval, text retrieval, and other aspects. It can effectively detect high-dimensional data with a short time and high accuracy.Based on the local sensitive hash function, the local sensitive hash algorithm defines the function mapped fromSn to B set as F. Any hash function f is selected from the hash function family, and any two points a and b are analyzed to make fa=fb.It is assumed that pointsa and b meet the conditions in
(28)Ifa−b≤S,thenPrFfa=fb≥P1,Ifa−b≤cS,thenPrFfa=fb≤P2.In general,c>1,P1>P2.


## 2.6. The Local Sensitive Hash Algorithm Based onP Stable Distribution

### 2.6.1.P Stable Distribution

U is assumed to be a distribution in the set of real numbers R. If there is an integer not less than 0, any real number S1,S2,⋯,Sn and random variable T1,T2,⋯,Tn are independently and identically distributed in U, the distributions of variables ∑isiTi and ∑isip1/pT are consistent, and T is a random variable subject to U. U satisfies P stable distribution.WhenP values are 1 and 2, they are 1 stable distribution and 2 stable distribution, respectively. Equation (29) is its probability density function:
(29)cx=1π11+x2,gx=12πe−x2/2.


### 2.6.2. Algorithm Description

P stable distribution first needs to define the hash function, as shown in
(30)hm=s⋅m+KW,where s is the vector, subject to standard normal distribution; m is the vector formed by dataset; K is a random number; and W is segment length on the straight line.For any two vectorsm1andm2, if the value of m1−m2 is small, the two vectors are very likely to collide. If the distance between two vectors is far, the two vectors will not collide. The distance between two high-dimensional data can be kept unchanged by equally dividing and labeling the real number axis.k functions are selected from the hash function h1,h2,⋯,hn to form the function gx, expressed as
(31)gx=h1x,h2x,⋯,hkx.L functions gx form g1x,⋯,gLx. Any function can map a dataset to a hash table. The vector Si=S1,S2,⋯,Sdi=1,2,⋯,k is used as a projection vector to map the point mi in the dataset to the hash bucket gmi=h1mi,h2mi,⋯,hkmi. The projection values of points in the same hash bucket are the same. The specific process of the algorithm based on P stable distribution is as follows.L,k,K,W,m and dataset dimension d have been given. L∗kd-dimensional vectors L∗k are randomly generated to map the dataset, and equation (32) is obtained:
(32)g1mi=h11mi,h12mi,⋯,h1kmii=1,⋯,k⋯gLmi=hL1mi,hL2mi,⋯,hLkmii=1,⋯,k.The query points are mapped to the random space to obtain(33)xhiq=him,i=1,2,⋯,L.Approximate points similar to query points are obtained.


### 2.6.3. Local Sensitive Hash Algorithm Based on Multisearch

Figure11 shows the steps of the multisearch local sensitive hash algorithm.Figure 11
Specific steps of microseismic search engine.Equation (34) is a hash function based on P stable distribution:
(34)hsij,Kijm=sij⋅m+KijW.This function indicates thatm is projected in the direction of Sij and divided into the slot of W width.


### 2.6.4. LSH Microseismic Search Engine Model Based on Multisearch

Figure11 shows the specific steps of the LSH microseismic search engine based on multisearch.In this experiment, ten groups of microseismic events are selected as the parameter set of the LSH algorithm. Each set of parameters is tested 10 times, and the average value is calculated to ensure the accuracy of the parameter results. When the search engine algorithm is used to query the input data, the query results must meet the corresponding conditions. The two indicators of recall and precision can judge the quality of query results. The calculation equations of recall rate and precision read(35)recall=Aa∩TaAa,(36)precision=Aa∩TaTa,where a is the query point, Ta is the set of query results, and Aa is the set of results satisfying the conditions.The performance of the LSH algorithm largely depends on three parameters: dimensionk of hash function family, number L of hash tables, and interval size L. Therefore, the above three parameters need to be determined first. Equation (37) displays the probability of collision between the two vectors after hash:
(37)pu=Pra,bha,bp=ha,bq=∫0w1ufstu1−twdt.k functions are selected optionally from the hash function family and mapped, represented by
(38)gx=h1x,⋯,hkx.L hash functions are selected optionally from the k-dimensional hash function family. Equation (39) is the probability of collision of vectors after projection:
(39)qu,k,L=1−1−pukL.The purpose of the waveform query is to obtain all waveforms with a Euclidean distance less than the query rangeu0 from the database. After the collision probability and density function of the vector are obtained, the calculation equations of recall rate and precision read
(40)Rk,L=∫0N0fuqu,k,Ldu∫0N0fudu,(41)Pk,L=∫0N0fuqu,k,Ldu∫0∞fuqu,k,Ldu.An important index to evaluate the retrieval process is the retrieval time. While ensuring the recall rate and precision, the shorter the time spent in the retrieval process is, the better the retrieval efficiency is. When the three parametersk,L,andW remain unchanged, the number of hash tables will exert a certain impact on the retrieval time, so the selected number of hash tables L should be appropriate.


## 2.6.1.P Stable Distribution

U is assumed to be a distribution in the set of real numbers R. If there is an integer not less than 0, any real number S1,S2,⋯,Sn and random variable T1,T2,⋯,Tn are independently and identically distributed in U, the distributions of variables ∑isiTi and ∑isip1/pT are consistent, and T is a random variable subject to U. U satisfies P stable distribution.WhenP values are 1 and 2, they are 1 stable distribution and 2 stable distribution, respectively. Equation (29) is its probability density function:
(29)cx=1π11+x2,gx=12πe−x2/2.


## 2.6.2. Algorithm Description

P stable distribution first needs to define the hash function, as shown in
(30)hm=s⋅m+KW,where s is the vector, subject to standard normal distribution; m is the vector formed by dataset; K is a random number; and W is segment length on the straight line.For any two vectorsm1andm2, if the value of m1−m2 is small, the two vectors are very likely to collide. If the distance between two vectors is far, the two vectors will not collide. The distance between two high-dimensional data can be kept unchanged by equally dividing and labeling the real number axis.k functions are selected from the hash function h1,h2,⋯,hn to form the function gx, expressed as
(31)gx=h1x,h2x,⋯,hkx.L functions gx form g1x,⋯,gLx. Any function can map a dataset to a hash table. The vector Si=S1,S2,⋯,Sdi=1,2,⋯,k is used as a projection vector to map the point mi in the dataset to the hash bucket gmi=h1mi,h2mi,⋯,hkmi. The projection values of points in the same hash bucket are the same. The specific process of the algorithm based on P stable distribution is as follows.L,k,K,W,m and dataset dimension d have been given. L∗kd-dimensional vectors L∗k are randomly generated to map the dataset, and equation (32) is obtained:
(32)g1mi=h11mi,h12mi,⋯,h1kmii=1,⋯,k⋯gLmi=hL1mi,hL2mi,⋯,hLkmii=1,⋯,k.The query points are mapped to the random space to obtain(33)xhiq=him,i=1,2,⋯,L.Approximate points similar to query points are obtained.


## 2.6.3. Local Sensitive Hash Algorithm Based on Multisearch

Figure11 shows the steps of the multisearch local sensitive hash algorithm.Figure 11
Specific steps of microseismic search engine.Equation (34) is a hash function based on P stable distribution:
(34)hsij,Kijm=sij⋅m+KijW.This function indicates thatm is projected in the direction of Sij and divided into the slot of W width.


## 2.6.4. LSH Microseismic Search Engine Model Based on Multisearch

Figure11 shows the specific steps of the LSH microseismic search engine based on multisearch.In this experiment, ten groups of microseismic events are selected as the parameter set of the LSH algorithm. Each set of parameters is tested 10 times, and the average value is calculated to ensure the accuracy of the parameter results. When the search engine algorithm is used to query the input data, the query results must meet the corresponding conditions. The two indicators of recall and precision can judge the quality of query results. The calculation equations of recall rate and precision read(35)recall=Aa∩TaAa,(36)precision=Aa∩TaTa,where a is the query point, Ta is the set of query results, and Aa is the set of results satisfying the conditions.The performance of the LSH algorithm largely depends on three parameters: dimensionk of hash function family, number L of hash tables, and interval size L. Therefore, the above three parameters need to be determined first. Equation (37) displays the probability of collision between the two vectors after hash:
(37)pu=Pra,bha,bp=ha,bq=∫0w1ufstu1−twdt.k functions are selected optionally from the hash function family and mapped, represented by
(38)gx=h1x,⋯,hkx.L hash functions are selected optionally from the k-dimensional hash function family. Equation (39) is the probability of collision of vectors after projection:
(39)qu,k,L=1−1−pukL.The purpose of the waveform query is to obtain all waveforms with a Euclidean distance less than the query rangeu0 from the database. After the collision probability and density function of the vector are obtained, the calculation equations of recall rate and precision read
(40)Rk,L=∫0N0fuqu,k,Ldu∫0N0fudu,(41)Pk,L=∫0N0fuqu,k,Ldu∫0∞fuqu,k,Ldu.An important index to evaluate the retrieval process is the retrieval time. While ensuring the recall rate and precision, the shorter the time spent in the retrieval process is, the better the retrieval efficiency is. When the three parametersk,L,andW remain unchanged, the number of hash tables will exert a certain impact on the retrieval time, so the selected number of hash tables L should be appropriate.


## 3. Results

### 3.1. Parameter Analysis of LSH Microseismic Search Engine Model Based on Multisearch

The number of hash tablesL, dimension k of hash function family, and interval size are analyzed in detail.The number of hash tables will have a certain impact on the search accuracy and time. The larger the value is, the longer the search time is. In the case of limited memory, the value is generally 1-10. The dimension of the hash bucket is closely related to the dispersion of the dataset after projection. The larger thek value is, the fewer the points that enter the same hash bucket through projection are. The value is generally 2-20. The interval size is determined by the module length of the data point. The larger the W value is, the more concentrated the points in the dataset after projection are, and the longer the search time is. The value of W needs to be determined through multiple experiments.The number of hash tables is set to 1-10. All hash tables are tested 10 times, and the average value is calculated to obtain the recall rate. Figure12 is a curve of the time required for searching and the proportion of candidates retrieved with the number of hash tables.Figure 12
Operation diagram of the selection results of the hash table.Figure12 displays that the more the hash tables are, the longer the retrieval time is. Overall, when the number of hash tables is 6, the proportion of candidates retrieved, retrieval time, and recall rate are better. The hash function family dimension is set to 2-20. All hash function group dimensions are tested 10 times, and the average value is calculated to obtain the recall rate. Figure 13 is the change curve of the time required for searching and the proportion of candidates retrieved with the dimension of the hash function family.Figure 13
Operation diagram of dimension selection results of hash function family.Figure13 shows that the larger the dimension of the hash function family is, the shorter the time required for data search is. The comprehensive comparison of the above data shows that when the hash function family dimension is 14, the proportion of candidates retrieved, retrieval time, and recall rate are better. The value range of interval size W is set to 6000-11500. All interval sizes are tested 10 times, and the average value is calculated to obtain the recall rate. Figure 14 is a change curve of the time required for searching and the proportion of candidates retrieved with the interval size.Figure 14
Operation diagram of interval size selection results.Figure14 shows that when the interval size is 8000, the proportion of candidates retrieved, retrieval time, and recall rate are better. The above analysis suggests that when the number of hash tables, hash function family dimension, and interval size are 6, 14, and 8000, respectively, the time spent in data retrieval is short, the recall rate is high, and the proportion of candidates retrieved is large.Next, when the number of detection boxes is 1-90, the changes of recall rate, the time required to search, and the proportion of candidates retrieved with the number of detection boxes are analyzed. Figure15 shows the results.Figure 15
Operation diagram ofT selection results.Figure15 shows that it will take a longer time to retrieve the data when the number of detection boxes increases. When the number of detection boxes is 10, the retrieval time is 0.73021 s. When the number of detection boxes increases to 20, the retrieval time has been greater than 1 s, so it is decided that the number of detection boxes is 10. At this time, the recall rate and the proportion of search candidates are 0.825 and 0.6967, respectively.The changes in recall rate and the proportion of retrieved candidates with the number of detection boxes based onP stable distribution and multiprobe LSH are analyzed. Figure 16 shows the results.Figure 16
Comparison of operation results of multiprobe LSH andP stable distribution: (a) comparison of the proportion of candidates retrieved; (b) comparison of recall rate.
(a)(b)Figure16 shows that the proportion of candidates retrieved by multiprobe LSH is significantly better than that of P stable distribution, and the proportion of candidates retrieved is about twice higher than that of P stable distribution; multiprobe LSH also has obvious advantages on the recall rate.


### 3.2. Parameter Analysis of Search Engine Algorithm for Measured Coal Mine Microseismic Data

Because there are some differences between the experimental microseismic database and the measured microseismic database, it is still necessary to determine the parameter value of LSH before searching the measured coal mine microseismic data.The training set selected contains 296 groups of microseismic events. Ten groups of microseismic events are selected as the parameter test set of the LSH algorithm. Each group of parameter sets is tested 10 times, and its average value is calculated to ensure the accuracy of parameter results.Consistent with the method of determining the parameters in the previous section, the number of hash tables, the dimension of the hash function family, and the size of the interval are analyzed. Figure17 shows the results.Figure 17
Running diagram of results: (a) selection result of the number of hash tables; (b) selection result of the hash function family dimension; (c) selection result of the interval size.
(a)(b)(c)Figure17 shows that when the search engine algorithm parameters of the measured coal mine microseismic data are selected, the retrieval time, recall rate, and the proportion of retrieved candidates can get better values when the number of hash tables, the dimension of hash function family, and the interval size are 4, 600, and 500, respectively.


## 3.1. Parameter Analysis of LSH Microseismic Search Engine Model Based on Multisearch

The number of hash tablesL, dimension k of hash function family, and interval size are analyzed in detail.The number of hash tables will have a certain impact on the search accuracy and time. The larger the value is, the longer the search time is. In the case of limited memory, the value is generally 1-10. The dimension of the hash bucket is closely related to the dispersion of the dataset after projection. The larger thek value is, the fewer the points that enter the same hash bucket through projection are. The value is generally 2-20. The interval size is determined by the module length of the data point. The larger the W value is, the more concentrated the points in the dataset after projection are, and the longer the search time is. The value of W needs to be determined through multiple experiments.The number of hash tables is set to 1-10. All hash tables are tested 10 times, and the average value is calculated to obtain the recall rate. Figure12 is a curve of the time required for searching and the proportion of candidates retrieved with the number of hash tables.Figure 12
Operation diagram of the selection results of the hash table.Figure12 displays that the more the hash tables are, the longer the retrieval time is. Overall, when the number of hash tables is 6, the proportion of candidates retrieved, retrieval time, and recall rate are better. The hash function family dimension is set to 2-20. All hash function group dimensions are tested 10 times, and the average value is calculated to obtain the recall rate. Figure 13 is the change curve of the time required for searching and the proportion of candidates retrieved with the dimension of the hash function family.Figure 13
Operation diagram of dimension selection results of hash function family.Figure13 shows that the larger the dimension of the hash function family is, the shorter the time required for data search is. The comprehensive comparison of the above data shows that when the hash function family dimension is 14, the proportion of candidates retrieved, retrieval time, and recall rate are better. The value range of interval size W is set to 6000-11500. All interval sizes are tested 10 times, and the average value is calculated to obtain the recall rate. Figure 14 is a change curve of the time required for searching and the proportion of candidates retrieved with the interval size.Figure 14
Operation diagram of interval size selection results.Figure14 shows that when the interval size is 8000, the proportion of candidates retrieved, retrieval time, and recall rate are better. The above analysis suggests that when the number of hash tables, hash function family dimension, and interval size are 6, 14, and 8000, respectively, the time spent in data retrieval is short, the recall rate is high, and the proportion of candidates retrieved is large.Next, when the number of detection boxes is 1-90, the changes of recall rate, the time required to search, and the proportion of candidates retrieved with the number of detection boxes are analyzed. Figure15 shows the results.Figure 15
Operation diagram ofT selection results.Figure15 shows that it will take a longer time to retrieve the data when the number of detection boxes increases. When the number of detection boxes is 10, the retrieval time is 0.73021 s. When the number of detection boxes increases to 20, the retrieval time has been greater than 1 s, so it is decided that the number of detection boxes is 10. At this time, the recall rate and the proportion of search candidates are 0.825 and 0.6967, respectively.The changes in recall rate and the proportion of retrieved candidates with the number of detection boxes based onP stable distribution and multiprobe LSH are analyzed. Figure 16 shows the results.Figure 16
Comparison of operation results of multiprobe LSH andP stable distribution: (a) comparison of the proportion of candidates retrieved; (b) comparison of recall rate.
(a)(b)Figure16 shows that the proportion of candidates retrieved by multiprobe LSH is significantly better than that of P stable distribution, and the proportion of candidates retrieved is about twice higher than that of P stable distribution; multiprobe LSH also has obvious advantages on the recall rate.


## 3.2. Parameter Analysis of Search Engine Algorithm for Measured Coal Mine Microseismic Data

Because there are some differences between the experimental microseismic database and the measured microseismic database, it is still necessary to determine the parameter value of LSH before searching the measured coal mine microseismic data.The training set selected contains 296 groups of microseismic events. Ten groups of microseismic events are selected as the parameter test set of the LSH algorithm. Each group of parameter sets is tested 10 times, and its average value is calculated to ensure the accuracy of parameter results.Consistent with the method of determining the parameters in the previous section, the number of hash tables, the dimension of the hash function family, and the size of the interval are analyzed. Figure17 shows the results.Figure 17
Running diagram of results: (a) selection result of the number of hash tables; (b) selection result of the hash function family dimension; (c) selection result of the interval size.
(a)(b)(c)Figure17 shows that when the search engine algorithm parameters of the measured coal mine microseismic data are selected, the retrieval time, recall rate, and the proportion of retrieved candidates can get better values when the number of hash tables, the dimension of hash function family, and the interval size are 4, 600, and 500, respectively.


## 4. Conclusions

As one of the crucial problems in microseismic monitoring technology, the location of the microseismic focal point is the basis of the study of focal point distribution and mechanism. The accurate location of the microseismic focal point is of great significance for mine earthquake monitoring and early warning and impact risk assessment with strong destructiveness such as rockburst. Based on the stress wave method, the signal of the microseismic model is collected, the collected waveform is intercepted, and then, the waveform database is constructed. The search engine location of the constructed database is conducted based on the LSH ofP stable distribution. To solve the problems of inaccurate location information and low recall rate of retrieval results, a microseismic search engine model is constructed. This exploration is aimed at completing the following work. EEMD combined with wavelet denoising is used to denoise the coal mine microseismic signal. Then, a waveform database is established for the denoised waveform data and focal point location. The structure and mathematical model of LSH based on P stable distribution are introduced and improved, and the optimized algorithm, multiprobe LSH is obtained. The microseismic positioning model is established according to the characteristics of microseismic data. The effects of the number of hash tables, the dimension of hash function family, and interval size on the LSH microseismic positioning model are discussed, and the above parameters are determined. The results show that the microseismic search engine based on multiprobe LSH has higher recall and more accurate positioning results.Although LSH has achieved good results in the fast and accurate positioning of the microseismic search engine, many deficiencies still need to be further improved. (1) Due to the limited experimental conditions, there are fewer experimental models and fewer measured microseismic data of coal mines. More microseismic waveforms will be added to the database, so that LSH has greater applicability in the focal point location. (2) LSH parameters include the number of hash tables, hash function family dimension, and interval size. The parameters here are determined by multiple experiments. In future research work, appropriate algorithms can be used to adaptively adjust these parameters to improve the generalization ability of the model. (3) Although the application of data-oriented multiprobe LSH in microseismic search engines has achieved good results, the dataset information is not fully used. Therefore, in future research, it is necessary to increase the capacity of the dataset, use multiple PCA, make full use of the dataset information, and maintain the positioning accuracy.



---

*Source: 4007348-2021-12-29.xml*