Scheduling and plotting methods for seismic data volume plotting, as well as scheduling and plotting devices.
By using spatial octree segmentation and resolution level classification, combined with data parameters and manual analysis, the problem of data block stripes in the rendering of massive seismic data volumes was solved, thus improving rendering efficiency.
Patent Information
- Application Number
- CN202111273798.3
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2021-10-29
- Publication Date
- 2026-11-10
- Estimated Expiration
- 2041-10-29
AI Technical Summary
In existing methods for rendering massive seismic data volumes, the problem of data block stripes leads to low rendering efficiency and makes it impossible to effectively use the distance between data blocks and viewpoints as a scheduling basis.
A spatial octree is used to segment the seismic data volume. Resolution levels are divided based on the viewpoint. Data parameters and data manuals are used to determine whether to continue traversing downwards. Effective display levels are calculated by combining resolution levels and data parameters to avoid data block segmentation problems.
It improves the data scheduling efficiency in the process of rendering massive seismic data. The logic is clear and the method is simple, effectively avoiding the problem of data block segmentation and enabling rapid rendering.
Smart Images

Figure CN116071486B_ABST
Abstract
Description
Technical Field
[0001] This invention relates to the field of seismic interpretation technology, specifically to a scheduling method and drawing method, scheduling and drawing apparatus for drawing seismic data volumes. Background Technology
[0002] Existing massive seismic data volumes are typically rendered by multi-resolution processing using spatial octrees before being divided into blocks for rendering. Therefore, in specific scenarios, data scheduling is crucial for rendering efficiency. However, conventional scheduling methods generally only use the distance between data blocks and the viewpoint as the scheduling criterion. This results in data blocks appearing as stripes on the same slice because the distances between the data blocks that make up the slice and the viewpoint fall at different resolution levels. Summary of the Invention
[0003] In view of this, embodiments of the present invention provide a scheduling method and a drawing method, scheduling and drawing device for drawing seismic data volumes, which solves the problem of data block stripes appearing during the drawing of massive seismic data volumes.
[0004] An embodiment of the present invention provides a scheduling method for seismic data volume rendering, comprising:
[0005] The seismic data volume is divided into data blocks to form a spatial octree, and the data blocks are divided into resolution levels centered on the viewpoint;
[0006] Obtain the data parameters of the data body;
[0007] Traverse the spatial octree and determine whether to continue traversing downwards based on the resolution level after partitioning and the data parameters.
[0008] If it is impossible to determine whether to continue traversing downwards, then the decision to continue traversing downwards should be based on the datasheet.
[0009] In one embodiment, the step of dividing the seismic data volume into data blocks to form a spatial octree includes: taking the display range of the data volume as the root of the spatial octree, performing a binary recursive segmentation on each data block to form the spatial octree.
[0010] In one embodiment, the data parameters of the data body include: the distance between the center of the data block and the viewpoint, the distance between the center of the data body and the viewpoint, and the radius of the data body.
[0011] In one implementation, the step of determining whether to continue traversing downwards based on the partitioned resolution level and the data parameters includes: determining whether the distance between the center of the data block and the viewpoint is less than the distance corresponding to the resolution level of the data block; if so, continuing to traverse downwards.
[0012] In one implementation, the datasheet includes: the number of times the data block continues to be traversed downwards and the total number of time samples.
[0013] In one implementation, the step of determining whether to continue traversing downwards based on the datasheet includes:
[0014] The parameter factors are obtained based on the data parameters;
[0015] The probability of the parameter factor continuing to traverse downwards within the corresponding interval is obtained based on the parameter factor, the number of times the data block continues to traverse downwards, and the total number of time samples.
[0016] Determine whether the probability of continuing to traverse downwards is greater than a threshold. If so, then continue to traverse downwards.
[0017] In one implementation, if the result of the step of determining whether to continue traversing downwards based on the resolution level and the data parameters after partitioning is to continue traversing downwards, or if the result of the step of determining whether to continue traversing downwards based on the data manual is to continue traversing downwards, then the number of times the data block continues to be traversed downwards and the total number of time samples are updated in the data manual.
[0018] In one implementation, after the step of determining whether to continue traversing downwards based on the data manual: if the determination result does not require continuing downwards, then all data blocks are sorted and drawn.
[0019] In one implementation, the step of sorting all data blocks includes: sorting the data blocks in order of distance from the center of the data block to the viewpoint.
[0020] An embodiment of the present invention provides a method for drawing seismic data volumes, which uses the aforementioned scheduling method for drawing seismic data volumes.
[0021] In one implementation, it includes:
[0022] The segmentation module is used to segment the seismic data volume into data blocks to form a spatial octree;
[0023] A segmentation module is used to divide the data block into resolution levels centered on the viewpoint;
[0024] The calculation module is used to obtain the data parameters of the data body;
[0025] The judgment module is used to traverse the spatial octree and determine whether to continue traversing downwards based on the resolution level after partitioning and the data parameters; then, it determines whether to continue traversing downwards based on the data manual.
[0026] An embodiment of the present invention provides a seismic data volume rendering apparatus, including the seismic data volume rendering apparatus described above.
[0027] An embodiment of the present invention provides an electronic device, including a memory and a processor. The memory is used to store one or more computer instructions, wherein when the one or more computer instructions are executed by the processor, they implement the scheduling method and the seismic data volume drawing method as described above.
[0028] An embodiment of the present invention provides a computer-readable storage medium storing a computer program, which, when executed by a processor, is used to implement the scheduling method for drawing seismic data volumes as described above and the seismic data volume drawing method described above.
[0029] This invention provides a scheduling method and rendering apparatus for rendering seismic data volumes. The scheduling method calculates the resolution level of data blocks to obtain an effective display level, and schedules the data using the resolution level, data parameters, and data manual, effectively avoiding data block segmentation problems. This method is logically clear, simple, and fast to implement, greatly improving the data scheduling efficiency in the rendering of massive amounts of seismic data. Attached Figure Description
[0030] Figure 1 The diagram shown is a flowchart illustrating a scheduling method for drawing seismic data volumes according to an embodiment of the present invention.
[0031] Figure 2 The diagram shown is a schematic diagram of a spatial octree provided in an embodiment of the present invention.
[0032] Figure 3 The diagram shown is a schematic diagram of a space octree provided in an embodiment of the present invention.
[0033] Figure 4 The diagram shown is a schematic diagram of the viewpoint and resolution level distribution provided in an embodiment of the present invention.
[0034] Figure 5 The diagram shown is a flowchart illustrating a process for determining whether to continue traversing downwards based on a datasheet, according to an embodiment of the present invention.
[0035] Figure 6 The figure shown is a statistical diagram of probability data provided in an embodiment of the present invention.
[0036] Figure 7 The diagram shown is a schematic diagram of a scheduling device for drawing seismic data volumes according to an embodiment of the present invention. Detailed Implementation
[0037] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.
[0038] Example 1:
[0039] This embodiment provides a scheduling method for plotting seismic data volumes. Data scheduling involves determining, during the plotting process, which resolution of data to use for the current spatial location. Based on this idea, such as... Figure 1 As shown, the scheduling method for plotting the seismic data volume includes:
[0040] Step 01: The seismic data volume is segmented into data blocks to form a spatial octree; the data blocks are then divided into resolution levels centered on the viewpoint; (Refer to...) Figure 2 As shown.
[0041] A spatial octree is a data structure that recursively slices a three-dimensional block in space along three directions: front, back, left, right, up, and down. Multi-resolution processing involves hierarchical sampling of each block.
[0042] In one embodiment, the display range of the entire data volume is taken as the root of the spatial octree. Each data block is recursively bisected in three directions: front, back, left, right, up, and down. The entire drawing data volume then constitutes a spatial octree, and the depth of each data block in this octree is the resolution level corresponding to that data block.
[0043] For rendering massive seismic data volumes, the sheer volume of data far exceeds the capabilities of the rendering hardware. Therefore, it's inevitable that data blocks of varying resolutions will exist within the entire visible area. The scheduling algorithm, therefore, considers user habits and ensures that slices do not experience data segmentation issues within a certain angle of the user's display range. This requires setting resolution levels for the entire visible area; when rendering data blocks within a specified area, data blocks of that specific resolution must be loaded for rendering.
[0044] Step 02: Obtain the data parameters of the data body;
[0045] Optionally, the data parameters of the data volume include: the distance between the center of the data block and the viewpoint, the distance between the center of the data volume and the viewpoint, and the radius of the data volume. These data volume parameters can be calculated.
[0046] Step 03: Traverse the spatial octree (see reference) Figure 3 As shown in the figure, based on the resolution level after division and the data parameters, it is determined whether to continue traversing downwards.
[0047] Optionally, the distance between the center of the data block and the viewpoint is determined (e.g., ...). Figure 4 If the distance (as shown) is less than the distance corresponding to the resolution level of the data block, continue traversing downwards.
[0048] Set the distance Dmax corresponding to the resolution level of the data block, and the distance Dp between the center of the data block and the viewpoint. If Dp is less than Dmax, it means that a more accurate model needs to be drawn, and the traversal needs to continue downward.
[0049] Step 04: If it is impossible to determine whether to continue traversing downwards, then determine whether to continue traversing downwards based on the data manual.
[0050] Among them, such as Figure 6 As shown, the steps for determining whether to continue traversing downwards based on the datasheet include:
[0051] Step 041: If step 03 cannot determine whether to continue traversing downwards, then obtain the parameter factor based on the data parameters;
[0052] Step 042: Based on the parameter factor, the number of times the data block continues to be traversed downwards, and the total number of time samples, obtain the probability that the parameter factor will continue to be traversed downwards in the corresponding interval;
[0053] Step 043: Determine whether the probability of continuing to traverse downwards is greater than the threshold. If it is, then continue to traverse downwards; otherwise, stop traversing downwards.
[0054] Optionally, the datasheet includes the number of times the data block continues to be traversed downwards and the total number of time samples.
[0055] Among them, reference Figure 7 As shown, the steps for creating a datasheet include:
[0056] Select the parameter factor Gp:
[0057] Gp = (Dp - (Da - Ra)) / 2 * Ra;
[0058] Where Dp is the distance between the center of the data block and the viewpoint; Da is the distance between the center of the entire data volume and the viewpoint; Ra is the radius of the entire data volume. Where Gp∈[0,1]; Gp represents the distribution of the data block within the entire data volume, so it can be considered that Gp determines whether the data block is traversed downwards. Where the distance between the entire data volume and the viewpoint ranges from (Da-Ra,Da+Ra);
[0059] Divide the interval [0,1] into n parts, namely X1-X n Set the interval X corresponding to the Gp value. i Within a preset time period, where i is greater than 1 and less than n, the number of times the corresponding data block recorded in the data manual continues to be traversed downwards is T. i Update the total number of time samples S i If it cannot be determined in step 03 whether the node needs to be traversed downwards, calculate X. i Continue iterating downwards through the probability Pi.
[0060] Pi = Ti / Si;
[0061] When the probability Pi of continuing to traverse downwards is greater than a preset value, traversing downwards is selected.
[0062] Optionally, if the probability Pi > 0.5 of continuing downwards, choose to traverse downwards.
[0063] If the result of the step of determining whether to continue traversing downwards based on the resolution level and data parameters after partitioning is to continue traversing downwards, or if the result of the step of determining whether to continue traversing downwards based on the data manual is to continue traversing downwards, then the number of times the data block continues to be traversed downwards and the total number of time samples are updated in the data manual.
[0064] After determining whether to continue traversing downwards based on the data manual: if the determination result indicates that it is not necessary to continue traversing downwards, then all data blocks are sorted and drawn. Optionally, the step of sorting all data blocks includes: sorting the data blocks in order from farthest to closest according to the distance between the center of the data block and the viewpoint.
[0065] This invention calculates an effective display level by considering the resolution level of data blocks and the distance to the viewpoint. Using this algorithm for data scheduling effectively avoids data block fragmentation. The method is logically clear, simple, and fast to implement, significantly improving data scheduling efficiency in the rendering of massive seismic data. This dynamic scheduling algorithm can be applied to various data rendering scenarios.
[0066] Example 2:
[0067] This embodiment provides a method for plotting seismic data volumes, employing the scheduling method for seismic data volume plotting described in Embodiment 1 above. The scheduling method for seismic data volume plotting includes:
[0068] Step 01: Divide the seismic data volume into data blocks to form a spatial octree, and divide the data blocks into resolution levels with the viewpoint as the center;
[0069] A spatial octree is a data structure that recursively slices a three-dimensional block in space along three directions: front, back, left, right, up, and down. Multi-resolution processing involves hierarchical sampling of each block.
[0070] In one embodiment, the display range of the entire data volume is taken as the root of the spatial octree. Each data block is recursively bisected in three directions: front, back, left, right, up, and down. The entire drawing data volume then constitutes a spatial octree, and the depth of each data block in this octree is the resolution level corresponding to that data block.
[0071] For rendering massive seismic data volumes, the sheer volume of data far exceeds the capabilities of the rendering hardware. Therefore, it's inevitable that data blocks of varying resolutions will exist within the entire visible area. The scheduling algorithm, therefore, considers user habits and ensures that slices do not experience data segmentation issues within a certain angle of the user's display range. This requires setting resolution levels for the entire visible area; when rendering data blocks within a specified area, data blocks of that specific resolution must be loaded for rendering.
[0072] Step 02: Obtain the data parameters of the data body;
[0073] Optionally, the data parameters of the data volume include: the distance between the center of the data block and the viewpoint, the distance between the center of the data volume and the viewpoint, and the radius of the data volume. These data volume parameters can be calculated.
[0074] Step 03: Traverse the spatial octree and determine whether to continue traversing downwards based on the resolution level after partitioning and the data parameters.
[0075] Optionally, determine whether the distance between the center of the data block and the viewpoint is less than the distance corresponding to the resolution level of the data block; if so, continue traversing downwards.
[0076] Set the distance Dmax corresponding to the resolution level of the data block, and the distance Dp between the center of the data block and the viewpoint. If Dp is less than Dmax, it means that a more accurate model needs to be drawn, and the traversal needs to continue downward.
[0077] Step 04: If it is impossible to determine whether to continue traversing downwards, then determine whether to continue traversing downwards based on the data manual.
[0078] The steps for determining whether to continue traversing downwards based on the datasheet include:
[0079] Step 041: If step 03 cannot determine whether to continue traversing downwards, then obtain the parameter factor based on the data parameters;
[0080] Step 042: Based on the parameter factor, the number of times the data block continues to be traversed downwards, and the total number of time samples, obtain the probability that the parameter factor will continue to be traversed downwards in the corresponding interval;
[0081] Step 043: Determine whether the probability of continuing to traverse downwards is greater than the threshold. If it is, then continue to traverse downwards; otherwise, stop traversing downwards.
[0082] Optionally, the datasheet includes the number of times the data block continues to be traversed downwards and the total number of time samples.
[0083] The steps involved in creating a data manual include:
[0084] Select the parameter factor Gp:
[0085] Gp = (Dp - (Da - Ra)) / 2 * Ra;
[0086] Where Dp is the distance between the center of the data block and the viewpoint; Da is the distance between the center of the entire data volume and the viewpoint; Ra is the radius of the entire data volume. Where Gp∈[0,1]; Gp represents the distribution of the data block within the entire data volume, so it can be considered that Gp determines whether the data block is traversed downwards. Where the distance between the entire data volume and the viewpoint ranges from (Da-Ra,Da+Ra);
[0087] Divide the interval [0,1] into n parts, namely X1-X n Set the interval X corresponding to the Gp value. i Within a preset time period, where i is greater than 1 and less than n, the number of times the corresponding data block recorded in the data manual continues to be traversed downwards is T. i Update the total number of time samples S i If it cannot be determined in step 03 whether the node needs to be traversed downwards, calculate X. i Continue iterating downwards through the probability Pi.
[0088] Pi = Ti / Si;
[0089] When the probability Pi of continuing to traverse downwards is greater than a preset value, traversing downwards is selected.
[0090] Optionally, if the probability Pi > 0.5 of continuing downwards, choose to traverse downwards.
[0091] If the result of the step of determining whether to continue traversing downwards based on the resolution level and data parameters after partitioning is to continue traversing downwards, or if the result of the step of determining whether to continue traversing downwards based on the data manual is to continue traversing downwards, then the number of times the data block continues to be traversed downwards and the total number of time samples are updated in the data manual.
[0092] After determining whether to continue traversing downwards based on the data manual: if the determination result indicates that it is not necessary to continue traversing downwards, then all data blocks are sorted and drawn. Optionally, the step of sorting all data blocks includes: sorting the data blocks in order from farthest to closest according to the distance between the center of the data block and the viewpoint.
[0093] This invention calculates an effective display level by considering the resolution level of data blocks and the distance to the viewpoint. Using this algorithm for data scheduling effectively avoids data block fragmentation. The method is logically clear, simple, and fast to implement, significantly improving data scheduling efficiency in the rendering of massive seismic data. This dynamic scheduling algorithm can be applied to various data rendering scenarios.
[0094] Example 3:
[0095] This embodiment provides a scheduling device 100 for plotting seismic data volumes, such as... Figure 7 As shown, the scheduling device 100 for drawing the seismic data volume includes: a segmentation module 10, a division module 20, a calculation module 30, and a judgment module 40.
[0096] The segmentation module 10 is used to segment the seismic data volume into data blocks to form a spatial octree;
[0097] The partitioning module 20 is used to partition the data block into resolution levels centered on the viewpoint;
[0098] Calculation module 30 is used to obtain the data parameters of the data body;
[0099] The judgment module 40 is used to traverse the spatial octree and determine whether to continue traversing downwards based on the resolution level after partitioning and the data parameters; then, it determines whether to continue traversing downwards based on the data manual.
[0100] The segmentation module 10 segments the seismic data volume into data blocks to form a spatial octree; the partitioning module 20 divides the data blocks into resolution levels centered on the viewpoint; the calculation module 30 obtains the data parameters of the data volume; then the judgment module 40 traverses the spatial octree and determines whether to continue traversing downwards based on the resolution levels and data parameters after partitioning; then it determines whether to continue traversing downwards based on the data manual.
[0101] In addition, the judgment module 40 is also used for:
[0102] The parameter factors are obtained based on the data parameters;
[0103] The probability of the parameter factor continuing to traverse downwards within the corresponding interval is obtained based on the parameter factor, the number of times the data block continues to traverse downwards, and the total number of time samples.
[0104] Determine whether the probability of continuing to traverse downwards is greater than a threshold. If so, then continue to traverse downwards.
[0105] This invention calculates an effective display level by considering the resolution level of data blocks and the distance to the viewpoint. Using this algorithm for data scheduling effectively avoids data block fragmentation. The method is logically clear, simple, and fast to implement, significantly improving data scheduling efficiency in the rendering of massive seismic data. This dynamic scheduling algorithm can be applied to various data rendering scenarios.
[0106] Example 4:
[0107] This embodiment provides a seismic data volume drawing device, which includes: a segmentation module 10, a division module 20, a calculation module 30, and a judgment module 40.
[0108] The segmentation module 10 is used to segment the seismic data volume into data blocks to form a spatial octree;
[0109] The partitioning module 20 is used to partition the data block into resolution levels centered on the viewpoint;
[0110] Calculation module 30 is used to obtain the data parameters of the data body;
[0111] The judgment module 40 is used to traverse the spatial octree and determine whether to continue traversing downwards based on the resolution level after partitioning and the data parameters; then, it determines whether to continue traversing downwards based on the data manual.
[0112] The segmentation module 10 segments the seismic data volume into data blocks to form a spatial octree; the partitioning module 20 divides the data blocks into resolution levels centered on the viewpoint; the calculation module 30 obtains the data parameters of the data volume; then the judgment module 40 traverses the spatial octree and determines whether to continue traversing downwards based on the resolution levels and data parameters after partitioning; then it determines whether to continue traversing downwards based on the data manual.
[0113] In addition, the judgment module 40 is also used for:
[0114] The parameter factors are obtained based on the data parameters;
[0115] The probability of the parameter factor continuing to traverse downwards within the corresponding interval is obtained based on the parameter factor, the number of times the data block continues to traverse downwards, and the total number of time samples.
[0116] Determine whether the probability of continuing to traverse downwards is greater than a threshold. If so, then continue to traverse downwards.
[0117] This invention calculates an effective display level by considering the resolution level of data blocks and the distance to the viewpoint. Using this algorithm for data scheduling effectively avoids data block fragmentation. The method is logically clear, simple, and fast to implement, significantly improving data scheduling efficiency in the rendering of massive seismic data. This dynamic scheduling algorithm can be applied to various data rendering scenarios.
[0118] Example 5:
[0119] This embodiment provides an electronic device, which may be a mobile phone, computer, or tablet computer, etc., including a memory and a processor. The memory stores a computer program, which, when executed by the processor, implements the scheduling method for drawing seismic data volumes as described in Embodiment 1 and the method for drawing seismic data volumes as described in Embodiment 2. It is understood that the electronic device may also include an input / output (I / O) interface and communication components.
[0120] The processor is used to execute all or part of the steps in the scheduling method for drawing seismic data volumes as in Embodiment 1 and the drawing method for seismic data volumes as in Embodiment 2. The memory is used to store various types of data, which may include, for example, instructions for any application or method in an electronic device, as well as application-related data.
[0121] The processor can be implemented as an Application Specific Integrated Circuit (ASIC), Digital Signal Processor (DSP), Programmable Logic Device (PLD), Field Programmable Gate Array (FPGA), controller, microcontroller, microprocessor, or other electronic components, and is used to execute the scheduling method for drawing seismic data volumes in Embodiment 1 and the drawing method for drawing seismic data volumes in Embodiment 2.
[0122] The memory can be implemented by any type of volatile or non-volatile storage device or a combination thereof, such as Static Random Access Memory (SRAM), Electrically Erasable Programmable Read-Only Memory (EEPROM), Erasable Programmable Read-Only Memory (EPROM), Programmable Read-Only Memory (PROM), Read-Only Memory (ROM), magnetic storage, flash memory, magnetic disk, or optical disk.
[0123] Example 6:
[0124] This embodiment also provides a computer-readable storage medium. The functional units in the various embodiments of the present invention can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. If the functions are implemented as software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium.
[0125] Based on this understanding, the technical solution of the present invention, or the part that contributes to the prior art, or part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of the present invention.
[0126] The aforementioned storage media include: flash memory, hard disks, multimedia cards, card-type memory (e.g., SD or DX memory), random access memory (RAM), static random access memory (SRAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), programmable read-only memory (PROM), magnetic memory, disks, optical discs, servers, APP application stores, and various other media capable of storing program verification codes, on which computer programs are stored. When the computer program is executed by a processor, it can implement the following method steps:
[0127] Step 01: Divide the seismic data volume into data blocks to form a spatial octree, and divide the data blocks into resolution levels with the viewpoint as the center;
[0128] A spatial octree is a data structure that recursively slices a three-dimensional block in space along three directions: front, back, left, right, up, and down. Multi-resolution processing involves hierarchical sampling of each block.
[0129] In one embodiment, the display range of the entire data volume is taken as the root of the spatial octree. Each data block is recursively bisected in three directions: front, back, left, right, up, and down. The entire drawing data volume then constitutes a spatial octree, and the depth of each data block in this octree is the resolution level corresponding to that data block.
[0130] For rendering massive seismic data volumes, the sheer volume of data far exceeds the capabilities of the rendering hardware. Therefore, it's inevitable that data blocks of varying resolutions will exist within the entire visible area. The scheduling algorithm, therefore, considers user habits and ensures that slices do not experience data segmentation issues within a certain angle of the user's display range. This requires setting resolution levels for the entire visible area; when rendering data blocks within a specified area, data blocks of that specific resolution must be loaded for rendering.
[0131] Step 02: Obtain the data parameters of the data body;
[0132] Optionally, the data parameters of the data volume include: the distance between the center of the data block and the viewpoint, the distance between the center of the data volume and the viewpoint, and the radius of the data volume. These data volume parameters can be calculated.
[0133] Step 03: Traverse the spatial octree and determine whether to continue traversing downwards based on the resolution level after partitioning and the data parameters.
[0134] Optionally, determine whether the distance between the center of the data block and the viewpoint is less than the distance corresponding to the resolution level of the data block; if so, continue traversing downwards.
[0135] Set the distance Dmax corresponding to the resolution level of the data block, and the distance Dp between the center of the data block and the viewpoint. If Dp is less than Dmax, it means that a more accurate model needs to be drawn, and the traversal needs to continue downward.
[0136] Step 04: If it is impossible to determine whether to continue traversing downwards, then determine whether to continue traversing downwards based on the data manual.
[0137] Among them, such as Figure 5 As shown, the steps for determining whether to continue traversing downwards based on the datasheet include:
[0138] Step 041: If step 03 cannot determine whether to continue traversing downwards, then obtain the parameter factor based on the data parameters;
[0139] Step 042: Based on the parameter factor, the number of times the data block continues to be traversed downwards, and the total number of time samples, obtain the probability that the parameter factor will continue to be traversed downwards in the corresponding interval;
[0140] Step 043: Determine whether the probability of continuing to traverse downwards is greater than the threshold. If it is, then continue to traverse downwards; otherwise, stop traversing downwards.
[0141] Optionally, the datasheet includes the number of times the data block continues to be traversed downwards and the total number of time samples.
[0142] The steps involved in creating a data manual include:
[0143] Select the parameter factor Gp:
[0144] Gp = (Dp - (Da - Ra)) / 2 * Ra;
[0145] Where Dp is the distance between the center of the data block and the viewpoint; Da is the distance between the center of the entire data volume and the viewpoint; Ra is the radius of the entire data volume. Where Gp∈[0,1]; Gp represents the distribution of the data block within the entire data volume, so it can be considered that Gp determines whether the data block is traversed downwards. Where the distance between the entire data volume and the viewpoint ranges from (Da-Ra,Da+Ra);
[0146] Divide the interval [0,1] into n parts, namely X1-X n Set the interval X corresponding to the Gp value. i Within a preset time period, where i is greater than 1 and less than n, the number of times the corresponding data block recorded in the data manual continues to be traversed downwards is T. i Update the total number of time samples S i If it cannot be determined in step 03 whether the node needs to be traversed downwards, calculate X. iContinue iterating downwards through the probability Pi.
[0147] Pi = Ti / Si;
[0148] When the probability Pi of continuing to traverse downwards is greater than a preset value, traversing downwards is selected.
[0149] Optionally, if the probability Pi > 0.5 of continuing downwards, choose to traverse downwards.
[0150] If the result of the step of determining whether to continue traversing downwards based on the resolution level and data parameters after partitioning is to continue traversing downwards, or if the result of the step of determining whether to continue traversing downwards based on the data manual is to continue traversing downwards, then the number of times the data block continues to be traversed downwards and the total number of time samples are updated in the data manual.
[0151] After determining whether to continue traversing downwards based on the data manual: if the determination result indicates that it is not necessary to continue traversing downwards, then all data blocks are sorted and drawn. Optionally, the step of sorting all data blocks includes: sorting the data blocks in order from farthest to closest according to the distance between the center of the data block and the viewpoint.
[0152] This invention calculates an effective display level by considering the resolution level of data blocks and the distance to the viewpoint. Using this algorithm for data scheduling effectively avoids data block fragmentation. The method is logically clear, simple, and fast to implement, significantly improving data scheduling efficiency in the rendering of massive seismic data. This dynamic scheduling algorithm can be applied to various data rendering scenarios.
[0153] Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this invention. It will be clearly understood by those skilled in the art that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here.
[0154] In the several embodiments provided in this application, it should be understood that the disclosed systems, apparatuses, and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative. For instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the shown or discussed mutual couplings, direct couplings, or communication connections may be through some interfaces; indirect couplings or communication connections between devices or units may be electrical, mechanical, or other forms. The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units, i.e., they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.
[0155] The basic principles of this application have been described above with reference to specific embodiments. However, it should be noted that the advantages, benefits, and effects mentioned in this application are merely examples and not limitations, and should not be considered as essential features of each embodiment of this application. Furthermore, the specific details disclosed above are for illustrative and facilitative purposes only, and are not limitations. These details do not limit the application to the necessity of employing the aforementioned specific details for implementation.
[0156] The block diagrams of devices, apparatuses, devices, and systems involved in this application are merely illustrative examples and are not intended to require or imply that they must be connected, arranged, or configured in the manner shown in the block diagrams. As those skilled in the art will recognize, these devices, apparatuses, devices, and systems can be connected, arranged, and configured in any manner.
[0157] It should also be noted that in the apparatus, equipment, and methods of this application, the components or steps can be disassembled and / or recombined. These disassemblies and / or recombinations should be considered as equivalent solutions of this application.
[0158] The above description of the disclosed aspects is provided to enable any person skilled in the art to make or use this application. Various modifications to these aspects will be readily apparent to those skilled in the art, and the general principles defined herein can be applied to other aspects without departing from the scope of this application. Therefore, this application is not intended to be limited to the aspects shown herein, but rather to be accorded the widest scope consistent with the principles and novel features disclosed herein.
[0159] In the description of this application, "multiple" means at least two, such as two, three, etc., unless otherwise explicitly specified. All directional indications (such as up, down, left, right, front, back, top, bottom, etc.) in the embodiments of this application are only used to explain the relative positional relationships and movement of the components in a specific posture (as shown in the figures). If the specific posture changes, the directional indication will also change accordingly. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover non-exclusive inclusion. For example, a process, method, system, product, or device that includes a series of steps or units is not limited to the listed steps or units, but may optionally include steps or units not listed, or may optionally include other steps or units inherent to these processes, methods, products, or devices.
[0160] Furthermore, the reference to "embodiment" herein means that a particular feature, structure, or characteristic described in connection with an embodiment may be included in at least one embodiment of this application. The appearance of this phrase in various places throughout the specification does not necessarily refer to the same embodiment, nor is it a separate or alternative embodiment mutually exclusive with other embodiments. It will be explicitly and implicitly understood by those skilled in the art that the embodiments described herein can be combined with other embodiments.
[0161] The above description is merely a specific embodiment of the present invention, but the scope of protection of the present invention is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the technical scope disclosed in the present invention should be included within the scope of protection of the present invention. Therefore, the scope of protection of the present invention should be determined by the scope of the claims. The above description is merely a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, etc., made within the spirit and principles of the present invention should be included within the scope of protection of the present invention.
Claims
1. A scheduling method for plotting seismic data volumes, characterized in that, The scheduling method for plotting the seismic data volume includes: The seismic data volume is divided into data blocks to form a spatial octree, and the data blocks are divided into resolution levels centered on the viewpoint; Obtain the data parameters of the data body; Traverse the spatial octree and determine whether to continue traversing downwards based on the resolution level after partitioning and the data parameters. If it is impossible to determine whether to continue traversing downwards, then determine whether to continue traversing downwards based on the data manual; The data manual includes: the number of times the data block continues to be traversed downwards and the total number of time samples; the step of determining whether to continue traversing downwards based on the data manual includes: obtaining a parameter factor based on the data parameters; obtaining the probability of the parameter factor continuing to traverse downwards within the corresponding interval based on the parameter factor, the number of times the data block continues to be traversed downwards and the total number of time samples; determining whether the probability of continuing to traverse downwards is greater than a threshold, and if so, continuing to traverse downwards; If the result of the step of determining whether to continue traversing downwards based on the resolution level and data parameters after partitioning is to continue traversing downwards, or if the result of the step of determining whether to continue traversing downwards based on the data manual is to continue traversing downwards, then the number of times the data block continues to be traversed downwards and the total number of time samples are updated in the data manual. The data parameters of the data body include: the distance between the center of the data block and the viewpoint, the distance between the center of the data body and the viewpoint, and the radius of the data body; the steps of establishing the data manual include: selecting the parameter factor Gp: Gp=(Dp-(Da-Ra)) / 2*Ra; Dp is the distance between the center of the data block and the viewpoint; Da is the distance between the center of the entire data volume and the viewpoint; Ra is the radius of the entire data volume; Gp∈[0,1]; Gp represents the distribution of the data block in the entire data volume, and Gp determines whether the data block is traversed downwards.
2. The scheduling method for plotting seismic data volumes according to claim 1, characterized in that, The step of dividing the seismic data volume into data blocks to form a spatial octree includes: taking the display range of the data volume as the root of the spatial octree, performing a binary recursive segmentation on each data block to form the spatial octree.
3. The scheduling method for plotting seismic data volumes according to claim 1, characterized in that, The step of determining whether to continue traversing downwards based on the resolution level and data parameters after partitioning includes: determining whether the distance between the center of the data block and the viewpoint is less than the distance corresponding to the resolution level of the data block; if so, continuing to traverse downwards.
4. The scheduling method for plotting seismic data volumes according to claim 1, characterized in that, After the step of determining whether to continue traversing downwards based on the data manual: if the determination result is that it is not necessary to continue traversing downwards, then all data blocks are sorted and drawn.
5. The scheduling method for plotting seismic data volumes according to claim 4, characterized in that, The step of sorting all data blocks includes: sorting the data blocks in order from farthest to nearest based on the distance between the center of the data block and the viewpoint.
6. A method for plotting seismic data volumes, characterized in that, The scheduling is performed using the scheduling method for drawing seismic data volumes as described in any one of claims 1-5.
7. A scheduling device for plotting seismic data volumes, characterized in that, include: The segmentation module is used to segment the seismic data volume into data blocks to form a spatial octree; A segmentation module is used to divide the data block into resolution levels centered on the viewpoint; The calculation module is used to obtain the data parameters of the data body; The judgment module is used to traverse the spatial octree and determine whether to continue traversing downwards based on the resolution level after partitioning and the data parameters. If it is impossible to determine whether to continue traversing downwards, then determine whether to continue traversing downwards based on the data manual; The data handbook includes: the number of times the data block continues to be traversed downwards and the total number of time samples; the step of determining whether to continue traversing downwards based on the data handbook includes: obtaining a parameter factor based on the data parameters; obtaining the probability of continuing traversing downwards within the corresponding interval based on the parameter factor, the number of times the data block continues to be traversed downwards, and the total number of time samples; determining whether the probability of continuing traversing downwards is greater than a threshold, and if so, continuing traversing downwards; the determination result of the step of determining whether to continue traversing downwards based on the partitioned resolution level and the data parameters is to continue traversing downwards, or the determination result of the step of determining whether to continue traversing downwards based on the data handbook is... If the traversal continues downwards, the number of times the data block continues to be traversed downwards and the total number of time samples are updated in the data manual. The data parameters of the data body include: the distance between the center of the data block and the viewpoint, the distance between the center of the data body and the viewpoint, and the radius of the data body. The steps of establishing the data manual include: selecting the parameter factor Gp: Gp=(Dp-(Da-Ra)) / 2*Ra; Dp is the distance between the center of the data block and the viewpoint; Da is the distance between the center of the entire data body and the viewpoint; Ra is the radius of the entire data body; Gp∈[0,1]; Gp represents the distribution of the data block in the entire data body range, and Gp determines whether the data block is traversed downwards.
8. A seismic data volume plotting device, characterized in that, The scheduling device for drawing earthquake data volumes as described in claim 7 above.
9. An electronic device, characterized in that, The system includes a memory and a processor, wherein the memory is used to store one or more computer instructions, wherein the one or more computer instructions, when executed by the processor, implement the scheduling method for drawing seismic data volumes as described in any one of claims 1-5 and the seismic data volume drawing method as described in claim 6.
10. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program, which, when executed by a processor, is used to implement the scheduling method for drawing seismic data volumes as described in any one of claims 1-5 and the seismic data volume drawing method as described in claim 6.
Citation Information
Patent Citations
Visualization method for seismic data
CN109597127A
Fractal dimension calculation method and device based on octree algorithm
CN112991424A
