15792

Fast hyperbolic Radon transform represented as convolutions in log-polar coordinates

Viktor V. Nikitin, Fredrik Andersson, Marcus Carlsson, Anton A. Duchkov
Centre for Mathematical Sciences, Lund University, Solvegatan 18, Box 118, SE-22100 Lund, Sweden
arXiv:1604.07651 [math.NA], (22 Apr 2016)
@article{nikitin2016fast,

   title={Fast hyperbolic Radon transform represented as convolutions in log-polar coordinates},

   author={Nikitin, Viktor V. and Andersson, Fredrik and Carlsson, Marcus and Duchkov, Anton A.},

   year={2016},

   month={apr},

   archivePrefix={"arXiv"},

   primaryClass={math.NA}

}

Download Download (PDF)   View View   Source Source   

353

views

The hyperbolic Radon transform is a commonly used tool in seismic processing, for instance in seismic velocity analysis, data interpolation and for multiple removal. A direct implementation by summation of traces with different moveouts is computationally expensive for large data sets. In this paper we present a new method for fast computation of the hyperbolic Radon transforms. It is based on using a log-polar sampling with which the main computational parts reduce to computing convolutions. This allows for fast implementations by means of FFT. In addition to the FFT operations, interpolation procedures are required for switching between coordinates in the time-offset; Radon; and log-polar domains. Graphical Processor Units (GPUs) are suitable to use as a computational platform for this purpose, due to the hardware supported interpolation routines as well as optimized routines for FFT. Performance tests show large speed-ups of the proposed algorithm. Hence, it is suitable to use in iterative methods, and we provide examples for data interpolation and multiple removal using this approach.
VN:F [1.9.22_1171]
Rating: 5.0/5 (5 votes cast)
Fast hyperbolic Radon transform represented as convolutions in log-polar coordinates, 5.0 out of 5 based on 5 ratings

* * *

* * *

TwitterAPIExchange Object
(
    [oauth_access_token:TwitterAPIExchange:private] => 301967669-yDz6MrfyJFFsH1DVvrw5Xb9phx2d0DSOFuLehBGh
    [oauth_access_token_secret:TwitterAPIExchange:private] => o29ji3VLVmB6jASMqY8G7QZDCrdFmoTvCDNNUlb7s
    [consumer_key:TwitterAPIExchange:private] => TdQb63pho0ak9VevwMWpEgXAE
    [consumer_secret:TwitterAPIExchange:private] => Uq4rWz7nUnH1y6ab6uQ9xMk0KLcDrmckneEMdlq6G5E0jlQCFx
    [postfields:TwitterAPIExchange:private] => 
    [getfield:TwitterAPIExchange:private] => ?cursor=-1&screen_name=hgpu&skip_status=true&include_user_entities=false
    [oauth:protected] => Array
        (
            [oauth_consumer_key] => TdQb63pho0ak9VevwMWpEgXAE
            [oauth_nonce] => 1475039548
            [oauth_signature_method] => HMAC-SHA1
            [oauth_token] => 301967669-yDz6MrfyJFFsH1DVvrw5Xb9phx2d0DSOFuLehBGh
            [oauth_timestamp] => 1475039548
            [oauth_version] => 1.0
            [cursor] => -1
            [screen_name] => hgpu
            [skip_status] => true
            [include_user_entities] => false
            [oauth_signature] => 59jRBMLDFdFHIXA2FS5RqV/Ai18=
        )

    [url] => https://api.twitter.com/1.1/users/show.json
)
Follow us on Facebook

HGPU group © 2010-2016 hgpu.org

All rights belong to the respective authors

Contact us: