Detector line dynamic thinning method and device

Abstract

The invention provides a wave line dynamic thinning method and device, and the method comprises the following steps: 1, determining the head and tail points of a detection line, and calculating a linear equation of a straight line connecting the head and tail points; 2, respectively calculating the distance between each point between the head point and the tail point and the straight line, and determining the maximum value of the distance; and step 3, setting a sparse threshold value of the detection line, and thinning the detection line according to the sparse threshold value of the detection line and the maximum value of the distance. According to the method for dynamically thinning the detection line, redundant data points which do not influence visual display are eliminated on the premise of ensuring a geometrical skeleton of the detection line, so that thinning of the detection line is realized.

Description

Technical Field

[0001] The present invention relates to the technical field of seismic exploration and development, and particularly relates to a method and device for dynamically thinning geophone lines. Background Art

[0002] Three-dimensional observation system design software is used for designing and processing seismic data. It provides rich tools and functions, including three-dimensional observation system design, data acquisition, data processing, image generation, etc. In the process of oil and gas exploration and development, three-dimensional observation system design software plays an important role in the whole process of seismic data acquisition.

[0003] With the wide application of high-precision and high-density observation systems, the data of shot points and geophone points grow rapidly. In the process of loading and displaying a super-large number of point sets by traditional three-dimensional observation system design software, the direct loading and rendering method is adopted, which occupies a large amount of computer resources, resulting in slow rendering efficiency and directly affecting the user experience of the software.

[0004] Therefore, it is expected to develop a method for processing geophone line data to avoid the problems of low computing efficiency and slow rendering efficiency brought by ultra-large data volume to three-dimensional observation system design software. Summary of the Invention

[0005] In view of the problems existing in the above-mentioned prior art, the present invention proposes a method for dynamically thinning geophone lines, and the method includes:

[0006] Step 1: Determine the start and end points of the geophone line, and calculate the linear equation of the straight line connecting the start and end points;

[0007] Step 2: Calculate the distances between each point between the start and end points and the straight line respectively, and determine the maximum value of the distances;

[0008] Step 3: Set a geophone line thinning threshold, and thin the geophone line according to the geophone line thinning threshold and the maximum value of the distances.

[0009] Preferably, in Step 1, the coordinates of the start and end points of the geophone line are (x 1 , y 1 ) and (x 2 , y 2 ) respectively, and the linear equation of the straight line is:

[0010]

[0011] where x represents the abscissa and y represents the ordinate.

[0012] Preferably, Step 2 includes:

[0013] Step 21: Convert the straight-line equation into the general form: Ax + By + C = 0, where A, B, and C represent the coefficients of the general form of the straight-line equation;

[0014] Step 22: Calculate the distance between each point and the straight line respectively according to the following formula:

[0015]

[0016] where di represents the distance between the i-th point and the straight line, and x i and y i represent the abscissa and ordinate of the i-th point respectively;

[0017] Step 23: Determine the maximum value d max , d max = max{d 1 , d 2 , d 3 ,..., d n}, where n represents the number of points between the start and end points.

[0018] Preferably, in the step 3, set the geophone line thinning threshold dist according to the following formula:

[0019] dist = transform(pixel)

[0020] where pixel represents the pixel value, and transform() represents the conversion function from pixel coordinates to geodetic coordinates.

[0021] Preferably, the thinning of the geophone line according to the geophone line thinning threshold and the maximum value of the distance includes:

[0022] If the maximum value of the distance is less than the geophone line thinning threshold dist, that is, d max < dist, then discard all the points between the start and end points on the geophone line, and thin the geophone line;

[0023] If the maximum value of the distance is greater than or equal to the geophone line thinning threshold dist, that is, d max ≥ dist, then divide the geophone line into two parts with the point corresponding to the maximum value, and repeat the steps 1 to 3 for each part respectively to thin the geophone line.

[0024] Another aspect of the present invention provides a geophone line dynamic thinning device, including:

[0025] A straight-line equation establishment module, configured to determine the start and end points of the geophone line and calculate the straight-line equation of the straight line connecting the start and end points;

[0026] A distance calculation module, configured to calculate the distance between each point between the start and end points and the straight line respectively, and determine the maximum value of the distance;

