High resolution 3D Tau-p transform by matching pursuit Weiping Cao* and Warren S. Ross, Shearwater GeoServices

Similar documents
An optimized workflow for coherent noise attenuation in time-lapse processing

We Two Seismic Interference Attenuation Methods Based on Automatic Detection of Seismic Interference Moveout

Lecture #15 Lecture Notes

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation

Some Tutorial about the Project. Computer Graphics

Wavefront Reconstructor

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation

Smoothing Spline ANOVA for variable screening

High-Boost Mesh Filtering for 3-D Shape Enhancement

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task

Feature Reduction and Selection

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

A Binarization Algorithm specialized on Document Images and Photos

Reading. 14. Subdivision curves. Recommended:

S1 Note. Basis functions.

Automatic selection of reference velocities for recursive depth migration

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

CSCI 104 Sorting Algorithms. Mark Redekopp David Kempe

Simulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010

CS229 Class Project: Fusion arc treatment planning strategy by adaptive learning cost function based beam selection Ho Jin Kim

An Image Compression Algorithm based on Wavelet Transform and LZW

An Entropy-Based Approach to Integrated Information Needs Assessment

Learning a Class-Specific Dictionary for Facial Expression Recognition

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices

IMAGE FUSION TECHNIQUES

Feature-Area Optimization: A Novel SAR Image Registration Method

An Image Fusion Approach Based on Segmentation Region

An efficient method to build panoramic image mosaics

EFFICIENT LOW DELAY FILTERING FOR RESIDUAL ECHO SUPPRESSION

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data

An Optimal Algorithm for Prufer Codes *

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Solving two-person zero-sum game by Matlab

Real-Time Nondestructive Testing of Composite Aerospace Structures with a Self- Adaptive Technique

BASIC PRINCIPLES OF ACOUSTIC EMISSION TOMOGRAPHY

An inverse problem solution for post-processing of PIV data

Simplification of 3D Meshes

Review of approximation techniques

RESOLUTION ENHANCEMENT OF SATELLITE IMAGES USING DUAL-TREE COMPLEX WAVELET AND CURVELET TRANSFORM

Comparison of traveltime inversions on a limestone structure

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

Optimal Workload-based Weighted Wavelet Synopses

Very simple computational domains can be discretized using boundary-fitted structured meshes (also called grids)

A novel Adaptive Sub-Band Filter design with BD-VSS using Particle Swarm Optimization

AVO Modeling of Monochromatic Spherical Waves: Comparison to Band-Limited Waves

LECTURE : MANIFOLD LEARNING

Lecture 5: Multilayer Perceptrons

Downloaded 07/02/14 to Redistribution subject to SEG license or copyright; see Terms of Use at

A three-dimensional reconstruction algorithm for an inverse-geometry volumetric CT system

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

Music/Voice Separation using the Similarity Matrix. Zafar Rafii & Bryan Pardo

Image Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline

APPLICATION OF A COMPUTATIONALLY EFFICIENT GEOSTATISTICAL APPROACH TO CHARACTERIZING VARIABLY SPACED WATER-TABLE DATA

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory

S.P.H. : A SOLUTION TO AVOID USING EROSION CRITERION?

Mathematics 256 a course in differential equations for engineering students

Machine Learning: Algorithms and Applications

Contourlet-Based Image Fusion using Information Measures

CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION

Multi-stable Perception. Necker Cube

Load Balancing for Hex-Cell Interconnection Network

REMOTE SENSING REQUIREMENTS DEVELOPMENT: A SIMULATION-BASED APPROACH

An Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method

Feature-Preserving Mesh Denoising via Bilateral Normal Filtering

Cluster Analysis of Electrical Behavior

Categories and Subject Descriptors B.7.2 [Integrated Circuits]: Design Aids Verification. General Terms Algorithms

The Research of Ellipse Parameter Fitting Algorithm of Ultrasonic Imaging Logging in the Casing Hole

Robust Dictionary Learning with Capped l 1 -Norm

Parallel Numerics. 1 Preconditioning & Iterative Solvers (From 2016)

Shape Representation Robust to the Sketching Order Using Distance Map and Direction Histogram

Key-Selective Patchwork Method for Audio Watermarking

Hermite Splines in Lie Groups as Products of Geodesics

Biostatistics 615/815

Kernel Collaborative Representation Classification Based on Adaptive Dictionary Learning

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

Hybrid Non-Blind Color Image Watermarking

ADAPTIVE TRAVEL TIME TOMOGRAPHY WITH LOCAL SPARSITY. Michael Bianco and Peter Gerstoft

