@presentation {kumar2017SINBADFfas,
	title = {Full-azimuth seismic data processing w/ coil acquisition},
	year = {2017},
	publisher = {SINBAD},
	abstract = {In this work, we will demonstrate the performance of our in-house 5D low-rank based interpolation method on a seismic data acquired using coil shooting full-azimuth acquisition. We will show that we can recover full-azimuthal interpolated data from highly subsampled data, where the subsampling ratio is 4\%. This is the first time, we are testing our interpolation ideas on real 3D marine seismic data acquisition. Our findings show that we can avoid the general practice of windowing the data while performing the interpolation, specially using rank-minimization based framework.},
	keywords = {Presentation, SINBAD, SINBADFALL2017, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2017/Fall/kumar2017SINBADFfas/kumar2017SINBADFfas.pdf},
	url2 = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2017/Fall/kumar2017SINBADFfas/kumar2017SINBADFfas.mov},
	author = {Rajiv Kumar and Nick Moldoveanu and Keegan Lensink 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}
}
@presentation {herrmann2015SINBADfom,
	title = {Fast {\textquotedblleft}online{\textquotedblright} migration with Compressive Sensing},
	year = {2015},
	publisher = {SINBAD},
	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 = {Presentation, SINBAD, SINBADSPRING2015, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2015/Spring/herrmann2015SINBADfom/herrmann2015SINBADfom.pdf},
	author = {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}
}
@presentation {miao2013SINBADfid,
	title = {Fast imaging via depth stepping with the two-way wave equation},
	year = {2013},
	publisher = {SINBAD},
	abstract = {In this presentation we propose a fast imaging algorithm via depth stepping with the two-way wave equation. Within the framework of survey sinking, a stabilized depth extrapolation operator is computed using a spectral projector which can efficiently split evanescent wave components. The computation of the spectral projector features with an Hierarchically Semi-Seperable (HSS) matrix representation speeded up polynomial recursion, resulting in an accleration from cubic numerical complexity to linear numerical complexity.},
	keywords = {Presentation, SINBAD, SINBADFALL2013, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2013/Fall/miao2013SINBADfid/miao2013SINBADfid.pdf},
	author = {Lina Miao 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}
}
@presentation {herrmann2013SINBADffwi,
	title = {Frugal FWI},
	year = {2013},
	publisher = {SINBAD},
	abstract = {Seismic waveform inversion aims at obtaining detailed estimates of subsurface medium parameters, such as soundspeed, from seismic data. A formulation in the frequency-domain leads to an optimization problem constrained by a Helmholtz equation with many right-hand sides. Application of this technique in 3D precludes the use of factorization techniques to solve the Helmholtz equation due the large number of gridpoints and the bandwidth of the matrix. While many sophisticated pre-conditioned iterative techniques have been developed for the Helmholtz equation, they often include model-specific tuning parameters and are thus not very attractive for inversion since the medium parameters change from one iteration to the next. In this paper, we propose a method for 3D seismic waveform inversion that addresses both the need to efficiently solve the Helmholtz equation as well as the computational cost induced by the many right-hand sides. To solve the Helmholtz equation, we consider a simple generic preconditioned iterative method (CARP-CG) that is well-suited for inversion because of its robustness. We extend this method to a block-iterative method that can efficiently handle multiple right-hand sides. To reduce the computational cost of of the overall optimization procedure, we use recently proposed techniques from stochastic optimization that allow us to work with approximate gradient information. These approximations are obtained by evaluating only a small portion of the right-hand sides and/or by solving the PDE approximately. We propose heuristics to adaptively determine the required accuracy of the PDE solves and the sample-size and illustrate the algorithms on synthetic benchmark models. This is joint work with Tristan van Leeuwen.},
	keywords = {Presentation, SINBAD, SINBADFALL2013, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2013/Fall/herrmann2013SINBADffwi/herrmann2013SINBADffwi.pdf},
	author = {Felix J. Herrmann}
}
@presentation {herrmann2013SINBADfwi,
	title = {Frugal FWI},
	year = {2013},
	publisher = {SINBAD},
	abstract = {Seismic waveform inversion aims at obtaining detailed estimates of subsurface medium parameters, such as soundspeed, from seismic data. A formulation in the frequency-domain leads to an optimization problem constrained by a Helmholtz equation with many right-hand- sides. Application of this technique in 3D precludes the use of factorization techniques to solve the Helmholtz equation due the large number of gridpoints and the bandwidth of the matrix. While many sophisticated pre-conditioned iterative techniques have been developed for the Helmholtz equation, they often include model-specific tuning parameters and are thus not very attractive for inversion since the medium parameters change from one iteration to the next. In this paper, we propose a method for 3D seismic waveform inversion that addresses both the need to efficiently solve the Helmholtz equation as well as the computational cost induced by the many right-hand-sides. To solve the Helmholtz equation, we consider a simple generic preconditioned iterative method (CARP-CG) that is well-suited for inversion because of its robustness. We extend this method to a block-iterative method that can efficiently handle multiple right-hand sides. To reduce the computational cost of of the overall optimization procedure, we use recently proposed techniques from stochastic optimization that allow us to work with approximate gradient information. These approximations are obtained by evaluating only a small portion of the right-hand sides and/or by solving the PDE approximately. We propose heuristics to adaptively determine the required accuracy of the PDE solves and the sample-size and illustrate the algorithms on synthetic benchmark models. This is joint work with Tristan van Leeuwen.},
	keywords = {Presentation, SINBAD, SINBADSPRING2013, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2013/Spring/herrmann2013SINBADfwi/herrmann2013SINBADfwi.pdf},
	author = {Felix J. Herrmann}
}
@presentation {xiang2012SINBADfgn,
	title = {Fast Gauss-Newton full-waveform inversion with sparsity regularization},
	year = {2012},
	publisher = {SINBAD},
	abstract = {Full-waveform inversion (FWI) can be considered as a controlled data fitting process, in which we approximately fit observed data by iteratively updating the initial velocity model, we expect the final model can reveal subsurface structure till the wavefield misfit can converge to designed tolerance. The conventional FWI approach is expensive since it requires the inversion of a linear system, which involves extremely large multi-experiment data volumes. To overcome this issue we percent a curvetlet based sparsity-promoting Gauss-Newton inversion method. In this presentation we invert for the model updates by replacing the normal Gauss-Newton linearized subproblem for subsampled FWI with a sparsity promoting FWI formulation. We speed up the algorithm and avoid over fitting the data by solving the problem approximately. Aside from this, we control wavefield dispersion by gradually increasing grid size as we move to higher frequencies. Our approach is successful because it reduces the size of seismic data volumes without loss of information. With this reduction, we can compute a Newton-like update with the reduced data volume at the cost of roughly one gradient update for the fully sampled wavefield.},
	keywords = {Presentation, SINBAD, SINBADFALL2012, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2012/Fall/xiang2012SINBADfgn/xiang2012SINBADfgn_pres.pdf},
	author = {Xiang Li}
}
@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}
}
@presentation {herrmann2012SINBADals,
	title = {Fast sparsity-promoting imaging with message passing},
	year = {2012},
	publisher = {SINBAD},
	abstract = {To meet current-day challenges, exploration seismology increasingly relies on more and more sophisticated algorithms that require multiple paths through all data. This requirement leads to problems because the size of seismic data volumes is increasing exponentially, exposing bottlenecks in IO and computational capability. To overcome these bottlenecks, we follow recent trends in machine learning and compressive sensing by proposing a sparsity-promoting inversion technique that works on small randomized subsets of data only. We boost the performance of this algorithm significantly by modifying a state-of-the-art l1-norm solver to benefit from message passing, which breaks the build up of correlations between model iterates and the randomized linear forward model. We demonstrate the performance of this algorithm on a toy sparse-recovery problem and on a realistic reverse-time-migration example with random source encoding. The improvements in speed, memory use, and output quality are truly remarkable.},
	keywords = {Presentation, SINBAD, SINBADFALL2012, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2012/Fall/herrmann2012SINBADals/herrmann2012SINBADals_pres.pdf},
	author = {Felix J. Herrmann}
}
@presentation {peters2012SINBADfde,
	title = {Frequency domain 3D elastic wave propagation in general anisotropic media},
	year = {2012},
	publisher = {SINBAD},
	abstract = {Elastic wave propagation in 3 spatial dimensions is modeled using a wave equation containing the full stiffness tensor consisting of 21 independent components. This allows modeling in general anisotropic media. The wave equation is discretized on several Cartesian and rotated Cartesian staggered finite-difference grids (using a 2nd order approximation). The grids are linearly combined and, in combination with a antilumped mass strategy, minimize numerical dispersion while requiring a low number of grid points per wavelength. In case not all 21 components need to be modeled, an approximation of the stiffness tensor can be used (e.g., orthorhombic anisotropy, TTI, ...). This results in a linear system of equations, which is solved using an iterative method. The modeling of all 21 components of the stiffness tensor (or an approximation) enables the development of new waveform inversion functionalities.},
	keywords = {Presentation, SINBAD, SINBADFALL2012, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2012/Fall/peters2012SINBADfde/peters2012SINBADfde_pres.pdf},
	author = {Bas Peters}
}
@presentation {vanleeuwen2011SINBADfwi,
	title = {Fast waveform inversion without source encoding},
	year = {2011},
	publisher = {SINBAD},
	keywords = {Presentation, SINBAD, SINBADFALL2011, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2011/Fall/vanleeuwen2011SINBADfwi/vanleeuwen2011SINBADfwi_pres.pdf},
	author = {Tristan van Leeuwen}
}
@conference {li2011EAGEfwirr,
	title = {Full-waveform inversion with randomized L1 recovery for the model updates},
	booktitle = {EAGE Annual Conference Proceedings},
	year = {2011},
	month = {05},
	abstract = {Full-waveform inversion (FWI) is a data fitting procedure that relies on the collection of seismic data volumes and sophisticated computing to create high-resolution results. With the advent of FWI, the improvements in acquisition and inversion have been substantial, but these improvements come at a high cost because FWI involves extremely large multi-experiment data volumes. The main obstacle is the "curse of dimensionality" exemplified by Nyquist{\~O}s sampling criterion, which puts a disproportionate strain on current acquisition and processing systems as the size and desired resolution increases. In this paper, we address the "curse of dimensionality" by randomized dimensionality reduction of the FWI problem adapted from the field of CS. We invert for model updates by replacing the Gauss-Newton linearized subproblem for subsampled FWI with a sparsity promoting formulation, and solve this formulation using the SPGl1 algorithm. We speed up the algorithm and avoid overfitting the data by solving for the linearized updates only approximately. Our approach is successful because it reduces the size of seismic data volumes without loss of information. With this reduction, we can compute a Newton-like update with the reduced data volume at the cost of roughly one gradient update for the fully sampled wavefield.},
	keywords = {EAGE, Full-waveform inversion, Presentation},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2011/li11EAGEfwirr/li11EAGEfwirr.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2011/li11EAGEfwirr/li11EAGEfwirr_pres.pdf},
	url2 = {http://earthdoc.eage.org/publication/publicationdetails/?publication=50345},
	author = {Xiang Li and Aleksandr Y. Aravkin and Tristan van Leeuwen and Felix J. Herrmann}
}
@conference {li2010SEGfwi,
	title = {Full-waveform inversion from compressively recovered model updates},
	booktitle = {SEG Technical Program Expanded Abstracts},
	volume = {29},
	year = {2010},
	month = {10},
	pages = {1029-1033},
	publisher = {SEG},
	organization = {SEG},
	abstract = {Full-waveform inversion relies on the collection of large multi-experiment data volumes in combination with a sophisticated back-end to create high-fidelity inversion results. While improvements in acquisition and inversion have been extremely successful, the current trend of incessantly pushing for higher quality models in increasingly complicated regions of the Earth reveals fundamental shortcomings in our ability to handle increasing problem size numerically. Two main culprits can be identified. First, there is the so-called {\textquoteleft}{\textquoteleft}curse of dimensionality{\textquoteright}{\textquoteright} exemplified by Nyquist{\textquoteright}s sampling criterion, which puts disproportionate strain on current acquisition and processing systems as the size and desired resolution increases. Secondly, there is the recent {\textquoteleft}{\textquoteleft}departure from Moore{\textquoteright}s law{\textquoteright}{\textquoteright} that forces us to lower our expectations to compute ourselves out of this. In this paper, we address this situation by randomized dimensionality reduction, which we adapt from the field of compressive sensing. In this approach, we combine deliberate randomized subsampling with structure-exploiting transform-domain sparsity promotion. Our approach is successful because it reduces the size of seismic data volumes without loss of information. With this reduction, we compute Newton-like updates at the cost of roughly one gradient update for the fully-sampled wavefield.},
	keywords = {Full-waveform inversion, Presentation, SEG},
	doi = {10.1190/1.3513022},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2010/li10SEGfwi/li10SEGfwi.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2010/li10SEGfwi/li10SEGfwi_pres.pdf},
	author = {Xiang Li and Felix J. Herrmann}
}
@presentation {li2010SINBADfwi,
	title = {Full-waveform inversion with randomized L1 recovery for the model updates},
	year = {2010},
	publisher = {SINBAD},
	keywords = {Presentation, SINBAD, SINBADFALL2010, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2010/Fall/li2010SINBADfwi/li2010SINBADfwi_pres.pdf},
	author = {Xiang Li}
}
@conference {herrmann2007SINBADfrw,
	title = {Focused recovery with the curvelet transform},
	booktitle = {SINBAD 2007},
	year = {2007},
	abstract = {Incomplete data represents a major challenge for a successful prediction and subsequent removal of multiples. In this paper, a new method will be represented that tackles this challenge in a two-step approach. During the first step, the recently developed curvelet-based recovery by sparsity-promoting inversion (CRSI) is applied to the data, followed by a prediction of the primaries. During the second high-resolution step, the estimated primaries are used to improve the frequency content of the recovered data by combining the focal transform, defined in terms of the estimated primaries, with the curvelet transform. This focused curvelet transform leads to an improved recovery, which can subsequently be used as input for a second stage of multiple prediction and primary-multiple separation. This is joint work with Deli Wang and Gilles Hennenfent.},
	keywords = {Presentation, SINBAD, SLIM},
	presentation = {https://slim.gatech.edu/sites/data/Papers/Herrmann2007SINBADfoc.pdf},
	author = {Felix J. Herrmann}
}
