@techreport {louboutin2020SCsta,
	title = {Scaling through abstractions {\textendash} high-performance vectorial wave simulations for seismic inversion with Devito},
	number = {TR-CSE-2020-3},
	year = {2020},
	month = {4},
	institution = {Georgia Institute of Technology},
	abstract = {[Devito] is an open-source Python project based on domain-specific language and compiler technology. Driven by the requirements of rapid HPC applications development in exploration seismology, the language and compiler have evolved significantly since inception. Sophisticated boundary conditions, tensor contractions, sparse operations and features such as staggered grids and sub-domains are all supported; operators of essentially arbitrary complexity can be generated. To accommodate this flexibility whilst ensuring performance, data dependency analysis is utilized to schedule loops and detect computational-properties such as parallelism. In this article, the generation and simulation of MPI-parallel propagators (along with their adjoints) for the pseudo-acoustic wave-equation in tilted transverse isotropic media and the elastic wave-equation are presented. Simulations are carried out on industry scale synthetic models in a HPC Cloud system and reach a performance of 28TFLOP/s, hence demonstrating Devito{\textquoteright}s suitability for production-grade seismic inversion problems.},
	keywords = {devito, elastic, finite-difference, HPC, large-scale, RTM, TTI},
	url = {https://slim.gatech.edu/Publications/Public/TechReport/2020/louboutin2020SCsta/louboutin2020SCsta.html},
	author = {Mathias Louboutin and Fabio Luporini and Philipp A. Witte and Rhodri Nelson and George Bisbas and Jan Thorbecke and Felix J. Herrmann and Gerard Gorman}
}
@article {tu2015GJIsem,
	title = {Source estimation with surface-related multiples{\textendash}-fast ambiguity-resolved seismic imaging},
	journal = {Geophysical Journal International},
	volume = {205},
	year = {2016},
	note = {(published online in Geophysical Journal International)},
	month = {03},
	pages = {1492-1511},
	abstract = {We address the problem of obtaining a reliable seismic image without prior knowledge of the source wavelet, especially from data that contain strong surface-related multiples. Conventional reverse-time migration requires prior knowledge of the source wavelet, which is either technically or computationally challenging to accurately determine; inaccurate estimates of the source wavelet can result in seriously degraded reverse-time migrated images, and therefore wrong geological interpretations. To solve this problem, we present a "wavelet-free" imaging procedure that simultaneously inverts for the source wavelet and the seismic image, by tightly integrating source estimation into a fast least-squares imaging framework, namely compressive imaging, given a reasonably accurate background velocity model. However, this joint inversion problem is difficult to solve as it is plagued with local minima and the ambiguity with respect to amplitude scalings because of the multiplicative, and therefore nonlinear, appearance of the source wavelet in the otherwise linear formalism. We have found a way to solve this nonlinear joint-inversion problem using a technique called variable projection, and a way to overcome the scaling ambiguity by including surface-related multiples in our imaging procedure following recent developments in surface-related multiple prediction by sparse inversion. As a result, we obtain without prior knowledge of the source wavelet high-resolution seismic images, comparable in quality to images obtained assuming the true source wavelet is known. By leveraging the computationally efficient compressive-imaging methodology, these results are obtained at affordable computational costs compared with conventional processing work flows that include surface-related multiple removal and reverse-time migration.},
	keywords = {computational seismology, free surface, Inverse theory, multiples, seismic imaging, time series analysis, wave propagation},
	url = {https://slim.gatech.edu/Publications/Public/Journals/GeophysicalJournalInternational/2016/tu2015GJIsem/tu2015GJIsem.pdf},
	url2 = {http://gji.oxfordjournals.org/content/205/3/1492.full.pdf?keytype=ref\&ijkey=zFydRGQpiJzeCS9},
	author = {Ning Tu and Aleksandr Y. Aravkin and Tristan van Leeuwen and Tim T.Y. Lin and Felix J. Herrmann}
}
@mastersthesis {tu2015THfis,
	title = {Fast imaging with surface-related multiples},
	year = {2015},
	note = {(PhD)},
	month = {08},
	school = {The University of British Columbia},
	type = {phd},
	address = {Vancouver},
	abstract = {Surface-related multiples, which are waves that bounce more than once between the water surface and the subsurface reflectors, constitute a significant part of the data acquired in marine seismic surveys. If left untreated, they can lead to misplaced phantom reflectors in the image, and result in erroneous interpretations of the subsurface structure. As a result, these multiples are removed before the imaging procedure in conventional seismic data processing. However, because they interact more with the subsurface medium, they may carry extra information that is not present in the primaries. Therefore instead of removing these multiples, a more desirable alternative is to make active use of them. We derive from the well-established "Surface-Related Multiple Elimination" relation, and arrive at a linearized expression of the wave-equation based modelling that incorporates the surface- related multiples. We then present a computationally efficient approach to iteratively invert this expression to obtain an image of the subsurface from data that contain multiples. We achieve the computational efficiency inside each iteration by (i) using the wave-equation solver to implicitly carry out the expensive multiple prediction; and (ii) reducing the number of wave-equation solves during data simulation by subsampling the monochromatic source experiments. We show that, compared with directly applying the cross-correlation/deconvolutional imaging conditions, the presented approach can suppress the coherent imaging artifacts from multiples more effectively. We also show that, by curvelet-domain sparsity promoting and occasionally drawing new data samples during the inversion, the proposed inversion method gains improved robustness to velocity errors in the background model, as well as modelling errors incurred during linearization of the wave-equation. To combine the information encoded in both the primaries and the multiples, we then propose a highly accurate source estimation method to jointly invert the total upgoing wavefield. We show with field data examples that we can reap benefits from both the relative noise-free primaries and the extra illumination coverage of the multiples. We also demonstrate that the inclusion of multiples help mitigate the amplitude ambiguity during source estimation. We conclude the thesis with an outlook for future research directions, as well as potential extensions of the proposed work.},
	keywords = {inversion, least-squares, multiples, seismic imaging},
	url = {https://slim.gatech.edu/Publications/Public/Thesis/2015/tu2015THfis/tu2015THfis.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Thesis/2015/tu2015THfis/tu2015THfis_pres.pdf},
	author = {Ning Tu}
}
@article {tu2014fis,
	title = {Fast imaging with surface-related multiples by sparse inversion},
	journal = {Geophysical Journal International},
	volume = {201},
	number = {1},
	year = {2015},
	note = {(Geophysical Journal International)},
	month = {04},
	pages = {304-317},
	abstract = {In marine exploration seismology, surface-related multiples are usually treated as noise mainly because subsequent processing steps, such as migration velocity analysis and imaging, require multiple-free data. Failure to remove these wavefield components from the data may lead to erroneous estimates for migration velocity or result in strong coherent artefacts that interfere with the imaged reflectors. However, multiples can carry complementary information compared to primaries, as they interact with the free surface and are therefore exposed more to the subsurface. Recent work has shown that when processed correctly multiples can improve seismic illumination. Given a sufficiently accurate background velocity model and an estimate for the source signature, we propose a new and computationally efficient linearized inversion procedure based on two-way wave equations, which produces accurate images of the subsurface from the total upgoing wavefield including surface-related multiples. Modelling of the surface-related multiples in the proposed method derives from the well-known surface-related multiple elimination method. We incur a minimal overhead from incorporating the multiples by having the wave-equation solver carry out the multiple predictions via the inclusion of an areal source instead of expensive dense matrix-matrix multiplications. By using subsampling techniques, we obtain high-quality true-amplitude least-squares migrated images at computational costs of roughly a single reverse-time migration (RTM) with all the data. These images are virtually free of coherent artefacts from multiples. Proper inversion of the multiples would be computationally infeasible without using these techniques that significantly bring down the cost. By promoting sparsity in the curvelet domain and using rerandomization, out method gains improved robustness to errors in the background velocity model, and errors incurred in the linearization of the wave equation with respect to the model. We demonstrate the superior performance of the proposed method compared to the conventional RTM using realistic synthetic examples.},
	keywords = {approximate message passing, Compressive Sensing, curvelet, inversion, Kaczmarz, multiples},
	url = {https://slim.gatech.edu/Publications/Public/Journals/GeophysicalJournalInternational/2014/tu2014fis/tu2014fis.pdf},
	url2 = {http://gji.oxfordjournals.org/cgi/content/full/ggv020?ijkey=pKzrSXbtxjlOjzd\&keytype=ref},
	author = {Ning Tu and Felix J. Herrmann}
}
@presentation {yang2015SINBADFfis,
	title = {Fast imaging with surface-related multiples: {\textendash} shallow water multiples},
	year = {2015},
	publisher = {SINBAD},
	abstract = {In this talk, we will show surface-related multiples imaging with source estimation. Here the algorithms are based on linearized bregman, and we give the source estimation formulation in this case. With the featured blocked structure of linearized bregman, we can do efficient imaging in straightforward way by randomly choosing sources and frequencies. Another benefit is the simplicity to delivery the algorithm.},
	keywords = {Presentation, SINBAD, SINBADFALL2015, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2015/Fall/yang2015SINBADFfis/yang2015SINBADFfis.pdf},
	url2 = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2015/Fall/yang2015SINBADFfis/yang2015SINBADFfis.mov},
	author = {Mengmeng Yang and Ning Tu and Felix J. Herrmann}
}
@article {tu2015TLEfls,
	title = {Fast least-squares imaging with surface-related multiples: application to a North-Sea data set},
	journal = {The Leading Edge},
	volume = {34},
	number = {7},
	year = {2015},
	note = {(The Leading Edge)},
	month = {07},
	pages = {788{\textendash}794},
	abstract = {In marine seismic acquisition, surface-related multiples constitute a significant portion of the acquired data. Typically, multiples are removed during early-stage data-processing as they can lead to phantom reflectors during migration that may result in erroneous geological interpretations. However, if properly dealt with, multiples can provide valuable extra information and complement primaries in illuminating the subsurface. In this article, we demonstrate the limitation of the reverse-time migration in imaging these multiples, and present an alternative inversion procedure that is computationally efficient, that jointly maps both primaries and multiples to the true reflectors, and where the source function is estimated on the fly. As a result, we obtain high-quality, mostly artifact-free, broad-band images where the imprint of the source-function are partly removed at a computationally affordable expense compared to the combined costs of the wave-equation based surface-related multiple elimination and the reverse-time migration. We achieve all this by including the total downgoing wavefields as areal sources in the least-squares migration in combination with curvelet-domain sparsity promotion. We apply the proposed method to a shallow-water marine data set from the North sea, which contains abundant short-period surface-related multiples, and show its efficacy in eliminating coherent imaging artifacts associated with these multiples. We also demonstrate the benefits of joint imaging of primaries and multiples compared to imaging these signal components separately.},
	keywords = {field data, inversion, least squares, migration, multiples},
	doi = {10.1190/tle34070788.1},
	url = {https://slim.gatech.edu/Publications/Public/Journals/TheLeadingEdge/2015/tu2015TLEfls/tu2015TLEfls.html},
	author = {Ning Tu and Felix J. Herrmann}
}
@conference {herrmann2015EAGEfom,
	title = {Fast "online" migration with Compressive Sensing},
	booktitle = {EAGE Annual Conference Proceedings},
	year = {2015},
	note = {(EAGE, Madrid)},
	month = {06},
	abstract = {We present a novel adaptation of a recently developed relatively simple iterative algorithm to solve large-scale sparsity-promoting optimization problems. Our algorithm is particularly suitable to large-scale geophysical inversion problems, such as sparse least-squares reverse-time migration or Kirchoff migration since it allows for a tradeoff between parallel computations, memory allocation, and turnaround times, by working on subsets of the data with different sizes. Comparison of the proposed method for sparse least-squares imaging shows a performance that rivals and even exceeds the performance of state-of-the art one-norm solvers that are able to carry out least-squares migration at the cost of a single migration with all data.},
	keywords = {EAGE, LSRTM},
	doi = {10.3997/2214-4609.201412942},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2015/herrmann2015EAGEfom/herrmann2015EAGEfom.html},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2015/herrmann2015EAGEfom/herrmann2015EAGEfom_pres.pdf},
	author = {Felix J. Herrmann and Ning Tu and Ernie Esser}
}
@conference {kumar2015CSEGlse,
	title = {Least-squares extended imaging with surface-related multiples},
	booktitle = {CSEG Annual Conference Proceedings},
	year = {2015},
	note = {(CSEG, Calgary)},
	month = {05},
	abstract = {Common image gathers are used in building velocity models, inverting anisotropy parameters, and analyzing reservoir attributes. Often primary reflections are used to form image gathers and multiples are typically attenuated in processing to remove strong coherent artifacts generated by multiples that interfere with the imaged reflectors. However, researchers have shown that, if correctly used, multiples can actually provide extra illumination of the subsurface in seismic imaging, especially for delineating the near-surface features. In this work, we borrow ideas from literatures on imaging with surface-related multiples, and apply these ideas to extended imaging. This way we save the massive computation cost in separating multiples from the data before using them during the formation of image gathers. Also, we mitigate the strong coherent artifacts generated by multiples which can send the migration velocity analysis type algorithms in wrong direction. Synthetic examples on a three-layer model show the efficacy of the proposed formulation.},
	keywords = {CSEG, image-gather, surface-related multiples},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/CSEG/2015/kumar2015CSEGlse/kumar2015CSEGlse.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/CSEG/2015/kumar2015CSEGlse/kumar2015CSEGlse_pres.pdf},
	author = {Rajiv Kumar and Ning Tu and Tristan van Leeuwen and Felix J. Herrmann}
}
@techreport {kumar2015EAGElse,
	title = {Least-squares extended imaging with surface-related multiples},
	number = {TR-EOAS-2015-1},
	year = {2015},
	month = {01},
	institution = {UBC},
	abstract = {Common image gathers are used in building velocity models, inverting for anisotropy parameters, and analyzing reservoir attributes. Typically, only primary reflections are used to form image gathers as multiples can cause artifacts that interfere with the events of interest. However, it has been shown that multiples can actually provide extra illumination of the subsurface, especially for delineating the near-surface features. In this paper, we aim to form common image gathers directly from the data with surface related multiples by applying concepts that have been used to successfully deal with surface-related multiples in imaging. We achieve this by effectively inverting an extended migration operator. This results in extended images with better near-surface illumination that are free of artifacts that can hamper velocity analysis. In addition, being able to generate extended images directly from the total data avoids the need for (time-consuming) pre-processing. Synthetic examples on a layered model show that the proposed formulation is promising.},
	keywords = {image gathers, surface-related multiples},
	url = {https://slim.gatech.edu/Publications/Public/TechReport/2015/kumar2015EAGElse/kumar2015EAGElse.html},
	author = {Rajiv Kumar and Ning Tu and Tristan van Leeuwen and Felix J. Herrmann}
}
@presentation {oghenekohwo2015SINBADrdc,
	title = {Recent developments in compressive sensing for time-lapse studies},
	year = {2015},
	publisher = {SINBAD},
	abstract = {We present an overview of the advances we have made with respect to extending compressive sensing ideas to time-lapse studies. We show applications in compressive time-lapse seismic data acquisition, imaging and full-waveform inversion.},
	keywords = {Presentation, SINBAD, SINBADSPRING2015, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2015/Spring/oghenekohwo2015SINBADrdc/oghenekohwo2015SINBADrdc.pdf},
	author = {Felix Oghenekohwo and Rajiv Kumar and Haneet Wason and Ernie Esser and Ning Tu and Felix J. Herrmann}
}
@conference {tu2015PIMSsls,
	title = {Sparse least-squares seismic imaging with source estimation utilizing multiples},
	booktitle = {PIMS Workshop on Advances in Seismic Imaging and Inversion},
	year = {2015},
	note = {(PIMS Workshop on Advances in Seismic Imaging and Inversion, University of Alberta, Edmonton)},
	month = {05},
	abstract = {We present an least-squares seismic imaging method that (1) is efficient by subsampling the monochromatic source experiments; (2) does not require the prior knowledge of the source wavelet, by inverting for the seismic image and the source wavelet simultaneously using variable projection; and (3) makes active use of surface-related multiples to increase the illumination and to resolve the scaling ambiguity in source estimation, by tightly integrating the well-established surface-related-multiple-prediction into the wave-equation based modelling. As a result, we are able to obtain ambiguity-resolved, high-fidelity least-squares inverted seismic images with computational costs that are comparable to conventional reverse-time migrations with all the data. We demonstrate the efficacy of the proposed method using synthetic examples.},
	keywords = {inversion, least-squares migration, multiples, PIMS, seismic imaging, source estimation, workshop},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/PIMS/2015/tu2015PIMSsls/tu2015PIMSsls_pres.pdf},
	author = {Ning Tu and Felix J. Herrmann}
}
@conference {witte2015IIPFWIspl,
	title = {Sparsity-promoting least-square migration with linearized Bregman and compressive sensing},
	booktitle = {Inaugural Full-Waveform Inversion Workshop},
	year = {2015},
	note = {(Natal, Brazil)},
	month = {08-09},
	abstract = {We present a novel adaptation of a recently developed relatively simple iterative algorithm to solve large-scale sparsity-promoting optimization problems. Our algorithm is particularly suitable to large-scale geophysical inversion problems, such as sparse least-squares reverse-time migration or Kirchoff migration since it allows for a tradeoff between parallel computations, memory allocation, and turnaround times, by working on subsets of the data with different sizes. Comparison of the proposed method for sparse least-squares imaging shows a performance that rivals and even exceeds the performance of state-of-the art one-norm solvers that are able to carry out least-squares migration at the cost of a single migration with all data.},
	keywords = {Bregman, compressed sensing, FWI, migration, sparsity promotion, time domain},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/IIPFWI/witte2015IIPFWIspl/witte2015IIPFWIspl_pres.pdf},
	author = {Philipp A. Witte and Ning Tu and Ernie Esser and Mengmeng Yang and Mathias Louboutin and Felix J. Herrmann}
}
@conference {petrenko2014EAGEaih,
	title = {Accelerating an iterative Helmholtz solver with FPGAs},
	booktitle = {EAGE Annual Conference Proceedings},
	year = {2014},
	month = {06},
	abstract = {We implement the Kaczmarz row-projection algorithm (Kaczmarz (1937)) on a CPU host + FPGA accelerator platform using techniques of dataflow programming. This algorithm is then used as the preconditioning step in CGMN, a modified version of the conjugate gradients method (Bj{\"o}rck and Elfving (1979)) that we use to solve the time-harmonic acoustic isotropic constant density wave equation. Using one accelerator we achieve a speed-up of over 2{\texttimes} compared with one Intel core.},
	keywords = {CGMN, EAGE, FPGA, Helmholtz equation, Kaczmarz, reconfigurable computing},
	doi = {10.3997/2214-4609.20141141},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2014/petrenko2014EAGEaih/petrenko2014EAGEaih.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2014/petrenko2014EAGEaih/petrenko2014EAGEaih_pres.pdf},
	author = {Art Petrenko and Tristan van Leeuwen and Diego Oriato and Simon Tilbury and Felix J. Herrmann}
}
@conference {petrenko2014OGHPCaih,
	title = {Accelerating an iterative Helmholtz solver with FPGAs},
	booktitle = {OGHPC},
	year = {2014},
	month = {03},
	abstract = {We implement the Kaczmarz row-projection algorithm [Kaczmarz, 1937] on a CPU host + FPGA accelerator platform using techniques of dataflow programming. This algorithm is then used as the preconditioning step in CGMN, a modified version of the conjugate gradients method [Bj?rck and Elfving, 1979] that we use to solve the time-harmonic acoustic isotropic constant density wave equation.},
	keywords = {CGMN, FPGA, Helmholtz equation, Kaczmarz, OGHPC, reconfigurable computing},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/OGHPC/2014/petrenko2014OGHPCaih/petrenko2014OGHPCaih.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/OGHPC/2014/petrenko2014OGHPCaih/petrenko2014OGHPCaih_poster.pdf},
	author = {Art Petrenko and Felix J. Herrmann and Diego Oriato and Simon Tilbury and Tristan van Leeuwen}
}
@presentation {petrenko2014SINBADaih,
	title = {Accelerating an iterative Helmholtz solver with FPGAs},
	year = {2014},
	publisher = {SINBAD},
	abstract = {An implementation of seismic wave simulation on a platform consisting of a conventional host processor and a reconfigurable hardware accelerator is presented. This research is important in the field of exploration for oil and gas resources, where a 3D model of the subsurface is frequently required. By comparing seismic data collected in a real-world survey with synthetic data generated by simulated waves, it is possible to deduce such a model. However this requires many time-consuming simulations with different Earth models to find the one that best fits the measured data. Speeding up the wave simulations would allow more models to be tried, yielding a more accurate estimate of the subsurface. The reconfigurable hardware accelerator employed in this work is a field programmable gate array (FPGA). FPGAs are computer chips that consist of electronic building blocks that the user can configure and reconfigure to represent their algorithm in hardware. Whereas a traditional processor can be viewed as a pipeline for processing instructions, an FPGA is a pipeline for processing data. The chief advantage of the FPGA is that all the instructions in the algorithm are already hardwired onto the chip. This means that execution time depends only on the amount of data to be processed, and not on the complexity of the algorithm. The main contribution is an implementation of the well-known Kaczmarz row projection algorithm on the FPGA, using techniques of dataflow programming. This kernel is used as the preconditioning step of CGMN, a modified version of the conjugate gradients method that is used to solve the time-harmonic acoustic isotropic constant density wave equation. Using one FPGA accelerator, the current implementation allows seismic wave simulations to be performed over twice as fast, compared to running on one Intel Xeon E5-2670 core. I also discuss the effect of modifications of the algorithm necessitated by the hardware on the convergence properties of CGMN. Finally, a specific plan for future work is set-out in order to fully exploit the accelerator platform, and my work is set in its larger context},
	keywords = {Presentation, SINBAD, SINBADSPRING2014, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2014/Spring/petrenko2014SINBADaih/petrenko2014SINBADaih.pdf},
	author = {Art Petrenko and Tristan van Leeuwen and Diego Oriato and Simon Tilbury and Felix J. Herrmann}
}
@presentation {kumar2014SINBADeia,
	title = {Extended images in action {\textendash}- image gather with surface-related multiples},
	year = {2014},
	publisher = {SINBAD},
	abstract = {Common image gathers are used in building velocity models, invert anisotropy parameters and to analyze reservoir attributes. Often primary reflections are used to form the image gathers and multiples are typically attenuated in processing. However, researchers have shown that, if correctly used, they can provide useful information about the subsurface during reverse-time migration. In this work, i will show how we can use multiples along with primaries to form the image-gathers.},
	keywords = {Presentation, SINBAD, SINBADFALL2014, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2014/Fall/kumar2014SINBADeia/kumar2014SINBADeia.pdf},
	author = {Rajiv Kumar and Ning Tu and Tristan van Leeuwen and Felix J. Herrmann}
}
@presentation {tu2014SINBADfis2,
	title = {Fast imaging with source estimation},
	year = {2014},
	publisher = {SINBAD},
	abstract = {In seismic imaging, an inaccurate estimate of the source wavelet may result in degraded seismic images. While conventional reverse-time migration requires the knowledge of the source wavelet as prior information, we propose to include source estimation in the fast compressive imaging procedure. Using the proposed method, we can obtain seismic images that are comparable to those imaged with the true source wavelet, with computational costs that are comparable to conventional RTM images with all the data. We also extend the proposed method to image data with surface-related multiples, where these multiples help to mitigate the amplitude ambiguity in source estimation. We verify the proposed method using realistic synthetic examples.},
	keywords = {Presentation, SINBAD, SINBADFALL2014, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2014/Fall/tu2014SINBADfis2/tu2014SINBADfis2.pdf},
	author = {Ning Tu and Aleksandr Y. Aravkin and Tristan van Leeuwen and Tim T.Y. Lin and Felix J. Herrmann}
}
@presentation {tu2014SINBADfis,
	title = {Fast imaging with surface-related multiples by sparse inversion},
	year = {2014},
	publisher = {SINBAD},
	abstract = {When used correctly, surface-related multiples can provide extra illumination coverage compared with primaries. In this talk, I will discuss how to jointly image primaries and surface-related multiples in a computationally efficient fashion. We bring down the computational cost by two means. First we use wave-equation solvers to implicitly carry out the expensive dense matrix-matrix multiplications in the prediction of surface-related multiples. Second we bring down the simulation cost by subsampling the frequencies and monochromatic source experiments together with curvelet-domain sparsity-promoting and rerandomization. As a result, we obtain true-amplitude least-squares migrated seismic images with computational costs that are comparable to a single RTM with all the data. We demonstrate the efficacy of the proposed method using realistic synthetic examples.},
	keywords = {Presentation, SINBAD, SINBADFALL2014, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2014/Fall/tu2014SINBADfis/tu2014SINBADfis.pdf},
	author = {Ning Tu and Felix J. Herrmann}
}
@conference {herrmann2014SEGWSfli,
	title = {Fast linearized inversion with surface-related multiples with source estimation},
	booktitle = {SEG Workshop on Using Multiples as Signal for Imaging; Denver},
	year = {2014},
	note = {(SEG Workshop, Denver)},
	month = {10},
	abstract = {In the well-known SRME relation, multiples are expressed as the multi-dimensional convolution between the subsurface Green{\textquoteright}s function and the downgoing receiver wavefield. Therefore these multiples can be considered as the response of the subsurface to an "areal" source term given by the same downgoing receiver wavefield. This relation can be used to treat these multiples as signals instead of considering them as noise that must removed before seismic imaging. However, when we use conventional reverse-time migration to image these multiple events, it results in acausal imaging artifacts caused by cross-correlations between wrong pairs of up- and downgoing wavefields. We find that these artifacts can be removed by adopting a sparsity-promoting least-squares inversion approach. However, iterative inversions go at the expense of excessive computational costs. By combining the SRME relation and wave-equation based linearized modelling, we are able to significantly reduce the costs by avoiding the dense matrix-matrix multiplications of SRME and the number of wave-equation solves via source subsampling. As a result, we arrive at a method with a cost comparable to that of a single reverse-time migration with all shots.},
	keywords = {inversion, multiples, SEG, workshop},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2014/herrmann2014SEGWSfli/herrmann2014SEGWSfli.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2014/herrmann2014SEGWSfli/herrmann2014SEGWSfli_pres.pdf},
	author = {Ning Tu and Felix J. Herrmann}
}
@presentation {tu2014SINBADind,
	title = {Imaging the Nelson data set using surface-related multiples},
	year = {2014},
	publisher = {SINBAD},
	abstract = {We will present out latest finding on migration with multiples on the Nelson dataset.},
	keywords = {Presentation, SINBAD, SINBADFALL2014, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2014/Fall/tu2014SINBADind/tu2014SINBADind.pdf},
	author = {Ning Tu and Felix J. Herrmann}
}
@presentation {tu2014SINBADsis,
	title = {Sparse inversion simplified},
	year = {2014},
	publisher = {SINBAD},
	abstract = {Implementation of the SPGl1 solver in low-level computer languages such as C or Fortran may sound daunting to many. This talk is tailored for you if you would like to reap benefits from using sparse constraints to regularize your inversion problem, and at the same time want some easy-to-implement algorithm to solve it. We discuss in this talk the linearized Bregman projection method that embraces both ingredients, and show promising applications in fast least-squares imaging and seismic data interpolation problems.},
	keywords = {Presentation, SINBAD, SINBADFALL2014, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2014/Fall/tu2014SINBADsis/tu2014SINBADsis.pdf},
	author = {Ning Tu and Navid Ghadermarzy and Rajiv Kumar and Felix J. Herrmann}
}
@techreport {tschannen2014tdl,
	title = {Time domain least squares migration and dimensionality reduction},
	number = {TR-EOAS-2014-9},
	year = {2014},
	month = {06},
	institution = {UBC},
	abstract = {Least-squares seismic migration (LSM) is a wave equation based linearized inversion problem relying on the minimization of a least-squares misfit function, with respect to the medium perturbation, between recorded and modeled wavefields. Today{\textquoteright}s challenges in Hydrocarbon ex- ploration are to build high resolution images of more and more complicated geological reservoirs, which requires to handle very large systems of equations. The extreme size of the problem com- bined with the fact that it is ill-conditioned make LSM not yet feasible for industrial purposes. To overcome this "curse of dimensionality", dimension reduction and divide-and-conquer tech- niques that aim to decrease the computation time and the required memory, while conserving the image quality, have recently been developed. By borrowing ideas from stochastic optimiza- tion and compressive sensing, the imaging problem is reformulated as an L1-regularized, sparsity promoted LSM. The idea is to take advantage of the compressibility of the model perturbation in the curvelet domain and to work on series of smaller subproblems each involving a small ran- domized subset of data. We try two different subset sampling strategies, artificial randomized simultaneous sources experiments ("supershots") and drawing sequential shots firing at random source locations. These subsets are changed after each subproblem is solved. In both cases we obtain good migration results at significantly reduced computational cost. Application of these methods to a complicated synthetic model yields to encouraging results, underlining the usefulness of sparsity promotion and randomization in time stepping formulation.},
	keywords = {Compressive Sensing, sparsity promotion, Stochastic optimization, Wave equation migration},
	url = {https://slim.gatech.edu/Publications/Public/TechReport/2014/tschannen2014tdl/tschannen2014tdl.pdf},
	author = {Valentin Tschannen and Zhilong Fang and Felix J. Herrmann}
}
@presentation {petrenko2013SINBADaih,
	title = {Accelerating an iterative Helmholtz solver with FPGAs},
	year = {2013},
	publisher = {SINBAD},
	abstract = {Solution of the Helmholtz equation is the main computational burden of full-waveform inversion in the frequency domain. For this task we employ the CARP-CG algorithm (Gordon \& Gordon 2010), an iterative solver that preconditions the original Helmholtz system into an equivalent symmetric positive definite system and then applies the method of conjugate gradients. Forming the matrix for the new system is not necessary as its multiplicative action on a vector is implemented using a series of projections onto the rows of the original system. Our contribution is implementing CARP-CG for a host + accelerator (FPGA) computing environment. The computational paradigm is one of dataflow: vector and matrix elements are streamed from memory through the accelerator which applies the row projections. The advantage of an FPGA to process streams of data is that unless the algorithm is memory bandwidth limited, computation time is directly proportional to the amount of data. The complexity of the algorithm implemented on the FPGA is irrelevant since all the operations programmed onto the FPGA happen in the same clock tick. In contrast, on a CPU, more complex algorithms require more clock ticks as the instructions are executed sequentially, or with only a small amount of parallelism. Ongoing work porting the CARP-CG algorithm to the accelerator is presented.},
	keywords = {Presentation, SINBAD, SINBADFALL2013, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2013/Fall/petrenko2013SINBADaih/petrenko2013SINBADaih.pdf},
	author = {Art Petrenko and Tristan van Leeuwen and Felix J. Herrmann and Diego Oriato and Simon Tilbury}
}
@article {shahidi2013GPars,
	title = {Application of randomized sampling schemes to curvelet-based sparsity-promoting seismic data recovery},
	journal = {Geophysical Prospecting},
	volume = {61},
	number = {5},
	year = {2013},
	month = {09},
	pages = {973-997},
	abstract = {Reconstruction of seismic data is routinely used to improve the quality and resolution of seismic data from incomplete acquired seismic recordings. Curvelet-based Recovery by Sparsity-promoting Inversion, adapted from the recently-developed theory of compressive sensing, is one such kind of reconstruction, especially good for recovery of undersampled seismic data. Like traditional Fourier-based methods, it performs best when used in conjunction with randomized subsampling, which converts aliases from the usual regular periodic subsampling into easy-to-eliminate noise. By virtue of its ability to control gap size, along with the random and irregular nature of its sampling pattern, jittered (sub)sampling is one proven method that has been used successfully for the determination of geophone positions along a seismic line. In this paper, we extend jittered sampling to two-dimensional acquisition design, a more difficult problem, with both underlying Cartesian, and hexagonal grids. We also study what we term separable and non-separable two-dimensional jittered samplings. We find hexagonal jittered sampling performs better than Cartesian jittered sampling, while fully non-separable jittered sampling performs better than separable jittered sampling. Two other 2D randomized sampling methods, Poisson Disk sampling and Farthest Point sampling, both known to possess blue-noise spectra, are also shown to perform well.},
	keywords = {curvelets, Geophysical Prospecting, randomized sampling},
	doi = {10.1111/1365-2478.12050},
	url = {https://slim.gatech.edu/Publications/Public/Journals/GeophysicalProspecting/2013/shahidi2013GPars/shahidi2013GPars.pdf},
	author = {Reza Shahidi and Gang Tang and Jianwei Ma and Felix J. Herrmann}
}
@conference {tu2013SEGcle,
	title = {Controlling linearization errors in $\ell_1$ regularized inversion by rerandomization},
	booktitle = {SEG Technical Program Expanded Abstracts},
	volume = {32},
	year = {2013},
	month = {09},
	pages = {4640-4644},
	abstract = {Linearized inversion is a data fitting procedure that tries to match the observed seismic data with data predicted by linearized modelling. In practice, the observed data is not necessarily in the column space of the linearized modelling operator. This can be caused by lack of an accurate background velocity model or by coherent noises not explained by linearized modelling. Through carefully designed experiments, we ob- serve that a moderate data mismatch does not pose an issue if we can use all the data in the inversion. However, artifacts do arise from the mismatch when randomized dimensionality reduction techniques are adopted to speed up the inversion. To stabilize the inversion for dimensionality reduction with randomized source aggregates, we propose to rerandomize by drawing independent simultaneous sources occasionally during the inversion. The effect of this rerandomization is remarkable because it results in virtually artifact-free images at a cost comparable to a single reverse-time migration. Implications of our method are profound because we are now able to resolve fine-scale steep subsalt features in a computationally feasible manner.},
	keywords = {inversion, message passing, rerandomization, SEG, sparsity},
	doi = {10.1190/segam2013-1302.1},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2013/tu2013SEGcle/tu2013SEGcle.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2013/tu2013SEGcle/tu2013SEGcle_pres.pdf},
	author = {Ning Tu and Xiang Li and Felix J. Herrmann}
}
@presentation {tu2013SINBADrerand,
	title = {Controlling linearization errors with rerandomization},
	year = {2013},
	publisher = {SINBAD},
	abstract = {Least squares migration aims to fit the observed seismic data with data predicted by linearized modelling, by solving an PDE-constrained optimization problem. This problem is challenging mostly because of its prohibitive computational cost. To address the issue, dimensionality reduction techniques were proposed in the literature. However, the solution of the reduced problem can deviate from that of the full problem when there are components in the observed data that cannot be explained by linearized modelling. We solve the problem by rerandomizing our $\ell_1$ regularized inversion. In this presentation, I will explain the method and demonstrate what we can achieve with rerandomization, especially for resolving fine sub-salt structures.},
	keywords = {Presentation, SINBAD, SINBADSPRING2013, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2013/Spring/tu2013SINBADrerand/tu2013SINBADrerand.pdf},
	author = {Ning Tu and Felix J. Herrmann}
}
@presentation {tu2013SINBADvp,
	title = {Fast imaging with multiples and source estimation},
	year = {2013},
	publisher = {SINBAD},
	abstract = {Multiples are usually treated as unwanted components in seismic data. However, if correctly used, they can provide valuable information about the subsurface. In this presentation, I will talk about how to make use of multiples in $\ell_1$ regularized least-squares imaging, and how to estimate the source wavelet on the fly using multiples. Synthetic examples show that using multiples not only helps to retrieve the true-amplitude seismic image and the source wavelet, it also increases the wavenumber contents in the seismic image. By using dimensionality reduction techniques with rerandomization, we also greatly decrease the simulation cost without compromising the image quality.},
	keywords = {Presentation, SINBAD, SINBADSPRING2013, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2013/Spring/tu2013SINBADvp/tu2013SINBADvp.pdf},
	author = {Ning Tu and Aleksandr Y. Aravkin and Tristan van Leeuwen and Felix J. Herrmann}
}
@presentation {tu2013SINBADfim,
	title = {Fast imaging with multiples and source estimation},
	year = {2013},
	publisher = {SINBAD},
	abstract = {During this talk, we present a computationally efficient (cost of 1-2 RTMs with all data) iterative sparsity-promoting inversion framework where surface-related multiples are jointly imaged with primaries and where the source signature is estimated on the fly. Our imaging algorithm is computationally efficient because it works during each iteration with small independent randomized subsets of data. The multiples are handled by introducing an areal source term that includes the upgoing wavefield. We update the source signature for each iteration using a variable projection method. The resulting algorithm removes imaging artifacts from surface-related multiples, estimates and removes the imprint of the source, recovers true amplitudes, is fast, and robust to linearization errors by virtue of the statistical independence of the subsets of data we are working with at each iteration.},
	keywords = {Presentation, SINBAD, SINBADFALL2013, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2013/Fall/tu2013SINBADfim/tu2013SINBADfim.pdf},
	author = {Ning Tu and Felix J. Herrmann}
}
@conference {tu2013EAGElsm,
	title = {Fast least-squares migration with multiples and source estimation},
	booktitle = {EAGE Annual Conference Proceedings},
	year = {2013},
	month = {06},
	abstract = {The advent of modern computing has made it possible to do seismic imaging using least-squares reverse-time migration. We obtain superior images by solving an optimization problem that recovers the true-amplitude images. However, its success hinges on overcoming several issues, including overwhelming problem size, unknown source wavelet, and interfering coherent events like multiples. In this abstract, we reduce the problem size by using ideas from compressive sensing, and estimate source wavelet by generalized variable projection. We also demonstrate how to invert for subsurface information encoded in surface-related multiples by incorporating the free-surface operator as an areal source in reverse-time migration. Our synthetic examples show that multiples help to improve the resolution of the image, as well as remove the amplitude ambiguity in wavelet estimation.},
	keywords = {EAGE, Imaging, multiples, source estimation, sparse},
	doi = {10.3997/2214-4609.20130727},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2013/tu2013EAGElsm/tu2013EAGElsm.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2013/tu2013EAGElsm/tu2013EAGElsm_pres.pdf},
	author = {Ning Tu and Aleksandr Y. Aravkin and Tristan van Leeuwen and Felix J. Herrmann}
}
@conference {herrmann2013EAGEfrtm,
	title = {Fast RTM with multiples and source estimation},
	booktitle = {EAGE/SEG Forum - Turning noise into geological information: The next big step?},
	year = {2013},
	month = {11},
	abstract = {During this talk, we present a computationally efficient (cost of 1-2 RTM{\textquoteright}s with all data) iterative sparsity-promoting inversion framework where surface-related multiples are jointly imaged with primaries and where the source signature is estimated on the fly. Our imaging algorithm is computationally efficient because it works during each iteration with small independent randomized subsets of data. The multiples are handled by introducing an areal source term that includes the upgoing wavefield. We update the source signature for each iteration using a variable projection method. The resulting algorithm removes imaging artifacts from surface-related multiples, estimates and removes the imprint of the source, recovers true amplitudes, is fast, and robust to linearization errors by virtue of the statistical independence of the subsets of data we are working with at each iteration.},
	keywords = {EAGE, multiples, RTM, SEG, source estimation},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2013/herrmann2013EAGEfrtm/herrmann2013EAGEfrtm_pres.pdf},
	author = {Felix J. Herrmann and Ning Tu}
}
@article {herrmann2013TLEffwi,
	title = {Frugal full-waveform inversion: from theory to a practical algorithm},
	journal = {The Leading Edge},
	volume = {32},
	number = {9},
	year = {2013},
	month = {09},
	pages = {1082-1092},
	abstract = {As conventional oil and gas fields are maturing, our profession is challenged to come up with the next-generation of more and more sophisticated exploration tools. In exploration seismology this trend has led to the emergence of wave-equation based inversion technologies such as reverse-time migration and full-waveform inversion. While significant progress has been made in wave-equation based inversion, major challenges remain in the development of robust and computationally feasible workflows that give reliable results in geophysically challenging areas that may include ultra-low shear velocity zones or high-velocity salt. Moreover, sub-salt production carries risks that needs mitigation, which raises the bar from creating sub-salt images to inverting for sub-salt overpressure.},
	keywords = {Optimization, waveform inversion},
	doi = {10.1190/tle32091082.1},
	url = {https://slim.gatech.edu/Publications/Public/Journals/TheLeadingEdge/2013/herrmann2013ffwi/herrmann2013ffwi.html},
	author = {Felix J. Herrmann and Andrew J. Calvert and Ian Hanlon and Mostafa Javanmehri and Rajiv Kumar and Tristan van Leeuwen and Xiang Li and Brendan R. Smithyman and Eric Takam Takougang and Haneet Wason}
}
@conference {tu2013SEGldi,
	title = {Limitations of the deconvolutional imaging condition for two-way propagators},
	booktitle = {SEG Technical Program Expanded Abstracts},
	volume = {32},
	year = {2013},
	month = {09},
	pages = {3916-3920},
	abstract = {The deconvolutional imaging condition has gained wide attention in recent years, as it is often used to image surface-related multiples. However, we noticed on close inspection that this condition was derived from one-way propagation principles. Now that two-way wave-equation based simulations have become more affordable, we revisit the deconvolutional imaging condition and reveal its limitations for two-way propagators. First, it can distort the image due to receiver-side propagation effects. Second, when used to image surface-related multiples, it is not capable of removing all interfering phantom reflectors.},
	keywords = {inversion, migration, multiples, SEG},
	doi = {10.1190/segam2013-1440.1},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2013/tu2013SEGldi/tu2013SEGldi.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2013/tu2013SEGldi/tu2013SEGldi_pres.pdf},
	author = {Ning Tu and Tristan van Leeuwen and Felix J. Herrmann}
}
@presentation {li2013SINBADmsd,
	title = {Model-space versus data-space FWI with the acoustic wave equation},
	year = {2013},
	publisher = {SINBAD},
	abstract = {Inverting data with elastic phases using an acoustic wave equation can lead to erroneous results, especially when the number of iterations is too high, which may lead to over fitting the data. Several approaches have been proposed to address this issue. Most commonly, people data- filtering operations that are aimed to deemphasize the elastic phases in the data in favor of the acoustic phases. Examples of this approach are nested loops over offset range and Laplace parameters. In this presentation, we discuss two complementary optimization-driven methods where the minimization process decides adaptively which of the data or model components are consistent with the objective. Specifically, we compare the s t misfit function as the data-space alternative and curvelet-domain sparsity promotion as the model-space alternative. Application of these two methods to a realistic synthetic lead to comparable results that we believe can be improved by combining these two methods.},
	keywords = {Presentation, SINBAD, SINBADFALL2013, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2013/Fall/li2013SINBADmsd/li2013SINBADmsd.pdf},
	author = {Xiang Li and Anais Tamalet and Tristan van Leeuwen and Felix J. Herrmann}
}
@conference {li2013SEGodmvdaiedwawe,
	title = {Optimization driven model-space versus data-space approaches to invert elastic data with the acoustic wave equation},
	booktitle = {SEG Technical Program Expanded Abstracts},
	volume = {32},
	year = {2013},
	month = {09},
	pages = {986-990},
	abstract = {Inverting data with elastic phases using an acoustic wave equation can lead to erroneous results, especially when the number of iterations is too high, which may lead to over fitting the data. Several approaches have been proposed to address this issue. Most commonly, people apply "data-independent" filtering operations that are aimed to deemphasize the elastic phases in the data in favor of the acoustic phases. Examples of this approach are nested loops over offset range and Laplace parameters. In this paper, we discuss two complementary optimization-driven methods where the minimization process decides adaptively which of the data or model components are consistent with the objective. Specifically, we compare the Student{\textquoteright}s t misfit function as the data-space alternative and curvelet-domain sparsity promotion as the model-space alternative. Application of these two methods to a realistic synthetic lead to comparable results that we believe can be improved by combining these two methods.},
	keywords = {elastic, Full-waveform inversion, least-squares, SEG},
	doi = {10.1190/segam2013-1375.1},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2013/li2013SEGodmvdaiedwawe/li2013SEGodmvdaiedwawe.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2013/li2013SEGodmvdaiedwawe/li2013SEGodmvdaiedwawe_pres.pdf},
	author = {Xiang Li and Anais Tamalet and Tristan van Leeuwen and Felix J. Herrmann}
}
@presentation {tu2013SINBADmachar,
	title = {SLIM{\textquoteright}s findings on the Machar dataset},
	year = {2013},
	publisher = {SINBAD},
	abstract = {By courtesy of BP, we are able to get some hands-on experience imaging seismic data from the Machar field in North Sea. We performed reverse-time migration and sparsity-promoting migration with source-estimation to this dataset (or a cropped section of the dataset in many cases due to computational constraints), and had some interesting findings. In this presentation, we will show some conclusive results we have got, and explain the key techniques in imaging this dataset.},
	keywords = {Presentation, SINBAD, SINBADFALL2013, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2013/Fall/tu2013SINBADmachar/tu2013SINBADmachar.pdf},
	author = {Ning Tu and Felix J. Herrmann}
}
@conference {aravkin2013ICASSPssi,
	title = {Sparse seismic imaging using variable projection},
	booktitle = {ICASSP},
	year = {2013},
	month = {05},
	abstract = {We consider an important class of signal processing problems where the signal of interest is known to be sparse, and can be recovered from data given auxiliary information about how this data was generated. For example, a sparse green{\textquoteright}s function may be recovered from seismic experimental data using sparsity optimization when the source signature is known. Unfortunately, in practice this information is often missing, and must be recovered from data along with the signal using deconvolution techniques. In this paper, we present a novel methodology to simulta- neously solve for the sparse signal and auxiliary parameters using a recently proposed variable projection technique. Our main contribution is to combine variable projection with spar- sity promoting optimization, obtaining an efficient algorithm for large-scale sparse deconvolution problems. We demon- strate the algorithm on a seismic imaging example.},
	keywords = {Imaging, Optimization, sparsity, variable projection},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/ICASSP/2013/aravkin2013ICASSPssi/aravkin2013ICASSPssi.pdf},
	author = {Aleksandr Y. Aravkin and Tristan van Leeuwen and Ning Tu}
}
@presentation {ning2012SINBADfim,
	title = {Fast imaging with multiples},
	year = {2012},
	publisher = {SINBAD},
	abstract = {If correctly used, multiple energy can be mapped to the correct subsurface locations. However, simply applying the cross-correlation imaging condition will introduce non-causal artifacts into the final image. Here we propose an inversion approach to image primaries and multiples simultaneously that yields an artifact-free image. To address the high computational cost associated with inversion, we propose to: i) have the wave-equation solver carry out the multi-dimensional convolutions implicitly, and ii) reduce the number of PDE solves by randomized subsampling. We then propose to improve the overall performance of this algorithm by a process called rerandomization, which helps to cancel the correlation built between model iterate and the subsampling operator. We show the merits of our approach on a number of examples.},
	keywords = {Presentation, SINBAD, SINBADFALL2012, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2012/Fall/ning2012SINBADfim/ning2012SINBADfim_pres.pdf},
	author = {Ning Tu}
}
@presentation {ning2012SINBADSPRINGfim,
	title = {Fast imaging with multiples by sparse inversion},
	year = {2012},
	publisher = {SINBAD},
	keywords = {Presentation, SINBAD, SINBADSPRING2012, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2012/Spring/ning2012SINBADSPRINGfim/ning2012SINBADSPRINGfim_pres.pdf},
	author = {Ning Tu}
}
@conference {herrmann2012SEGfwi,
	title = {FWI from the West Coasts: lessons learned from "Gulf of Mexico Imaging Challenges: What Can Full Waveform Inversion Achieve?"},
	booktitle = {SEG Workshop on FWI; Las Vegas},
	year = {2012},
	publisher = {SEG},
	organization = {SEG},
	keywords = {FWI, SEG, workshop},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2012/herrmann2012SEGfwi/herrmann2012SEGfwi_pres.pdf},
	author = {Andrew J. Calvert and Ian Hanlon and Mostafa Javanmehri and Rajiv Kumar and Tristan van Leeuwen and Xiang Li and Brendan R. Smithyman and Eric Takam Takougang and Haneet Wason and Felix J. Herrmann}
}
@conference {tu2012SEGima,
	title = {Imaging with multiples accelerated by message passing},
	booktitle = {SEG Technical Program Expanded Abstracts},
	volume = {31},
	year = {2012},
	month = {11},
	pages = {1-6},
	publisher = {SEG},
	organization = {SEG},
	abstract = {With the growing realization that multiples can provide valuable information, there is a paradigm shift from removing them to using them. For instance, primary estimation by sparse inversion has demonstrated its superiority over surface-related multiple removal in many aspects. Inspired by this shift, we propose a method to image directly from the total up-going wavefield, including surface-related multiples, by sparse inversion. To address the high computational cost associated with this method, we propose to speed up the inversion by having the wave-equation solver carry out the multi-dimensional convolutions implicitly and cheaply by randomized subsampling. We improve the overall performance of this algorithm by selecting new independent copies of the randomized modeling operator, which leads to a cancellation of correlations that hamper the speed of convergence of the solver. We show the merits of our approach on a number of examples.},
	keywords = {Imaging, multiples, SEG},
	doi = {10.1190/segam2012-1552.1},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2012/tu2012SEGima/tu2012SEGima.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2012/tu2012SEGima/tu2012SEGima_pres.pdf},
	author = {Ning Tu and Felix J. Herrmann}
}
@conference {tu2012EAGElsm,
	title = {Least-squares migration of full wavefield with source encoding},
	booktitle = {EAGE Annual Conference Proceedings},
	year = {2012},
	month = {06},
	abstract = {Multiples can provide valuable information that is missing in primaries, and there is a growing interest in using them for seismic imaging. In our earlier work, we proposed to combine primary estimation and migration to image from the total up-going wavefield. The method proves to be effective but computationally expensive. In this abstract, we propose to reduce the computational cost by removing the multi-dimensional convolution required by primary estimation, and reducing the number of PDE solves in migration by introducing simultaneous sources with source renewal. We gain great performance boost without compromising the quality of the image.},
	keywords = {depth migration, EAGE, surface-related multiples},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2012/tu2012EAGElsm/tu2012EAGElsm.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2012/tu2012EAGElsm/tu2012EAGElsm_pres.pdf},
	url2 = {http://earthdoc.eage.org/publication/publicationdetails/?publication=59688},
	author = {Ning Tu and Felix J. Herrmann}
}
@presentation {herrmann2012SINBADfwi,
	title = {Our findings on the Chevron benchmark dataset},
	year = {2012},
	publisher = {SINBAD},
	abstract = {During this presentation, we will review our findings working with the synthetic GOM data released as part of the post SEG workshop:"Gulf of Mexico Imaging Challenges: What Can Full Waveform Inversion Achieve?". This is joint work with Andrew J. Calvert, Ian Hanlon, Mostafa Javanmehri, Rajiv Kumar, Tristan van Leeuwen, Xiang Li, Brendan R. Smithyman, Eric Takam Takougang, and Haneet Wason.},
	keywords = {Presentation, SINBAD, SINBADFALL2012, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2012/Fall/herrmann2012SINBADfwi/herrmann2012SINBADfwi_pres.pdf},
	author = {Andrew J. Calvert and Ian Hanlon and Mostafa Javanmehri and Rajiv Kumar and Tristan van Leeuwen and Xiang Li and Brendan R. Smithyman and Eric Takam Takougang and Haneet Wason and Felix J. Herrmann}
}
@presentation {tamalet2012SINBADvpe,
	title = {Variance parameters estimation - application to full waveform inversion},
	year = {2012},
	publisher = {SINBAD},
	abstract = {Many inverse problems include nuisance parameters. While not of direct interest, these parameters are required to recover primary parameters. In order to estimate these nuisance parameters as well as the primary parameters in large-scale inverse problems, a method based on variable projection, which consists in projecting out a subset over the variables, has been developed. We present here the application of this method to the problem of variance parameters estimation in multiple datasets, which is an important problem in many areas including geophysics. More precisely, we apply the method to Full Waveform Inversion and demonstrate the improvement in recovery of the model parameters in the case where the variance of the noise increases with the frequency.},
	keywords = {Presentation, SINBAD, SINBADFALL2012, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2012/Fall/tamalet2012SINBADvpe/tamalet2012SINBADvpe_pres.pdf},
	author = {Anais Tamalet}
}
@presentation {ning2011SINBADmsr,
	title = {Migration from surface-related multiples},
	year = {2011},
	publisher = {SINBAD},
	keywords = {Presentation, SINBAD, SINBADFALL2011, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2011/Fall/ning2011SINBADmsr/ning2011SINBADmsr_pres.pdf},
	author = {Ning Tu}
}
@conference {tu2011SEGmult,
	title = {Migration with surface-related multiples from incomplete seismic data},
	booktitle = {SEG Technical Program Expanded Abstracts},
	volume = {30},
	year = {2011},
	month = {09},
	pages = {3222-3227},
	publisher = {SEG},
	organization = {SEG},
	abstract = {Seismic acquisition is confined by limited aperture that leads to finite illumination, which, together with other factors, hinders imaging of subsurface objects in complex geological settings such as salt structures. Conventional processing, including surface-related multiple elimination, further reduces the amount of information we can get from seismic data. With the growing consensus that multiples carry valuable information that is missing from primaries, we are motivated to exploit the extra illumination provided by multiples to image the sub- surface. In earlier research, we proposed such a method by combining primary estimation and sparsity-promoting migration to invert for model perturbations directly from the total up-going wavefield. In this abstract, we focus on a particular case. By exploiting the extra illumination from surface-related multiples, we mitigate the effects caused by migrating from incomplete data with missing sources and missing near-offsets.},
	keywords = {Imaging, Presentation, Processing, SEG},
	doi = {10.1190/1.3627865},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2011/tu11SEGmult/tu11SEGmult.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2011/tu11SEGmult/tu11SEGmult_pres.pdf},
	author = {Ning Tu and Tim T.Y. Lin and Felix J. Herrmann}
}
@conference {tu2011EAGEspmsrm,
	title = {Sparsity-promoting migration with surface-related multiples},
	booktitle = {EAGE Annual Conference Proceedings},
	year = {2011},
	month = {05},
	abstract = {Multiples, especially the surface-related multiples, form a significant part of the total up-going wave- field. If not properly dealt with, they can lead to false reflectors in the final image. So conventionally practitioners remove them prior to migration. Recently research has revealed that multiples can actually provide extra illumination so different methods are proposed to address the issue that how to use multiples in seismic imaging, but with various kinds of limitations. In this abstract, we combine primary estimation and sparsity-promoting migration into one convex-optimization process to include information from multiples. Synthetic examples show that multiples do make active contributions to seismic migration. Also by this combination, we can benefit from better recoveries of the Greens function by using sparsity-promoting algorithms since reflectivity is sparser than the Greens function.},
	keywords = {EAGE, Imaging, Presentation, Processing},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2011/tu11EAGEspmsrm/tu11EAGEspmsrm.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2011/tu11EAGEspmsrm/tu11EAGEspmsrm_pres.pdf},
	url2 = {http://earthdoc.eage.org/publication/publicationdetails/?publication=50369},
	author = {Ning Tu and Tim T.Y. Lin and Felix J. Herrmann}
}
@presentation {tu2010SINBADspm,
	title = {Sparsity promoting migration with surface-related multiples},
	year = {2010},
	publisher = {SINBAD},
	keywords = {Presentation, SINBAD, SINBADFALL2010, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2010/Fall/tu2010SINBADspm/tu2010SINBADspm_pres.pdf},
	author = {Ning Tu}
}
@conference {lin2010SEGspm,
	title = {Sparsity-promoting migration from surface-related multiples},
	booktitle = {SEG Technical Program Expanded Abstracts},
	volume = {29},
	year = {2010},
	month = {10},
	pages = {3333-3337},
	publisher = {SEG},
	organization = {SEG},
	abstract = {Seismic imaging typically begins with the removal of multiple energy in the data, out of fear that it may introduce erroneous structure. However, seismic multiples have effectively seen more of the earth{\textquoteright}s structure, and if treated correctly can potential supply more information to a seismic image compared to primaries. Past approaches to accomplish this leave ample room for improvement; they either require extensive modification to standard migration techniques, rely too much on prior information, require extensive pre-processing, or resort to full-waveform inversion. We take some valuable lessons from these efforts and present a new approach balanced in terms of ease of implementation, robustness, efficiency and well-posedness, involving a sparsity-promoting inversion procedure using standard Born migration and a data-driven multiple modeling approach based on the focal transform.},
	keywords = {Presentation, Processing, SEG},
	doi = {10.1190/1.3513540},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2010/lin10SEGspm/lin10SEGspm.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2010/lin10SEGspm/lin10SEGspm_pres.pdf},
	author = {Tim T.Y. Lin and Ning Tu and Felix J. Herrmann}
}
@conference {herrmann09EAGEbnrs,
	title = {Beating Nyquist by randomized sampling},
	booktitle = {EAGE Annual Conference Proceedings},
	year = {2009},
	note = {Presented at the EAGE (workshop), Amsterdam},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2009/herrmann09EAGEbnrs/herrmann09EAGEbnrs.pdf},
	author = {Felix J. Herrmann and Gang Tang and Reza Shahidi and Gilles Hennenfent and Tim T.Y. Lin}
}
@techreport {tang09TRdtr,
	title = {Design of two-dimensional randomized sampling schemes for curvelet-based sparsity-promoting seismic data recovery},
	number = {TR-EOAS-2009-3},
	year = {2009},
	institution = {UBC Earth and Ocean Sciences Department},
	abstract = {The tasks of sampling, compression and reconstruction are very common and often necessary in seismic data processing due to the large size of seismic data. Curvelet-based Recovery by Sparsity-promoting Inversion, motivated by the newly developed theory of compressive sensing, is among the best recovery strategies for seismic data. The incomplete data input to this curvelet-based recovery is determined by randomized sampling of the original complete data. Unlike usual regular undersampling, randomized sampling can convert aliases to easy-to-eliminate noise, thus facilitating the process of reconstruction of the complete data from the incomplete data. Randomized sampling methods such as jittered sampling have been developed in the past that are suitable for curvelet-based recovery, however most have only been applied to sampling in one dimension. Considering that seismic datasets are usually higher dimensional and extremely large, in the present paper, we extend the 1D version of jittered sampling to two dimensions, both with underlying Cartesian and hexagonal grids. We also study separable and non-separable two dimensional jittered sampling, the former referring to the Kronecker product of two one-dimensional jittered samplings. These different categories of jittered sampling are compared against one another in terms of signal-to-noise ratio and visual quality, from which we find that jittered hexagonal sampling is better than jittered Cartesian sampling, while fully non-separable jittered sampling is better than separable sampling. Because in the image processing and computer graphics literature, sampling patterns with blue-noise spectra are found to be ideal to avoid aliasing, we also introduce two other randomized sampling methods, possessing sampling spectra with beneficial blue noise characteristics, Poisson Disk sampling and Farthest Point sampling. We compare these methods, and apply the introduced sampling methodologies to higher dimensional curvelet-based reconstruction. These sampling schemes are shown to lead to better results from CRSI compared to the other more traditional sampling protocols, e.g. regular subsampling.},
	url = {https://slim.gatech.edu/Publications/Public/Journals/2009/tang09TRdtr/tang09TRdtr.pdf},
	author = {Gang Tang and Reza Shahidi and Jianwei Ma}
}
@conference {tang2009SEGhdb,
	title = {Higher dimensional blue-noise sampling schemes for curvelet-based seismic data recovery},
	booktitle = {SEG Technical Program Expanded Abstracts},
	volume = {28},
	year = {2009},
	month = {10},
	pages = {191-195},
	publisher = {SEG},
	organization = {SEG},
	abstract = {In combination with compressive sensing, a successful reconstruction scheme called Curvelet-based Recovery by Sparsity-promoting Inversion (CRSI) has been developed, and has proven to be useful for seismic data processing. One of the most important issues for CRSI is the sampling scheme, which can greatly affect the quality of reconstruction. Unlike usual regular undersampling, stochastic sampling can convert aliases to easy-to-eliminate noise. Some stochastic sampling methods have been developed for CRSI, e.g. jittered sampling, however most have only been applied to 1D sampling along a line. Seismic datasets are usually higher dimensional and very large, thus it is desirable and often necessary to develop higher dimensional sampling methods to deal with these data. For dimensions higher than one, few results have been reported, except uniform random sampling, which does not perform well. In the present paper, we explore 2D sampling methodologies for curvelet-based reconstruction, possessing sampling spectra with blue noise characteristics, such as Poisson Disk sampling, Farthest Point Sampling, and the 2D extension of jittered sampling. These sampling methods are shown to lead to better recovery and results are compared to the other more traditional sampling protocols.},
	keywords = {Presentation, SEG},
	doi = {10.1190/1.3255230},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2009/tang09SEGhdb/tang09SEGhdb.pdf},
	author = {Gang Tang and Reza Shahidi and Felix J. Herrmann and Jianwei Ma}
}
@article {tang2008CITEocs,
	title = {Optimized Compressed Sensing for Curvelet-based Seismic Data Reconstruction},
	journal = {CiteSeer},
	year = {2008},
	abstract = {Compressed sensing (CS) or compressive sampling provides a new sampling theory to reduce data acquisition, which says that compressible signals can be exactly reconstructed from highly incomplete sets of measurements. Very recently, the CS has been applied for seismic exploration and started to compact the traditional data acquisition. In this paper, we present an optimized sampling strategy for the CS data acquisition, which leads to better performance by the curvelet sparsity-promoting inversion in comparison with random sampling and jittered sampling scheme. One of motivation is to reduce the mutual coherence between measurement sampling schemes and curvelet sparse transform in the CS framework. The basic idea of our optimization is to directly redistribute the energy in frequency domain making original spectrum easily discriminated from the random noise induced by random undersampling, while offering control on the maximum gap size. Numerical experiments on synthetic and real seismic data show good performances of the proposed optimized CS for seismic data reconstruction.},
	keywords = {curvelet transform, Optimized Compressive Sensing},
	url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.154.7994},
	url2 = {http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.154.7994\&rep=rep1\&type=pdf},
	author = {Wen Tang and Jianwei Ma and Felix J. Herrmann}
}
@article {friedlander2007SJOero,
	title = {Exact regularization of convex programs},
	journal = {SIAM Journal on Optimization},
	volume = {18},
	number = {4},
	year = {2007},
	month = {05},
	pages = {1326-1350},
	abstract = {The regularization of a convex program is exact if all solutions of the regularized problem are also solutions of the original problem for all values of the regularization parameter below some positive threshold. For a general convex program, we show that the regularization is exact if and only if a certain selection problem has a Lagrange multiplier. Moreover, the regularization parameter threshold is inversely related to the Lagrange multiplier. We use this result to generalize an exact regularization result of Ferris and Mangasarian [Appl. Math. Optim., 23(1991), pp. 266{\textendash}273] involving a linearized selection problem. We also use it to derive necessary and sufficient conditions for exact penalization, similar to those obtained by Bertsekas [Math. Programming, 9(1975), pp. 87{\textendash}99] and by Bertsekas, Nedi , Ozdaglar [Convex Analysis and Optimization, Athena Scientific, Belmont, MA, 2003]. When the regularization is not exact, we derive error bounds on the distance from the regularized solution to the original solution set. We also show that existence of a {\textquoteleft}{\textquoteleft}weak sharp minimum{\textquoteright}{\textquoteright} is in some sense close to being necessary for exact regularization. We illustrate the main result with numerical experiments on the l1 regularization of benchmark (degenerate) linear programs and semidefinite/second-order cone programs. The experiments demonstrate the usefulness of l1 regularization in finding sparse solutions.},
	keywords = {Optimization, SLIM},
	doi = {10.1137/060675320},
	author = {Michael P. Friedlander and P. Tseng}
}
@conference {thomson2006SINBADlss,
	title = {Large-scale seismic data recovery by the parallel windowed curvelet transform},
	booktitle = {SINBAD 2006},
	year = {2006},
	abstract = {We propose using overlapping, tapered windows to process seismic data in parallel. This method consists of numerically tight linear operators and adjoints that are suitable for use in iterative algorithms. This method is also highly scalable and makes parallelprocessing of large seismic data sets feasible. We use this scheme to define the Parallel Windowed Fast Discrete Curvelet Transform (PWFDCT), which we have applied to a seismic data interpolation algorithm. Some preliminary results will be shown. Henryk Modzeleweski: Design and specifications for SLIMPy{\textquoteright}s software framework The SLIM group is actively developing software for seismic imaging. This talk will give a general overview of the software development philosophy adopted by SLIM. The covered topics will include: 1) adopting Python for object-oriented programming, 2) including parallelism into the algorithms used in seismic imaging/modeling, 3) in-house algorithms for seismic imaging, and 4) contributions to Madagascar (RSF). The talk will serve as an introduction to the other presentations in the session "SINBAD Software releases".},
	keywords = {Presentation, SINBAD, SLIM},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2006/thomson2006SINBADlss/thomson2006SINBADlss.pdf},
	author = {Darren Thomson}
}
@conference {thomson2006SEGpwfd,
	title = {A parallel windowed fast discrete curvelet transform applied to seismic processing},
	booktitle = {SEG Technical Program Expanded Abstracts},
	volume = {25},
	year = {2006},
	pages = {2767-2771},
	publisher = {SEG},
	organization = {SEG},
	abstract = {We propose using overlapping, tapered windows to process seismic data in parallel. This method consists of numerically tight linear oper ators and adjoints that are suitable for use in iterative algorithms. This method is also highly scalable and makes parallel processing of large seismic data sets feasible. We use this scheme to define the Parallel Windowed Fast Discrete Curvelet Transform (PWFDCT), which we apply to a seismic data interpolation algorithm. The successful performance of our parallel processing scheme and algorithm on a two-dimensional synthetic data is shown.},
	keywords = {SEG},
	doi = {10.1190/1.2370099},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2006/thomson06SEGpwfd/thomson06SEGpwfd.pdf},
	author = {Darren Thomson and Gilles Hennenfent and Henryk Modzelewski and Felix J. Herrmann}
}
@conference {thomson2006SINBADppe,
	title = {(P)SLIMPy: parallel extension},
	booktitle = {SINBAD 2006},
	year = {2006},
	abstract = {The parallel extensions to the SLIMpy environment enable pipe-based processing of large data sets in an MPI-based parallel environment. Parallel processing can be done by straightforward slicing of data, or by using an overlapping domain decomposition that requires communication between different processors. The principal aim of the parallel extensions is to leave abstract numerical algorithms (ANA{\textquoteright}s) and applications programmed for use in SLIMpy untouched when moving to parallel processing. The object-oriented functionality of Python makes this possible.},
	keywords = {Presentation, SINBAD, SLIM},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2006/thomson2006SINBADppe/thomson2006SINBADppe.pdf},
	author = {Darren Thomson}
}
@conference {yarham2004CSEGcpa,
	title = {Curvelet processing and imaging: adaptive ground roll removal},
	booktitle = {CSEG Annual Conference Proceedings},
	year = {2004},
	month = {05},
	publisher = {CSEG},
	organization = {CSEG},
	abstract = {In this paper we present examples of ground roll attenuation for synthetic and real data gathers by using Contourlet and Curvelet transforms. These non-separable wavelet transforms are locoalized both (x,t)- and (k,f)-domains and allow for adaptive seperation of signal and ground roll. Both linear and non-linear filtering are discussed using the unique properties of these basis that allow for simultaneous localization in the both domains. Eventhough, the linear filtering techniques are encouraging the true added value of these basis-function techniques becomes apparent when we use these decompositions to adaptively substract modeled ground roll from data using a non-linear thesholding procedure. We show real and synthetic examples and the results suggest that these directional-selective basis functions provide a usefull tool for the removal of coherent noise such as ground roll.},
	keywords = {CSEG, Presentation, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/CSEG/2004/Yarham04CSEGcpa/yarham04csegcpa.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/CSEG/2004/Yarham04CSEGcpa/Yarham04CSEGcpa_pres.pdf},
	author = {Carson Yarham and Daniel Trad and Felix J. Herrmann}
}
@conference {yarham2004CSEGgrr,
	title = {Ground roll removal using non-separable wavelet transforms},
	booktitle = {CSEG Annual Conference Proceedings},
	year = {2004},
	keywords = {Presentation},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/CSEG/2004/Yarham04CSEGgrr/Yarham04CSEGgrr.pdf},
	author = {Carson Yarham and Felix J. Herrmann and Daniel Trad}
}
