By Topic

Data Reconstruction via Sparse Double Focal Transformation: An Overview

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kutscha, H. ; Dept. of Imaging, Sci. & Technol., Delft Univ. of Technlology, Delft, Netherlands ; Verschuur, E.

In measurements for seismic exploration, the sampling of sources and receivers is usually not adequate to perform subsequent processing and imaging algorithms. Therefore, reconstruction of the seismic data to obtain aliasing-free, dense, and regularly sampled data is an important preprocessing step. In most reconstruction algorithms, information about the subsurface can not be utilized, even if such is available. Focal transformation is a way to effectively incorporate prior knowledge of the subsurface in seismic data reconstruction. The basis functions of this transformation are the focal operators. They can be understood as one-way propagation operators from certain effective depth levels to the measurement surface in a prior (approximate) velocity model. A sparseness constraint in the focal domain is used to penalize aliasing noise. By using several depth levels simultaneously, the data can be described with less parameters in the transform domain. This results in a better signal to noise separation and, therefore, improved reconstruction. The principles are described and some illustrations on synthetic seismic data demonstrate the virtues of the approach.

Published in:

Signal Processing Magazine, IEEE  (Volume:29 ,  Issue: 4 )