ImageVerifierCode 换一换
格式:PPT , 页数:23 ,大小:822.15KB ,
资源ID:378748      下载积分:2000 积分
快捷下载
登录下载
邮箱/手机:
温馨提示:
如需开发票,请勿充值!快捷下载时,用户名和密码都是您填写的邮箱或者手机号,方便查询和重复下载(系统自动生成)。
如填写123,账号就是123,密码也是123。
特别说明:
请自助下载,系统不会自动发送文件的哦; 如果您已付费,想二次下载,请登录后访问:我的下载记录
支付方式: 支付宝扫码支付 微信扫码支付   
注意:如需开发票,请勿充值!
验证码:   换一换

加入VIP,免费下载
 

温馨提示:由于个人手机设置不同,如果发现不能下载,请复制以下地址【http://www.mydoc123.com/d-378748.html】到电脑端继续下载(重复下载不扣费)。

已注册用户请登录:
账号:
密码:
验证码:   换一换
  忘记密码?
三方登录: 微信登录  

下载须知

1: 本站所有资源如无特殊说明,都需要本地电脑安装OFFICE2007和PDF阅读器。
2: 试题试卷类文档,如果标题没有明确说明有答案则都视为没有答案,请知晓。
3: 文件的所有权益归上传用户所有。
4. 未经权益所有人同意不得将文件中的内容挪作商业或盈利用途。
5. 本站仅提供交流平台,并不能对任何下载内容负责。
6. 下载文件中如有侵权或不适当内容,请与我们联系,我们立即纠正。
7. 本站不保证下载资源的准确性、安全性和完整性, 同时也不承担用户因使用这些下载资源对自己和他人造成任何形式的伤害或损失。

版权提示 | 免责声明

本文(Automatic Picking of First Arrivals.ppt)为本站会员(sofeeling205)主动上传,麦多课文库仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对上载内容本身不做任何修改或编辑。 若此文所含内容侵犯了您的版权或隐私,请立即通知麦多课文库(发送邮件至master@mydoc123.com或直接QQ联系客服),我们立即给予删除!

Automatic Picking of First Arrivals.ppt

1、1,Automatic Picking of First Arrivals,He Dian and Ting Sun,Definition,The first-break picking is that of identifying or picking the first arrivals of refracted signals from all the signals received by the receiver arrays for a particular source signal generation.,2,Direct arrivals Reflected arrivals

2、 Refracted arrivals,3,One of the methods for studying the near-surface low-velocity zone and for subsequent determination of static corrections is the technique of employing first arrivals.A common static correction is the weathering correction, which compensates for a layer of low seismic velocity

3、material near the surface of the Earth.,Why?,5,6,7,Application,Static corrections for seismic data processing, an important step in producing high-quality seismic sections.The weathering layer lead to near-surface low-velocity zone and produces travel-time anomalies , and the anomalies result in fal

4、se subsurface structures in later seismic processing. However, the anomalies can be corrected by using the first break arrival times on refraction signals.,8,Application,Detailed knowledge of the structure of the low-velocity zone.,9,Application,Used as observation data in reservoir history matching

5、History matching is the act of adjusting a model of a reservoir until it closely reproduces the past behavior of a reservoir. The past behavior can be production data and pressure data, well log and seismic data. The accuracy of the history matching depends on the quality of the reservoir model and

6、the quality and quantity of observation data. Once a model has been history matched, it can be used to simulate future reservoir behavior with a higher degree of confidence.,10,The main difficulties are connected with the properties of noise on seismograms:There is always a non-zero level of noise b

7、efore first arrive.2. The analysis of field data shows that first arrival and noise can be spatially correlated over short distances.3. Other anomalies in the topography of the survey region.,Difficulties,Coherence method. Cross correlation method. Combination of the correlation method an linear lea

8、st squares prediction technique. Neural Networks. Fractal-based algorithm.,10/9/2018,12,Methods,Automatic picking of first arrivals,Assume that the data of first arrivals are presented by a seismogram uj,n with N traces recorded at points xn=nx, n=1, , N, at time moments tj=jt, j=1, , J.,13,Automati

9、c picking of first arrivals,First step of the algorithm Destruction of a possible spatial correlation of noise. This is achieved by suppression of noise with an amplitude below a certain level. This level is defined by estimation of the average maximum noise level in a given time-space window before

10、 the first arrivals.,14,Automatic picking of first arrivals,First step of the algorithm Let such a window be on the traces m1 to m2 For each trace m, the maximum noise level is defined,Average maximum level of noise,Define a unit step function, The process of noise suppression is expressed as,where

11、is a minimum threshold value of the ratio of the signal to the average maximum noise level.,15,Automatic picking of first arrivals,Second step of the algorithm is first-arrival detection. This is based on statistical estimates obtained by summation of traces along straight lines in given directions.

12、 In order to define the directions of summation, we introduce the dimensionless slowness:where x is the distance between traces, t is the time sampling interval and vk is the apparent velocity in the direction of summation.,16,Automatic picking of first arrivals,Second step of the algorithm Define a

13、 range of summation over L traces, with L=2LH+1 around the central trace n. Then by summation in direction Pk, get the average,And the standard deviationNow introduce the function,17,Automatic picking of first arrivals,Second step of the algorithmThe function can serve as a good estimate for signal-

14、to-noise ratio, as can be clearly seen from two extreme cases. (1) absence of signal gives a very small value for W (2) ideal signal on all traces gives infinite value for W,18,Automatic picking of first arrivals,Second step of the algorithm However, in practice we do not know the real distribution

15、of U and furthermore, we must deal with very small ranges of summation. Thus, propose the following criterion for signal detectionwhere assuming that on M traces (ML) there are random deviations of noise with the same amplitude a in a direction Pk. The noise is negligible on the remaining L-M traces

16、19,Automatic picking of first arrivals,Second step of the algorithmcan serve as a measure of reliability of signal detection. The inequality is a criterion for making a decision regarding the presence of a signal. This means that we eliminate the possibility of false detection due to random correl

17、ation of noise on M traces.,20,Automatic picking of first arrivals,Third step of the algorithm Find the time of first arrivals on trace n. Average in a given time window It,Next, for every value of k we find a minimum value of j, let it equal , for which the inequality is satisfied.,21,Automatic pic

18、king of first arrivals,Third step of the algorithm In order to increase the reliability of detection, we demand that this inequality is satisfied for several consecutive values of in j. Then, we find the minimum of all the values , let it equal . The valuethus is the estimate of the time of first arrivals on trace n.,22,Thanks Questions?,23,

copyright@ 2008-2019 麦多课文库(www.mydoc123.com)网站版权所有
备案/许可证编号:苏ICP备17064731号-1