📄 paper.tex
字号:
\begin{equation}{\mbox{amp}_t \over \mbox{amp}_x}=\left|{\partial x \over \partial t}\right|\,{\Delta t \over \Delta x}={\Delta t \over \delta t} \leq 1\;.\label{eqn:Jacobian}\end{equation}According to the proposed modification, Hale's antialiasing principleis reformulated, as follows:\begin{quote}{\em In the steep part of an integral operator, never allow successivetime shifts applied to the input trace to differ by more than one timesampling interval. In the flat part of the operator, never allowsuccessive space shifts to differ by more than one space samplinginterval.}\end{quote}\inputdir{flt}Figure \ref{fig:amotra}, borrowed from \cite{Claerbout.bei.95},illustrates the basic idea of the proposed technique. It clearly showsthe difference between the flat and steep parts of migrationhyperbolas. To observe the reciprocity, rotate the figure by 90degrees.\plot{amotra}{height=2in}{Figure borrowed from \cite{Claerbout.bei.95} to illustrate the reciprocity antialiasing. The flat parts of the hyperbolas require interpolation in time. The steep parts of the hyperbolas require interpolation in space.}\inputdir{mod}To compare the proposed antialiasing method with the temporalfiltering method, I test the antialiased migration program on simple2-D synthetic tests. Figure \ref{fig:amomod} shows a simple model andthe modeling results from modeling without antialiasing, with temporalfiltering, and with the proposed reciprocity method. The modelingresults were migrated with the corresponding migration operators toobtain the image of the model in Figure \ref{fig:amomig}. Both thetemporal filtering and the proposed method succeed in removing themajor aliasing artifacts. However, the reciprocity method demonstratesa higher resolution and a better preservation of the frequencycontent.\plot{amomod}{width=4.5in}{Top left is a synthetic model. Topright is modeling without antialiasing. Bottom left is modeling withreciprocity antialiasing (the proposed method). Bottom right is modelingwith antialiasing by temporal filtering.}\plot{amomig}{width=4.5in}{Top left plot is the syntheticmodel. The other plots are migrations of the corresponding data shownin the previous figure . Top right is a migration withoutantialiasing. Bottom left is a migration with reciprocity antialiasing(the proposed method). Bottom right is a migration with trianglefilter antialiasing.}\inputdir{sig}These properties are examined more closely in the next syntheticexample. Figure \ref{fig:amosmo} shows a more sophisticated syntheticmodel that contains a fault, an unconformity and layered structures\cite[]{Claerbout.bei.95}. For better displaying, I extract the centralpart of the model and compare it with the migration results ofdifferent methods in Figure \ref{fig:amosmi}. Comparing the plotsshows that the reciprocity method successfully removes the aliasingartifacts (round-off errors) of the aliased (nearest neighborinterpolation) migration. At the same time, it is less harmful to thehigh-frequency components of the data than triangle filtering. Thisconclusion finds an additional support in Figure \ref{fig:amospe} thatdisplays the average spectrum of the image traces for differentmethods. Both of the antialiasing methods remove the high-frequencyartifacts of the nearest neighbor modeling and migration. Thereciprocity method performs it in a gentler way, preserving thehigh-frequency components of the model.\plot{amosmo}{height=2.5in}{Synthetic model used to testthe antialiased migration program.}\plot{amosmi}{width=6in}{Top left plot is azoomed portion of the synthetic model. The other plots are migratedimages. Top right is a migration without antialiasing. Bottom left isa migration with reciprocity antialiasing (the proposed method). Bottomright is a migration with triangle filter antialiasing.}\plot{amospe}{height=2.5in}{Top is the spectrum of themodel. The other plots are the spectra of the migrated images. Thesecond plot corresponds to the modeling/migration without account forantialiasing. The third plot is modeling/migration with thereciprocity antialiasing. The bottom plot is modeling/migration withtriangle antialiasing.} The algorithm sequence of the antialiased migration is illustrated inFigures \ref{fig:amormo} and \ref{fig:amormi}. The two plots in Figure\ref{fig:amormo} show the steep-dip and flat-dip modeling respectively. Thesuperposition of these two terms is the resultant antialiased datashown in the left plot of Figure \ref{fig:amormm}. The right plot ofFigure \ref{fig:amormm} shows the migrated image obtained by adding theflat-dip (left of Figure \ref{fig:amormi}) and steep-dip (right of Figure\ref{fig:amormi}) migrations.\plot{amormo}{width=6in,height=2.25in}{Antialiased modeling. Leftcorresponds to the flat-dip term. Right corresponds to the steep-dipterm.}\plot{amormi}{width=6in,height=2.25in}{Antialiasedmigration. Left corresponds to the flat-dip term. Right corresponds tothe steep-dip term.}\plot{amormm}{width=6in,height=2.25in}{Antialiasedmodeling and migration. Left is the superposition of the flat-dip andsteep-dip modeling. Right is superposition of the flat-dip andsteep-dip migration.}\begin{comment}The efficiency of the antialiased migration is compared in the CPUtime chart in Figure \ref{fig:amochp}. The test data set included 500by 250 data points with $\Delta t=0.004$ sec, and $\Delta x = 25$ m.The figure shows that the performance of the reciprocity antialiasingincreases with increase of the migration velocity. This behavior canbe explained by the fact that high-velocity migration hyperbolasrequire a smaller number of expensive computations in the steep(aliased) parts. It allows us to expect a high performance of themethod in application to the curvilinear operators with limitedaperture (dip moveout, azimuth moveout, shot continuation).%\plot{amochp}{height=1.5in}{CPU time of migration programs%on HP 9000-735 versus the constant migration velocity used in the%experiment.}\end{comment}\subsection{3-D antialiasing}\inputdir{imp}The proposed method of antialiasing is easily generalized to the caseof a three-dimensional integral operator. In this case, we need toconsider three different parameterizations: $t(x,y)$, $x(t,y)$, and$y(t,x)$ and switch from one of them to another according to the rule:\begin{itemize}\item if $\Delta t \geq {{\Delta x} \, {|\partial t / \partial x|}}$and $\Delta t \geq {{\Delta y} \, {|\partial t / \partial y|}}$,use $t(x,y)$,\item if $\Delta x \geq {{\Delta t} \, {|\partial x / \partial t|}}$and $\Delta x \geq {{\Delta y} \, {|\partial x / \partial y|}}$,use $x(t,y)$,\item if $\Delta y \geq {{\Delta t} \, {|\partial y / \partial t|}}$and $\Delta y \geq {{\Delta x} \, {|\partial y / \partial x|}}$,use $y(t,x)$.\end{itemize}Following \cite{GEO66-02-06540666}, I illustrate 3-Dantialiasing by applying prestack time migration on a single inputtrace. The results are shown in Figures~\ref{fig:imp-noa},\ref{fig:imp-aal} and \ref{fig:imp-all}. The result without anyantialiasing protection (Figure~\ref{fig:imp-noa}) contains clearlyvisible aliasing artifacts caused by the steeply dipping parts of theoperator. Antialiasing by temporal filtering(Figure~\ref{fig:imp-aal}) removes the artifacts but also attenuatesthe steeply dipping events. Antialiasing by the proposed reciprocalparameterization (Figure~\ref{fig:imp-all}) removes the aliasingartifacts while preserving the steeply dipping events and the imageresolution.\plot{imp-noa}{width=6in}{Prestack 3-D time migration of a single input trace. Top: time slice at 1 s. Bottom: vertical slice. No antialiasing protection has been applied. As a result, aliasing artifacts are clearly visible in the image.}\plot{imp-aal}{width=6in}{Prestack 3-D time migration of a single input trace. Top: time slice at 1 s. Bottom: vertical slice. Antialiasing by temporal filtering has been applied. Aliasing artifacts are removed, steeply dipping events are attenuated.}\plot{imp-all}{width=6in}{Prestack 3-D time migration of a single input trace. Top: time slice at 1 s. Bottom: vertical slice. The proposed reciprocal antialiasing has been applied. Aliasing artifacts are removed, steeply dipping events are preserved.}\section{Conclusions}%%%%I have introduced a new method of antialiasing integral operators,modified from Hale's approach to antialiased dip moveout. The methodcompares favorably with the popular temporal filtering technique. Themain advantages are:\begin{enumerate}\item Accurate handling of variable operator dips.\item Consequent preservation of the high-frequency part of the dataspectrum, leading to a higher resolution.\item Easy control of operator amplitudes.\item Easy generalization to 3-D.\end{enumerate}The method possesses a sufficient numerical efficiency in practicalimplementations. Its most appropriate usage is for antialiasingoperators with analytically computed summation paths, such as prestacktime migration, dip moveout, azimuth moveout, and shot continuation.\section{Acknowledgments}I thank Biondo Biondi for many helpful discussions. The financialsupport for this work was provided by the sponsors of the StanfordExploration Project.\bibliographystyle{seg}\bibliography{antial,SEG,SEP2}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -