A fast butterfly algorithm for the hyperbolic Radon transform
We introduce a fast butterfly algorithm for the hyperbolic Radon transform commonly used in seismic data processing. For two-dimensional data, the algorithm runs in complexity O(N[superscript 2] logN), where N is representative of the number of points in either dimension of data space or model space...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Technical Report |
| Language: | en_US |
| Published: |
Massachusetts Institute of Technology. Earth Resources Laboratory
2014
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/90469 |
| _version_ | 1811093877954707456 |
|---|---|
| author | Hu, Jingwei Fomel, Sergey Demanet, Laurent Ying, Lexing |
| author2 | Massachusetts Institute of Technology. Earth Resources Laboratory |
| author_facet | Massachusetts Institute of Technology. Earth Resources Laboratory Hu, Jingwei Fomel, Sergey Demanet, Laurent Ying, Lexing |
| author_sort | Hu, Jingwei |
| collection | MIT |
| description | We introduce a fast butterfly algorithm for the hyperbolic Radon transform commonly used in seismic data processing. For two-dimensional data, the algorithm runs in complexity O(N[superscript 2] logN), where N is representative of the number of points in either dimension of data space or model space. Using a series of examples, we show that the proposed algorithm is significantly more efficient than conventional integration. |
| first_indexed | 2024-09-23T15:52:08Z |
| format | Technical Report |
| id | mit-1721.1/90469 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T15:52:08Z |
| publishDate | 2014 |
| publisher | Massachusetts Institute of Technology. Earth Resources Laboratory |
| record_format | dspace |
| spelling | mit-1721.1/904692019-04-10T21:28:35Z A fast butterfly algorithm for the hyperbolic Radon transform Hu, Jingwei Fomel, Sergey Demanet, Laurent Ying, Lexing Massachusetts Institute of Technology. Earth Resources Laboratory Numerical methods We introduce a fast butterfly algorithm for the hyperbolic Radon transform commonly used in seismic data processing. For two-dimensional data, the algorithm runs in complexity O(N[superscript 2] logN), where N is representative of the number of points in either dimension of data space or model space. Using a series of examples, we show that the proposed algorithm is significantly more efficient than conventional integration. 2014-09-30T14:17:08Z 2014-09-30T14:17:08Z 2012 Technical Report http://hdl.handle.net/1721.1/90469 en_US Earth Resources Laboratory Industry Consortia Annual Report;2012-20 application/pdf Massachusetts Institute of Technology. Earth Resources Laboratory |
| spellingShingle | Numerical methods Hu, Jingwei Fomel, Sergey Demanet, Laurent Ying, Lexing A fast butterfly algorithm for the hyperbolic Radon transform |
| title | A fast butterfly algorithm for the hyperbolic Radon transform |
| title_full | A fast butterfly algorithm for the hyperbolic Radon transform |
| title_fullStr | A fast butterfly algorithm for the hyperbolic Radon transform |
| title_full_unstemmed | A fast butterfly algorithm for the hyperbolic Radon transform |
| title_short | A fast butterfly algorithm for the hyperbolic Radon transform |
| title_sort | fast butterfly algorithm for the hyperbolic radon transform |
| topic | Numerical methods |
| url | http://hdl.handle.net/1721.1/90469 |
| work_keys_str_mv | AT hujingwei afastbutterflyalgorithmforthehyperbolicradontransform AT fomelsergey afastbutterflyalgorithmforthehyperbolicradontransform AT demanetlaurent afastbutterflyalgorithmforthehyperbolicradontransform AT yinglexing afastbutterflyalgorithmforthehyperbolicradontransform AT hujingwei fastbutterflyalgorithmforthehyperbolicradontransform AT fomelsergey fastbutterflyalgorithmforthehyperbolicradontransform AT demanetlaurent fastbutterflyalgorithmforthehyperbolicradontransform AT yinglexing fastbutterflyalgorithmforthehyperbolicradontransform |