USO10571586B2

(12) United
Yang et al.
States Patent (10 ) Patent No.: US 10,571,586 B2
(45 ) Date of Patent: Feb. 25 , 2020
(54 ) FALSE IMAGE REMOVAL IN REVERSE (56 ) References Cited
TIME MIGRATION
U.S. PATENT DOCUMENTS
( 71) Applicant: Saudi Arabian Oil Company , Dhahran 8,116,168 B1 2/2012 Luo et al .
(SA ) 2012/0051176 A1 3/2012 Liu
2014/0328140 A1 11/2014 Khalil et al.
( 72 ) Inventors: Jiarui Yang, Beijing ( CN ); Tong Wang 2015/0124559 Al 5/2015 Cha et al.
Fei, Dhahran (SA ); Yi Luo , Dhahran 2016/0341837 A1 11/2016 Jing et al.
(SA )
OTHER PUBLICATIONS
(73 ) Assignee: Saudi Arabian Oil Company, Dhahran
(SA ) Wang et al., RTM Artifact Removal Via a Fast Algorithm for
Wavefield Decomposition, 2016 SEG International Exposition and
( * ) Notice : Subject to any disclaimer , the term of this 86th Annual Meeting, pp . 4690-4694 ( Year: 2016 ).*
patent is extended or adjusted under 35 (Continued )
U.S.C. 154(b ) by 79 days.
Primary Examiner Toah M Le
(21 ) Appl. No .: 15 /701,038 (74 ) Attorney, Agent, or Firm — Fish & Richardson P.C.
(22 ) Filed : Sep. 11 , 2017 (57) ABSTRACT
(65) Prior Publication Data The present disclosure describes methods and systems,
US 2019/0079206 A1 Mar. 14 , 2019
including computer- implemented methods, computer pro
gram products, and computer systems, for removing false
(51) Int. Cl. image in reverse time migration (RTM ). One computer
GOIV 1/36
implemented method includes dividing volume of a source
( 2006.01) wavefield and a receiver wavefield into a plurality of win
GOIV 1/32 ( 2006.01 ) dows, calculating a down-going component of the source
GOIV 1/28 (2006.01 ) wavefield and an up -going component of the receiver wave
(52 ) U.S. Ci. field for each window in the plurality of windows and at a
CPC GOIV 1/36 (2013.01); GOIV 1/282 particular value of time, calculating a down - going compo
(2013.01 ); GOIV 1/32 (2013.01); GOIV nent of the source wavefield at the particular value of time
2210/44 (2013.01); GOLV 2210/48 (2013.01); by summing the down -going component of the source
GOIV 2210/679 ( 2013.01 ) wavefield in each window of the plurality of windows, and
(58 ) Field of Classification Search calculating an up -going component of the receiver wavefield
CPC .... GO1V 1/36 ; GOIV 1 /366-368 ; GOIV 1/32; at the particular value of time by summing the up - going
GO1V 1/325 ; GOIV 1/282 ; GOIV component of the receiver wavefield in each window of the
2210/679; GO1V 2210/48; GOLV plurality of windows.
2210/44 ; GOIV 2210/40
See application file for complete search history . 16 Claims, 5 Drawing Sheets
100

Divide vuitunc ota uveocid into oxizple overlappog winds. Wadut a wodicom ,
the background velocity for RIM Smumately omgevous.

Fra auch wichw.da kuwai spatial Funier transion to $ (7,4;), S'li .t .Risti ),
arid '( ,t:), and a $ (7 .),STEP 7.1i ) and (h.t;), respectively
leke«up the it. >> port for: (k.r )und $ 8.4.).and
isht ou!ks < part for Rík,e ) and (2,1 ). That is :
{t ${ ?..:)0 ., K ,: 50
>0 8.6. ) SIR .t:AKSO
..>

RelE.Eja {PIRMO
0,4,30 O.K. > O

Cucine HS (5,0;)- bufir-(KE )-- is the avevey

sisice du Winc ,f ** + *** + kig is de posut ofibowenubberVector é
leser given a uniry in wwwia zerudinjis tie irarul
.

Calcutive sa- (k .21 ) = $_ (K,!:) + H3-(1.3), Roy- { , ;) = R (E11) + KR_ {k.T ).

lh:10 :3? tia! Fourier 23: 501: 1 , , ,} #: ... ). : ge: 5; +( x t },
R4-67.1,), respectively . Ao como -going avereid is sowice
S03,0 ) = 2450 + 47,1 ;)) * q - ving Ryti) - RefN-( 1,0; )).

SOD all tie visdon - lesalis of solar;) and R (1.4 ) vid ispering is oi eripuing area .
the goong 14 vidoxo - going zaretied source and on -going for reciver.
 US 10,571,586 B2
Page 2

( 56 ) References Cited

OTHER PUBLICATIONS
Fei et al., “ An Endemic Problem in Reverse - Time Migration ,” 84th
Annual InternationalMeeting, SEG , Expanded Abstracts, Published
in 2014 , pp . 3811-3815 .
Fei et al., “ Removing False Images in Reverse- Time Migration : the
Concept of De-Primary,” Geophysics, 80, No. 6 , Nov.-Dec . 2015,
pp . S237 -S244.
Fletcher, “ Suppressing Unwanted Internal Reflections in Prestack
Reverse - Time Migration ,” Geophysics, 71, No. 6 , Nov.-Dec . 2006 ,
pp . E79- E82.
Liu et al., “ An Effective Imaging Condition for Reverse - Time
Migration using Wavefield Decomposition ,” Geophysics, vol. 76 ,
No. 1, Jan. 2011, pp . S29 -S39 .
Liu et al., “ Reverse - Time Migration using One -Way Wavefield
Imaging Condition ,” 77th Annual InternationalMeeting , SEG Expanded
Abstracts, published in 2007 , pp . 2170-2174 .
Hu et al., “ Angle gathers from reverse time migration using analytic
wavefield propagation and decomposition in the time domain ,"
Geophysics vol. 81, No. 1, Jan. 1, 2016 , 9 pages.
Kim et al., “ 3D Least- Squares Reverse Time Migration Using
Wavefield Decomposition via Hilbert transform ,” 79th EAGE Con
ference & Exhibition , Jun . 12 , 2017, 5 pages .
International Search Report and Written Opinion issued in Interna
tional Application No. PCT/US2018 /049834 dated Dec. 20 , 2018 ,
17 pages.
* cited by examiner
U.S. Patent Feb. 25 , 2020 Sheet 1 of 5 US 10,571,586 B2

1007
Divide volume of a wavefield into multiple overlapping windows. Within a window ,
the background velocity for RTM is approximately homogenous ,