Differential wavefront curvature sensor

CHAPTER 3 ENCODING VIDEO SEQUENCES IN FRACTAL BASED COMPRESSION. Day by day, the demands for higher and faster technologies are rapidly

y and the total sum of

THE PULL-PUSH ALGORITHM REVISITED

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching

Suppression for Luminance Difference of Stereo Image-Pair Based on Improved Histogram Equalization

Vol. 5, No. 3 March 2014 ISSN Journal of Emerging Trends in Computing and Information Sciences CIS Journal. All rights reserved.

An accelerated value/policy iteration scheme for the solution of DP equations

I. INTRODUCTION J. Acoust. Soc. Am. 109 (6), June /2001/109(6)/2629/7/$ Acoustical Society of America 2629

CS 534: Computer Vision Model Fitting

Steganography System using Slantlet Transform

Simulation Based Analysis of FAST TCP using OMNET++

3D vector computer graphics

LOCAL FEATURE EXTRACTION AND MATCHING METHOD FOR REAL-TIME FACE RECOGNITION SYSTEM. Ho-Chul Shin, Hae Chul Choi and Seong-Dae Kim

An Influence of the Noise on the Imaging Algorithm in the Electrical Impedance Tomography *

SEG/New Orleans 2006 Annual Meeting

A Volumetric Approach for Interactive 3D Modeling

AMath 483/583 Lecture 21 May 13, Notes: Notes: Jacobi iteration. Notes: Jacobi with OpenMP coarse grain

Straight Line Detection Based on Particle Swarm Optimization

Transcription:

Hgh resoluton 3D Tau-p transform by matchng pursut Wepng Cao* and Warren S. Ross, Shearwater GeoServces Summary The 3D Tau-p transform s of vtal sgnfcance for processng sesmc data acqured wth modern wde azmuth recordng systems. Ths paper presents a 3D hgh resoluton Tau-p transform based on the matchng pursut algorthm. 3D sesmc data are frst transformed to the frequency doman, and a sparse set of f-p x -p y coeffcents are teratvely nverted by matchng pursut. When the data are spatally alased, the nverson results are weghted by a total energy mask. The numercal examples demonstrate ths scheme acheves a hgh resoluton Tau-p transform that represents the nput data accurately and handles spatal alasng properly. Introducton The Tau-p transform, also called the lnear Radon transform, has been a very mportant tool n sesmc data processng. Its applcatons range from lnear nose removal to de-ghostng and data nterpolaton/regularzaton. The Tau-p transform s usually formulated as an nverse problem to solve for the Tau-p coeffcents that best represent the nput data under certan crtera, Lm d. (1) In the above equaton, m s the tau-p model and L s the transform operator. Unlke the Fourer transform, the bass for the Tau-p transform s not orthogonal. Therefore tradtonal L2 norm based nverson algorthms provde a low resoluton transformaton, especally when the data samplng and aperture are not deal. Varous authors developed 2D hgh resoluton Radon transform schemes (Thorson and Claerbout 1985; Sacch and Ulrych 1995; Cary, 1998; Trad et al., 2003, Wang et al., 2009) by mposng sparsty constrants n the tme or frequency doman, and the above ssue has been effectvely mtgated for 2D sesmc data. Though 2D Tau-p transform has been wdely used n sesmc processng, ts 2D plane wave assumpton cannot handle the 3D curvature varatons wth azmuth present n 3D sesmc data. Therefore the Tau-p transform needs to be extended to 3D to process 3D sesmc data, especally those data acqured wth wde azmuth recordng systems. Zhang and Lu (2013) developed an accelerated hgh resoluton 3D Tau-p transform wth an effcent spatal transform scheme followed by teratve thresholdng of the nverted Tau-p coeffcents. Wang and Nmsala (2014) proposed a fast progressve sparse Tau-p transform: a low-rank optmzaton s appled for nverson stablty and effcency, and alasng s handled by progressvely drvng the nverson for hgh frequences wth the low frequency results. Ths paper proposes a matchng pursut method for 3D Tau-p transform. The matchng pursut algorthm provdes an approxmate L0 norm soluton to nverse problems, and has been very successful wth FK doman sesmc nterpolaton/regularzaton (Xu et al., 2005;Ozbek et al., 2010; Nguyen and Wnnett, 2011; Hollander et al., 2012; Schonewlle et al., 2013). We choose a matchng pursut approach because of ts proven performance n the FK context, and because t has a straghtforward mplementaton. Also, to properly handle spatal alasng, the total energy of each p trace s computed and used as a mask for the matchng pursut soluton. Method The matchng pursut algorthm bulds up a sparse soluton to the nverse problem by teratvely pckng the strongest component n the model resdue. For the Tau-p transform mplementaton, matchng pursut s mplemented on frequency slces after the nput data are transformed nto the frequency doman. In the frequency doman, the terms n equaton 1 are formulated as: nput data d d f, x, y ), where ( ( x, y ) represent the spatal coordnates of trace number ; j j m m ( f, p x, p ) s the Tau-p coeffcent for the jth p y par. The transform operator L s expressed as L e, j j j 2 f ( p x x p y y ) The adjont transform s formulated as j j H f p x p y m ~ j j ( x y ( f, p, p ) L d e ) x y. (2) 2 d ( f, x, y ), (3) The algorthm s mplemented as follows: 1. Intalze the data resdual wth the nput data 2. Calculate the adjont model by applyng the adjont of operator L to the resdual 3. Select the strongest component n the adjont model and add t to the estmated soluton 4. Inverse transform the selected component nto the data (space) doman, and update the data resdual by subtractng ths transformed component 5. Go to step 2 f resdual level s not low enough. Otherwse ext teraton. To avod a large number of temporal Fourer transform operatons, the nput sesmc data are transformed nto the

Hgh resoluton 3D Tau-p transform frequency space doman, and matchng pursut teratons are mplemented for each frequency slce. In 3D sesmc acquston, the sesmc data are usually alased n the crosslne drecton, and spatal alasng brngs a serous challenge to the Tau-p transform. To overcome ths ssue, for each p x, p y trace we compute the total energy durng the matchng pursut teratons, creatng a mask over the entre p x, p y space. Then n later teratons, ths mask s used as a model-space weght for the nverson. Ths process s repeated perodcally throughout the nverson teratons untl a satsfactory resdual s acheved. Fgures 1-3 show a smple synthetc example to compare Tau-p transform results obtaned wth the matchng pursut algorthm and a Cauchy-lke sparse nverson scheme wth some smlartes to that of Sacch and Ulrych (1995). As llustrated n Fgure 2, the matchng pursut algorthm delvers a Tau-p transform wth hgher resoluton and more accurate ampltude. Also these two Tau-p panels are transformed back to sesmc traces to check the fdelty of the forward transform by checkng the round-trp errors. Fgure 3 shows the round-trp errors scaled by 10 dsplayed at the same range as Fgure 1. The worst error ampltude of the Cauchy-lke approach s over ten tmes that for the matchng pursut scheme. Ths test demonstrates that relatve to the Cauchy-lke approach shown here the matchng pursut algorthm provdes a Tau-p transform that has hgher resoluton and represents the data more accurately. Fgure 2: Tau-p panels for a) matchng pursut method and b) Cauchy-lke method Fgure 3: Tau-p transform round-trp error for a) match pursut method and b) Cauchy-lke method Fgure 1: synthetc data wth 4 lnear events Fgures 4-6 show a 3D synthetc example to llustrate the performance of ths ant-alasng scheme. The trace spacng n the nlne and crosslne drecton s 10 m, and the wavelet s a Rcker wavelet wth maxmum frequency 50 Hz. The dense crosslne samplng n Fgure 4 s decmated to 30 m to generate an alased nput for the Tau-p transform, and the Tau-p coeffcents are used to nterpolate the data back to the dense geometry. Fgure 5 shows that wthout the ant-alasng scheme, a sgnfcant amount of error s ntroduced at the nterpolated trace locatons. By contrast, the error at the nput trace locatons s very low, whch ndcates a good data match n Tau-p transform. When the ant-alasng step s appled, the nterpolaton error s greatly reduced, as Fgure 6 shows.