[0027] A decimation module, configured to set a decimation threshold for the geophone lines, and decimate the geophone lines according to the decimation threshold for the geophone lines and the maximum value of the distance.

[0028] Preferably, the coordinates of the start and end points of the geophone line are respectively (x 1 , y 1 ), and (x 2 , y 2 ), and the straight line equation of the straight line is:

[0029]

[0030] where x represents the abscissa and y represents the ordinate.

[0031] Preferably, the calculating the distance between each point between the start and end points and the straight line respectively, and determining the maximum value of the distance includes:

[0032] Step 21: Convert the straight line equation into the general form: Ax + By + C = 0, where A, B, and C represent the coefficients of the general form of the straight line equation;

[0033] Step 22: Calculate the distance between each point and the straight line respectively according to the following formula:

[0034]

[0035] where di represents the distance between the i-th point and the straight line, x i and y i respectively represent the abscissa and ordinate of the i-th point;

[0036] Step 23: Determine the maximum value d max of the distance, d max = max{d 1 , d 2 , d 3 ,..., d n}, where n represents the number of points between the start and end points.

[0037] Preferably, the decimation threshold dist for the geophone lines is set according to the following formula:

[0038] dist = transform(pixel)

[0039] where pixel represents the pixel value, and transform() represents the conversion function from pixel coordinates to geodetic coordinates.

[0040] On the other hand, the present invention provides a computer-readable storage medium storing a computer program, which, when executed by a processor, implements the dynamic decimation method of the detection line.

[0041] On yet another aspect, the present invention provides an electronic device, which includes:

[0042] a memory storing executable instructions;

[0043] a processor that runs the executable instructions in the memory to implement the dynamic decimation method of the detection line.

[0044] The beneficial effects of the dynamic decimation method of the detection line of the present invention are as follows: on the premise of ensuring the geometric shape skeleton of the detection line, redundant data points that do not affect visual display are removed, so as to realize the decimation of the detection line, and the geometric shape skeleton of the detection line is visually retained. The method of the present invention can avoid the problems of low computing efficiency and slow rendering efficiency brought by ultra-large data volume to the three-dimensional observation system design software. The dynamic decimation method of the detection line of the present invention can also be applied to the shot line, and the effect of removing redundant data points can also be achieved.

[0045] The method and device of the present invention have other characteristics and advantages, which will be obvious in the accompanying drawings and subsequent specific embodiments incorporated herein, or will be described in detail in the accompanying drawings and subsequent specific embodiments incorporated herein. These drawings and specific embodiments are used together to explain the specific principles of the present invention. BRIEF DESCRIPTION OF THE DRAWINGS

[0046] By describing the exemplary embodiments of the present invention in more detail in conjunction with the accompanying drawings, the above and other objects, features, and advantages of the present invention will become more obvious. Among them, in the exemplary embodiments of the present invention, the same reference numerals generally represent the same components.

[0047] Figure 1 Shows a flowchart of the dynamic decimation method of the detection line according to an embodiment of the present invention.

[0048] Figure 2 Shows a schematic diagram of the original data points of the detection line according to an exemplary embodiment of the present invention.

[0049] Figure 3 and Figure 4 Shows a schematic diagram of the processing of step 3 of the dynamic decimation method of the detection line according to an exemplary embodiment of the present invention.

[0050] Figure 5 Shows a schematic diagram of the processing result of the dynamic decimation method of the detection line according to an exemplary embodiment of the present invention. Detailed implementation manners

[0051] The preferred implementation manners of the present invention will be described in more detail below with reference to the accompanying drawings. Although the preferred implementation manners of the present invention are shown in the drawings, it should be understood that the present invention can be implemented in various forms and should not be limited by the implementation manners set forth herein. On the contrary, these implementation manners are provided to make the present invention more thorough and complete, and to fully convey the scope of the present invention to those skilled in the art.

[0052] The present invention provides a method for dynamically thinning detection lines, which includes the following steps:

[0053] Step 1: Determine the start and end points of the detection line, and calculate the linear equation of the line connecting the start and end points;

[0054] Step 2: Calculate the distance between each point between the start and end points and the line respectively, and determine the maximum value of the distance;

[0055] Step 3: Set a thinning threshold for the detection line, and thin the detection line according to the thinning threshold of the detection line and the maximum value of the distance.