For each window .do local spatial Fourier transform to $ (x ,t ) . S '(Ft;), R ( 7.ti ),
and R'(& tj). and get $ (k , ti ). S'(k.t;). R (k.tz ), and R (k ,ti),respectively.
Take out theky >> O part for $ (k ,t;) and S (K,tj),and
take out k , < part for å (k ,t?) and ? (k.t;). That is :
$ (k , ti ).kz > 0
Sock,ti)= {$(6,41 0.ky 50
$'(k,t ),ky > 0
$\.(8.4) --{$( ,
Ru(E,tr)= {R(E,t) in < 0 Z R_(k,te)= {RP((Ret;0),,Kk ,, 20<
Calculate # 5 : (K ,t1) and HR- (k.ti ) is the average velocity
inside the window , A = k + k + k? is the norm of the wavenumbur vector, é is
a user given small quantity to avoid zero divisor and ; is the inaginary unit .

Calculate Šp + (k.t? ) = $4 (T.t ) + HS (T ,t;), Ry- (k.t? ) R- (k ,t?) + HR- (k .t;).

Do inverse spatial Fourier transform to (ket;), R :-(k , ti ), and get 55+(1.t ).

RO ( 4.t ;) , respectively . And down -going wavefield for source
5p (1.t ;) = Re( So + (1.t :) ) while up-going Ro ( 8,ti) = Re (Ri- (7,t;)).
Sum all the window -results of SpOf , tj) and Ryti) with tapering in overlapping area ,
thus getting the whole down- goig wavefield for source and up -going for receiver.

FIG . 1
U.S. Patent Feb. 25 , 2020 Sheet 2 of 5 US 10,571,586 B2

2007

205
when

Get theSCE,t), s'CF,t),RCE,ta),Iand '(E,t)by forward modelings?

Calculate Sa , tj ) and R , (X , ti) as shown in FIG . 1 215

No Idu ( 7) = lau ( x ) + Sq ( X, ti) Ruti) 5 220

tan mer

152
5 225

te >> Tmax ? $ 230

Output lau ( 8 )
15 235

FIG . 2
U.S. Patent Feb. 25 , 2020 Sheet 3 of 5 US 10,571,586 B2

305

310

FIG . 3
2,
U.S. Patent Feb. 25 , 2020 Sheet 4 of 5 US 10,571,586 B2

4002 S 405
Divide volume of source and receiver wavefields into a plurality ofwindows

For each window in the plurality of windows and at a particular value of ime
Calculate a positive component of Fourier transformation of the source wavefield , and
calculate a negative componentofFourier transformation ofthe receiver wavefield

Calculate Hilberttransformation of the positive component of the Fourier

transformation of the source wavefield , and calculate Hilbert transformation of the
negative component of the Fourier transformation of the receiver wavefield

Calculate a down -going component of the source wavefield in the particularwindow as

a real component ofinverse Fourier transformation of a sum ofthe positive component 420
of the Fourier transformation of the source wavefield and the Hilbert transformation of
the positive component of the Fourier transformation of the source wavefield

Calculate an up - going component ofthe receiverwavefield in the particular window as

a real component of inverse Fourier transformation ofa sum of the negative 425
component of the Fourier transformation of the receiverwavefield and the Hilbert
transformation of the negative component of the Fourier transfomation of the receiver
wavefield

Calculate a down-going component ofthe source wavefield at the particular value oftime by
summing the down - going componentof the source wavefield in each window of the plurality 5 430
ofwindows, and calculate an up -going componentofthe receiver wavefield at the particular
value oftime by summing the up-going component ofthe receiverwavefield in each window
of the plurality ofwindows

FIG .
U.S. Patent Feb. 25 , 2020 Sheet 5 of 5 US 10,571,586 B2

5002
Network 530

Interface
503
OROKOK

Processor

Memory Database
Oooooor

Application Seismic Data 516

w

Wavefields 518
VVV Time-derivative of
Wavefields 520
Service Layer Down- going and Up
going Wavefields 522

Computer 502

FIG . 5
 US 10,571,586 B2
1 2
FALSE IMAGE REMOVAL IN REVERSE A first aspect, combinable with the general implementa
TIME MIGRATION tion , comprising , calculating a positive component of Fou
rier transformation of time-derivative of the source wave
TECHNICAL FIELD field and calculating a negative component of Fourier
5 transformation of time- derivative of the receiver wavefield .
This disclosure relates to seismic data processing and , A second aspect, combinable with any of the previous
more specifically , to false image removal in reverse time aspects , wherein the plurality of windows is a plurality of
migration . overlapping windows.
A third aspect, combinable with any of the previous
BACKGROUND aspects, wherein summing the down- going component of
10
the source wavefield and summing the up - going component
High resolution depth images of earth subsurface layers of the receiver wavefield in each window comprises sum
are important for reservoir exploration , delineation , and ming the down -going component of the source wavefield
development. Wave equation based seismic depth migration and summing the up - going component of the receiver wave
techniques, such as reverse time migration (RTM ), are 15 field in each window with tapering in overlapping area .
suitable techniques for seismic depth imaging in the oil aspectsA fourth aspect, combinable with any of the previous
industry, especially in complex environments such as subsalt Fourier, transformation
wherein the Fourier transformation is 1D spatial
.
exploration . However, imaging noise exists in RTM due to
unwanted cross - correlation of source and receiver wave 20 aspects, comprising , calculating with
A fifth aspect , combinable
an
any of the previous
image term based on the
fields at nonreflecting points along a raypath . down -going component of the source wavefield and the
SUMMARY up- going component of the receiver wavefield at the par
ticular value of time.
The details of one or more implementations of the subject
The present
including disclosure
computer describesmethods
- implemented methods, computer
and systems
pro, 25 drawings
matter of this specification are set forth in the accompanying
gram products , and computer systems for removing false and advantages and the description below . Other features, aspects,
of the subject matter will become apparent
image in reverse time migration (RTM ). One computer from the description , the drawings, and the claims.
implemented method includes dividing volume of a source
wavefield and a receiver wavefield into a plurality of win- 30 BRIEF DESCRIPTION OF THE DRAWINGS
dows, calculating a down- going component of the source
wavefield and an up -going component of the receiver wave FIG . 1 illustrates an example method for calculating a
field for each window in the plurality of windows and at a down-going component of a source wavefield and an up
particular value of time, the down- going component of the going component ofa receiver wavefield , according to some
source wavefield being a real component of inverse Fourier 35 implementations.
transformation of a sum of a positive component of Fourier FIG . 2 illustrates an example method for calculating an
transformation of the source wavefield and Hilbert transfor image based on a down -going component of a source
mation of the positive component of the Fourier transfor wavefield and an up - going component of a receiver wave
mation of the source wavefield , the up - going component of field , according to some implementations.
the receiver wavefield being a real component of inverse 40 FIG . 3 illustrates example images before and after remov
Fourier transformation of a sum of a negative component of ing false image in reverse time migration (RTM ), according
Fourier transformation of the receiver wavefield and Hilbert to some implementations.
transformation of the negative component of the Fourier FIG . 4 is a flowchart illustrating an example method for
transformation of the receiver wavefield , calculating a calculating a down- going component of a source wavefield
down-going component of the source wavefield at the par- 45 and an up -going component of a receiverwavefield, accord
ticular value of time by summing the down -going compo ing to some implementations.
nent of the source wavefield in each window of the plurality FIG . 5 is a block diagram illustrating an example com
of windows, and calculating an up- going component of the puter system used to provide computational functionalities
receiver wavefield at the particular value of time by sum associated with described algorithms, methods, functions ,
ming the up -going component of the receiver wavefield in 50 processes, flows, and procedures as described in the instant
each window of the plurality of windows. disclosure, according to some implementations .
Other implementations of this aspect include correspond Like reference numbers and designations in the various
ing computer systems, apparatuses , and computer programs drawings indicate like elements.
recorded on one or more computer storage devices, each
configured to perform the actions of the methods. A system 55 DETAILED DESCRIPTION
of one or more computers can be configured to perform
particular operations or actions by virtue of having software , The following detailed description describes removing
firmware , hardware , or a combination of software , firmware , false image introduced by reverse time migration (RTM )
or hardware installed on the system that in operation causes image condition applied on source and receiver wavefields
the system to perform the actions. One or more computer 60
programs can be configured to perform particular operations
with erroneous propagation direction combinations and is
presented to enable a person skilled in the art to make and
or actions by virtue of including instructions that, when use the disclosed subjectmatter in the contextof one or more
executed by data processing apparatus, cause the apparatus particular implementations . Various modifications, altera
to perform the actions. tions, and permutations of the disclosed implementations
The foregoing and other implementations can each , 65 can be made and will be readily apparent to those skilled in
optionally , include one or more of the following features , the art , and the general principles defined may be applied to
alone or in combination : other implementations and applications without departing
 US 10,571,586 B2
3 4
from the scope of the disclosure. Thus, the present disclosure to the ?( k . ),where o denotes frequency and k = k ,k , k )
is not intended to be limited to the described or illustrated denotes a wavenumber vector. The down -going component
implementations, but is to be accorded the widest scope in (kw ) domain is the part with ok >0 , while the up - going
consistent with the principles and features disclosed .
High resolution depth images of earth subsurface layers 5 component in (kw ) domain is the part with wk_<0 .How
are important for successful reservoir exploration , delinea ever, in practical implementation of RTM , the wavefield is
tion , and development. Wave equation based seismic depth typically calculated by the finite -difference method , and due
migration techniques, such as RTM , are suitable techniques to the large data amount, only a few time-slices of the
for seismic depth imaging in the oil industry , especially in wavefield can be stored . Therefore, Fourier transform of the
complex environments such as subsalt exploration . How- 10 wavefield from time t to frequency w , or Hilbert transform
ever, imaging noise exists in RTM due to unwanted cross to pick the positive /negative w part cannot be performed .
correlation of source and receiver wavefields , at nonreflect At a high level, the described approach provides an
ing points along a raypath . approximation method to split a wavefield into down- going
In RTM , the image IX ) is obtained by applying a and up -going components. The described approximation
conventional image condition : 15 method splits a wavefield into down-going and up -going
components with , for example, only the knowledge of the
1(A ) Tmavs (7,7R (2,1)dt (1) current time-slice and the current time-derivative slice of the
wavefield . The current time- slice and the current time
where S (x ,t) is a source wavefield, R (x ,t) is a receiver derivative slice of the wavefield can be acquired from the
wavefield , x = (x,y,z ) represents a position vector, and t 20 finite -difference forward modeling of the wavefield in RTM .
represents time and ranges between 0 and Tmax (e.g. , the Based on this splitting, the image Idulx ) can be calculated
maximum recording time).In general, the image I( X ) can be and the false image produced by wrong component combi
decomposed , according to Liu et al., 2007, into four com nations (e.g., Idd X ), Iu ( x ), Iud( X )) can be eliminated from
ponents :
25 I( x ) to enhance the final image ofRTM . As a result, the final
I(* )=Idu(* )+ Idd )+ Imu(m )+ Iud * ) ( 2 ) image of RMT can be used , for example, to better estimate
where Idu is the cross correlation of the down -going source ration properties of earth subsurface layers for oil and gas explo
.
and up -going receiver wavefields, Ida is the cross correlation FIG . 1 illustrates an example method 100 for calculating
offieldsthe, Iuudown -going
is the crosssource and down
correlation of the-going receiver
up - going sourcewave
and 30 up a down-going component of a source wavefield and an
up -going receiver wavefields, and Iud is the cross correlation some -going component of a receiver wavefield, according to
of the up -going source and down -going receiver wavefields. implementations . For example , based on RTM forward
In addition , the four components are expressed as : modeling, a time-slice of the source wavefield S ( x ,t), atttig
35 is S( x ,t;), and a time-slice of the receiver wavefield R (x ,t),
laul * )=6.7ImerSax ,t)R , (* ,t)dt (3)
at t =t ;, is R ( x ,t :) . In addition , a time-derivative slice of the
Idx ) =lTmars . ) , t)dt (4 ) source wavefield S ( x ,t) and a time- derivative slice of the
luula )= . Tmers, (5,1 )R ( ,t)dt (5 ) 40
receiver wavefield R (x ,t), at t=t ;, can be obtained as:
Iud(x )=S.Tmars ( 1,1) R2( ,t)dt (6 )
S' , 1) = dS dt(x , t)
where S ( x ,t) and R ( X. ) are the down - going components
of the source and receiver wavefields, respectively , and Su (8 )
(x ,t) and R (X ,t)are theup -going components of the source
45
R ' (x , t;) dRX
dt
, 1)
and receiver wavefields, respectively.
The low -frequency imaging noises in RTM can be sup With a time-slice and a time-derivative slice of a wavefield ,
pressed by eliminating the Idd( x ) and Iud(x ) components the wavefield can be split into down-going and up -going
from the image I(X ). To calculate the remaining image Idu 50 components by the workflow shown in FIG . 1.
(X ) + Iudx ), a Hilbert transform may be applied to the As illustrated in FIG . 1, the example method 100 starts
wavefields along depth coordinate z , and the image integra with dividing the volume of a wavefield (e.g., the source
tion - combinations can be calculated afterwards. The Iudl x ) wavefield and/or the receiver wavefield ) into multiple over
component can also form a false image and needs to be 55 in a 3D space and. The
lapping windows window , for example, can be defined
provides a confined 3D sub -volume. In
eliminated . As a result , only the Idul x ) component is kept in each dimension in the 3D space , the window is half
the image I(x ) in order to remove false image in RTM . To overlapped
size can be ,
with an adjacentwindow . In general, the window
for example, one - tenth of its dimension size . In
keep the Idul x ) component only, at least one of the source the present disclosure , the velocity of media within a win
wavefield or receiver wavefield is split into down-going and 60 dow is assumed to be approximately homogeneous, and the
up -going components . Therefore , Hilbert transform previ dispersion relation of the wavefield for all wavenumber
ously described may not produce the image Idulx'). vector k is:
One way to split a wavefield into down- going and up
going components is to perform the split in a frequency 65 0 = + C KI= +Wk + 2+ kz? (9 )
wavenumber domain . For example , the source wavefield where V is the average velocity of media inside the window ,
S ( x ,t) can be transformed (e.g., via 2D Fourier transform ) and w is the circular frequency .
 US 10,571,586 B2
