Curvelet transform-based POCS in f-k domain
- Authors
- Kim, B.; Jeong, S.; Byun, J.; Seol, S.J.
- Issue Date
- Nov-2012
- Publisher
- Society of Exploration Geophysicists
- Citation
- Society of Exploration Geophysicists International Exposition and 82nd Annual Meeting 2012, SEG 2012, pp.3253 - 3257
- Indexed
- SCOPUS
- Journal Title
- Society of Exploration Geophysicists International Exposition and 82nd Annual Meeting 2012, SEG 2012
- Start Page
- 3253
- End Page
- 3257
- URI
- https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/164370
- DOI
- 10.1190/segam2012-1063.1
- ISSN
- 0000-0000
- Abstract
- Recently, various interpolation techniques have been developed for reconstructing the missing traces from the irregularly undersampled seismic data. Among those techniques, a projection onto convex set (POCS) algorithm has gained popularity for its robustness and easy implementation. However, the conventional POCS algorithm using Fourier transform has the limitation in interpolating the seismic data containing curved events. Standard curvelet transform-based POCS algorithm can reconstruct the curved events effectively, but it has trouble in interpolating the weak events when they are interpolated with strong events together. To overcome this problem, we introduce a new curvelet transform-based POCS algorithm which applies curvelet transform to the 2D Fourier transformed data in the frequency-wavenumber domain instead of the data in the time-space domain for each iteration of POCS algorithm. Numerical results clearly demonstrate that the presented algorithm is superior to the standard curvelet transform-based POCS especially for interpolating the data containing various amplitudes.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - 서울 공과대학 > 서울 자원환경공학과 > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/164370)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.