Hgh resoluton 3D Tau-p transform Feld data example Fgure 4: nlne and crosslne vews of the synthetc data pror to crosslne downsamplng from 10 m to 30 m. Fgure 5: nterpolaton error for Tau-p wthout ant-alasng We appled ths sparse Tau-p transform algorthm to a deep-water 3D marne shot gather to test ts performance on nterpolaton. Acquston conssted of ten cables wth a spacng of 150 m, and 12.5 m channel spacng along the cable. For the test, the data s frst decmated by a factor of two n the cable drecton to generate a sparse dataset. As the three-slce vew n Fgure 7 shows the dataset s badly sampled n both the nlne and crosslne drecton. The FK spectrum n Fgure 8 shows the data s clearly alased n the nlne drecton. The hgh resoluton 3D Tau-p transform s appled to the decmated data, and the resultant Tau-p coeffcents are used to nterpolate back to the orgnal dense samplng n the cable drecton, and compared wth the true dense data. Fgures 9 and 10 demonstrate the nterpolaton results for a near and a far cable. Note that although ths s a 3D transform, the nterpolaton was performed only n one (the nlne) drecton, not the very sparse crosslne drecton. We also test the nterpolaton performance for dfferent percentages of the Tau-p coeffcent threshold. As shown n Fgure 11 for the center part of the data (trace 25-80) the RMS nterpolaton error drops to 10-15% f we use 0.5% of the Tau-p coeffcents, and ncreasng the threshold percentage to 1% brngs lttle mprovement to the error level. There s no sgnfcant dfference for the near and far cables. The valleys of the "V" shapes are locatons where nput traces are avalable and we have data control to reach the best nterpolaton ft. The nterpolaton error on the near traces s at or below 10%. Ths s a 2 to 1 nterpolaton, and the crosslne drecton s very badly alased (wth 150 cable spacng). Overall we thnk the nterpolaton performance s reasonable consderng the nput data s serously alased n both drectons. Fgure 6: nterpolaton error for Tau-p wth ant-alasng Fgure 7: 3D sparse nput data for nterpolaton The average cable spacng s 150, and after decmaton the group nterval s 25 m.

Hgh resoluton 3D Tau-p transform Fgure 8: FK spectrum of the decmated nput n the nlne drecton Fgure 11: nterpolaton error vs traces for two dfferent threshold percentages (0.5% and 1%) of Tau-p coeffcents for nterpolaton Conclusons Fgure 9: Interpolaton for a far cable: true dense cable (left), nterpolated dense cable (center) and the nterpolaton error (rght). A hgh resoluton 3D Tau-p transform scheme s developed to process sparse 3D sesmc data. Wth the matchng pursut algorthm and an ant-alasng strategy based on total energy n the Tau-p plane, a hgh resoluton Tau-p representaton of the alased 3D data can be acheved. Numercal examples demonstrate mproved resoluton n the Tau-p transform and a more accurate data representaton. The applcaton of ths scheme to feld data nterpolaton/regularzaton shows promsng results. Acknowledgments The authors would lke to Sergo Gron for many helpful dscussons and Shearwater Geoservces for the permsson of publsh ths work. Fgure 10: Interpolaton for a near cable: true dense cable (left), nterpolated dense cable (center) and the nterpolaton error (rght).

Hgh resoluton 3D Tau-p transform References Cary, P., 1998, The smplest dscrete Radon transform: 68th Annual Internatonal Meetng, SEG Expanded Abstracts, 1999 2002 Nguyen, T., and R. Wnnett, 2011, Sesmc nterpolaton by optmally matched Fourer components: 81st Annual Internatonal Meetng, SEG, Expanded Abstracts, 3085 3089 Özbek, A., M. Vassallo, A. K. Özdemr, D. Molten, and Y. K. Alp, 2010, Ant-alas optmal nterpolaton wth prors: 80th Annual Internatonal Meetng, SEG, Expanded Abstracts, 3401 3405. Sacch, M., and T. Ulrych, 1995, Hgh-resoluton velocty gathers and offset space reconstructon: Geophyscs, 60, 1169 1177 Schonewlle, M., Zhme Yan, Martn Bayly and Rchard Bsley, 2013, Matchng pursut Fourer nterpolaton usng prors derved from a second data set: 83rd Annual Internatonal Meetng, SEG Expanded Abstracts, 3651-3654 Trad, D., T. Ulrych, and M. Sacch, 2003, Latest vews of the sparse Radon transform: Geophyscs, 68,386 399 Thorson, R., and Claerbout, J., 1985, Velocty-stack and slant-stack stochastc nverson: Geophyscs, 50, 2727 2741 Wang, J., M. Ng, and M. Perz, 2010, Sesmc data nterpolaton by greedy local Radon transform: Geophyscs,75, no. 6, WB225 WB234 Wang, P. and K. Nmsala, 2014, Fast progressve sparse Tau-P transform for regularzaton of spatally alased sesmc data: 84th Annual Internatonal Meetng, SEG Expanded Abstracts, 3589-3592 Xu, S., Y. Zhang, D. L. Pham, and G. Lambaré, 2005, Antleakage Fourer transform for sesmc data regularzaton: Geophyscs,70, no. 4, V87 V95 Zhang, Y., and W. Lu, 2014, 2D and 3D prestack sesmc data regularzaton usng an accelerated sparse tmenvarant Radon transform: Geophyscs,79, no. 5, V165 V177