5 6
For each window in the multiple overlapping windows,
local spatial Fourier transform (e.g., 1D Fourier transform ) ( 18 )
is applied to the time- slice of the source wavefield ( i.e., AS R. ) S '.. )
VIKI+ )
+

S ( x ,t;)), the time-derivative slice of the source wavefield 5 ?

( i.e., S'(x ,t;)), the time-slice of the receiver wavefield (i.e., #fav=VvVR$+43+&£j?k,1;)-$+(w = -V VkZ+k +k?
R ( x ,t;)), and the time-derivative slice of the receiver wave HR . , :) RR, 1 ) (19)
field (i.e., R '( x ,t;)). The resulting Fourier transformations j(VIK | +8 )
are ? (K ,t;), 3 (k ,t;), ÔCK , ty ), and R ( K ,t;),respectively . The 10
k_> 0 parts for ?( k ,t;) and ( k ,t;), and the k_< 0 parts for
Â
fw=VW/A?+ +k?}(k,1;)–Â-(w = -V-Vk²V +k? +k ? (k, ti)
? (K ,t;), and R ( Kot;), can be obtained as:
15
where IKl=Vk,2+2,2+k ;? is the norm of the wavenumber
( 10 ) vector K , and ? is a user specified small number chosen to
? +[k, t:) ? ??k 0,,tìk),,k?so> 0 avoid dividing zero in the equations. For example, the value
of ? can be 0.0001 or smaller.
Sk,t ), k , > 0 (11) From Equations (14 ) and (18 ), the following ( i.e., the
Sk,t )= 20 component with k > 0 and w > 0 ) can be obtained :
0 , kz < 0
(12 )
Ê (k , ) = S ?íkO,, tjk ),,20
kz < 0 ?o+(k,t ) = $1(k,t:) + AS (k , t?) = 2? + (w = V ??k? +k } +k (k ,1 ) (20 )

