Abstract

True-amplitude migration of the Kirchho type is a task of high computational e ort. A substantial part of this e ort is spent on the calculation of proper weight functions to countermand the e ect of geometrical spreading in the data. The generation of the weights is usually very time consuming. Also, the weights must be stored. Together with the traveltime tables which are needed for the stacking surfaces, this leads to large demands in computer storage in addition to the high requirements in CPU time. In this paper we propose a strategy to compute the weight functions directly from coarsely-gridded traveltimes. Together with a fast and accurate method for the interpolation of the traveltimes onto the required fine migration grid, this leads to considerable savings in CPU time as well as storage. Application to a complex synthetic data set demonstrates the high quality of our approach.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.