[0056] The method for dynamically thinning detection lines of the present invention eliminates redundant data points that do not affect visual display on the premise of ensuring the geometric shape skeleton of the detection line, thereby realizing the thinning of the detection line.

[0057] Example 1

[0058] Figure 1 The flowchart of the method for dynamically thinning detection lines according to an embodiment of the present invention is shown. As shown in the figure, the method includes steps 1 to 3.

[0059] Step 1: Determine the start and end points of the detection line, and calculate the linear equation of the line connecting the start and end points.

[0060] The detection line includes multiple data points. First, determine the start and end points of the detection line, and represent the coordinates of the start and end points of the detection line as (x 1 , y 1 ) and (x 2 , y 2 ) respectively. Then, the linear equation of the line connecting the start and end points is:

[0061]

[0062] where x represents the abscissa and y represents the ordinate.

[0063] Step 2: Calculate the distance between each point between the start and end points and the line respectively, and determine the maximum value of the distance.

[0064] Step 2 specifically includes the following steps:

[0065] Step 21: Convert the straight-line equation into the general form: Ax + By + C = 0, where A, B, and C represent the coefficients of the general form of the straight-line equation.

[0066] Arrange the straight-line equation to obtain the general form of the straight-line equation Ax + By + C = 0, where:

[0067] A = y 2 -y 1

[0068] B = x 1 -x 2

[0069] C = y 1 (x 1 -x 2 ) - x 1 (y 2 -y 1 )

[0070] Step 22: Calculate the distance between each point and the straight line according to the following formula:

[0071]

[0072] where d i represents the distance between the i-th point and the straight line, and x i and y i represent the abscissa and ordinate of the i-th point respectively.

[0073] Step 23: Determine the maximum value d max , d max = max{d 1 , d 2 , d 3 ,..., d n}, where n represents the number of points between the start and end points.

[0074] Determine the maximum value d i of the distance d max between each point and the straight line, that is, d max = max{d 1 , d 2 , d 3 ,..., d n}, where n represents the number of points between the start and end points, and max represents taking the maximum value calculation.

[0075] Step 3: Set the detection line sparsity threshold, and thin the detection line according to the detection line sparsity threshold and the maximum value of the distance.

[0076] Set the detection line sparse threshold dist according to the following formula:

[0077] dist = transform(pixel)

[0078] where pixel represents the pixel value, and transform() represents the transformation function from pixel coordinates to geodetic coordinates.

[0079] By setting the sparse threshold, the threshold function can be applied to each pixel in the image to achieve image binarization or segmentation. This method can effectively highlight the important features in the image and suppress unimportant details. In the sparse threshold method, a transformation function is used to process the pixel values. The transformation function can map the pixel values to another numerical range and can be adjusted as needed. Common transformation functions include linear transformation, non-linear transformation, and threshold functions, etc.

[0080] In this embodiment, thinning the detection line according to the maximum value of the detection line sparse threshold and the distance includes:

[0081] If the maximum value of the distance is less than the detection line sparse threshold dist, i.e., d max < dist, then discard all the points between the start and end points on the detection line, and thin the detection line. In this case, only the start and end points are retained on the detection line.

[0082] If the maximum value of the distance is greater than or equal to the detection line sparse threshold dist, i.e., d max ≥ dist, then divide the detection line into two parts with the point corresponding to the maximum value, and repeat steps 1 to 3 for each part respectively to thin the detection line until all the points on the detection line are processed.

[0083] Example 2

[0084] Embodiment 2 provides a method for dynamically thinning a detection line, including the following steps:

[0085] Step 1: Determine the start and end points of the detection line, and calculate the linear equation of the straight line connecting the start and end points;

[0086] Step 2: Calculate the distance between each point between the start and end points and the straight line respectively, and determine the maximum value of the distance;

[0087] Step 3: Set the detection line sparse threshold, and thin the detection line according to the detection line sparse threshold and the maximum value of the distance.

[0088] In this embodiment, in step 1, the coordinates of the start and end points of the detection line are respectively (x 1 , y 1), and (x 2 , y 2 ), the linear equation of the straight line is:

[0089]

[0090] where x represents the abscissa and y represents the ordinate.

[0091] In this embodiment, step 2 includes:

[0092] Step 21: Convert the linear equation into the general form: Ax + By + C = 0, where A, B, and C represent the coefficients of the general form of the linear equation;

[0093] Step 22: Calculate the distance between each point and the straight line respectively according to the following formula:

[0094]

[0095] where di represents the distance between the i-th point and the straight line, x i and y i respectively represent the abscissa and ordinate of the i-th point;

[0096] Step 23: Determine the maximum value d of the distance max , d max = max{d 1 , d 2 , d 3 ,..., d n}, where n represents the number of points between the starting and ending points.

[0097] In this embodiment, in step 3, set the geophone line thinning threshold dist according to the following formula:

[0098] dist = transform(pixel)

[0099] where pixel represents the pixel value, and transform() represents the conversion function from pixel coordinates to geodetic coordinates.

[0100] In this embodiment, thinning the geophone line according to the geophone line thinning threshold and the maximum value of the distance includes:

[0101] If the maximum value of the distance is less than the geophone line thinning threshold dist, that is, d max < dist, then discard all the points between the starting and ending points on the geophone line and thin the geophone line;

[0102] If the maximum value of the distance is greater than or equal to the geophone line thinning threshold dist, that is, d maxIf ≥ dist, the detection line is divided into two parts by the point corresponding to the maximum value, and steps 1 to 3 are repeatedly executed for each part to thin the detection line.

[0103] Figure 2 Fig. shows a schematic diagram of the original data points of the detection line according to this embodiment. Figure 3 Fig. shows a schematic diagram after the detection line is divided into two parts by the point corresponding to the maximum value according to step 3. Figure 4 Fig. shows a schematic diagram after the above steps are repeatedly executed for the divided parts according to step 3. Figure 5 Fig. shows a schematic diagram of the data points after thinning is completed.

[0104] For other detailed descriptions of this exemplary embodiment, reference can be made to the corresponding descriptions in the foregoing embodiments, which will not be elaborated herein.

[0105] Example 3

[0106] This embodiment provides a dynamic thinning device for a detection line, including:

[0107] A straight-line equation establishment module for determining the start and end points of the detection line and calculating the straight-line equation of the straight line connecting the start and end points;

[0108] A distance calculation module for respectively calculating the distance between each point between the start and end points and the straight line and determining the maximum value of the distance;

[0109] A thinning module for setting a detection line thinning threshold and thinning the detection line according to the detection line thinning threshold and the maximum value of the distance.

[0110] In this embodiment, the coordinates of the start and end points of the detection line are respectively (x 1 , y 1 ) and (x 2 , y 2 ), and the straight-line equation of the straight line is:

[0111]

[0112] where x represents the abscissa and y represents the ordinate.

[0113] In this embodiment, respectively calculating the distance between each point between the start and end points and the straight line and determining the maximum value of the distance includes:

[0114] Step 21: Convert the straight-line equation into the general form: Ax + By + C = 0, where A, B, and C represent the coefficients of the general form of the straight-line equation;

[0115] Step 22: Calculate the distance between each point and the straight line according to the following formula:

[0116]

[0117] wherein, di represents the distance from the i-th point to the straight line, and x i and y i respectively represent the abscissa and ordinate of the i-th point;

[0118] Step 23: Determine the maximum value d of the distance max , d max = max{d 1 , d 2 , d 3 ,..., d n}, where n represents the number of points between the start and end points.

[0119] In this embodiment, the detection line sparse threshold dist is set according to the following formula:

[0120] dist = transform(pixel)

[0121] where pixel represents the pixel value, and transform() represents the conversion function from pixel coordinates to geodetic coordinates.

[0122] In this embodiment, thinning the detection line according to the detection line sparse threshold and the maximum value of the distance includes:

[0123] If the maximum value of the distance is less than the detection line sparse threshold dist, that is, d max < dist, then all points between the start and end points on the detection line are discarded, and the detection line is thinned;

[0124] If the maximum value of the distance is greater than or equal to the detection line sparse threshold dist, that is, d max ≥ dist, then the detection line is divided into two parts by the point corresponding to the maximum value, and the processing steps performed by the straight line equation establishment module, the distance calculation module, and the thinning module are respectively repeated for each part to thin the detection line.