(13) 25
R?_{k,t?)= {? (k ,tj), k? < 0
0,k, = 0
By the conjugate properties of Fourier transform , the down
going source wavefield for the particular window can be
obtained :
If K corresponds to , for example , only two circular 30 Sp (2,4 )= Re( IFFT ($ D :(2,1:))) (21)
frequencies, one positive and one negative as shown in where IFFT( ) is the inverse spatial Fourier transform from
Equation (9 ), ? ( K , to ), in Equation (10 ) can be decomposed k Similarly
to x , and, Re ( ) is a function that returns real part.
into two terms as: from Equations ( 16 ) and (19 ), the following
35
( i.e. , the component with k <0 and a < 0 ) can be obtained :
?+ [k, ti ) = tw= V ?k +k +k } (k ,t;) + + w =-V k?+k%+k (14)
Ru -l , t;) = R - R, 1 ) + HR_R,1 ) = 2 "fw-V/23-43.4?)(2,1) (22)

Based on the property of the Fourier transform , the follow 40

ing can be obtained : By the conjugate properties of Fourier transform , the up
going receiver wavefield for the particular window can be
obtained :
(15 )
S.?k ,t;) = jv Vkx + k} + k? Rult",t;)= Re( IFFT(Rv_ (k ,t;))) (23)
(farumv lizda3-5yl?,iv)-$+(w =-v v k 3 + 3 +k? (k,1:)) 45
To obtain the whole down-going source wavefield
Sdx ,t;), all the window results of S ( x ,t;) (e.g., calculated
via Equation (21 ) for every window in the multiple over
where j is an imaginary unit. Similarly , ?_ (K ,t;) in Equation lapping windows) are summed . Similarly , to obtain the
( 12 ) can also be decomposed into two terms as: 50
whole up -going receiver wavefield R (x ,t ), all the window
results of RAX,t ) (e.g., calculated via Equation (23 ) for
² (k , t )= R\-(w=V { k} +k} +k } (k , t ) + P-fev=-VJ23 ( 16 ) every window in the multiple overlapping windows) are
V + 3+k?y?k ,t;) summed . As discussed above , FIG . 1 provides an approxi
55 mation method of calculating a down- going component of a
Based on the property of the Fourier transform , the follow wavefield source wavefield and an up - going component of a receiver
ing can be obtained : . As shown in Equations (18 to 20 ) and (22 ), the
key in splitting a wavefield with only a time slice of the
wavefield and a time-derivative slice of the wavefield is to
( 17 ) 60 select the w > 0 and /or w < 0 component without, in some
RR,1 )= jv./k ? + K3 + k? implementations, using Fourier transform in the time
domain .
( Â -( w=V { k} +k +k } (k , t ) – -w = -V V k? +k%+k? ) ik , FIG . 2 illustrates an example method 200 for calculating
an image based on a down -going component of a source
65 wavefield and an up -going component of a receiver wave
From Equations ( 15 ) and ( 17 ), the Hilbert transformations field , according to some implementations. For example , the
of ? .(K ,t ) and Ê_ (k ,t ) can be derived approximately as: example method 200 starts at block 205 where i and the
 US 10,571,586 B2
7 8
image IdulX ) are both initialized to 0. At block 210, time At block 415 , Hilbert transformation of the positive
slices of source and receiver wavefields at time ty are component of the Fourier transformation of the source
obtained from the source and receiver wavefields (i.e., wavefield and Hilbert transformation of the negative com
ponent of the Fourier transformation of the receiver wave
S ( x ,t) and R ( x ,t)). In addition , time-derivative slices of the 5 field are calculated . In some implementations, the Hilbert
source and receiver wavefields at time t; are also obtained transformation of the positive component of the Fourier
( e.g., via Equations (7 ) and ( 8 )). At block 215 , the whole transformation of the source wavefield is calculated based
down-going source wavefield ( i.e., Sax ,t;)) and the whole on a positive component of Fourier transformation of time
derivative of the source wavefield ( e.g., Equation (18 )). In
up-goingthereceiver
using wavefieldmethod
approximation (i.e., R ,described
(x ,t;))caninbeFIGcalculated
. 1. At 10 negative
some implementations , the Hilbert transformation of the
component of the Fourier transformation of the
block 220, S( x ,t)R ( x ,t) is added to the image Idulx ). At receiver wavefield is calculated based on a negative com
block 225 , i is increased by 1. At block 230 , it is determined ponent of Fourier transformation of time-derivative of the
whether t is greater than T, ??? * Tmax is , for example , the 15
receiver wavefield (e.g., Equation ( 19 )).
maximum recording time of the source and receiver wave At block 420 , a down- going component of the source
fields. Ift; is not greater than T , then the method proceeds
??? ? wavefield in the particular window (e.g., Sp ( x ,t;)) is calcu
to block 210. If t; is greater than T ,??? ? then the final image lated . In some implementations, a sum of the positive
Idul X ) is outputted at block 235. Although this disclosure component of the Fourier transformation of the source
refers to the method in FIG . 2 for purposes of example, the 20 wavefield and the Hilbert transformation of the positive
subject matter of this document can use other methods to component of the Fourier transformation of the source
wavefield is calculated first (e.g., Equation (20 )). Next,
calculate the image Idul X ) based on the down-going source inverse Fourier transformation is applied to the sum . Then ,
wavefield and up -going receiver wavefield calculated using the down - going component of the source wavefield in the
the approximation method described in FIG . 1 . 25 particular window is calculated as a real component of the
FIG . 3 illustrates example images 300 before and after inverse Fourier transformation of the sum (e.g., Equation
removing false image in reverse time migration (RTM ), (21 .
according to some implementations. In FIG . 3 , the RTM At block 425 , an up -going component of the receiver
impulse response result 305 using the method proposed by wavefield in the particular window ( e.g. , Ru ( x ,t )) is cal
Liu et. al., 2007 is shown on the top . The result 305 shows 30 culated . In some implementations, a sum of the negative
migration noise (e.g., generated from Idal X ) and Iuu ( x )) and component of the Fourier transformation of the receiver
false image (e.g., generated from Iud (x )) pointed by three wavefield and the Hilbert transformation of the negative
component of the Fourier transformation of the receiver
arrows. The result 310 using the described approximation wavefield is calculated first (e.g., Equation (22)). Next,
method is shown on the bottom of FIG . 3. The result 310 35 inverse Fourier transformation is applied to the sum . Then ,
shows the removal of the migration noise and the false the up -going component of the receiver wavefield in the
image. particular window is calculated as a real component of the
FIG . 4 is a flowchart illustrating an example method 400 inverse Fourier transformation of the sum (e.g., Equation
for calculating a down- going component of a source wave (23 ) ) .
field and an up -going component of a receiver wavefield , 40 At block 430 , a down- going component of the source
according to some implementations. For clarity of presen wavefield and an up - going component of the receiver wave
tation , the description that follows generally describes field at the particular value of time (e.g., SAX,t;) and
method 400 in the context of the other figures in this R ,( x , )) are calculated. The down -going component of the
description . For example , method 400 can be performed by source wavefield at the particular value of time is calculated
a computer system described in FIG . 5. However, it will be 45 by summing the down -going component of the source
understood thatmethod 400 may be performed , for example ,
by any suitable system , environment, software , and hard wavefield ( e.g., calculated in Equation (21 )) in each window
of the multiple windows. The up -going component of the
ware, or a combination of systems, environments, software, receiver
and hardware, as appropriate . In some implementations , lated by wavefield at the particular value of time is calcu
various steps of method 400 can be run in parallel , in 50 wavefieldsumming the up -going component of the receiver
(e.g., calculated in Equation ( 23 )) in each window
combination , in loops , or in any order. of the multiple windows. In some implementations, the
The method 400 starts at block 405 where volume of a
source wavefield and a receiver wavefield is divided into window down - going component of the source wavefield in each
multiple windows. In some implementations, the multiple the overlapping of the multiple windows is summed with tapering in
windows are multiple overlapping windows. For each win- 55 component of theareareceiver . In some implementations, the up - going
wavefield in each window of the
dow in the multiple windows and at a particular value of multiple windows is summed with tapering in the overlap
time (e.g. , t; between 0 and Tmax ), the following operations ping area .
( i.e., block 410 to block 425 ) are performed.
At block 410 , a positive component of Fourier transfor fiedTheor example method 400 shown in FIG . 4 can be modi
reconfigured to include additional , fewer, or different
mation of the source wavefield (e.g., Equation ( 10 )) and a 60
negative component of Fourier transformation of the steps (not shown in FIG . 4 ), which can be performed in the
receiver wavefield ( e.g., Equation (12 )) are calculated . In order shown or in a different order. For example , after block
some implementations, the Fourier transformation is 1D 430, an image ( e.g., Idul X )) can be calculated based on the
spatial Fourier transformation not performed in the time down- going component of the source wavefield and the
domain . In some implementations, the positive component 65 up -going component of the receiver wavefield at the par
is the part where k_ > 0 and the negative component is the part ticular value of time. In some implementations, one or more
where k_ < 0 . of the steps shown in FIG . 4 can be repeated or iterated , for
 US 10,571,586 B2
