@article {witte2019TPDedas,
	title = {An Event-Driven Approach to Serverless Seismic Imaging in the Cloud},
	journal = {IEEE Transactions on Parallel and Distributed Systems},
	volume = {31},
	number = {9},
	year = {2020},
	note = {(IEEE Transactions on Parallel and Distributed Systems)},
	month = {03},
	pages = {2032-2049},
	abstract = {Adapting the cloud for high-performance computing (HPC) is a challenging task, as software for HPC applications hinges on fast network connections and is sensitive to hardware failures. Using cloud infrastructure to recreate conventional HPC clusters is therefore in many cases an infeasible solution for migrating HPC applications to the cloud. As an alternative to the generic lift and shift approach, we consider the specific application of seismic imaging and demonstrate a serverless and event-driven pproach for running large-scale instances of this problem in the cloud. Instead of permanently running compute instances, our workflow is based on a serverless architecture with high throughput batch computing and event-driven computations, in which computational resources are only running as long as they are utilized. We demonstrate that this approach is very flexible and allows for resilient and nested levels of parallelization, including domain decomposition for solving the underlying partial differential equations. While the event-driven approach introduces some overhead as computational resources are repeatedly restarted, it inherently provides resilience to instance shut-downs and allows a significant reduction of cost by avoiding idle instances, thus making the cloud a viable alternative to on-premise clusters for large-scale seismic imaging.},
	keywords = {cloud, event-driven, Imaging, LSRTM, serverless},
	doi = {10.1109/TPDS.2020.2982626},
	url = {https://slim.gatech.edu/Publications/Public/Journals/IEEETPDS/2020/witte2019TPDedas/witte2019TPDedas.html},
	author = {Philipp A. Witte and Mathias Louboutin and Henryk Modzelewski and Charles Jones and James Selvage and Felix J. Herrmann}
}
@article {vanleeuwen2015GPWEMVA,
	title = {Enabling affordable omnidirectional subsurface extended image volumes via probing},
	journal = {Geophysical Prospecting},
	volume = {65},
	number = {2},
	year = {2017},
	note = {(Geophysical Prospecting)},
	month = {03},
	pages = {385-406},
	abstract = {Image gathers as a function of subsurface offset are an important tool for the inference of rock properties and velocity analysis in areas of complex geology. Traditionally, these gathers are thought of as multidimensional correlations of the source and receiver wavefields. The bottleneck in computing these gathers lies in the fact that one needs to store, compute, and correlate these wavefields for all shots in order to obtain the desired image gathers. Therefore, the image gathers are typically only computed for a limited number of subsurface points and for a limited range of subsurface offsets, which may cause problems in complex geological areas with large geologic dips. We overcome increasing computational and storage costs of extended image volumes by introducing a formulation that avoids explicit storage and removes the customary and expensive loop over shots found in conventional extended imaging. As a result, we end up with a matrix{\textendash}vector formulation from which different image gathers can be formed and with which amplitude-versus-angle and wave-equation migration velocity analysis can be performed without requiring prior information on the geologic dips. Aside from demonstrating the formation of two-way extended image gathers for different purposes and at greatly reduced costs, we also present a new approach to conduct automatic wave-equation-based migration-velocity analysis. Instead of focusing in particular offset directions and preselected subsets of subsurface points, our method focuses every subsurface point for all subsurface offset directions using a randomized probing technique. As a consequence, we obtain good velocity models at low cost for complex models without the need to provide information on the geologic dips.},
	keywords = {AVA, migration velocity analysis, Stochastic optimization},
	doi = {10.1111/1365-2478.12418},
	url = {https://slim.gatech.edu/Publications/Public/Journals/GeophysicalProspecting/2016/vanleeuwen2015GPWEMVA/vanleeuwen2015GPWEMVA.pdf},
	author = {Tristan van Leeuwen and Rajiv Kumar and Felix J. Herrmann}
}
@article {lin2015scatterEPSI,
	title = {Estimation of primaries by sparse inversion with scattering-based multiple predictions for data with large gaps},
	journal = {Geophysics},
	volume = {81},
	number = {3},
	year = {2016},
	note = {(Geophysics)},
	month = {05},
	pages = {V183-V197},
	abstract = {We propose to solve the Estimation of Primaries by Sparse Inversion problem without any explicit data reconstruction, from a seismic record with missing near-offsets and large holes in the acquisition grid which does not produce aliasing but otherwise causes large errors in the multiple prediction. Exclusion of the unknown data as an inversion variable from the process is desirable, since it sidesteps possible issues arising from fitting observations that are also unknowns in the same inversion problem. Instead, we simulate their multiple contributions by augmenting the forward prediction model for the total wavefield with a scattering series that mimics the action of the free surface reflector within the confines of the unobserved trace locations. Each term in this scattering series simply involves convolution of the predicted wavefield once more with the current estimated surface-free Green{\textquoteright}s function at these unobserved locations. We investigate the necessary modifications to the primary estimation algorithm to account for the resulting nonlinearity in the modeling operator, and also demonstrate that just a few scattering terms are enough to satisfactorily mitigate the effects of near-offset data gaps during the inversion process. Numerical experiments on synthetic data show that the final derived method can significantly outperform explicit data reconstruction for large near-offset gaps. This is achieved with a similar computational cost and better memory efficiency compared to explicit data reconstruction. We also show on real data that our scheme outperforms pre-interpolation of the near-offset gap.},
	keywords = {EPSI, multiples, Optimization, REPSI, scattering, sparsity},
	doi = {10.1190/geo2015-0263.1},
	url = {https://slim.gatech.edu/Publications/Public/Journals/Geophysics/2016/lin2015scatterEPSI/lin2015scatterEPSI.html},
	author = {Tim T.Y. Lin and Felix J. Herrmann}
}
@article {kumar2014GEOPemc,
	title = {Efficient matrix completion for seismic data reconstruction},
	journal = {Geophysics},
	volume = {80},
	number = {5},
	year = {2015},
	note = {(Geophysics)},
	month = {09},
	pages = {V97-V114},
	abstract = {Despite recent developments in improved acquisition, seismic data often remain undersampled along source and receiver coordinates, resulting in incomplete data for key applications such as migration and multiple prediction. We have interpreted the missing-trace interpolation problem in the context of matrix completion (MC), and developed three practical principles for using low-rank optimization techniques to recover seismic data. Specifically, we strive for recovery scenarios wherein the original signal is low rank and the subsampling scheme increases the singular values of the matrix. We use an optimization program that restores this low-rank structure to recover the full volume. Omitting one or more of these principles can lead to poor interpolation results, as we found experimentally. In light of this theory, we compensate for the high-rank behavior of data in the source-receiver domain by using the midpoint-offset transformation for 2D data and a source-receiver permutation for 3D data to reduce the overall singular values. Simultaneously, to work with computationally feasible algorithms for large-scale data, we use a factorization-based approach to MC, which significantly speeds up the computations compared with repeated singular value decompositions without reducing the recovery quality. In the context of our theory and experiments, we also find that windowing the data too aggressively can have adverse effects on the recovery quality. To overcome this problem, we carried out our interpolations for each frequency independently while working with the entire frequency slice. The result is a computationally efficient, theoretically motivated framework for interpolating missing-trace data. Our tests on realistic 2D and 3D seismic data sets show that our method compares favorably in terms of computational speed and recovery quality with existing curvelet- and tensor-based techniques.},
	keywords = {2D, 3D, algorithm, interpolation, low-rank, signal processing},
	doi = {10.1190/geo2014-0369.1},
	url = {https://slim.gatech.edu/Publications/Public/Journals/Geophysics/2015/kumar2014GEOPemc/kumar2014GEOPemc.pdf},
	url2 = {http://library.seg.org/doi/abs/10.1190/geo2014-0369.1},
	author = {Rajiv Kumar and Curt Da Silva and Okan Akalin and Aleksandr Y. Aravkin and Hassan Mansour and Ben Recht and Felix J. Herrmann}
}
@article {haber10TRemp,
	title = {An effective method for parameter estimation with PDE constraints with multiple right hand sides},
	journal = {SIAM Journal on Optimization},
	volume = {22},
	number = {3},
	year = {2012},
	month = {07},
	abstract = {Often, parameter estimation problems of parameter-dependent PDEs involve multiple right-hand sides. The computational cost and memory requirements of such problems increase linearly with the number of right-hand sides. For many applications this is the main bottleneck of the computation. In this paper we show that problems with multiple right-hand sides can be reformulated as stochastic programming problems by combining the right-hand sides into a few {\quotedblbase}simultaneous{\textquotedblright} sources. This effectively reduces the cost of the forward problem and results in problems that are much cheaper to solve. We discuss two solution methodologies: namely sample average approximation and stochastic approximation. To illustrate the effectiveness of our approach we present two model problems, direct current resistivity and seismic tomography.},
	keywords = {FWI, Optimization, SLIM},
	url = {http://dx.doi.org/10.1137/11081126X},
	author = {Eldad Haber and Matthias Chung and Felix J. Herrmann}
}
@article {herrmann11GPelsqIm,
	title = {Efficient least-squares imaging with sparsity promotion and compressive sensing},
	journal = {Geophysical Prospecting},
	volume = {60},
	number = {4},
	year = {2012},
	month = {07},
	pages = {696-712},
	address = {University of British Columbia, Vancouver},
	abstract = {Seismic imaging is a linearized inversion problem relying on the minimization of a least-squares misfit functional as a function of the medium perturbation. The success of this procedure hinges on our ability to handle large systems of equations{\textendash}-whose size grows exponentially with the demand for higher resolution images in more and more complicated areas{\textendash}-and our ability to invert these systems given a limited amount of computational resources. To overcome this "curse of dimensionality" in problem size and computational complexity, we propose a combination of randomized dimensionality-reduction and divide-and-conquer techniques. This approach allows us to take advantage of sophisticated sparsity-promoting solvers that work on a series of smaller subproblems each involving a small randomized subset of data. These subsets correspond to artificial simultaneous-source experiments made of random superpositions of sequential-source experiments. By changing these subsets after each subproblem is solved, we are able to attain an inversion quality that is competitive while requiring fewer computational, and possibly, fewer acquisition resources. Application of this concept to a controlled series of experiments showed the validity of our approach and the relationship between its efficiency{\textendash}-by reducing the number of sources and hence the number of wave-equation solves{\textendash}-and the image quality. Application of our dimensionality-reduction methodology with sparsity promotion to a complicated synthetic with well-log constrained structure also yields excellent results underlining the importance of sparsity promotion.},
	keywords = {Compressive Sensing, Imaging, Optimization, SLIM},
	doi = {10.1111/j.1365-2478.2011.01041.x},
	url = {https://slim.gatech.edu/Publications/Public/Journals/GeophysicalProspecting/2012/herrmann11GPelsqIm/herrmann11GPelsqIm.pdf},
	url2 = {http://onlinelibrary.wiley.com/doi/10.1111/j.1365-2478.2011.01041.x/full},
	author = {Felix J. Herrmann and Xiang Li}
}
@article {aravkin2012IPNuisance,
	title = {Estimating nuisance parameters in inverse problems},
	journal = {Inverse Problems},
	volume = {28},
	number = {11},
	year = {2012},
	month = {10},
	abstract = {Many inverse problems include nuisance parameters which, while not of direct interest, are required to recover primary parameters. Structure present in these problems allows efficient optimization strategies - a well known example is variable projection, where nonlinear least squares problems which are linear in some parameters can be very efficiently optimized. In this paper, we extend the idea of projecting out a subset over the variables to a broad class of maximum likelihood (ML) and maximum a posteriori likelihood (MAP) problems with nuisance parameters, such as variance or degrees of freedom. As a result, we are able to incorporate nuisance parameter estimation into large-scale constrained and unconstrained inverse problem formulations. We apply the approach to a variety of problems, including estimation of unknown variance parameters in the Gaussian model, degree of freedom (d.o.f.) parameter estimation in the context of robust inverse problems, automatic calibration, and optimal experimental design. Using numerical examples, we demonstrate improvement in recovery of primary parameters for several large- scale inverse problems. The proposed approach is compatible with a wide variety of algorithms and formulations, and its implementation requires only minor modifications to existing algorithms.},
	keywords = {full waveform inversion, students t, variance},
	doi = {10.1088/0266-5611/28/11/115016},
	url = {http://arxiv.org/abs/1206.6532},
	url2 = {https://slim.gatech.edu/Publications/Public/Journals/InverseProblems/2012/aravkin2012IPNuisance/aravkin2012IPNuisance.pdf},
	author = {Aleksandr Y. Aravkin and Tristan van Leeuwen}
}
@article {kumar2010TNPecr,
	title = {Enhancing crustal reflection data through curvelet denoising},
	journal = {Technophysics},
	volume = {508},
	number = {1-4},
	year = {2011},
	month = {07},
	pages = {106-116},
	abstract = {Suppression of incoherent noise, which is present in the seismic signal and may often lead to ambiguous interpretation, is a key step in processing associated with crustal reflection data. In this paper, we make use of the parsimonious representation of seismic data in the curvelet domain to perform the noise attenuation while preserving the coherent energy and its amplitude information. Curvelets are a recently developed mathematical transform that has as one of its properties minimal overlap between seismic signal and noise in the transform domain, thereby facilitating signal-noise separation. The problem is cast as an inverse problem and the results are obtained by updating the solution at each iteration. We demonstrate the effectiveness of this procedure at removing noise on both synthetic shot gathers and a synthetic stacked seismic section. We then apply curvelet denoising to deep crustal seismic reflection data where the signal-to-noise ratio is low. The reflection data were recorded along Lithoprobe{\textquoteright}s SNORCLE Line 1 across Paleoproterozoic-Archean domains in Canada{\textquoteright}s Northwest Territories. After initial processing, we apply the iterative curvelet denoising to both pre-stack shot gathers and post-stack data. Ground roll, random noise and much of the anomalous vertical energy is removed from the pre-stack shot gathers, to the extent that crustal reflections, including those from the Moho, are clearly seen on individual gathers. Denoised stacked data show a series of dipping reflections in the lower crust that extend into the Moho. The Moho itself is relatively flat and characterized by a sharp, narrow band of reflections. Comparing the results for the stacked data with those from F-X deconvolution, curvelet denoising outperforms the latter by attenuating incoherent noise with minimal harm to the signal. Because curvelet denoising retains amplitude information, it provides opportunities for further studies of seismic sections through attribute analyses. Curvelet denoising provides an important new tool in the processing toolbox for crustal seismic reflection data.},
	keywords = {Processing, SLIM},
	doi = {10.1016/j.tecto.2010.07.01},
	url = {http://www.sciencedirect.com/science/article/pii/S0040195110003227},
	author = {Vishal Kumar and Jounada Oueity and Ron Clowes 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}
}