[0125] For other detailed descriptions of this exemplary embodiment, reference can be made to the corresponding descriptions in the foregoing embodiments, which will not be elaborated herein.

[0126] Example 4

[0127] This embodiment provides a computer-readable storage medium, which stores a computer program. When the computer program is executed by a processor, the foregoing method for dynamically thinning the detection line is implemented.

[0128] A computer-readable storage medium can be a tangible device that can hold and store instructions used by an instruction execution device. A computer-readable storage medium can be, for example—but not limited to—an electrical storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer-readable storage medium include: a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a static random access memory (SRAM), a portable compact disc read-only memory (CD-ROM), a digital versatile disc (DVD), a memory stick, a floppy disk, a mechanically encoded device, such as a punched card or raised structures in grooves storing instructions thereon, and any suitable combination of the foregoing. The computer-readable storage medium used herein is not construed as an instantaneous signal itself, such as a radio wave or other freely propagating electromagnetic wave, an electromagnetic wave propagated through a waveguide or other transmission medium (e.g., an optical pulse through an optical fiber cable), or an electrical signal transmitted through a wire.

[0129] For other detailed descriptions of this exemplary embodiment, reference may be made to the corresponding descriptions in the foregoing embodiments, which will not be repeated here.

[0130] Example 5

[0131] This embodiment provides an electronic device, including:

[0132] A memory storing executable instructions;

[0133] A processor that runs the executable instructions in the memory to implement the foregoing detection line dynamic thinning method.

[0134] The computer-readable program instructions described herein can be downloaded from a computer-readable storage medium to various computing / processing devices, or downloaded to an external computer or external storage device through a network, such as the Internet, a local area network, a wide area network, and / or a wireless network. The network can include copper transmission cables, optical fiber transmissions, wireless transmissions, routers, firewalls, switches, gateway computers, and / or edge servers. The network adapter or network interface in each computing / processing device receives the computer-readable program instructions from the network and forwards the computer-readable program instructions for storage in the computer-readable storage medium in each computing / processing device.

[0135] The computer program instructions for performing the operations of the present disclosure may be assembly instructions, instruction set architecture (ISA) instructions, machine instructions, machine - related instructions, microcode, firmware instructions, state - setting data, or source code or object code written in any combination of one or more programming languages, including object - oriented programming languages such as Smalltalk, C++, etc., and conventional procedural programming languages such as the "C" language or similar programming languages. The computer - readable program instructions may be executed entirely on the user's computer, partially on the user's computer, executed as a stand - alone software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., through the Internet using an Internet service provider). In some embodiments, by using the state information of the computer - readable program instructions to customize an electronic circuit, such as a programmable logic circuit, a field - programmable gate array (FPGA), or a programmable logic array (PLA), the electronic circuit can execute the computer - readable program instructions to implement various aspects of the present disclosure.

[0136] Aspects of the present disclosure are described herein with reference to the flowcharts and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the present disclosure. It should be understood that each block of the flowcharts and / or block diagrams, and combinations of blocks in the flowcharts and / or block diagrams, can be implemented by computer - readable program instructions.

[0137] These computer - readable program instructions can be provided to a processor of a general - purpose computer, a special - purpose computer, or other programmable data - processing apparatus to produce a machine such that the instructions, when executed by the processor of the computer or other programmable data - processing apparatus, create a means for implementing the functions / acts specified in one or more blocks of the flowchart and / or block diagram. These computer - readable program instructions can also be stored in a computer - readable storage medium, which causes a computer, a programmable data - processing apparatus, and / or other devices to operate in a particular manner, so that the computer - readable medium storing the instructions comprises a manufacture, which includes instructions for implementing various aspects of the functions / acts specified in one or more blocks of the flowchart and / or block diagram.

[0138] Computer-readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices, causing a series of operational steps to be performed on the computer, other programmable data processing apparatus, or other devices to generate a computer-implemented process such that the instructions executed on the computer, other programmable data processing apparatus, or other devices implement the functions / acts specified in one or more boxes of the flowchart and / or block diagram.

[0139] For other detailed descriptions of this exemplary embodiment, reference may be made to the corresponding descriptions in the foregoing embodiments, which will not be repeated here.