9 10
example , until a terminating condition is reached. In some services to the computer 502 or other components (whether
implementations, one or more of the individual steps shown or not illustrated ) that are communicably coupled to the
in FIG . 4 can be executed as multiple separate steps, or one computer 502. The functionality of the computer 502 may be
or more subsets of the steps shown in FIG . 4 can be accessible for all service consumers using this service layer.
combined and executed as a single step . In some implemen- 5 Software services, such as those provided by the service
tations, one or more of the individual steps shown in FIG . 4 layer 513 , provide reusable , defined functionalities through
may also be omitted from the example method 400 . a defined interface. For example, the interface may be
FIG . 5 is a block diagram of an example computer system
500 used to provide computational functionalities associated providingwritten
software
data in
in JAVA , C ++ , or other suitable language
extensible markup language (XML) format
with described algorithms, methods, functions, processes, 10 or other suitable format. While
flows, and procedures as described in the instant disclosure , component of the computer 502illustrated as an integrated
according to an implementation . The illustrated computer tions may illustrate the API 512 or the service implementa
, alternative
layer 513 as
502 is intended to encompass any computing device such as stand -alone components in relation to other components
a server , desktop computer, laptop /notebook computer ,wire the computer 502 or other components (whether or notof
less data port, smart phone , personal data assistant (PDA ), 15
tablet computing device , one or more processors within illustrated ) that are communicably coupled to the computer
these devices, or any other suitable processing device , 502.Moreover, any or all parts of the API 512 or the service
including physical or virtual instances (or both ) of the layer 513 may be implemented as child or sub-modules of
computing device. Additionally, the computer 502 may another software module, enterprise application , or hard
comprise a computer that includes an input device, such as 20 ware module, without departing from the scope of this
a keypad, keyboard , touch screen , or other device that can disclosure .
accept user information , and an output device that conveys The computer 502 includes an interface 504. Although
information associated with the operation of the computer illustrated as a single interface 504 in FIG . 5 , two or more
502, including digital data, visual, or audio information (or interfaces 504 may be used according to particular needs,
a combination of information ), or a graphical user interface 25 desires, or particular implementations of the computer 502 .
(GUI). The interface 504 is used by the computer 502 for commu
The computer 502 can serve in a role as a client, network nicating with other systems that are connected to the net
component, a server, a database or other persistency, or any work 530 (whether illustrated or not ) in a distributed envi
other component (or a combination of roles ) of a computer ronment. Generally, the interface 504 comprises logic
system for performing the subject matter described in the 30 encoded in software or hardware (or a combination of
instant disclosure . The illustrated computer 502 is commu software and hardware ) and is operable to communicate
nicably coupled with a network 530. In some implementa with the network 530. More specifically, the interface 504
tions, one ormore components of the computer 502 may be may comprise software supporting one or more communi
configured to operate within environments, including cloud cation protocols associated with communications such that
computing -based , local, global, or other environment (or a 35 the network 530 or interface's hardware is operable to
combination of environments). communicate physical signals within and outside of the
At a high level, the computer 502 is an electronic com illustrated computer 502 .
puting device operable to receive, transmit ,process, store , or The computer 502 includes a processor 505. Although
manage data and information associated with the described illustrated as a single processor 505 in FIG . 5 , two or more
subject matter. According to some implementations, the 40 processors may be used according to particular needs,
computer 502 may also include or be communicably desires , or particular implementations of the computer 502 .
coupled with an application server, e -mail server , web Generally, the processor 505 executes instructions and
server, caching server, streaming data server, or other server manipulates data to perform the operations of the computer
( or a combination of servers). 502 and any algorithms, methods, functions, processes,
The computer 502 can receive requests over network 530 45 flows, and procedures as described in the instant disclosure .
from a client application (for example , executing on another The computer 502 also includes a database 506 that can
computer) and respond to the received requests by process hold data for the computer 502 or other components ( or a
ing the received requests using the appropriate software combination of both ) that can be connected to the network
application (s). In addition , requests may also be sent to the 530 (whether illustrated or not). For example, database 506
computer 502 from internal users (for example , from a 50 can be an in -memory, conventional, or other type ofdatabase
command console or by other appropriate access method ), storing data consistent with this disclosure. In some imple
external or third -parties , other automated applications, as mentations , database 506 can be a combination of two or
well as any other appropriate entities, individuals , systems, more different database types (for example , a hybrid in
or computers . memory and conventional database ) according to particular
Each of the components of the computer 502 can com- 55 needs, desires, or particular implementations of the com
municate using a system bus 503. In some implementations, puter 502 and the described functionality . Although illus
any or all of the components of the computer 502 , both trated as a single database 506 in FIG . 5 , two or more
hardware or software (or a combination of hardware and databases (of the same or combination of types) can be used
software ),may interface with each other or the interface 504 according to particular needs, desires, or particular imple
(or a combination of both ) over the system bus 503 using an 60 mentations of the computer 502 and the described function
application programming interface ( API) 512 or a service ality . While database 506 is illustrated as an integral com
layer 513 (or a combination of the API 512 and service layer ponent of the computer 502, in alternative implementations,
513). The API 512 may include specifications for routines, database 506 can be external to the computer 502. As
data structures , and object classes. The API 512 may be illustrated , the database 506 holds seismic data 516 , source
either computer-language independent or dependent and 65 and receiver wavefields 518, time-derivative slices of the
may refer to a complete interface, a single function , or even source and receiver wavefields 520 , and down- going source
a set of APIs. The service layer 513 provides software and up -going receiver wavefields 522 .
 US 10,571,586 B2
