CN111474579A - Automatic view changing method based on uniform coverage times - Google Patents
Automatic view changing method based on uniform coverage times Download PDFInfo
- Publication number
- CN111474579A CN111474579A CN202010377581.6A CN202010377581A CN111474579A CN 111474579 A CN111474579 A CN 111474579A CN 202010377581 A CN202010377581 A CN 202010377581A CN 111474579 A CN111474579 A CN 111474579A
- Authority
- CN
- China
- Prior art keywords
- point
- obstacle
- grid
- shot
- automatic
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 32
- 238000005457 optimization Methods 0.000 claims abstract description 9
- 238000004364 calculation method Methods 0.000 claims abstract description 7
- 238000002922 simulated annealing Methods 0.000 claims abstract description 5
- 230000004888 barrier function Effects 0.000 claims description 6
- 238000001514 detection method Methods 0.000 claims description 4
- 238000000137 annealing Methods 0.000 claims description 2
- 238000001816 cooling Methods 0.000 claims description 2
- 238000010586 diagram Methods 0.000 description 8
- 238000013461 design Methods 0.000 description 6
- 238000007667 floating Methods 0.000 description 4
- 241000558306 Gynocardia odorata Species 0.000 description 2
- 238000005422 blasting Methods 0.000 description 2
- 230000007812 deficiency Effects 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 241001179022 Hydnocarpus anthelminthicus Species 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000012938 design process Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 230000002452 interceptive effect Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 239000000523 sample Substances 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01V—GEOPHYSICS; GRAVITATIONAL MEASUREMENTS; DETECTING MASSES OR OBJECTS; TAGS
- G01V1/00—Seismology; Seismic or acoustic prospecting or detecting
- G01V1/28—Processing seismic data, e.g. for interpretation or for event detection
- G01V1/30—Analysis
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Remote Sensing (AREA)
- Physics & Mathematics (AREA)
- Life Sciences & Earth Sciences (AREA)
- Acoustics & Sound (AREA)
- Environmental & Geological Engineering (AREA)
- Geology (AREA)
- General Life Sciences & Earth Sciences (AREA)
- General Physics & Mathematics (AREA)
- Geophysics (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses an automatic observing method based on uniform covering times, which mainly solves the problem that the prior art does not support the balanced automatic observing of the covering times. The method comprises the following steps: (S1) the system first calculates the number of original coverage before viewing; (S2) initially observing the obstacle point using an automatic obstacle avoidance algorithm based on the shortest moving distance; (S3) performing an optimization calculation with the goal of the coverage uniformity using a simulated annealing method on the basis of the step (S2), so that the final microstructure satisfies the requirement of the coverage uniformity. Through the scheme, the invention achieves the purpose of one-key automatic viewing in the program, and has very high practical value and popularization value.
Description
Technical Field
The invention belongs to the technical field of seismic acquisition and observation, and particularly relates to an automatic observing changing method based on uniform coverage times.
Background
In the design process of the seismic acquisition observation system, the uniformity of the coverage times is an important basis for evaluating the quality of the observation system, the coverage times of the theoretical observation system in a full coverage area are uniform, and in the actual seismic exploration construction in the field, a barrier area where shot points and demodulator probes cannot be arranged often exists. Due to the fact that shot points and wave detection points in seismic exploration cannot be regularly arranged according to a designed observation system in the obstacle regions, seismic data acquisition cannot reach the designed covering times, the signal-to-noise ratio of a seismic stacking section is reduced, shallow layers in seismic data obtained through final processing are lost, and overall recognition of a structural block and resource evaluation of depression are influenced. Therefore, obstacle avoidance processing is required, the position of the shot point is adjusted to make up for the deficiency of data in the obstacle area and the deficiency of the coverage times, and the adjustment of the position of the shot point directly influences the uniformity of the overall coverage times of the observation system.
The traditional variable-view design is generally operated manually, mainly considering the covering times and the ground surface obstacle condition, and achieving the purpose of meeting the covering times by arranging a method of forcibly crossing the obstacle, enlarging the offset distance at two ends of the obstacle and blasting or adopting restitutive blasting. However, with the development of seismic exploration technology and the continuous expansion of production scale, and the continuous improvement of exploration precision requirements, the defects of manual variable-view design become more and more prominent, and the variable-view requirements of large-scale complex obstacle areas cannot be met. In recent years, a plurality of scholars study observation system changed design methods, chaulmoogra such as Chao, and the like[2]An observation system based on a 3S technology (GPS positioning, satellite remote sensing and geographic information system) is designed, and the observation system can be designed by different methods aiming at different observation areas, but the method has higher requirements on equipment, is not an automatic observing change system in the true sense and needs manual intervention; the beautiful silk[3]Shallow earthquake obstacle-crossing and view-changing design software is developed, and obstacle-crossing and view-changing can be rapidly carried out on an acquisition site by utilizing the software without an automatic view-changing function; in addition, some researchers have proposed an automatic observing design method, but most of them aim at the shortest moving path to change the observation, and no consideration is given to whether the covering times are balanced after the observation.
Among these, the relevant references mentioned in the above are specifically as follows:
[1] the calculation method of the longitudinal and transverse coverage times in the King Jing, Dongjunpeng, three-dimensional observation system [ J ] West prospecting engineering, 2012,024(011) 125-.
[2] Chaulmoogra such as chaulmoogra, yinglu, Shiyiqing, et al. complex obstacle area three-dimensional earthquake observation system changed design method and application [ J ]. complex oil and gas reservoir, 2010,03(4):31-34.
[3] Development and application of the design software for changing shallow earthquake obstacle to the design of Juanjuan (Juanjuan) and shallow earthquake obstacle [ J ] earthquake engineering report 2016(3) -.
Disclosure of Invention
The invention aims to provide an automatic observing method based on uniform covering times, which mainly solves the problem that the prior art does not support the balanced automatic observing of the covering times.
In order to achieve the purpose, the technical scheme adopted by the invention is as follows:
an automatic observing changing method based on uniform covering times comprises the following steps:
(S1) the system first calculates the number of original coverage before viewing;
(S2) initially observing the obstacle point using an automatic obstacle avoidance algorithm based on the shortest moving distance;
(S3) performing an optimization calculation with the goal of the coverage uniformity using a simulated annealing method on the basis of the step (S2), so that the final microstructure satisfies the requirement of the coverage uniformity.
Further, the specific step of using the automatic obstacle avoidance algorithm based on the shortest moving distance in the step (S2) is as follows:
(S21) finding and traversing each obstacle point, finding a target grid point for each obstacle point;
(S22) marking the target grid points as available grid points while calculating a distance of each obstacle point from its corresponding target grid point;
(S23) sorting the obstacle points in descending order according to the distance;
(S24) judging whether the target grid point corresponding to the current obstacle point is available, if not, searching the target grid point of the current obstacle point again; if so, moving the obstacle point to the target grid point, and marking the target grid point as unavailable;
(S25) the step (S24) is performed for all obstacle points in sequence until all obstacle points are processed, and the algorithm execution ends.
Further, the target grid point in the step (S21) is a grid point that is closest to each obstacle point under the allowance condition, that is, the grid point is not occupied by other shots and is not in the obstacle area.
Further, in the step (S24), the target grid point is not available when occupied by other obstacle avoidance points.
Further, the specific steps of performing the optimization calculation with the uniform coverage times as the target in the step (S3) are as follows:
(S31) acquiring the original covering times from the step (S25);
(S32) setting an initial annealing temperature T and a maximum cycle number, and entering an iterative cycle while selecting a shot point that can be exchanged;
(S33) when finding the exchangeable shot, first randomly selecting an obstacle a, and then obtaining a list NGS of available neighboring grid points of the obstacle a;
(S34) entering list circulation, and simultaneously judging whether the maximum circulation times is reached, if so, returning to the step (S33), and if not, randomly selecting a grid G in the list;
(S35) judging whether the obstacle point a is exchanged with the grid G, if not, marking the grid G as unavailable and returning to the step (S34), if so, calculating the fitness function value f (S34)0) And moving the obstacle point a to the position of the grid G;
(S36) acquiring a shot point b closest to the grid G, and assigning the shot-detection relation of the shot point b to the obstacle point A;
(S37) adopting an incremental method to carry out rapid recalculation of the covering times and calculating a fitness function value f (S)1)；
(S38) calculating the increment Δ T ═ f (S)1)-f(S0) Judging whether the covering times become uniform, if so, accepting the exchange of the barrier point a and the shot point b, and if not, according to the probability e-ΔT/TReceiving the exchange of the obstacle point a and the shot point b; then the temperature T is carried outCooling;
(S39) judging whether the maximum loop number is reached, if not, returning to the step (S33), if so, reaching the loop termination condition, and ending the algorithm execution.
Specifically, the formula for performing the fast recounting of the number of times of coverage by the incremental method in the step (S37) is as follows: the current covering times are the last covering times, the covering times influenced by the obstacle point a and the covering times influenced by the shot point b.
Wherein, the original covering times before the observation is calculated in the step (S1) uses the document [1]The method of (1). In the step (S38), the number of coverage becomes more uniform if the increment Δ T < 0, where the fitness function is defined as f (current number of coverage-original number of coverage)2(ii) a Using a random seed to generate a floating point number between 0 and 1 if the probability value e-ΔT/T>Floating point number, then receiving the exchange between barrier point a and shot point b; the temperature T is reduced using the formula T ═ λ T, where λ is 0.9.
Compared with the prior art, the invention has the following beneficial effects:
(1) compared with the traditional method, the manual observing change method has high automation degree, avoids the complex steps of manually designing the observing change scheme and carrying out interactive operation in the traditional method, and carries out one-key automatic observing change in the program; an optimal solution which can enable the coverage frequency uniformity is found by using a simulated annealing algorithm, and the appearance changing effect is good; the automatic change of the large-scale work area can be processed, and the efficiency is high.
Drawings
FIG. 1 is a flow chart of the system of the present invention.
Fig. 2 is a flowchart of the automatic obstacle avoidance algorithm based on the shortest moving distance in the present invention.
Fig. 3 is a flowchart of an automatic obstacle avoidance algorithm based on uniform coverage times.
Fig. 4 is a schematic diagram of the arrangement relationship of a shot point in a work area (AB is an obstacle area) according to the present invention.
FIG. 5 is a schematic diagram of the arrangement relationship of shot points near an obstacle area after the automatic change of the invention by using the shortest moving distance algorithm.
Fig. 6 is a schematic diagram of arrangement relationship of shot points near an obstacle area after the automatic obstacle avoidance algorithm based on uniform coverage times is used in the invention.
FIG. 7 is a diagram of an original coverage count of a work area according to the present invention.
FIG. 8 is a schematic diagram of the coverage times of a work area after being automatically changed by using a shortest moving distance algorithm.
Fig. 9 is a schematic diagram of the number of coverage of a work area after an automatic obstacle avoidance algorithm based on uniform coverage is used.
Detailed Description
The present invention is further illustrated by the following figures and examples, which include, but are not limited to, the following examples.
Examples
As shown in fig. 1, an automatic viewing method based on uniform coverage times includes the following steps:
(S1) the system first calculates the number of original coverage before viewing;
(S2) initially observing the obstacle point using an automatic obstacle avoidance algorithm based on the shortest moving distance;
(S3) performing optimization calculation with the coverage uniformity as a target on the basis of the step (S2), so that the final viewing structure satisfies the requirement of coverage uniformity.
In step (S2), all obstacle points are first found based on the automatic obstacle avoidance algorithm with the shortest moving distance, and then the nearest grid point (denoted as a target grid point) is found for each obstacle point under the permission condition, where the permission condition refers to the maximum number of grids where the obstacle point specified by the user moves in the inline direction and the crossline direction, and the target grid point must be an available grid point (a grid point that is not occupied by other shots and is not in an obstacle area). And then sorting the obstacle avoidance points in a descending manner according to the distance between each obstacle point and the target grid point. And finally, moving each obstacle avoidance point to a target grid point according to the sequence, recording the target grid point as unavailable, searching the target grid point closest to the current obstacle avoidance point again if the target grid point corresponding to the current obstacle avoidance point is unavailable (occupied by other obstacle avoidance points), moving the target grid point to the target grid point and recording the target grid point as unavailable. After all the obstacle points are processed in sequence, the algorithm execution is finished, and the specific flow is shown in fig. 2.
Optimization of the coverage number balance is performed on the basis of the step (S2). The algorithm firstly obtains the original covering times, then sets the initial simulated annealing temperature T (the initial value of T is set as 1000), sets the maximum cycle time of 200, enters the cycle, iteratively searches exchangeable shot points, and selects the optimal scheme. When finding exchangeable shots, firstly, randomly selecting a barrier point a, then obtaining a list NGS of available adjacent grid points of the barrier point a, and selecting an exchangeable grid G in the adjacent grid list according to exchangeable conditions, wherein the exchangeable conditions refer to that no other shots are placed in the grid G. And after the exchange between the obstacle point a and the grid G is finished, searching a shot point B closest to the grid G, and assigning the shot-detection relation of the shot point B to the obstacle point a. Then, an incremental method is adopted to carry out rapid recalculation on the covering times, namely the current covering times are the covering times of the last time, the covering times influenced by the obstacle point a and the covering times influenced by the shot point b, an incremental value delta T is calculated, if the delta T is less than 0, the covering times are more balanced, and the exchange result is received; otherwise, calculating probability value e-ΔT/TThe random seed is used to generate a floating point number between 0 and 1, and if the probability value is greater than the floating point number, the swap is accepted. And finally, cooling the temperature T, and entering the next circulation. When the loop termination condition is reached, that is, the number of loops reaches 200, the algorithm execution is ended, and the specific flow is shown in fig. 3.
Fig. 4 is a schematic diagram showing an arrangement relationship of shot points near an obstacle area before a first work area is changed, rectangles distributed at equal intervals in the longitudinal direction in the diagram represent preset shot points, areas marked as a and B are the obstacle area, the preset shot points are distributed in the obstacle area, and the original coverage times of the first work area are shown in fig. 7. After the obstacle avoidance is automatically performed by using the moving distance-based shortest algorithm, all shot points in the original obstacle area are completely moved out of the obstacle area, the moved shot points are arranged along the vicinity of the obstacle area, the arrangement of the shot points in the vicinity of the obstacle area is shown in fig. 5, and the coverage times of the work area are shown in fig. 8. After the optimization is performed by using the algorithm with uniform coverage times, the arrangement relationship of the shot points near the obstacle area changes again, as shown in fig. 6, and the corresponding coverage times are as shown in fig. 9, which shows that the coverage times of the first work area become more uniform and closer to the original coverage times of the first work area before observation by using the optimization algorithm based on uniform coverage times.
The above embodiments are only preferred embodiments of the present invention, and are not intended to limit the scope of the present invention, but all changes that can be made by applying the principles of the present invention and performing non-inventive work on the basis of the principles shall fall within the scope of the present invention.
Claims (6)
1. An automatic observing changing method based on uniform covering times is characterized by comprising the following steps:
(S1) the system first calculates the number of original coverage before viewing;
(S2) initially observing the obstacle point using an automatic obstacle avoidance algorithm based on the shortest moving distance;
(S3) performing an optimization calculation with the goal of the coverage uniformity using a simulated annealing method on the basis of the step (S2), so that the final microstructure satisfies the requirement of the coverage uniformity.
2. The method for automatic viewing based on coverage uniformity of claim 1, wherein the step (S2) of using an automatic obstacle avoidance algorithm based on shortest moving distance comprises the following steps:
(S21) finding and traversing each obstacle point, finding a target grid point for each obstacle point;
(S22) marking the target grid points as available grid points while calculating a distance of each obstacle point from its corresponding target grid point;
(S23) sorting the obstacle points in descending order according to the distance;
(S24) judging whether the target grid point corresponding to the current obstacle point is available, if not, searching the target grid point of the current obstacle point again; if so, moving the obstacle point to the target grid point, and marking the target grid point as unavailable;
(S25) the step (S24) is performed for all obstacle points in sequence until all obstacle points are processed, and the algorithm execution ends.
3. The method of claim 2, wherein the target grid point in the step (S21) is a closest grid point to each obstacle point under a condition that the target grid point is not occupied by other shots and is not in an obstacle area.
4. The method of claim 3, wherein the step (S24) is performed when the target grid point is occupied by other obstacle avoidance points.
5. The method for automatic viewing based on coverage uniformity of claim 4, wherein the step (S3) of performing optimization calculation with coverage uniformity as a target comprises the following specific steps:
(S31) acquiring the original covering times from the step (S25);
(S32) setting an initial annealing temperature T and a maximum cycle number, and entering an iterative cycle while selecting a shot point that can be exchanged;
(S33) when finding the exchangeable shot, first randomly selecting an obstacle a, and then obtaining a list NGS of available neighboring grid points of the obstacle a;
(S34) entering list circulation, and simultaneously judging whether the maximum circulation times is reached, if so, returning to the step (S33), and if not, randomly selecting a grid G in the list;
(S35) judging whether the obstacle point a is exchanged with the grid G, if not, marking the grid G as unavailable and returning to the step (S34), if so, calculating the fitness function value f (S34)0) And moving the obstacle point a to the position of the grid G;
(S36) acquiring a shot point b closest to the grid G, and assigning the shot-detection relation of the shot point b to the obstacle point A;
(S37) adopting an incremental method to carry out rapid recalculation of the covering times and calculating a fitness function value f (S)1)；
(S38) calculating the increment Δ T ═ f (S)1)-f(S0) Judging whether the covering times become uniform, if so, accepting the exchange of the barrier point a and the shot point b, and if not, according to the probability e-ΔT/TReceiving the exchange of the obstacle point a and the shot point b; then, cooling the temperature T;
(S39) judging whether the maximum loop number is reached, if not, returning to the step (S33), if so, reaching the loop termination condition, and ending the algorithm execution.
6. The method of claim 5, wherein the step (S37) of fast recounting the covering times by using an incremental method is represented by the following formula: the current covering times are the last covering times, the covering times influenced by the obstacle point a and the covering times influenced by the shot point b.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010377581.6A CN111474579B (en) | 2020-05-07 | 2020-05-07 | Automatic view changing method based on uniform coverage times |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010377581.6A CN111474579B (en) | 2020-05-07 | 2020-05-07 | Automatic view changing method based on uniform coverage times |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111474579A true CN111474579A (en) | 2020-07-31 |
| CN111474579B CN111474579B (en) | 2022-08-30 |
Family
ID=71757344
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010377581.6A Expired - Fee Related CN111474579B (en) | 2020-05-07 | 2020-05-07 | Automatic view changing method based on uniform coverage times |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111474579B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113009573A (en) * | 2021-02-25 | 2021-06-22 | 中国石油集团东方地球物理勘探有限责任公司 | Seismic data acquisition method, seismic data acquisition device, computer equipment and storage medium |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102023310A (en) * | 2009-09-19 | 2011-04-20 | 中国石油化工集团公司 | Uniformity analysis method of three-dimensional observation system |
| CN104597493A (en) * | 2013-10-30 | 2015-05-06 | 中国石油天然气集团公司 | Observation system variable-layout design evaluation method and observation system variable-layout design evaluation device based on actual seismic data |
| US20160312552A1 (en) * | 2015-04-27 | 2016-10-27 | Baker Hughes Incorporated | Integrated modeling and monitoring of formation and well performance |
| CN106373192A (en) * | 2016-09-07 | 2017-02-01 | 成都理工大学 | Non-topology-consistency three-dimensional grid block tracking algorithm |
| CN107290775A (en) * | 2017-05-16 | 2017-10-24 | 中国地震局地球物理勘探中心 | A kind of city two-dimension earthquake crosses obstacle observation system optimization geometry changed design method |
| CN107526101A (en) * | 2017-07-07 | 2017-12-29 | 中国地质调查局油气资源调查中心 | A kind of collection for obtaining earthquake reflected wave and processing method |
| JP2019109065A (en) * | 2017-12-15 | 2019-07-04 | 大成建設株式会社 | Setting method of earthquake movement for design |
| CN110824545A (en) * | 2018-08-10 | 2020-02-21 | 中国石油化工股份有限公司 | Method for automatically and quickly observing complex surface and optimizing excited drug amount |
| CN110927777A (en) * | 2018-09-19 | 2020-03-27 | 中国石油化工股份有限公司 | Moving method and device for three-dimensional earthquake acquisition and observation system barrier area shot point |
-
2020
- 2020-05-07 CN CN202010377581.6A patent/CN111474579B/en not_active Expired - Fee Related
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102023310A (en) * | 2009-09-19 | 2011-04-20 | 中国石油化工集团公司 | Uniformity analysis method of three-dimensional observation system |
| CN104597493A (en) * | 2013-10-30 | 2015-05-06 | 中国石油天然气集团公司 | Observation system variable-layout design evaluation method and observation system variable-layout design evaluation device based on actual seismic data |
| US20160312552A1 (en) * | 2015-04-27 | 2016-10-27 | Baker Hughes Incorporated | Integrated modeling and monitoring of formation and well performance |
| CN106373192A (en) * | 2016-09-07 | 2017-02-01 | 成都理工大学 | Non-topology-consistency three-dimensional grid block tracking algorithm |
| CN107290775A (en) * | 2017-05-16 | 2017-10-24 | 中国地震局地球物理勘探中心 | A kind of city two-dimension earthquake crosses obstacle observation system optimization geometry changed design method |
| CN107526101A (en) * | 2017-07-07 | 2017-12-29 | 中国地质调查局油气资源调查中心 | A kind of collection for obtaining earthquake reflected wave and processing method |
| JP2019109065A (en) * | 2017-12-15 | 2019-07-04 | 大成建設株式会社 | Setting method of earthquake movement for design |
| CN110824545A (en) * | 2018-08-10 | 2020-02-21 | 中国石油化工股份有限公司 | Method for automatically and quickly observing complex surface and optimizing excited drug amount |
| CN110927777A (en) * | 2018-09-19 | 2020-03-27 | 中国石油化工股份有限公司 | Moving method and device for three-dimensional earthquake acquisition and observation system barrier area shot point |
Non-Patent Citations (10)
| Title |
|---|
| XUEMEI CHEN 等: "Measures of Scalability", 《 IEEE TRANSACTIONS ON INFORMATION THEORY》 * |
| XUEMEI CHEN 等: "Measures of Scalability", 《 IEEE TRANSACTIONS ON INFORMATION THEORY》, vol. 61, no. 8, 31 August 2015 (2015-08-31), pages 4410 - 4423, XP011662817, DOI: 10.1109/TIT.2015.2441071 * |
| 刘远志等: "三星堆遗址大型障碍物三维变观技术研究", 《物探化探计算技术》 * |
| 刘远志等: "三星堆遗址大型障碍物三维变观技术研究", 《物探化探计算技术》, vol. 32, no. 06, 15 November 2010 (2010-11-15), pages 594 - 600 * |
| 房鹏 等: "三维空间属性体克里金插值方法的研究", 《电脑知识与技术》 * |
| 房鹏 等: "三维空间属性体克里金插值方法的研究", 《电脑知识与技术》, vol. 16, no. 1, 31 January 2020 (2020-01-31), pages 231 - 232 * |
| 晁如佑等: "复杂障碍区三维地震观测系统变观设计方法及应用", 《复杂油气藏》 * |
| 晁如佑等: "复杂障碍区三维地震观测系统变观设计方法及应用", 《复杂油气藏》, vol. 3, no. 04, 25 December 2010 (2010-12-25), pages 31 - 34 * |
| 王博: "基于地质模型的观测系统变观技术研究", 《中国优秀硕士学位论文全文数据库 基础科学辑》 * |
| 王博: "基于地质模型的观测系统变观技术研究", 《中国优秀硕士学位论文全文数据库 基础科学辑》, no. 07, 31 July 2019 (2019-07-31), pages 11 - 453 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113009573A (en) * | 2021-02-25 | 2021-06-22 | 中国石油集团东方地球物理勘探有限责任公司 | Seismic data acquisition method, seismic data acquisition device, computer equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111474579B (en) | 2022-08-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106446435B (en) | A kind of optimization method on contaminated soil remediation range and boundary | |
| CN110418354A (en) | It is a kind of that propagation model wireless network planning method is exempted from based on machine learning | |
| CN112282847B (en) | Deformation monitoring method for underground coal mine roadway | |
| CN111474579B (en) | Automatic view changing method based on uniform coverage times | |
| CN101873605B (en) | Adaptive method for classifying communication environments in network planning | |
| CN108917583A (en) | A kind of super high-rise building deformation monitoring new method for taking tropospheric delay influence into account | |
| CN111163476A (en) | Wireless transmission model-based power wireless private network coverage and interference determination method | |
| CN112712169A (en) | Model building method and application of full residual depth network based on graph convolution | |
| CN110326323B (en) | Method and device for acquiring emission probability, transition probability and sequence positioning | |
| CN104048605A (en) | Laser scanning measurement target adjustment equation establishing method | |
| CN108207005B (en) | LTE wireless network evaluation method and server | |
| CN110345867A (en) | A method of the space CMM Point Coordinates error is corrected based on inverse distance weighting | |
| CN105157588A (en) | Multi-dimensional synchronous optimized measurement method for strain localization band interval evolution rule | |
| CN113301503B (en) | Weak coverage area detection method and device | |
| CN105868780A (en) | Method of matching and invoking of antenna thermal deformation compensation database based on orientation adjustment | |
| CN105764088A (en) | TDOA cellular location method based on genetic algorithm | |
| CN108738129A (en) | A kind of base station positioning method based on drive test data | |
| CN106658535A (en) | LTE adjacent area allocation leakage analysis method based on MR and working parameters | |
| CN110426755B (en) | Ground temperature data quality control method based on improved reverse distance weighting | |
| CN104917575B (en) | A kind of monitoring point optimizing method for disposing for radio environment monitoring | |
| CN103091713B (en) | A kind of method to relief surface observing system Automatic Optimal | |
| CN109886497A (en) | Surface air temperature interpolation method based on the improved inverse distance weight of latitude | |
| CN106658643A (en) | RSSI based valid anchor node selecting method | |
| CN108802815B (en) | Pre-stack crack prediction method for connected piece data | |
| CN112800581B (en) | Modeling research method for fine geological model of oil field |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20220830 |