@article {grady2022SCtll,
	title = {Model-Parallel Fourier Neural Operators as Learned Surrogates for Large-Scale Parametric PDEs},
	journal = {Computers \& Geosciences},
	volume = {178},
	year = {2023},
	note = {(Computers and Geosciences)},
	month = {07},
	pages = {105402},
	abstract = {Fourier neural operators (FNOs) are a recently introduced neural network architecture for learning solution operators of partial differential equations (PDEs), which have been shown to perform significantly better than comparable deep learning approaches. Once trained, FNOs can achieve speed-ups of multiple orders of magnitude over conventional numerical PDE solvers. However, due to the high dimensionality of their input data and network weights, FNOs have so far only been applied to two-dimensional or small three-dimensional problems. To remove this limited problem-size barrier, we propose a model-parallel version of FNOs based on domain-decomposition of both the input data and network weights. We demonstrate that our model-parallel FNO is able to predict time-varying PDE solutions of over 2.6 billion variables on Perlmutter using up to 512 A100 GPUs and show an example of training a distributed FNO on the Azure cloud for simulating multiphase CO2 dynamics in the Earth{\textquoteright}s subsurface.},
	keywords = {CCS, Computers and Geosciences, deep learning, Fourier neural operators, HPC, large-scale, Model Parallelism, Multiphase Flow, Operator Learning},
	doi = {10.1016/j.cageo.2023.105402},
	url = {https://slim.gatech.edu/Publications/Public/Journals/ComputersAndGeosciences/2023/grady2022SCtll/grady2022SCtll.pdf},
	software = {https://github.com/slimgroup/dfno},
	author = {Thomas J. Grady II and Rishi Khan and Mathias Louboutin and Ziyi Yin and Philipp A. Witte and Ranveer Chandra and Russell J. Hewett and Felix J. Herrmann}
}
@article {zhang2023otl,
	title = {Optimized time-lapse acquisition design via spectral gap ratio minimization},
	journal = {Geophysics},
	volume = {88},
	number = {4},
	year = {2023},
	note = {(Geophysics)},
	month = {07},
	pages = {A19-A23},
	abstract = {Modern-day reservoir management and monitoring of geological carbon storage increasingly call for costly time-lapse seismic data collection. In this letter, we show how techniques from graph theory can be used to optimize acquisition geometries for low-cost sparse 4D seismic. Based on midpoint-offset domain connectivity arguments, the proposed algorithm automatically produces sparse non-replicated time-lapse acquisition geometries that favor wavefield recovery.},
	keywords = {Acquisition, JRM, matrix factorization, spectral gap, survey design, time-lapse, wavefield reconstruction},
	doi = {10.1190/geo2023-0024.1},
	url = {https://slim.gatech.edu/Publications/Public/Journals/Geophysics/2023/zhang2023otl/Spectral_Gap_Paper.html},
	author = {Yijun Zhang and Ziyi Yin and Oscar Lopez and Ali Siahkoohi and Mathias Louboutin and Rajiv Kumar and Felix J. Herrmann}
}
@article {lopez2020gsb,
	title = {Spectral Gap-Based Seismic Survey Design},
	journal = {IEEE Transactions on Geoscience and Remote Sensing},
	year = {2023},
	month = {1},
	abstract = {Seismic imaging in challenging sedimentary basins and reservoirs requires acquiring, processing, and imaging very large volumes of data (tens of terabytes). To reduce the cost of acquisition and the time from acquiring the data to producing a subsurface image, novel acquisition systems based on compressive sensing, low-rank matrix recovery, and randomized sampling have been developed and implemented. These approaches allow practitioners to achieve dense wavefield reconstruction from a substantially reduced number of field samples. However, designing acquisition surveys suited for this new sampling paradigm remains a critical and challenging role in oil, gas, and geothermal exploration. Typical random designs studied in the low-rank matrix recovery and compressive sensing literature are difficult to achieve by standard industry hardware. For practical purposes, a compromise between stochastic and realizable samples is needed. In this paper, we propose a deterministic and computationally cheap tool to alleviate randomized acquisition design, prior to survey deployment and large-scale optimization. We consider universal and deterministic matrix completion results in the context of seismology, where a bipartite graph representation of the source-receiver layout allows for the respective spectral gap to act as a quality metric for wavefield reconstruction. We provide realistic scenarios to demonstrate the utility of the spectral gap as a flexible tool that can be incorporated into existing survey design workflows for successful seismic data acquisition via low-rank and sparse signal recovery.},
	keywords = {biadjacency matrix, bipartite graph, Compressive Sensing, IEEE, low rank matrix completion, nuclear norm minimization, seismic data, seismic trace interpolation, spectral gap},
	doi = {10.1109/TGRS.2023.3237464},
	url = {https://slim.gatech.edu/Publications/Public/Journals/IEEETGRS/2023/lopez2020gsb/lopez2020gsb.pdf},
	author = {Oscar Lopez and Rajiv Kumar and Nick Moldoveanu and Felix J. Herrmann}
}
@article {kukreja2020lcc,
	title = {Lossy Checkpoint Compression in Full Waveform Inversion},
	journal = {Geoscientific Model Development},
	volume = {15},
	number = {9},
	year = {2022},
	note = {(Geoscientific Model Development)},
	month = {5},
	pages = {3815-3829},
	abstract = {This paper proposes a new method that combines check-pointing methods with error-controlled lossy compression for large-scale high-performance Full-Waveform Inversion (FWI), an inverse problem commonly used in geophysical exploration. This combination can significantly reduce data movement, allowing a reduction in run time as well as peak memory. In the Exascale computing era, frequent data transfer (e.g., memory bandwidth, PCIe bandwidth for GPUs, or network) is the performance bottleneck rather than the peak FLOPS of the processing unit. Like many other adjoint-based optimization problems, FWI is costly in terms of the number of floating-point operations, large memory footprint during backpropagation, and data transfer overheads. Past work for adjoint methods has developed checkpointing methods that reduce the peak memory requirements during backpropagation at the cost of additional floating-point computations. Combining this traditional checkpointing with error-controlled lossy compression, we explore the three-way tradeoff between memory, precision, and time to solution. We investigate how approximation errors introduced by lossy compression of the forward solution impact the objective function gradient and final inverted solution. Empirical results from these numerical experiments indicate that high lossy-compression rates (compression factors ranging up to 100) have a relatively minor impact on convergence rates and the quality of the final solution.},
	keywords = {checkpointing, full waveform inversion, GMD, Lossy compression, memory},
	doi = {10.5194/gmd-15-3815-2022},
	url = {https://arxiv.org/pdf/2009.12623.pdf},
	author = {Navjot Kukreja and Jan Hueckelheim and Mathias Louboutin and John Washbourne and Paul H. J. Kelly and Gerard J. Gorman}
}
@article {yang2020lrpo,
	title = {Low-rank representation of omnidirectional subsurface extended image volumes},
	journal = {Geophysics},
	volume = {86},
	number = {3},
	year = {2021},
	note = {(Geophysics)},
	month = {1},
	pages = {1MJ-WA152},
	abstract = {Subsurface-offset gathers play an increasingly important role in seismic imaging. These gathers are used during velocity model building and inversion of rock properties from amplitude variations. While powerful, these gathers come with high computational and storage demands to form and manipulate these high dimensional objects. This explains why only limited numbers of image gathers are computed over a limited offset range. We avoid these high costs by working with highly compressed low-rank factorizations. We arrive at these factorizations via a combination of probings with the double two-way wave equation and randomized singular value decompositions. In turn, the resulting factorizations give us access to all subsurface offsets without having to form the full extended image volumes. The latter is computationally prohibitive because extended image volumes are quadratic in image size. As a result, we can easily handle situations where conventional horizontal offset gathers are no longer focused. More importantly, the factorization also provides a mechanism to use the invariance relation of extended image volumes for velocity continuation. With this technique, extended image volumes for one background velocity model can directly be mapped to those of another background velocity model. Our low-rank factorization inherits this invariance property so we incur factorization costs only once when examining different imaging scenarios. Because all imaging experiments only involve the factors, they are computationally cheap with costs that scale with the rank of the factorization. We validate our methodology on 2D synthetics including a challenging imaging example with salt. Our experiments show that our low-rank factorization parameterizes extended image volumes naturally. Instead of brute force explicit cross-correlations between shifted source and receiver wavefields, our approach relies on the underlying linear-algebra structure that enables us to work with these objects without incurring unfeasible demands on computation and storage.},
	keywords = {extended image volumes, invariance relationship, low rank, power schemes, randomized linear algebra},
	doi = {10.1190/geo2020-0152.1},
	url = {https://slim.gatech.edu/Publications/Public/Journals/Geophysics/2021/yang2020lrpo/Paper_final.html},
	author = {Mengmeng Yang and Marie Graff and Rajiv Kumar and Felix J. Herrmann}
}
@article {daskalakis2019SIAMJISasr,
	title = {Accelerating Sparse Recovery by Reducing Chatter},
	journal = {SIAM Journal on Imaging Sciences},
	volume = {13},
	number = {3},
	year = {2020},
	note = {(SIAM Journal on Imaging Sciences)},
	month = {07},
	pages = {1211{\textendash}1239},
	abstract = {Compressive Sensing has driven a resurgence of sparse recovery algorithms with l_1-norm minimization. While these minimizations are relatively well understood for small underdetermined, possibly inconsistent systems, their behavior for large over-determined and inconsistent systems has received much less attention. Specifically, we focus on large systems where computational restrictions call for algorithms that use randomized subsets of rows that are touched a limited number of times. In that regime, l_1-norm minimization algorithms exhibit unwanted fluctuations near the desired solution, and the Linear Bregman iterations are no exception. We explain this observed lack of performance in terms of chatter, a well-known phenomena observed in non-smooth dynamical systems, where intermediate solutions wander between different states stifling convergence. By identifying chatter as the culprit, we modify the Bregman iterations with chatter reducing adaptive element-wise step lengths in combination with potential support detection via threshold crossing. We demonstrate the performance of our algorithm on carefully selected stylized examples and a realistic seismic imaging problem involving millions of unknowns and matrix-free matrix-vector products that involve expensive wave-equation solves.},
	keywords = {chatter, inconsistent linear systems, Kacmarz, linearized Bregman dynamical systems, non-smooth dynamics, sparsity promotion},
	doi = {10.1137/19M129111X},
	url = {https://slim.gatech.edu/Publications/Public/Journals/SIAMJournalOnImagingSciences/2020/daskalakis2019SIAMJISasr/daskalakis2019SIAMJISasr.pdf},
	author = {Emmanouil Daskalakis and Felix J. Herrmann and Rachel Kuske}
}
@article {luporini2018aap,
	title = {Architecture and performance of Devito, a system for automated stencil computation},
	journal = {ACM Trans. Math. Softw.},
	volume = {46},
	number = {1},
	year = {2020},
	note = {(ACM Trans. Math. Softw.)},
	month = {04},
	abstract = {Stencil computations are a key part of many high-performance computing applications, such as image processing, convolutional neural networks, and finite-difference solvers for partial differential equations. Devito is a framework capable of generating highly-optimized code given symbolic equations expressed in Python, specialized in, but not limited to, affine (stencil) codes. The lowering process {\textendash} from mathematical equations down to C++ code {\textendash} is performed by the Devito compiler through a series of intermediate representations. Several performance optimizations are introduced, including advanced common sub-expressions elimination, tiling and parallelization. Some of these are obtained through well-established stencil optimizers, integrated in the back-end of the Devito compiler. The architecture of the Devito compiler, as well as the performance optimizations that are applied when generating code, are presented. The effectiveness of such performance optimizations is demonstrated using operators drawn from seismic imaging applications.},
	keywords = {compiler, finite difference method, performance optimization, stencil, structured grid, symbolic processing},
	doi = {10.1145/3374916},
	url = {https://slim.gatech.edu/Publications/Public/Journals/ACMTOMS/2020/luporini2018aap/luporini2018aap.pdf},
	author = {Fabio Luporini and Mathias Louboutin and Michael Lange and Navjot Kukreja and Philipp A. Witte and Jan H{\"u}ckelheim and Charles Yount and Paul H. J. Kelly and Felix J. Herrmann and Gerard J. Gorman}
}
@article {silva2018alr,
	title = {Applications of low-rank compressed seismic data to full waveform inversion and extended image volumes},
	journal = {Geophysics},
	year = {2019},
	note = {Accepted on January 22, 2019.},
	abstract = {Conventional oil and gas fields are increasingly difficult to explore and image, resulting in the call for more complex wave-equation based inversion algorithms that require dense long-offset samplings. Consequently, there is an exponential growth in the size of data volumes and prohibitive demands on computational resources. In this work, we propose a method to compress and process seismic data directly in a low-rank tensor format, which drastically reduces the amount of storage required to represent the data. We first outline how seismic data exhibits low-rank structure in a particular transform-domain, which can be exploited to compress the dense data in one extremely storage-efficient tensor format when the data is fully sampled. In the more realistic case of missing data, we can use efficient interpolation techniques to approximate the fully sampled volume in compressed form. In either case, once we have our data represented in its compressed tensor form, we design an algorithm to extract source or receiver gathers directly from the compressed parameters. This extraction process can be done on-the-fly directly on the compressed data, in a full waveform inversion context, and does not require scanning through the entire dataset in order to form shot gathers. To the best of our knowledge, this work is one of the first major contributions to working with seismic data applications directly in the compressed domain without reconstructing the entire data volume. We use a stochastic inversion approach, which works with small subsets of source experiments at each iteration, further reducing the computational and memory costs of full waveform inversion. We also demonstrate how this data compression and extraction technique can be applied to forming full subsurface image gathers through probing techniques.},
	keywords = {common shot/receiver gather, extended image volume, full waveform inversion, low rank, tensor},
	doi = {10.1190/geo2018-0116.1},
	url = {https://slim.gatech.edu/Publications/Public/Journals/Geophysics/2019/silva2018alr/silva2018alr.pdf},
	author = {Curt Da Silva and Yiming Zhang and Rajiv Kumar and Felix J. Herrmann}
}
@article {kukreja2019PASCccd,
	title = {Combining checkpointing and data compression to accelerate adjoint-based optimization problems},
	journal = {Euro-Par 2019: Parallel Processing},
	year = {2019},
	note = {(Euro-Par 2019: Parallel Processing)},
	pages = {87-100},
	publisher = {Springer International Publishing},
	abstract = {Seismic inversion and imaging are adjoint-based optimization problems that processes up to terabytes of data, regularly exceeding the memory capacity of available computers. Data compression is an effective strategy to reduce this memory requirement by a certain factor, particularly if some loss in accuracy is acceptable. A popular alternative is checkpointing, where data is stored at selected points in time, and values at other times are recomputed as needed from the last stored state. This allows arbitrarily large adjoint computations with limited memory, at the cost of additional recomputations. In this paper we combine compression and checkpointing for the first time to compute a realistic seismic inversion. The combination of checkpointing and compression allows larger adjoint computations compared to using only compression, and reduces the recomputation overhead significantly compared to using only checkpointing.},
	keywords = {Adjoint-state, checkpointing, compression, FD, HPC, Inverse problems},
	doi = {10.1007/978-3-030-29400-7_7},
	url = {https://slim.gatech.edu/Publications/Public/Journals/PASC/2019/kukreja2019PASCccd/kukreja2019PASCccd.pdf},
	author = {Navjot Kukreja and Jan H{\"u}ckelheim and Mathias Louboutin and Paul Hovland and Gerard Gorman}
}
@article {louboutin2018dae,
	title = {Devito (v3.1.0): an embedded domain-specific language for finite differences and geophysical exploration},
	journal = {Geoscientific Model Development},
	year = {2019},
	note = {(Geoscientific Model Development)},
	abstract = {We introduce Devito, a new domain-specific language for implementing high-performance finite difference partial differential equation solvers. The motivating application is exploration seismology where methods such as Full-Waveform Inversion and Reverse-Time Migration are used to invert terabytes of seismic data to create images of the earth{\textquoteright}s subsurface. Even using modern supercomputers, it can take weeks to process a single seismic survey and create a useful subsurface image. The computational cost is dominated by the numerical solution of wave equations and their corresponding adjoints. Therefore, a great deal of effort is invested in aggressively optimizing the performance of these wave-equation propagators for different computer architectures. Additionally, the actual set of partial differential equations being solved and their numerical discretization is under constant innovation as increasingly realistic representations of the physics are developed, further ratcheting up the cost of practical solvers. By embedding a domain-specific language within Python and making heavy use of SymPy, a symbolic mathematics library, we make it possible to develop finite difference simulators quickly using a syntax that strongly resembles the mathematics. The Devito compiler reads this code and applies a wide range of analysis to generate highly optimized and parallel code. This approach can reduce the development time of a verified and optimized solver from months to days.},
	keywords = {finite-differences, HPC, Modeling, wave-equation},
	doi = {10.5194/gmd-12-1165-2019},
	url = {https://slim.gatech.edu/Publications/Public/Journals/GMD/2019/louboutin2018dae/louboutin2018dae.pdf},
	author = {Mathias Louboutin and Michael Lange and Fabio Luporini and Navjot Kukreja and Philipp A. Witte and Felix J. Herrmann and Paulius Velesko and Gerard J. Gorman}
}
@article {witte2019ecl,
	title = {Geophysics Bright Spots: Efficient coding of large-scale seismic inversion algorithms},
	journal = {The Leading Edge},
	volume = {38},
	number = {6},
	year = {2019},
	note = {(The Leading Edge)},
	pages = {482-484},
	abstract = {In {\textquotedblleft}A large-scale framework for symbolic implementations of seismic inversion algorithms in Julia,{\textquotedblright} Witte et al. describe new developments in how to code complex geophysical algorithms in a concise way. Subsurface seismic imaging and parameter estimation are among the most computationally challenging problems in the scientific community. Codes for solving seismic inverse problems, such as FWI or least-squares reverse time migration (LS-RTM), need to be highly optimized, but at the same time, facilitate the implementation of complex optimization algorithms. Traditionally, production-level codes in the oil and gas industry were exclusively written in low-level languages, such as C or Fortran, with extensive amounts of manual performance optimizations, thus making code maintenance, debugging, and adoption of new algorithms prohibitively challenging. Witte et al. present a paradigm of software engineering for seismic inverse problems based on symbolic user interfaces and code generation with automated performance optimization. Inspired by recent deep learning frameworks, the Julia Devito inversion framework (JUDI; an open-source software package) combines high-level abstractions for expressing seismic inversion algorithms with a domain-specific language compiler called Devito for solving the underlying wave equations. Devito{\textquoteright}s generated code is compiled just in time and outperforms codes with manual performance optimizations. JUDI utilizes Julia{\textquoteright}s high-level parallelization, making the software easily adaptable to a variety of computing environments such as densely connected HPC clusters or the cloud. The numerical examples (Figure 3) demonstrate the ability to implement a variety of complex algorithms for FWI and LS-RTM in a few lines of Julia code and run it on large-scale 3D models. The paper concludes that abstractions and performance are not mutually exclusive, and use of symbolic user interfaces can facilitate the implementation of new and innovative seismic inversion algorithms.},
	keywords = {bright spots, inversion, Julia, large-scale},
	doi = {10.1190/tle38060482.1},
	url = {https://library.seg.org/doi/10.1190/tle38060482.1},
	author = {Philipp A. Witte and Mathias Louboutin and Navjot Kukreja and Fabio Luporini and Michael Lange and Gerard J. Gorman and Felix J. Herrmann}
}
@article {witte2018alf,
	title = {A large-scale framework for symbolic implementations of seismic inversion algorithms in Julia},
	journal = {Geophysics},
	volume = {84},
	number = {3},
	year = {2019},
	note = {(Geophysics)},
	month = {03},
	pages = {F57-F71},
	abstract = {Writing software packages for seismic inversion is a very challenging task, since problems such as full-waveform inversion or least-squares imaging are both algorithmically and computationally demanding due to the large number of unknown parameters and the fact that we are propagating waves over many wavelengths. Software frameworks therefore need to combine both versatility and performance to provide geophysicists with the means and flexibility to implement complex algorithms that scale to exceedingly large 3D problems. Following these principles, we introduce the Julia Devito Inversion framework, an open-source software package in Julia for large-scale seismic modeling and inversion based on Devito, a domain-specific language compiler for automatic code generation. The framework consists of matrix-free linear operators for implementing seismic inversion algorithms that closely resembles the mathematical notation, a flexible resilient parallelization and an interface to Devito for generating optimized stencil code to solve the underlying wave equations. In comparison to many manually optimized industry codes written in low-level languages, our software is built on the idea of independent layers of abstractions and user interfaces with symbolic operators, making it possible to manage both the complexity of algorithms and performance optimizations, while preserving modularity, which allows for a level of expressiveness needed to formulate a broad range of wave-equation-based inversion problems. Through a series of numerical examples, we demonstrate that this allows users to implement algorithms for waveform inversion and imaging as simple Julia scripts that scale to large-scale 3D problems; thus providing a truly performant research and production framework.},
	keywords = {FWI, inversion, LSRTM, Modeling, software},
	doi = {10.1190/geo2018-0174.1},
	url = {https://slim.gatech.edu/Publications/Public/Journals/Geophysics/2019/witte2018alf/witte2018alf.pdf},
	author = {Philipp A. Witte and Mathias Louboutin and Navjot Kukreja and Fabio Luporini and Michael Lange and Gerard J. Gorman and Felix J. Herrmann}
}
@article {kumar2018toi,
	title = {Target-oriented imaging using extended image volumes{\textemdash}a low-rank factorization approach},
	journal = {Geophysical Prospecting},
	volume = {67},
	number = {5},
	year = {2019},
	note = {(Geophysical Prospecting)},
	pages = {1312-1328},
	abstract = {Imaging in geological challenging environments has led to new developments, including the idea of generating reflection responses by means of interferometric redatuming at a given target datum in the subsurface, when the target datum lies beneath a complex overburden. One way to perform this redatuming is via conventional model-based wave-equation techniques. But those techniques can be computationally expensive for large-scale seismic problems since the number of wave-equation solves is equal to two-times the number of sources involved during seismic data acquisition. Also conventional shot-profile techniques require lots of memory to save full subsurface extended image volumes. Therefore, they only form subsurface image volumes in either horizontal or vertical directions. We now present a randomized singular value decomposition based approach built upon the matrix probing scheme, which takes advantage of the algebraic structure of the extended imaging system. This low-rank representation enables us to overcome both the computational cost associated with the number of wave-equation solutions and memory usage due to explicit storage of full subsurface extended image volumes employed by conventional migration methods. Experimental results on complex geological models demonstrate the efficacy of the proposed methodology and allow practical reflection-based extended imaging for large-scale 5D seismic data.},
	keywords = {extended image volumes, randomized linear algebra, target-oriented imaging},
	doi = {10.1111/1365-2478.12779},
	url = {https://slim.gatech.edu/Publications/Public/Journals/GeophysicalProspecting/2019/kumar2018toi/kumar2018toi.html},
	author = {Rajiv Kumar and Marie Graff-Kray and Ivan Vasconcelos and Felix J. Herrmann}
}
@article {louboutin2017fwip2,
	title = {Full-Waveform Inversion - Part 2: adjoint modeling},
	journal = {The Leading Edge},
	volume = {37},
	number = {1},
	year = {2018},
	note = {(The Leading Edge)},
	month = {1},
	pages = {69-72},
	abstract = {This tutorial is the second part of a three part tutorial series on full-waveform inversion (FWI), in which we provide a step by step walk through of setting up forward and adjoint wave equation solvers and an optimization framework for inversion. In part 1 (Louboutin et al., 2017), we demonstrated how to discretize the acoustic wave equation and how to set up a basic forward modeling scheme using Devito, a domain-specific language (DSL) in Python for automated finite-difference (FD) computations (Lange et al., 2016). Devito allows us to define wave equations as symbolic Python expressions (Meurer et al., 2017), from which optimized FD stencil code is automatically generated at run time. In part 1, we show how we can use Devito to set up and solve acoustic wave equations with (impulsive) seismic sources and sample wavefields at the receiver locations to model shot records.},
	keywords = {acoustic, devito, finite-difference, FWI, tutorial},
	doi = {10.1190/tle37010069.1},
	url = {https://slim.gatech.edu/Publications/Public/Journals/TheLeadingEdge/2018/louboutin2017fwip2/louboutin2017fwip2.html},
	author = {Mathias Louboutin and Philipp A. Witte and Michael Lange and Navjot Kukreja and Fabio Luporini and Gerard Gorman and Felix J. Herrmann}
}
@article {witte2018fwip3,
	title = {Full-Waveform Inversion - Part 3: optimization},
	journal = {The Leading Edge},
	volume = {37},
	number = {2},
	year = {2018},
	note = {(The Leading Edge)},
	month = {1},
	pages = {142-145},
	abstract = {This tutorial is the third part of a full-waveform inversion (FWI) tutorial series with a step-by-step walkthrough of setting up forward and adjoint wave equations and building a basic FWI inversion framework. For discretizing and solving wave equations, we use Devito, a Python-based domain-specific language for automated generation of finite-difference code (Lange et al., 2016). The first two parts of this tutorial (Louboutin et al., 2017, 2018) demonstrated how to solve the acoustic wave equation for modeling seismic shot records and how to compute the gradient of the FWI objective function using the adjoint-state method. With these two key ingredients, we will now build an inversion framework that can be used to minimize the FWI least-squares objective function.},
	keywords = {devito, finite-differences, FWI, inversion, Modeling, tutorial},
	doi = {10.1190/tle37020142.1},
	url = {https://slim.gatech.edu/Publications/Public/Journals/TheLeadingEdge/2018/witte2018fwip3/witte2018fwip3.html},
	author = {Philipp A. Witte and Mathias Louboutin and Keegan Lensink and Michael Lange and Navjot Kukreja and Fabio Luporini and Gerard Gorman and Felix J. Herrmann}
}
@article {liu2018ssi,
	title = {Simultaneous-shot inversion for PDE-constrained optimization problems with missing data},
	journal = {Inverse Problems},
	volume = {35},
	number = {2},
	year = {2018},
	note = {(Inverse Problems)},
	pages = {025003},
	abstract = {Stochastic optimization is key to efficient inversion in PDE-constrained optimization. Using {\textquoteleft}simultaneous shots{\textquoteright}, or random superposition of source terms, works very well in simple acquisition geometries where all sources see all receivers, but this rarely occurs in practice. We develop an approach that interpolates data to an ideal acquisition geometry while solving the inverse problem using simultaneous shots. The approach is formulated as a joint inverse problem, combining ideas from low-rank interpolation with full-waveform inversion. Results using synthetic experiments illustrate the flexibility and efficiency of the approach.},
	keywords = {Full-waveform inversion, low-rank interpolation, Optimization},
	doi = {10.1088/1361-6420/aaf317},
	url = {https://slim.gatech.edu/Publications/Public/Journals/InverseProblems/2018/liu2018ssi/liu2018ssi.pdf},
	author = {Michelle Liu and Rajiv Kumar and Eldad Haber and Aleksandr Y. Aravkin}
}
@article {fang2017uqfip,
	title = {Uncertainty quantification for inverse problems with weak partial-differential-equation constraints},
	journal = {Geophysics},
	volume = {83},
	number = {6},
	year = {2018},
	note = {(Geophysics)},
	pages = {R629-R647},
	abstract = {In a statistical inverse problem, the objective is a complete statistical description of unknown parameters from noisy observations in order to quantify uncertainties of the parameters of interest. We consider inverse problems with partial-differential-equation-constraints, which are applicable to a variety of seismic problems. Bayesian inference is one of the most widely-used approaches to precisely quantify statistics through a posterior distribution, incorporating uncertainties in observed data, modeling kernel, and prior knowledge of the parameters. Typically when formulating the posterior distribution, the partial-differential-equation-constraints are required to be exactly satisfied, resulting in a highly nonlinear forward map and a posterior distribution with many local maxima. These drawbacks make it difficult to find an appropriate approximation for the posterior distribution. Another complicating factor is that traditional Markov chain Monte Carlo methods are known to converge slowly for realistically sized problems. In this work, we relax the partial-differential-equation-constraints by introducing an auxiliary variable, which allows for Gaussian deviations in the partial-differential-equations. Thus, we obtain a new bilinear posterior distribution consisting of both data and partial-differential-equation misfit terms. We illustrate that for a particular range of variance choices for the partial-differential-equation misfit term, the new posterior distribution has fewer modes and can be well-approximated by a Gaussian distribution, which can then be sampled in a straightforward manner. Since it is prohibitively expensive to explicitly construct the dense covariance matrix of the Gaussian approximation for intermediate to large-scale problems, we present a method to implicitly construct it, which enables efficient sampling. We apply this framework to two-dimensional seismic inverse problems with 1,800 and 92,455 unknown parameters. The results illustrate that our framework can produce comparable statistical quantities to those produced by conventional Markov chain Monte Carlo type methods while requiring far fewer partial-differential-equation solves, which are the main computational bottlenecks in these problems.},
	keywords = {acoustic, FWI, UQ, weak-constraint},
	doi = {10.1190/geo2017-0824.1},
	url = {https://slim.gatech.edu/Publications/Public/Journals/Geophysics/2018/fang2017uqfip/fang2017uqfip.html},
	author = {Zhilong Fang and Curt Da Silva and Rachel Kuske and Felix J. Herrmann}
}
@article {kumar2016bls,
	title = {Beating level-set methods for 5D seismic data interpolation: a primal-dual alternating approach},
	journal = {IEEE Transactions on Computational Imaging},
	year = {2017},
	note = {(published online in IEEE Transactions on Computational Imaging)},
	month = {04},
	abstract = {Acquisition cost is a crucial bottleneck for seismic workflows, and low-rank formulations for data interpolation allow practitioners to {\textquoteright}fill in{\textquoteright} data volumes from critically subsampled data acquired in the field. Tremendous size of seismic data volumes required for seismic processing remains a major challenge for these techniques. Residual-constrained formulations require less parameter tuning when the target noise floor is known. We propose a new approach to solve residual constrained formulations for interpolation. We represent the data volume in a compressed manner using low-rank matrix factors, and build a block-coordinate algorithm with constrained convex subproblems that are solved with a primal-dual splitting scheme. The develop optimization framework works on the whole seismic temporal frequency slices and does not require windowing or non-trivial sorting of seismic data. The new approach is competitive with state of the art level-set algorithms that interchange the role of objectives with constraints. We use the new algorithm to successfully interpolate a large scale 5D seismic data volume (upto 1010 data-points), generated from the geologically complex synthetic 3D Compass velocity model, where 80\% of the data has been removed. We also develop a robust extension of the primal-dual approach to deal with the outliers (or noise) in the data.},
	keywords = {alternating minimization, matrix completion, primal-dual splitting, seismic data, seismic trace interpolation},
	doi = {10.1109/TCI.2017.2693966},
	url = {https://slim.gatech.edu/Publications/Public/Journals/IEEETransComputationalImaging/2017/kumar2016bls/kumar2016bls.pdf},
	author = {Rajiv Kumar and Oscar Lopez and Damek Davis and Aleksandr Y. Aravkin 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 {louboutin2017fwi,
	title = {Full-Waveform Inversion - Part 1: forward modeling},
	journal = {The Leading Edge},
	volume = {36},
	number = {12},
	year = {2017},
	note = {(The Leading Edge)},
	month = {12},
	pages = {1033-1036},
	abstract = {Since its re-introduction by Pratt (1999), full-waveform inversion (FWI) has gained a lot of attention in geophysical exploration because of its ability to build high resolution velocity models more or less automatically in areas of complex geology. While there is an extensive and growing literature on the topic, publications focus mostly on technical aspects, making this topic inaccessible for a broader audience due to the lack of simple introductory resources for newcomers to geophysics. We will accomplish this by providing a hands-on walkthrough of FWI using Devito (Lange et al. 2016), a system based on domain-specific languages that automatically generates code for time-domainfinite-differences.},
	keywords = {devito, finite-differences, FWI, Modeling, tutorial},
	doi = {10.1190/tle36121033.1},
	url = {https://slim.gatech.edu/Publications/Public/Journals/TheLeadingEdge/2017/louboutin2017fwi/louboutin2017fwi.html},
	author = {Mathias Louboutin and Philipp A. Witte and Michael Lange and Navjot Kukreja and Fabio Luporini and Gerard Gorman and Felix J. Herrmann}
}
@article {kumar2017hrc,
	title = {Highly repeatable 3D compressive full-azimuth towed-streamer time-lapse acquisition {\textendash}- a numerical feasibility study at scale},
	journal = {The Leading Edge},
	volume = {36},
	number = {8},
	year = {2017},
	note = {(The Leading Edge)},
	month = {08},
	pages = {677-687},
	abstract = {Most conventional 3D time-lapse (or 4D) acquisitions are ocean-bottom cable (OBC) or ocean-bottom node (OBN) surveys since these surveys are relatively easy to replicate compared to towed-streamer surveys. To attain high degrees of repeatability, survey replicability and dense periodic sampling has become the norm for 4D surveys that renders this technology expensive. Conventional towed-streamer acquisitions suffer from limited illumination of subsurface due to narrow azimuth. Although, acquisition techniques such as multi-azimuth, wide-azimuth, rich-azimuth acquisition, etc., have been developed to illuminate the subsurface from all possible angles, these techniques can be prohibitively expensive for densely sampled surveys. This leads to uneven sampling, i.e., dense receiver and coarse source sampling or vice-versa, in order to make these acquisitions more affordable. Motivated by the design principles of Compressive Sensing (CS), we acquire economic, randomly subsampled (or compressive) and simultaneous towed-streamer time-lapse data without the need of replicating the surveys. We recover densely sampled time-lapse data on one and the same periodic grid by using a joint-recovery model (JRM) that exploits shared information among different time-lapse recordings, coupled with a computationally cheap and scalable rank-minimization technique. The acquisition is low cost since we have subsampled measurements (about 70\% subsampled), simulated with a simultaneous long-offset acquisition configuration of two source vessels travelling across a survey area at random azimuths. We analyze the performance of our proposed compressive acquisition and subsequent recovery strategy by conducting a synthetic, at scale, seismic experiment on a 3D time-lapse model containing geological features such as channel systems, dipping and faulted beds, unconformities and a gas cloud. Our findings indicate that the insistence on replicability between surveys and the need for OBC/OBN 4D surveys can, perhaps, be relaxed. Moreover, this is a natural next step beyond the successful CS acquisition examples discussed in this special issue.},
	keywords = {3D, CS, marine, rank minimization, simultaneous long offset, time-lapse seismic},
	doi = {10.1190/tle36080677.1},
	url = {https://slim.gatech.edu/Publications/Public/Journals/TheLeadingEdge/2017/kumar2017hrc/kumar2017hrc.html},
	author = {Rajiv Kumar and Haneet Wason and Shashin Sharan and Felix J. Herrmann}
}
@article {yarman2017GPmbd,
	title = {A model based data driven dictionary learning for seismic data representation},
	journal = {Geophysical Prospecting},
	year = {2017},
	note = {(published online in Geophysical Prospecting)},
	month = {04},
	abstract = {Planar waves events recorded in a seismic array can be represented as lines in the Fourier domain. However, in the real-world seismic events usually have curvature or amplitude variability that means their Fourier transforms are no longer strictly linear, but rather occupy conic regions of the Fourier domain that are narrow at low frequencies, but broaden at high frequencies where the effect of curvature becomes more pronounced. One can consider these regions as localised "signal cones". In this work, we consider a space-time variable signal cone to model the seismic data. The variability of the signal cone is obtained through scaling, slanting and translation of the kernel for cone-limited (C-limited) functions (functions whose Fourier transform lives within a cone) or C-Gaussian function (a multivariate function whose Fourier transform decays exponentially with respect to slowness and frequency) which constitutes our dictionary. We find a discrete number of scaling, slanting and translation parameters from a continuum by optimally matching the data. This is a nonlinear optimization problem which we address by a fixed point method which utilizes a variable projection method with e1 constraints on the linear parameters and bound constraints on the nonlinear parameters. We observe that slow decay and oscillatory behavior of the kernel for C-limited functions constitute bottlenecks for the optimization problem which we partially overcome by the C-Gaussian function. We demonstrate our method through an interpolation example. We present the interpolation result using the estimated parameters obtained from the proposed method and compare it with those obtained using sparsity promoting curvelet decomposition, matching pursuit Fourier interpolation and sparsity promoting plane wave decomposition methods.},
	keywords = {dictionary learning, kernel method, nonlinear optimization, reproducing kernel, variable projection, variational method},
	doi = {10.1111/1365-2478.12533},
	url = {https://slim.gatech.edu/Publications/Public/Journals/GeophysicalProspecting/2017/yarman2017GPmbd/yarman2017GPmbd.pdf},
	author = {Can Evren Yarman and Rajiv Kumar and James Rickett}
}
@article {louboutin2016ppf,
	title = {Performance prediction of finite-difference solvers for different computer architectures},
	journal = {Computers \& Geosciences},
	volume = {105},
	year = {2017},
	note = {(Computers \& Geosciences)},
	month = {08},
	pages = {148-157},
	abstract = {The life-cycle of a partial differential equation (PDE) solver is often characterized by three development phases: the development of a stable numerical discretization; development of a correct (verified) implementation; and the optimization of the implementation for different computer architectures. Often it is only after significant time and effort has been invested that the performance bottlenecks of a PDE solver are fully understood, and the precise details varies between different computer architectures. One way to mitigate this issue is to establish a reliable performance model that allows a numerical analyst to make reliable predictions of how well a numerical method would perform on a given computer architecture, before embarking upon potentially long and expensive implementation and optimization phases. The availability of a reliable performance model also saves developer effort as it both informs the developer on what kind of optimisations are beneficial, and when the maximum expected performance has been reached and optimisation work should stop. We show how discretization of a wave-equation can be theoretically studied to understand the performance limitations of the method on modern computer architectures. We focus on the roofline model, now broadly used in the high-performance computing community, which considers the achievable performance in terms of the peak memory bandwidth and peak floating point performance of a computer with respect to algorithmic choices. A first principles analysis of operational intensity for key time-stepping finite-difference algorithms is presented. With this information available at the time of algorithm design, the expected performance on target computer systems can be used as a driver for algorithm design.},
	keywords = {finite differences, HPC, Modeling, performance},
	doi = {https://doi.org/10.1016/j.cageo.2017.04.014},
	url = {https://slim.gatech.edu/Publications/Public/Journals/ComputersAndGeosciences/2016/louboutin2016ppf/louboutin2016ppf.pdf},
	author = {Mathias Louboutin and Michael Lange and Felix J. Herrmann and Navjot Kukreja and Gerard Gorman}
}
@article {lopez2015IEEEogl,
	title = {Off-the-grid low-rank matrix recovery and seismic data reconstruction},
	journal = {IEEE Journal of Selected Topics in Signal Processing},
	volume = {10},
	number = {4},
	year = {2016},
	note = {(IEEE Journal of Selected Topics in Signal Processing)},
	month = {06},
	pages = {658-671},
	abstract = {Matrix sensing problems capitalize on the knowledge that a data matrix of interest exhibits low rank properties. This low dimensional structure often arises because the data matrix is obtained by sampling a smooth function on a regular (or structured) grid. However, in many practical situations the measurements are taken on an irregular grid (that is accurately known). This results in an "unstructured data matrix" that is less fit for the low rank model in comparison to its regular counterpart and therefore subject to degraded reconstruction via rank penalization techniques. In this paper, we propose and analyze a modified low-rank matrix recovery work-flow that admits unstructured observations. By incorporating a regularization operator which accurately maps structured data to unstructured data, into the nuclear-norm minimization problem, we are able to compensate for data irregularity. Furthermore, by construction our formulation yields output that is supported on a structured grid. We establish recovery error bounds for our methodology and offer matrix sensing and matrix completion numerical experiments including applications to seismic trace interpolation to demonstrate the potential of the approach.},
	keywords = {data regularization, matrix completion, matrix sensing, nonuniform discrete Fourier transform, nuclear-norm relaxation, seismic data, seismic trace interpolation},
	doi = {10.1109/JSTSP.2016.2555482},
	url = {https://slim.gatech.edu/Publications/Public/Journals/IEEESignalProcessingMagazine/2016/lopez2015IEEEogl/lopez2015IEEEogl.pdf},
	url2 = {http://ieeexplore.ieee.org/xpl/login.jsp?tp=\&arnumber=7454674},
	author = {Oscar Lopez and Rajiv Kumar and Ozgur Yilmaz 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 {kumar2015sss,
	title = {Source separation for simultaneous towed-streamer marine acquisition {\textendash}- a compressed sensing approach},
	journal = {Geophysics},
	volume = {80},
	number = {6},
	year = {2015},
	note = {(Geophysics)},
	month = {11},
	pages = {WD73-WD88},
	abstract = {Simultaneous marine acquisition is an economic way to sample seismic data and speed up acquisition, wherein single or multiple source vessels fire sources at near-simultaneous or slightly random times, resulting in overlapping shot records. The current paradigm for simultaneous towed-streamer marine acquisition incorporates {\textquotedblleft}low variability{\textquotedblright} in source firing times, i.e., 0 <= 1 or 2 s because the sources and receivers are moving. This results in a low degree of randomness in simultaneous data, which is challenging to separate (into its constituent sources) using compressed-sensing-based separation techniques because randomization is key to successful recovery via compressed sensing. We have addressed the challenge of source separation for simultaneous towed-streamer acquisitions via two compressed-sensing-based approaches, i.e., sparsity promotion and rank minimization. We have evaluated the performance of the sparsity-promotion- and rank-minimization-based techniques by simulating two simultaneous towed-streamer acquisition scenarios, i.e., over/under and simultaneous long offset. A field data example from the Gulf of Suez for the over/under acquisition scenario was also developed. We observed that the proposed approaches gave good and comparable recovery qualities of the separated sources, but the rank-minimization technique outperformed the sparsity-promoting technique in terms of the computational time and memory. We also compared these two techniques with the normal-moveout-based median-filtering-type approach, which had comparable results.},
	keywords = {2D, Acquisition, inversion, marine, Optimization, Rank, source separation, sparsity},
	doi = {10.1190/geo2015-0108.1},
	url = {https://slim.gatech.edu/Publications/Public/Journals/Geophysics/2015/kumar2015sss/kumar2015sss_revised.pdf},
	url2 = {http://library.seg.org/doi/abs/10.1190/geo2015-0108.1},
	author = {Rajiv Kumar and Haneet Wason and Felix J. Herrmann}
}
@article {aravkin2014SISCfmd,
	title = {Fast methods for denoising matrix completion formulations, with applications to robust seismic data interpolation},
	journal = {SIAM Journal on Scientific Computing},
	volume = {36},
	number = {5},
	year = {2014},
	note = {(SISC)},
	month = {10},
	pages = {S237-S266},
	abstract = {Recent SVD-free matrix factorization formulations have enabled rank minimization for systems with millions of rows and columns, paving the way for matrix completion in extremely large-scale applications, such as seismic data interpolation. In this paper, we consider matrix completion formulations designed to hit a target data-fitting error level provided by the user, and we propose an algorithm called LR-BPDN that is able to exploit factorized formulations to solve the corresponding optimization problem. Since practitioners typically have strong prior knowledge about target error level, this innovation makes it easy to apply the algorithm in practice, leaving only the factor rank to be determined. Within the established framework, we propose two extensions that are highly relevant to solving practical challenges of data interpolation. First, we propose a weighted extension that allows known subspace information to improve the results of matrix completion formulations. We show how this weighting can be used in the context of frequency continuation, an essential aspect to seismic data interpolation. Second, we propose matrix completion formulations that are robust to large measurement errors in the available data. We illustrate the advantages of LR-BPDN on collaborative filtering problems using the MovieLens 1M and 10M and Netflix 100M datasets. Then we use the new method, along with its robust and subspace reweighted extensions, to obtain high-quality reconstructions for large-scale seismic interpolation problems with real data, even in the presence of data contamination.},
	keywords = {factorized formulations, matrix completion, robust statistics, seismic trace interpolation, variational optimization},
	doi = {10.1137/130919210},
	url = {https://slim.gatech.edu/Publications/Public/Journals/SIAMJournalOnScientificComputing/2014/aravkin2014SISCfmd/aravkin2014SISCfmd.pdf},
	url2 = {http://epubs.siam.org/doi/abs/10.1137/130919210},
	author = {Aleksandr Y. Aravkin and Rajiv Kumar and Hassan Mansour and Ben Recht and Felix J. Herrmann}
}
@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}
}
@article {moghaddam2013GEOPnoa,
	title = {A new optimization approach for source-encoding full-waveform inversion},
	journal = {Geophysics},
	volume = {78},
	number = {3},
	year = {2013},
	month = {05},
	pages = {R125-R132},
	abstract = {Waveform inversion is the method of choice for determining highly heterogeneous subsurface structure. However, conventional waveform inversion requires that the wavefield for each source is computed separately. This makes it very expensive for realistic 3D seismic surveys. Source-encoding waveform inversion, in which the sources are modelled simultaneously, is considerably faster than conventional waveform inversion but suffers from artifacts. These artifacts can partly be removed by assigning random weights to the source wavefields. We found that the misfit function, and therefore also its gradient, for source-encoding waveform inversion is an unbiased random estimation of the misfit function used in conventional waveform inversion. We found a new method of source-encoding waveform inversion which takes into account the random nature of the gradients used in the optimization. In this new method, the gradient at each iteration is a weighted average of past gradients such that the most recent gradients have the largest weights with exponential decay. This way we damped the random fluctuations of the gradient by incorporating information from the previous iterations. We compare this new method with existing source-encoding waveform inversion methods as well as conventional waveform inversion and found that the model misfit reduction is faster and smoother than those of existing source-encoding waveform inversion methods, and it approaches the model misfit reduction obtained in conventional waveform inversion.},
	keywords = {FWI, Geophysics, Optimization, source encoding},
	doi = {10.1190/GEO2012-0090.1},
	url = {https://slim.gatech.edu/Publications/Public/Journals/Geophysics/2013/moghaddam2013GEOPnoa/moghaddam2013GEOPnoa.pdf},
	author = {Peyman P. Moghaddam and Henk Keers and Felix J. Herrmann and Wim A. Mulder}
}
@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}
}