11 12
The computer 502 also includes a memory 507 that can sors or computers . The apparatus can also be , or further
hold data for the computer 502 or other components (or a include, special purpose logic circuitry , for example , a
combination of both ) that can be connected to the network central processing unit ( CPU ), an FPGA (field program
530 (whether illustrated or not). For example , memory 507 mable gate array ), or an ASIC (application -specific inte
can be random access memory (RAM ), read -only memory 5 grated circuit ). In some implementations, the data process
(ROM ), optical , magnetic, and the like, storing data consis ing apparatus or special purpose logic circuitry (or a
tentwith this disclosure . In some implementations , memory combination of the data processing apparatus or special
507 can be a combination of two or more different types of purpose logic circuitry )may be hardware- or software -based
memory ( for example, a combination of RAM and magnetic ( or a combination of both hardware- and software -based ).
storage ) according to particular needs, desires, or particular 10 The apparatus can optionally include code that creates an
implementations of the computer 502 and the described execution environment for computer programs, for example,
functionality. Although illustrated as a single memory 507 in code that constitutes processor firmware, a protocol stack , a
FIG . 5 , two or more memories 507 (of the same or a database management system , an operating system , or a
combination of types ) can be used according to particular combination of execution environments . The presentdisclo
needs, desires, or particular implementations of the com- 15 sure contemplates the use of data processing apparatuses
puter 502 and the described functionality . While memory with or without conventional operating systems, for example
507 is illustrated as an integral component of the computer LINUX, UNIX , WINDOWS,MAC OS , ANDROID , IOS, or
502, in alternative implementations, memory 507 can be any other suitable conventional operating system .
external to the computer 502 . A computer program , which may also be referred to or be
The application 508 is an algorithmic software engine 20 described as a program , software, a software application , a
providing functionality according to particular needs, module , a software module, a script, or code can be written
desires, or particular implementations of the computer 502 , in any form of programming language, including compiled
particularly with respect to functionality described in this or interpreted languages, or declarative or procedural lan
disclosure. For example , application 508 can serve as one or guages , and it can be deployed in any form , including as a
more components, modules, or applications. Further, 25 stand -alone program or as a module, component, subroutine,
although illustrated as a single application 508 , the appli or other unit suitable for use in a computing environment. A
cation 508 may be implemented as multiple applications 508 computer program may, but need not, correspond to a file in
on the computer 502. In addition , although illustrated as a file system . A program can be stored in a portion of a file
integral to the computer 502 , in alternative implementations, that holds other programs or data , for example , one or more
the application 508 can be external to the computer 502 . 30 scripts stored in a markup language document, in a single
There may be any number of computers 502 associated file dedicated to the program in question , or in multiple
with , or external to, a computer system containing computer coordinated files, for example, files that store one ormore
502 , each computer 502 communicating over network 530 . modules , sub -programs, or portions of code . A computer
Further, the term “ client” , “user" , and other appropriate program can be deployed to be executed on one computer or
terminology may be used interchangeably, as appropriate, 35 on multiple computers that are located at one site or dis
without departing from the scope of this disclosure .More tributed across multiple sites and interconnected by a com
over, this disclosure contemplates that many users may use munication network . While portions of the programs illus
one computer 502 , or that one user may use multiple trated in the various figures are shown as individualmodules
computers 502. that implement the various features and functionality
Implementations of the subject matter and the functional 40 through various objects, methods, or other processes, the
operations described in this specification can be imple programs may instead include a number of sub -modules ,
mented in digital electronic circuitry , in tangibly embodied third -party services , components, libraries, and such , as
computer software or firmware, in computer hardware , appropriate. Conversely , the features and functionality of
including the structures disclosed in this specification and various components can be combined into single compo
their structural equivalents , or in combinations of one or 45 nents , as appropriate . Thresholds used to make computa
more of them . Implementations of the subject matter tional determinations can be statically , dynamically , or both
described in this specification can be implemented as one or statically and dynamically determined .
more computer programs, that is , one or more modules of The methods, processes, or logic flows described in this
computer program instructions encoded on a tangible, non specification can be performed by one or more program
transitory, computer-readable computer -storage medium for 50 mable computers executing one or more computer programs
execution by, or to control the operation of data processing to perform functions by operating on input data and gener
apparatus. Alternatively, or additionally, the program ating output. The methods, processes, or logic flows can also
instructions can be encoded in /on an artificially generated be performed by, and apparatus can also be implemented as ,
propagated signal, for example , a machine- generated elec special purpose logic circuitry, for example, a CPU , an
trical, optical , or electromagnetic signal that is generated to 55 FPGA , or an ASIC .
encode information for transmission to suitable receiver Computers suitable for the execution of a computer
apparatus for execution by a data processing apparatus . The program can be based on general or special purpose micro
computer -storage medium can be a machine-readable stor processors, both , or any other kind of CPU . Generally , a
age device , a machine -readable storage substrate , a random CPU will receive instructions and data from a read -only
or serial access memory device, or a combination of com- 60 memory (ROM ) or a random access memory (RAM ), or
puter- storage mediums. both . The essential elements of a computer are a CPU , for
The terms “ data processing apparatus," " computer," or performing or executing instructions, and one or more
" electronic computer device” (or equivalent as understood memory devices for storing instructions and data. Generally,
by one of ordinary skill in the art) refer to data processing a computer will also include, or be operatively coupled to ,
hardware and encompass all kinds of apparatus , devices, and 65 receive data from or transfer data to , or both , one or more
machines for processing data , including by way of example , mass storage devices for storing data, for example , mag
a programmable processor, a computer, or multiple proces netic , magneto - optical disks , or optical disks . However, a
 US 10,571,586 B2