[0140] The embodiments of the present invention have been described above. The above description is exemplary and not exhaustive, and is not limited to the disclosed embodiments. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described embodiments. The choice of terms used herein is intended to best explain the principles of the embodiments, the practical application, or the technical improvement of the technology in the market, or to enable other ordinary skill in the art to understand the embodiments disclosed herein.

Claims

1. A method for dynamically thinning geophone lines, characterized in that, the method includes: Step 1: Determine the start and end points of the geophone line, and calculate the linear equation of the line connecting the start and end points; Step 2: Calculate the distance between each point between the start and end points and the line respectively, and determine the maximum value of the distance; Step 3: Set the geophone line thinning threshold, and thin the geophone line according to the geophone line thinning threshold and the maximum value of the distance.

2. The method for dynamically thinning geophone lines according to claim 1, characterized in that, In the step 1, the coordinates of the start and end points of the detection line are respectively (x 1 , y 1 ) and (x 2 , y 2 ), and the linear equation of the straight line is as follows: where x represents the abscissa and y represents the ordinate.

3. The method for dynamically thinning geophone lines according to claim 2, characterized in that, Step 2 includes: Step 21: Convert the linear equation into the general form: Ax + By + C = 0, where A, B, and C represent the coefficients of the general form of the linear equation; Step 22: Calculate the distance between each point and the line respectively according to the following formula: where di represents the distance from the i-th point to the line, and x i and y i respectively represent the abscissa and ordinate of the i-th point; Step 23: Determine the maximum value d of the distance max , d max = max{d 1 , d 2 , d 3 ,..., d n}, where n represents the number of points between the start and end points.

4. The method for dynamically thinning geophone lines according to claim 3, characterized in that, In Step 3, set the geophone line thinning threshold dist according to the following formula: dist = transform(pixel) where pixel represents the pixel value, and transform() represents the conversion function from pixel coordinates to geodetic coordinates.

5. The method for dynamically thinning geophone lines according to claim 4, characterized in that, Thinning the geophone line according to the geophone line thinning threshold and the maximum value of the distance includes: If the maximum value of the distance is less than the detection line sparsity threshold dist, i.e., d max < dist, then all points between the start and end points on the detection line are discarded, and the detection line is thinned; If the maximum value of the distance is greater than or equal to the detection line thinning threshold dist, i.e., d max ≥ dist, the detection line is divided into two parts by the point corresponding to the maximum value, and steps 1 to 3 are respectively repeated for each part to thin the detection line.

6. A device for dynamically thinning geophone lines, characterized in that, including: A linear equation establishment module for determining the start and end points of the geophone line and calculating the linear equation of the line connecting the start and end points; A distance calculation module for calculating the distance between each point between the start and end points and the line respectively and determining the maximum value of the distance; A thinning module for setting the geophone line thinning threshold and thinning the geophone line according to the geophone line thinning threshold and the maximum value of the distance.

7. The device for dynamically thinning geophone lines according to claim 6, characterized in that, The coordinates of the start and end points of the detection line are (x 1 , y 1 ) and (x 2 , y 2 ), and the linear equation of the straight line is: where x represents the abscissa and y represents the ordinate.

8. The device for dynamically thinning geophone lines according to claim 7, characterized in that, Calculating the distance between each point between the start and end points and the line respectively and determining the maximum value of the distance includes: Step 21: Convert the linear equation into the general form: Ax + By + C = 0, where A, B, and C represent the coefficients of the general form of the linear equation; Step 22: Calculate the distance between each point and the line respectively according to the following formula: where di represents the distance from the i-th point to the straight line, and x i and y i represent the abscissa and ordinate of the i-th point respectively; Step 23: Determine the maximum value d of the distance max , d max = max{d 1 , d 2 , d 3 ,..., d n}, where n represents the number of points between the start and end points.

9. The device for dynamically thinning geophone lines according to claim 8, characterized in that, Set the geophone line thinning threshold dist according to the following formula: dist = transform(pixel) where pixel represents the pixel value, and transform() represents the conversion function from pixel coordinates to geodetic coordinates.

10. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program, which when executed by a processor implements the dynamic decimation method of detection lines according to any one of claims 1-5.

11. An electronic device, characterized in that the electronic device includes: a memory storing executable instructions; a processor that runs the executable instructions in the memory to implement the dynamic decimation method of detection lines according to any one of claims 1-5.

Images