13 14
computer need not have such devices. Moreover , a computer component, for example , a client computer having a graphi
can be embedded in another device, for example, a mobile cal user interface or a Web browser through which a user can
telephone, a personal digital assistant ( PDA ), a mobile audio interact with an implementation of the subject matter
or video player , a game console , a global positioning system described in this specification , or any combination of one or
(GPS ) receiver, or a portable storage device , for example, a ui
more such back -end , middleware, or front-end components.
universal serial bus (USB ) flash drive, to name just a few . The components of the system can be interconnected by any
Computer-readable media ( transitory or non-transitory , as form or medium of wireline or wireless digital data com
appropriate ) suitable for storing computer program instruc
tions and data include all forms of non -volatile memory , munication (or a combination of data communication ), for
example , a communication network . Examples of commu
media and memory devices, including by way of example 10 nication networks include a local area network (LAN ), a
semiconductor memory devices, for example, erasable pro radio access network (RAN ), a metropolitan area network
grammable read -only memory (EPROM ), electrically eras MAN ), a wide area network (WAN ), Worldwide Interop
able programmable read -only memory (EEPROM ), and (erability for Microwave Access (WIMAX ), a wireless local
flash memory devices;magnetic disks, for example , internal area network (WLAN ) using , for example , 802.11 a/b / g/n or
hard disks or removable disks; magneto -optical disks; and 15 802.20 (or a combination of 802.11x and 802.20 , or other
CD -ROM , DVD +/- R , DVD -RAM , and DVD -ROM disks .
The memory may store various objects or data , including protocols consistent with this disclosure ), all or a portion of
caches, classes , frameworks, applications, backup data , jobs , the Internet, or any other communication system or systems
web pages,web page templates, database tables , repositories at one ormore locations (or a combination of communica
storing dynamic information , and any other appropriate 20 tion networks ). The network may communicate with , for
information including any parameters , variables, algorithms, example, Internet Protocol ( IP ) packets, Frame Relay
instructions, rules, constraints, or references thereto . Addi frames, Asynchronous Transfer Mode (ATM ) cells , voice ,
tionally, the memory may include any other appropriate video , data , or other suitable information a combination
data, such as logs, policies , security or access data , reporting of communication types ) between network addresses.
files, as well as others. The processor and the memory can 25 The computing system can include clients and servers. A
be supplemented by, or incorporated in , special purpose client and server are generally remote from each other and
logic circuitry . typically interact through a communication network . The
To provide for interaction with a user, implementations of relationship of client and server arises by virtue of computer
the subject matter described in this specification can be programsrunning on the respective computers and having a
implemented
example on a( cathode
, a CRT computerrayhaving
tube), aLCD
display(liquiddevicecrystal
, for 30 client-server relationship to each other.
display ), LED (Light Emitting Diode ), or plasma monitor, While this specification contains many specific imple
for displaying information to the user and a keyboard and a mentation details , these should not be construed as limita
pointing device, for example , a mouse, trackball, or trackpad tions on the scope of any invention or on the scope of what
by which the user can provide input to the computer. Input 35 may
may bebe specific
claimed,tobutparticular
rather asimplementations
descriptions of features that
of particular
may also be provided to the computer using a touchscreen , inventions. Certain features that are described in this speci
such as a tablet computer surface with pressure sensitivity ,fication in the context of separate implementations can also
a multi-touch screen using capacitive or electric sensing, or
be implemented , in combination, in a single implementation.
other type of touchscreen . Other kinds of devices can be
used to provide for interaction with a user as well; for 40 Conversely , various features that are described in the context
example , feedback provided to the user can be any form of of a single implementation can also be implemented in
sensory feedback , for example , visual feedback , auditory multiple implementations , separately, or in any suitable
feedback , or tactile feedback ; and input from the user can be sub - combination . Moreover, although previously -described
received in any form , including acoustic , speech , or tactile features may be described as acting in certain combinations
input. In addition , a computer can interact with a user by 45 and even initially claimed as such , one ormore features from
sending documents to and receiving documents from a a claimed combination can , in some cases, be excised from
device that is used by the user; for example, by sending web the combination , and the claimed combination may be
pages to web browser on a user's client device in response directed to a sub - combination or variation of a sub - combi
to requests received from the web browser . nation .
The term “ graphical user interface,” or “ GUI,” may be 50 Particular implementations of the subject matter have
used in the singular or the plural to describe one or more been described. Other implementations, alterations, and
graphical user interfaces and each of the displays of a permutations of the described implementations are within
particular graphical user interface. Therefore, a GUI may the scope of the following claims as will be apparent to those
represent any graphical user interface, including but not skilled in the art . While operations are depicted in the
limited to , a web browser, a touch screen , or a command line 55 drawings or claims in a particular order, this should not be
interface (CLI) that processes information and efficiently understood as requiring that such operations be performed in
presents the information results to the user. In general, a GUI the particular order shown or in sequential order, or that all
may include a plurality ofuser interface (UI) elements , some illustrated operations be performed ( some operations may be
or all associated with a web browser, such as interactive considered optional), to achieve desirable results . In certain
fields, pull-down lists , and buttons. These and other UI 60 circumstances, multitasking or parallel processing (or a
elements may be related to or represent the functions of the combination ofmultitasking and parallel processing ) may be
web browser. advantageous and performed as deemed appropriate .
Implementations of the subject matter described in this Moreover , the separation or integration of various system
specification can be implemented in a computing system that modules and components in the previously -described imple
includes a back -end component, for example , as a data 65 mentations should not be understood as requiring such
server, or that includes a middleware component, for separation or integration in all implementations, and it
example , an application server, or that includes a front- end should be understood that the described program compo
 US 10,571,586 B2
15
nents and systems can generally be integrated together in a
single software product or packaged into multiple software
products .
Accordingly , the previously -described example imple
mentations do not define or constrain this disclosure . Other 5
changes, substitutions, and alterations are also possible
without departing from the spirit and scope of this disclo
sure .
Furthermore, any claimed implementation is considered
to be applicable to at least a computer-implemented method ;
a non -transitory, computer-readable medium storing com
puter-readable instructions to perform the computer- imple
mented method; and a computer system comprising a com
puter memory interoperably coupled with a hardware
processor configured to perform the computer- implemented
method or the instructions stored on the non- transitory ,
computer -readable medium .
REFERENCES
Faqi Liu , Guanquan Zhang, Scott A.Morton and Jacques P.
Leveille, 2011, An effective imaging condition for
reverse -time migration using wavefield decomposition :
Geophysics, vol. 76 , no . 1, S29S39 . 25
Faqi Liu , Guanquan Zhang, Scott A. Morton , Jacques P.
Leveille , 2007 , Reverse-time migration using one-way
wavefield imaging condition: 77th Annual International
Meeting, SEG Expanded Abstracts .
Tong W. Fei, Yi Luo and Fuhao Qin , 2014 , An endemic 30
problem in reverse -time migration : 84th Annual Interna
tional Meeting, SEG Expanded Abstracts .
The invention claimed is :
1. A method comprising:
dividing, by one or more hardware processors, volume of
a source wavefield S( x , t) and a receiver wavefield
R ( x , t) into a plurality of windows, wherein X = (x , y,
z ) represents a position vector and t represents time;
for each window in the plurality of windows and at a
particular value of time tti:
calculating, by the one or more hardware processors ,
? ( K , t;), a positive component of Fourier transfor 45
mation of the source wavefield , wherein K = k , k ,,
k ) represents a wavenumber vector, wherein
-{$s[8,0k0,,kzti).,sok:>0,
SL( , tz)
and wherein ? ( k , t?) is the Fourier transformation of the 55
source wavefield ;
calculating, by the one or more hardware processors ,
S..(nt)={$ ,1),6:30
S'k , ti ),kz > 0
0, k , = 0
a positive component of Fourier transformation of
time-derivative of the source wavefield ,wherein ?'(K , 65
t;) is the Fourier transformation of time-derivative of
the source wavefield :
16
calculating, by the one or more hardware processors,
HS . (k , ty ), Hilbert transformation of the positive
component of the Fourier transformation of the
source wavefield ;
calculating , by the one or more hardware processors ,
Sp ( x , t;), a down -going component of the source
wavefield in the particular window as a real compo
10
nent of inverse Fourier transformation of a sum of
the ? .( k , t ) and the HS .( k , t:) ;
calculating, by the one or more hardware processors,
?_ (K ,t;),a negative component of Fourier transfor
15 mation of the receiver wavefield , wherein
20
R_B.1.)= {R (k, tj),kz < 0
0 , k? > 0
and wherein Ê ( k , t;) is the Fourier transformation of
the receiver wavefield ;
calculating , b the one or more hardware processors ,
= R'k ,t ),kz < 0
0 , k , 20
a negative component of Fourier transformation of
time- derivative of the receiver wavefield , wherein
Ñ '(K , t?) is the Fourier transformation of time-deriva
tive of the receiver wavefield :
35
calculating , by the one or more hardware processors,
HK_ ( K , t:) , Hilbert transformation of the negative
component of the Fourier transformation of the
receiver wavefield ; and
40 calculating , by the one or more hardware processors,
Rulx , t;), an up -going component of the receiver
wavefield in the particular window as a real compo
nent of inverse Fourier transformation of a sum of
the R_ (K , t ) and the R_ ( K , t );
calculating , by the one or more hardware processors,
Salâ , t? ), a down-going component of the source
wavefield at the particular value of time by summing
the down -going component of the source wavefield
in each window of the plurality of windows;
50
calculating , by the one or more hardware processors,
Ry( , tz), an up -going component of the receiver
wavefield at the particular value of timeby summing
the up -going component of the receiverwavefield in
each window of the plurality ofwindows; and
generating, by the one or more hardware processors, an
image based on the calculated Sdx , t ) and R , (x , t;)
to remove false image in reverse time migration
(RTM ).
60
2. The method of claim 1 , wherein
ASK, 1) = +
and AR_ (k, t;)
VIKI + 8) (VIK | +8 )
 US 10,571,586 B2
17
and wherein V is an average velocity in the particular
window , IK1= VK22 + ,2+k ?norm of the wavenumber vector,
? is a user specified number, and j is an imaginary unit.
3. The method of claim 2 ,wherein Sp ( x , t:)=Re(IFFT(+ 5 +
(§ (k , t;)+ HS ( k ,t;))) and Rux , t )=Re(IFFT Ê_ (K , t;)+
+
HR_ ( K , t.))).
4. The method of claim 1, wherein the plurality of
windows is a plurality of overlapping windows.
5. The method of claim 4 , wherein summing the down
going component of the source wavefield and summing the
up -going component of the receiver wavefield in each
window comprises summing S ( x , t ) and R ( x , t ) in each 15
window w with tapering in overlapping area .
6. The method of claim 1 , wherein the Fourier transfor
mation is 1D spatial Fourier transformation .
7. The method of claim 1 , further comprising :
calculating an image term Idul x ) based on the Sdx , t )
and the R ( x , t ).
8. A device comprising:
a memory ; and
one or more hardware processors that are arranged to 25
perform operations including:
dividing volume of a source wavefield S ( x , t) and a
receiver wavefield R (x , t) into a plurality of win
dows, wherein X = (x, y , z) represents a position 30
vector and t represents time;
for each window in the plurality of windows and at a
particular value of time t=t ;:
calculating $ .( k , t ), a positive component of Fou- 35
rier transformation of the source wavefield ,
wherein K = {k , k ,, k?) represents a wavenumber
vector, wherein
5,foto)={SR.4),k>0
0 , kz 50
andwherein ? (K , t;) is the Fourier transformation of
the source wavefield ;
calculating
$ 2.v)={5&.1,k:>0
0 , k , so
a positive component of Fourier transformation of 55
time- derivative of the source wavefield , wherein
$'( K ,t,) is the Fourier transformation of time-deriva unit.
tive of the source wavefield :
calculating HR (K , t;), Hilbert transformation of the 60
positive component of the Fourier transformation (S. (K , t:)+ HS ( K ,t;))) and Ru(x , t;)=Re(IFFT?_(K , t;) +
of the source wavefield ;
calculating Sp ( x , t;), a down-going component of
the source wavefield in the particular window as a windows is a plurality of overlapping windows.
real component of inverse Fourier transformation 65 12. The device of claim 11 , wherein summing the down
of a sum of the ? .(K , t;) and the AS .(K , t;);
18
calculating Ê (K , ty ), a negative component of Fou
rier transformation of the receiver wavefield ,
wherein
RR, 1 ) = RR0 ,,k1 ,),20
K; < 0
10
andwherein  ( k , t?) is the Fourier transformation of
the receiver wavefield ;
calculating
RY_P,)={R}(81),k:<0 0 , k_20
20 a negative component of Fourier transformation of
time- derivative of the receiver wavefield , wherein
? '(K ,t;) is the Fourier transformation of time-deriva
tive of the receiver wavefield :
calculating HR_ ( K , t:), Hilbert transformation of the
negative component of the Fourier transformation
of the receiver wavefield ; and
calculating Rux, t;), an up -going component of the
receiver wavefield in the particular window as a
real component of inverse Fourier transformation
of a sum of the Ê_ (k , t ) and the Hk_( k , tz);
calculating Sdx , t;), a down-going component of the
source wavefield at the particular value of time by
summing the down- going component of the source
wavefield in each window of the plurality of win
dows;
calculating R , (x , t ), an up -going component of the
receiver wavefield at the particular value of time by
40 summing the up - going component of the receiver
wavefield in each window of the plurality of win
dows; and
generating an image based on the calculated Sax , t;)
45 and R , ( x , t;) to remove false image in reverse time
migration (RTM ).
9. The device of claim 8 , wherein
and R_ (K, t;) = R_(k,t;)
50
AS (k ,1 ) = +
i(V |K | + E) j(V 1K | + €)
and wherein V is an average velocity in the particular
window , Ikl=VkZ2 +k,2+k_2 is norm of the wavenumber
vector, E is a user specified number , and j is an imaginary
10. The device of claim 9, wherein S ( x , t;)=Re(IFFT
HR_( K , t;))).
11. The device of claim 8 , wherein the plurality of
going component of the source wavefield and summing the
up -going component of the receiver wavefield in each
 US 10,571,586 B2
19 20
window comprises summing Sp ( x , t) and R , ( x ,t ) in each component of inverse Fourier transformation of a
window w with tapering in overlapping area . sum of the S.(k , t ) and the HS .(K , tj);
13. The device of claim 8 , wherein the Fourier transfor
mation is 1D spatial Fourier transformation . calculating (K , t ), a negative component of Fourier
14. The device of claim 8 , the operations further com 5 transformation of the receiver wavefield , wherein
prising :
calculating an image term Idu ( x ) based on theSX, t;)
and the R ( x , t;). RR, 1 ) = R'k0 ,,kt,),=k?0 < 0
15. A non - transitory computer-readable medium storing 10
instructions executable by a computer system to perform
operations comprising :
dividing volume of a source wavefield S( x , t) and a and wherein  ' k , t?) is the Fourier transformation of
the receiver wavefield ;
receiver wavefield R (x , t) into a plurality of windows, 15 calculating
wherein x =(x, y, z) represents a position vector and t
represents time;
for each window in the plurality of windows and at a
particular value of time tti: RO<CE,i)={R}(k,t)i,k:<0
O , kz 20
>

calculating ? (K , t;), a positive component of Fourier 20

transformation of the source wavefield , wherein a negative component of Fourier transformation of
K = (ky, k ,, k ) represents a wavenumber vector, time- derivative of the receiver wavefield , wherein
wherein Ñ '(K , t?) is the Fourier transformation of time-deriva
tive of the receiver wavefield ;
25
calculating HK_ (K , t:) , Hilbert transformation of the
Sk. ) = 5*[k0 ,, kz1),k< :0 >0. negative componentof the Fourier transformation of
the receiver wavefield ; and
30
calculating Rux , t ), an up -going component of the
and wherein ? (K , t;) is the Fourier transformation of receiver wavefield in the particular window as a real
component of inverse Fourier transformation of a
the source wavefield ;
calculating sum of the R_ (K , t:) and the HR _( K , tz);
calculating Sdx , t;), a down-going component of the
35 source wavefield at the particular value of time by
summing the down-going component of the source
$,(,1)={S}.1),k=>0
SK, ti), kz > 0
0 ,kz < 0 wavefield in each window of the plurality ofwindows;
calculating R (X , t;), an up -going component of the
a positive component of Fourier transformation of 40 receiver wavefield at the particular value of time by
summing the up -going component of the receiver
time-derivative of the source wavefield, wherein ?'(k , wavefield in each window of the plurality of windows;
t;) is the Fourier transformation of time-derivative of and
the source wavefield ; generating an image based on the calculated S. , t;) and
calculating AS ( k , t;), Hilbert transformation of the 45 R ( x , t ) to remove false image in reverse time
positive component of the Fourier transformation of migration (RTM ).
the source wavefield ; 16. The medium of claim 15 , wherein the plurality of
calculating Sp ( x , t ), a down-going component of the windows is a plurality of overlapping windows.
source wavefield in the particular window as a real *