@unpublished {gahlot2025EAGEagc,
	title = {Advancing Geological Carbon Storage Monitoring with 3D Digital Shadow Technology},
	year = {2025},
	month = {6},
	keywords = {3D digital shadow, Amortized Variational Inference, Bayesian inference, conditional normalizing flows, data assimilation, deep learning, digital twin, experimental design, FWI, GCS, Imaging, Inverse problems, RTM, Summary Statistics, Uncertainty quantification, WISE},
	url = {https://slim.gatech.edu/Publications/Public/Submitted/2025/gahlot2025EAGEagc/abstract.html},
	author = {Abhinav Prakash Gahlot and Rafael Orozco and Felix J. Herrmann}
}
@conference {herrmann2025IMSIafi,
	title = {Amortized Full-Waveform Inference w/ Learned Summary Statistics},
	booktitle = {Reduced Order and Surrogate Modeling for Digital Twins, IMSI, Chicago},
	year = {2025},
	month = {11},
	keywords = {attention, Bayesian inference, CIG, deep learning, diffusion models, FWI, IMAGE, Imaging, Inverse problems, learned summary statistics, RTM, SEG, uncertainty calibration, Uncertainty quantification, velocity model building, WISE},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/IMSI/2025/herrmann2025IMSIafi},
	author = {Rafael Orozco and Ziyi Yin and Shiqin Zeng and Felix J. Herrmann}
}
@article {orozco2024IPaspire,
	title = {ASPIRE: Iterative Amortized Posterior Inference for Bayesian Inverse Problems},
	journal = {Inverse Problems},
	volume = {41},
	year = {2025},
	note = {(Inverse Problems)},
	month = {3},
	abstract = {Due to their uncertainty quantification, Bayesian solutions to inverse problems are the framework of choice in applications that are risk averse. These benefits come at the cost of computations that are in general, intractable. New advances in machine learning and variational inference (VI) have lowered the computational barrier by learning from examples. Two VI paradigms have emerged that represent different tradeoffs: amortized and non-amortized. Amortized VI can produce fast results but due to generalizing to many observed datasets it produces suboptimal inference results. Non-amortized VI is slower at inference but finds better posterior approximations since it is specialized towards a single observed dataset. Current amortized VI techniques run into a sub-optimality wall that can not be improved without more expressive neural networks or extra training data. We present a solution that enables iterative improvement of amortized posteriors that uses the same networks architectures and training data. The benefits of our method requires extra computations but these remain frugal since they are based on physics-hybrid methods and summary statistics. Importantly, these computations remain mostly offline thus our method maintains cheap and reusable online evaluation while bridging the approximation gap these two paradigms. We denote our proposed method ASPIRE - Amortized posteriors with Summaries that are Physics-based and Iteratively REfined. We first validate our method on a stylized problem with a known posterior then demonstrate its practical use on a high-dimensional and nonlinear transcranial medical imaging problem with ultrasound. Compared with the baseline and previous methods from the literature our method stands out as an computationally efficient and high-fidelity method for posterior inference.},
	keywords = {Amortization Gap, Amortized Variational Inference, Bayesian inference, medical imaging, Normalizing flows, simulation-based inference},
	doi = {10.1088/1361-6420/adba3d},
	url = {https://doi.org/10.1088/1361-6420/adba3d},
	author = {Rafael Orozco and Ali Siahkoohi and Mathias Louboutin and Felix J. Herrmann}
}
@conference {herrmann20205IMAGEapg,
	title = {Attention Please: Getting the Most from CIGs with Learned Summary Statistics},
	booktitle = {International Meeting for Applied Geoscience and Energy},
	year = {2025},
	month = {8},
	keywords = {attention, Bayesian inference, CIG, deep learning, diffusion models, FWI, IMAGE, Imaging, Inverse problems, learned summary statistics, RTM, SEG, uncertainty calibration, Uncertainty quantification, velocity model building, WISE},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2025/herrmann20205IMAGEapg},
	author = {Shiqin Zeng and Rafael Orozco and Yunlin Zeng and Huseyin Tuna Erdinc and Abhinav Prakash Gahlot and Felix J. Herrmann}
}
@presentation {herrmann2023SCAIMact,
	title = {Act normal that{\textquoteright}s crazy enough {\textemdash} an overview of seismic inversion with normalizing flows and surrogate modeling},
	year = {2023},
	note = {(SCAIM, Vancover)},
	month = {03},
	abstract = {During this talk, I will give an overview on how techniques from neural (conditional) density estimation and surrogate modeling can be used to solve challenging problems in seismic imaging and monitoring of geological carbon storage. I will start by outlining how (conditional) normalizing flows can be used as priors, to regularize inverse problems, and as low-fidelity amortized posteriors for wave-based inversions. To this end, I will uss techniques from simulation-based inference. When time, permits I will also talk about permeability inversion from time-lapse seismic data using neural surrogates (Fourier Neural Operators) to mimic solution operators of two-phase flow equations.},
	keywords = {CCS, FNO, GCS, monitoring, Normalizing flows, SCAIM, sequential Bayes, SLIM, surrogate, Uncertainty quantification},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SCAIM/2023/herrmann2023SCAIMact/index.html},
	author = {Felix J. Herrmann}
}
@conference {orozco2022SPIEadjoint,
	title = {Adjoint operators enable fast and amortized machine learning based Bayesian uncertainty quantification},
	booktitle = {SPIE Medical Imaging Conference},
	year = {2023},
	note = {(SPIE, San Diego)},
	month = {02},
	abstract = {Machine learning algorithms such as Normalizing Flows, VAEs, and GANs are powerful tools in Bayesian uncertainty quantification (UQ) of inverse problems. Unfortunately, when using these algorithms medical imaging practitioners are faced with the challenging task of manually defining neural networks that can handle complicated inputs such as acoustic data. This task needs to be replicated for different receiver types or configurations since these change the dimensionality of the input. We propose to first transform the data using the adjoint operator {\textemdash}ex: time reversal in photoacoustic imaging (PAI) or back-projection in computer tomography (CT) imaging {\textemdash} then continue posterior inference using the adjoint data as an input now that it has been standardized to the size of the unknown model. This adjoint preprocessing technique has been used in previous works but with minimal discussion on if it is biased. In this work, we prove that conditioning on adjoint data is unbiased for a certain class of inverse problems. We then demonstrate with two medical imaging examples (PAI and CT) that adjoints enable two things: Firstly, adjoints partially undo the physics of the forward operator resulting in faster convergence of an ML based Bayesian UQ technique. Secondly, the algorithm is now robust to changes in the observed data caused by differing transducer subsampling in PAI and number of angles in CT. Our adjoint-based Bayesian inference method results in point estimates that are faster to compute than traditional baselines and show higher SSIM metrics, while also providing validated UQ.},
	keywords = {Amortized Inference, Bayesian inference, deep learning, Inverse problems, machine learning, medical imaging, Normalizing flows, SPIE, Uncertainty quantification},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SPIE/2023/orozco2022SPIEadjoint/SPIE_2022_adjoint.html},
	author = {Rafael Orozco and Ali Siahkoohi and Gabrio Rizzuti and Tristan van Leeuwen and Felix J. Herrmann}
}
@conference {orozco2023IMAGEabf,
	title = {Amortized Bayesian Full Waveform Inversion and Experimental Design with Normalizing Flows},
	booktitle = {International Meeting for Applied Geoscience and Energy},
	year = {2023},
	note = {(IMAGE, Houston)},
	month = {08},
	abstract = {Probabilistic approaches to Full-Waveform Inversion (FWI), such as Bayesian ones, traditionally require expensive computations involving many wave-equation solves. To reduce the computational burden at test time, we propose to amortize the computational cost with offline training. After training, we aim to efficiently generate probabilistic FWI solutions with uncertainty. This aim is achieved by exploiting the ability of networks (i.e Normalizing Flows) to learn distributions, such as the Bayesian posterior. The posterior uncertainty is used during training to optimize the receiver sampling.},
	keywords = {bayesian, experimental design, FWI, Normalizing flows, SEG, Uncertainty quantification},
	url = {https://slimgroup.github.io/IMAGE2023/BayesianFWI/abstract.html},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2023/orozco2023IMAGEabf},
	author = {Rafael Orozco and Mathias Louboutin and Felix J. Herrmann}
}
@conference {orozco2023MIDLanf,
	title = {Amortized normalizing flows for transcranial ultrasound with uncertainty quantification},
	booktitle = {Medical Imaging with Deep Learning},
	year = {2023},
	note = {(MIDL, Nashville)},
	month = {07},
	abstract = {We present a novel approach to transcranial ultrasound computed tomography that utilizes normalizing flows to improve the speed of imaging and provide Bayesian uncertainty quantification. Our method combines physics-informed methods and data-driven methods to accelerate the reconstruction of the final image. We make use of a physics-informed summary statistic to incorporate the known ultrasound physics with the goal of compressing large incoming observations. This compression enables efficient training of the normalizing flow and standardizes the size of the data regardless of imaging configurations. The combinations of these methods results in fast uncertainty-aware image reconstruction that generalizes to a variety of transducer configurations. We evaluate our approach with in silico experiments and demonstrate that it can significantly improve the imaging speed while quantifying uncertainty. We validate the quality of our image reconstructions by comparing against the traditional physics-only method and also verify that our provided uncertainty is calibrated with the error.},
	keywords = {Bayesian Estimation, invertible networks, medical imaging, MIDL, Physics and Machine Learning Hybrid, Uncertainty quantification},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/MIDL/2023/orozco2023MIDLanf/paper.pdf},
	author = {Rafael Orozco and Mathias Louboutin and Ali Siahkoohi and Gabrio Rizzuti and Tristan van Leeuwen and Felix J. Herrmann}
}
@conference {louboutin2022SEGWSaaa,
	title = {Abstractions and algorithms for efficient seismic inversion on accelerators},
	booktitle = {IMAGE Workshop on What{\textquoteright}s Next for FWI and its Derived Products},
	year = {2022},
	note = {(IMAGE Workshop, Houston)},
	month = {09},
	abstract = {We present the SLIM open-source software framework for computational geophysics, and more generally, inverse problems based on the wave-equation (e.g., medical ultrasound). We developed a software environment aimed at scalable research and development by designing multiple layers of abstractions. This environment allows the researchers to easily formulate their problem in an abstract fashion, while still being able to exploit the latest developments in high-performance computing. We illustrate and demonstrate the benefits of our software design on many geophysical applications, including seismic inversion and physics-informed machine learning for geophysics (e.g., loop unrolled imaging, uncertainty quantification), all while facilitating the integration of external software.},
	keywords = {algorithms, deep learning, devito, FWI, Imaging, JUDI, LSRTM, SEG, software, workshop},
	url = {https://www.imageevent.org/Workshop/next-fwi-derived-products},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2022/louboutin2022SEGWSaaa/index.html},
	author = {Mathias Louboutin and Felix J. Herrmann}
}
@conference {louboutin2022RHPCafa,
	title = {Abstractions for at-scale seismic inversion},
	booktitle = {Rice Oil and Gas High Performance Computing Conference 2022},
	year = {2022},
	note = {Rice Oil and Gas High Performance Computing Conference 2022},
	month = {03},
	pages = {Thursday Workshop: Devito Training and Hackathon},
	abstract = {We present the SLIM open-source software framework for computational geophysics, and more generally, inverse problems based on the wave-equation (e.g., medical ultrasound). We developed a software environment aimed at scalable research and development by designing multiple layers of abstractions. This environment allows the researchers to easily formulate their problem in an abstract fashion, while still being able to exploit the latest developments in high-performance computing. We illustrate and demonstrate the benefits of our software design on many geophysical applications, including seismic inversion and physics-informed machine learning for geophysics (e.g., loop unrolled imaging, uncertainty quantification), all while facilitating the integration of external software.},
	keywords = {CCS, devito, FWI, HPC, inversion, JUDI, machine learning, RHPC, software, Uncertainty quantification},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/RHPC/2022/louboutin2022RHPCafa/RiceHPC22.pdf},
	url2 = {https://youtu.be/scRTbP8w6Wk?t=4542},
	author = {Mathias Louboutin and Ali Siahkoohi and Ziyi Yin and Rafael Orozco and Thomas J. Grady II and Yijun Zhang and Philipp A. Witte and Gabrio Rizzuti and Felix J. Herrmann}
}
@conference {louboutin2022SEGais,
	title = {Accelerating innovation with software abstractions for scalable computational geophysics},
	booktitle = {International Meeting for Applied Geoscience and Energy Expanded Abstracts},
	year = {2022},
	note = {(IMAGE, Houston)},
	month = {05},
	abstract = {We present the SLIM open-source software framework for computational geophysics, and more generally, inverse problems based on the wave-equation (e.g., medical ultrasound). We developed a software environment aimed at scalable research and development by designing multiple layers of abstractions. This environment allows the researchers to easily formulate their problem in an abstract fashion, while still being able to exploit the latest developments in high-performance computing. We illustrate and demonstrate the benefits of our software design on many geophysical applications, including seismic inversion and physics-informed machine learning for geophysics(e.g., loop unrolled imaging, uncertainty quantification), all while facilitating the integration of external software.},
	keywords = {CCS, devito, FWI, HPC, inversion, JUDI, machine learning, SEG, software, Uncertainty quantification},
	doi = {10.1190/image2022-3750561.1},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2022/louboutin2022SEGais/louboutin_seg22.html},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2022/louboutin2022SEGais/index.html},
	author = {Mathias Louboutin and Philipp A. Witte and Ali Siahkoohi and Gabrio Rizzuti and Ziyi Yin and Rafael Orozco and Felix J. Herrmann}
}
@presentation {orozco2022ML4SEISMICaos,
	title = {Adjoint operators as summary functions in amortized Bayesian inference frameworks},
	year = {2022},
	month = {11},
	abstract = {An important concern in seismic inverse problems is the large and varying size of observed data. The large size can cause computational cost concerns and its varying size (such as when changing receiver geometries) implies the need to rerun inference algorithms from scratch for each new observation. Motivated by these two problems, we take inspiration from the statistics literature which commonly relies on summary statistic of observed data. Summary statistic compress the observed data leaving only information needed for inference. In this work, we argue that the adjoint operator provides a natural candidate for a summary function in the context of physics-based inverse problems. We first mathematically show that for certain general assumptions transforming data under the adjoint operator defines a new conditional distribution which preserves the expectations of the original posterior. We validate our hypothesis by evaluating our framework in a learned amortized inference algorithm. Our seismic and medical synthetic experiments show computational gains and increased quality of point estimates using our framework. We discuss statistical metrics that show our learned posterior is well calibrated therefore justifying its use in uncertainty quantification.},
	keywords = {Amortized Inference, Bayesian inference, deep learning, Inverse problems, machine learning, medical imaging, ML4SEISMIC, Normalizing flows, SLIM, Uncertainty quantification},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/ML4SEISMIC/2022/orozco2022ML4SEISMICaos/index.html},
	author = {Rafael Orozco and Mathias Louboutin and Ali Siahkoohi and Gabrio Rizzuti and Felix J. Herrmann}
}
@presentation {yin2022ML4SEISMICavc,
	title = {Amortized velocity continuation with Fourier neural operators},
	year = {2022},
	month = {11},
	abstract = {Velocity continuation aims to map the migration image using one background model to the image using another background model. It is of great importance to quantify the uncertainty in seismic imaging result from various background models. With Fourier neural operators as a learned surrogate, this continuation from a given background model to an unseen background model can be quite accurately estimated with near-zero cost. However, the limitation of the prior art is that the input background model and the survey area are assumed to be fixed. The main contribution of this work is to extend the Fourier neural operator surrogate to be amortized over different given background models and survey areas. We verify the effectiveness of our learned surrogates by a realistic example on different areas of Parihaka dataset against different background models.},
	keywords = {Fourier neural operators, ML4SEISMIC, SLIM, Uncertainty quantification, velocity continuation},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/ML4SEISMIC/2022/yin2022ML4SEISMICavc/index.html},
	author = {Ali Siahkoohi and Ziyi Yin and Mathias Louboutin 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}
}
@conference {herrmann2019EAGEHPCaii,
	title = {Accelerating ideation and innovation cheaply in the Cloud the power of abstraction, collaboration and reproducibility},
	booktitle = {4th EAGE Workshop on High-performance Computing},
	year = {2019},
	note = {(EAGE HPC Workshop, Dubai)},
	month = {10},
	keywords = {cloud, devito, EAGE, HPC, JUDI},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/EAGEHPC/2019/herrmann2019EAGEHPCaii/herrmann2019EAGEHPCaii_pres.pdf},
	author = {Felix J. Herrmann and Charles Jones and Gerard Gorman and Jan H{\"u}ckelheim and Keegan Lensink and Paul H. J. Kelly and Navjot Kukreja and Henryk Modzelewski and Michael Lange and Mathias Louboutin and Fabio Luporini and James Selvages and Philipp A. Witte}
}
@article {peters2019aos,
	title = {Algorithms and software for projections onto intersections of convex and non-convex sets with applications to inverse problems},
	journal = {arXiv e-prints},
	year = {2019},
	note = {(arXiv)},
	month = {03},
	abstract = {We propose algorithms and software for computing projections onto the intersection of multiple convex and non-convex constraint sets. The software package, called SetIntersectionProjection, is intended for the regularization of inverse problems in physical parameter estimation and image processing. The primary design criterion is working with multiple sets, which allows us to solve inverse problems with multiple pieces of prior knowledge. Our algorithms outperform the well known Dykstra{\textquoteright}s algorithm when individual sets are not easy to project onto because we exploit similarities between constraint sets. Other design choices that make the software fast and practical to use, include recently developed automatic selection methods for auxiliary algorithm parameters, fine and coarse grained parallelism, and a multilevel acceleration scheme. We provide implementation details and examples that show how the software can be used to regularize inverse problems. Results show that we benefit from working with all available prior information and are not limited to one or two regularizers because of algorithmic, computational, or hyper-parameter selection issues.},
	keywords = {algorithm, software},
	url = {http://arxiv.org/abs/1902.09699},
	author = {Bas Peters and Felix J. Herrmann}
}
@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}
}
@conference {alfaraj2018EAGEasa,
	title = {Automatic statics and residual statics correction with low-rank approximation},
	booktitle = {EAGE Annual Conference Proceedings},
	year = {2018},
	note = {(EAGE, Copenhagen)},
	month = {06},
	abstract = {Seismic data, mainly on land, suffers from long-wavelength statics due to the laterally varying and heterogeneous nature of the near-surface weathering layers. We propose an automatic, data-driven and computationally efficient statics correction method based on low-rank approximation to correct for such statics. The method does not require a model to estimate static time shifts, which is the case for other static correction methods; rather it applies the appropriate static corrections on the data such that it becomes low rank in a certain domain. As of now, the method is applicable to data that has been corrected for elevation statics. Due to the near-surface irregularities and due to approximations used by static correction methods that lead to not fully correcting for statics, an iterative residual statics correction becomes necessary. Our proposed method corrects for residual statics without the necessity of the surface consistency assumption and a multi-iterate process. Additional benefits of the method include artifacts and noise suppression. We demonstrate the successful application of our method on several synthetic data examples.},
	keywords = {EAGE, land, Rank, residual statics, statics},
	doi = {10.3997/2214-4609.201801107},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2018/alfaraj2018EAGEasa/alfaraj2018EAGEasa.html},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2018/alfaraj2018EAGEasa/alfaraj2018EAGEasa_pres.pdf},
	author = {Ali M. Alfaraj and Rajiv Kumar and Felix J. Herrmann}
}
@presentation {peters2017SINBADFaaj,
	title = {Algorithms and Julia software for FWI with multiple constraints},
	year = {2017},
	publisher = {SINBAD},
	abstract = {We present a framework to add multiple convex and non-convex constraints to nonlinear inverse problems, specifically FWI. The constraints mitigate problems related to noisy data, artifacts arising from working with very few simultaneous sources, inaccurate starting models and using approximate physical forward models. Compared to earlier work at SLIM, the current framework is algorithmically simpler and computationally more efficient. We show examples where the model estimation is improved when we use very limited prior knowledge directly as constraints. We also present the software implementation in Julia and how it is used together with other software that compute data-misfit values and gradients w.r.t. the model parameters.},
	keywords = {Presentation, SINBAD, SINBADFALL2017, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2017/Fall/peters2017SINBADFaaj/peters2017SINBADFaaj.pdf},
	url2 = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2017/Fall/peters2017SINBADFaaj/peters2017SINBADFaaj.m4v},
	author = {Bas Peters and Felix J. Herrmann}
}
@presentation {bougher2016SINBADFaaa,
	title = {Amplitude vs. angle analysis as an unsupervised learning problem},
	year = {2016},
	publisher = {SINBAD},
	abstract = {Amplitude vs. angle analysis (AVA) of pre-stack seismic data is a commonly used method for inferring petrophysical information from seismic data. Conventionally, a two-term linearized rock physics model (Shuey equation) is used to invert angle-domain common-image gathers. Multivariate analysis of the inverted terms leads to a background of siliciclastic interfaces, where outlying points are associated with hydrocarbon saturated sands. The acquisition and processing of seismic data does not result in highly-calibrated measurements that adhere to the rock physics model, which often inhibits the success of AVA analysis. We offer an alternative approach that uses PCA-based methods to learn projections directly from the data without the need of a physical model. Results on synthetic and field data show that PCA-based projections can improve segmentation of potential reservoirs in seismic data.},
	keywords = {Presentation, SINBAD, SINBADFALL2016, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2016/Fall/bougher2016SINBADFaaa/bougher2016SINBADFaaa.pdf},
	url2 = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2016/Fall/bougher2016SINBADFaaa/bougher2016SINBADFaaa.mov},
	author = {Ben B. Bougher and Felix J. Herrmann}
}
@presentation {oghenekohwo2016SINBADFast,
	title = {Asymmetric sampling for time-lapse surveys},
	year = {2016},
	publisher = {SINBAD},
	abstract = {In this talk, we use the joint recovery model (JRM), which derives from distributed compressed sensing, to reconstruct time-lapse data acquired via time-jittered marine sources that are significantly subsampled in the monitor survey(s) in comparison to the baseline survey, hence, saving acquisition cost. We analyze the effects of two or more asymmetrically subsampled monitor surveys on wavefield reconstruction via JRM. We leverage the common information shared amongst the vintages during our sparsity-promoting recovery.},
	keywords = {Presentation, SINBAD, SINBADFALL2016, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2016/Fall/oghenekohwo2016SINBADFast/oghenekohwo2016SINBADFast.pdf},
	url2 = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2016/Fall/oghenekohwo2016SINBADFast/oghenekohwo2016SINBADFast.mov},
	author = {Felix Oghenekohwo and Haneet Wason and Felix J. Herrmann}
}
@conference {bougher2016SEGava,
	title = {AVA classification as an unsupervised machine-learning problem},
	booktitle = {SEG Technical Program Expanded Abstracts},
	year = {2016},
	note = {(SEG, Dallas)},
	month = {10},
	pages = {553-556},
	abstract = {Much of AVA analysis relies on characterizing background trends and anomalies in pre-stack seismic data. Analysts reduce a seismic section into a small number of these trends and anomalies, suggesting that a low-dimensional structure can be inferred from the data. We describe AVA-attribute characterization as an unsupervised-learning problem, where AVA classes are learned directly from the data without any prior assumptions on physics and geological settings. The method is demonstrated on the Marmousi II elastic model, where a gas reservoir was successfully delineated from a background trend in a depth migrated image.},
	keywords = {AVA, machine learning, SEG},
	doi = {10.1190/segam2016-13874419.1},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2016/bougher2016SEGava/bougher2016SEGava.html},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2016/bougher2016SEGava/bougher2016SEGava_pres.pdf},
	author = {Ben B. Bougher and Felix J. Herrmann}
}
@conference {vanleeuwen2015EAGEafs,
	title = {Affordable full subsurface image volume{\textendash}-an application to WEMVA},
	booktitle = {EAGE Annual Conference Proceedings},
	year = {2015},
	note = {(EAGE Workshop on Wave Equation based Migration Velocity Analysis, Madrid)},
	month = {06},
	abstract = {Common image gathers are used in building velocity models, inverting for anisotropy parameters, and analyzing reservoir attributes. In this paper, we offer a new perspective on image gathers, where we glean information from the image volume via efficient matrix-vector products. The proposed formulation make the computation of full subsurface image volume feasible. We illustrate how this matrix-vector product can be used to construct objective functions for automatic MVA.},
	keywords = {EAGE, MVA, randomized trace estimation, wave-equation},
	doi = {10.3997/2214-4609.201413498},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2015/vanleeuwen2015EAGEafs/vanleeuwen2015EAGEafs.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2015/vanleeuwen2015EAGEafs/vanleeuwen2015EAGEafs_pres.pdf},
	author = {Tristan van Leeuwen and Rajiv Kumar and Felix J. Herrmann}
}
@presentation {kumar2015SINBADFaoi,
	title = {Affordable omnidirectional image volumes extension to 3D},
	year = {2015},
	publisher = {SINBAD},
	abstract = {Image gathers are an important tool for velocity analysis, AVA analysis and targeted imaging, however, the computational cost involving in forming the image volumes makes them prohibitively expensive in case of large scale 3D seismic data acquisition. In this work, we propose the extension of our probing techniques from 2D to 3D to form the extended image volumes efficiently. We show the efficacy of proposed formulation on synthetic data set.},
	keywords = {Presentation, SINBAD, SINBADFALL2015, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2015/Fall/kumar2015SINBADFaoi/kumar2015SINBADFaoi.pdf},
	url2 = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2015/Fall/kumar2015SINBADFaoi/kumar2015SINBADFaoi.mov},
	author = {Rajiv Kumar and Tristan van Leeuwen and Felix J. Herrmann}
}
@conference {peters2015PRECONasl,
	title = {An algorithm for solving least-squares problems with a Helmholtz block and multiple right-hand-sides},
	booktitle = {International Conference On Preconditioning Techniques For Scientific And Industrial Applications},
	year = {2015},
	note = {(PRECON, The Netherlands)},
	month = {06},
	keywords = {CGMN, Helmholtz, least-squares, matrix-free, randomized linear algebra},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/PRECON/2015/peters2015PRECONasl/peters2015PRECONasl_pres.pdf},
	author = {Bas Peters and Chen Greif and Felix J. Herrmann}
}
@presentation {witte2015SINBADFara,
	title = {Anisotropic RTM applied to field data},
	year = {2015},
	publisher = {SINBAD},
	abstract = {In this talk we present our latest reverse time-migration results of the BP Machar data set, a 2D seismic line from the North sea featuring a large chalk dome. In contrast to our prior imaging attempts, we now account for anisotropic effects in the data using our new TTI pure quasi-P wave modeling code in the time domain.},
	keywords = {Presentation, SINBAD, SINBADFALL2015, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2015/Fall/witte2015SINBADFara/witte2015SINBADFara.pdf},
	url2 = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2015/Fall/witte2015SINBADFara/witte2015SINBADFara.mov},
	author = {Philipp A. Witte and Felix J. Herrmann}
}
@conference {esser2015SEGasd,
	title = {Automatic salt delineation {\textendash}- Wavefield Reconstruction Inversion with convex constraints},
	booktitle = {SEG Technical Program Expanded Abstracts},
	year = {2015},
	note = {(SEG, New Orleans)},
	month = {10},
	pages = {1337-1343},
	abstract = {We extend full-waveform inversion by Wavefield Reconstruction Inversion by including convex constraints on the model. Contrary to the conventional adjoint-state formulations, Wavefield Reconstruction Inversion has the advantage that the Gauss-Newton Hessian is well approximated by a diagonal scaling, which allows us to add convex constraints, such as the box- and the edge-preserving total-variation constraint, on the square slowness without incurring significant increases in computational costs. As the examples demonstrate, including these constraints yields far superior results in complex geological areas that contain high-velocity high-contrast bodies (e.g. salt or basalt). Without these convex constraints, adjoint-state and Wavefield Reconstruction Inversion get trapped in local minima for poor starting models.},
	keywords = {convex constraints, Full-waveform inversion, salt, SEG, total-variation norm},
	doi = {10.1190/segam2015-5877995.1},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2015/esser2015SEGasd/esser2015SEGasd.html},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2015/esser2015SEGasd/esser2015SEGasd_pres.pdf},
	author = {Ernie Esser and Llu{\'\i}s Guasch and Tristan van Leeuwen and Aleksandr Y. Aravkin and Felix J. Herrmann}
}
@presentation {esser2015SINBADasd,
	title = {Automatic salt delineation {\textemdash} Wavefield Reconstruction Inversion with convex constraints},
	year = {2015},
	note = {posthumously presented by Felix J. Herrmann},
	publisher = {SINBAD},
	abstract = {We extend full-waveform inversion by Wavefield Reconstruction Inversion by including convex constraints on the model. Contrary to the conventional adjoint-state formulations, Wavefield Reconstruction Inversion has the advantage that the Gauss-Newton Hessian is well approximated by a diagonal scaling, which allows us to add convex constraints, such as the box- and the edge-preserving total-variation constraint, on the square slowness without incurring significant increases in computational costs. As the examples demonstrate, including these constraints yields far superior results in complex geological areas that contain high-velocity high-contrast bodies (e.g. salt or basalt). Without these convex constraints, adjoint-state and Wavefield Reconstruction Inversion get trapped in local minima for poor starting models.},
	keywords = {Presentation, SINBAD, SINBADSPRING2015, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2015/Spring/esser2015SINBADasd/esser2015SINBADasd.pdf},
	author = {Ernie Esser and Llu{\'\i}s Guasch and Felix J. Herrmann}
}
@presentation {esser2015SINBADFasd,
	title = {Automatic salt delineation {\textemdash} Wavefield Reconstruction Inversion with convex constraints},
	year = {2015},
	publisher = {SINBAD},
	abstract = {We extend full-waveform inversion by Wavefield Reconstruction Inversion by including convex constraints on the model. Contrary to the conventional adjoint-state formulations, Wavefield Reconstruction Inversion has the advantage that the Gauss-Newton Hessian is well approximated by a diagonal scaling, which allows us to add convex constraints, such as the box- and the edge-preserving total-variation constraint, on the square slowness without incurring significant increases in computational costs. As the examples demonstrate, including these constraints yields far superior results in complex geological areas that contain high-velocity high-contrast bodies (e.g. salt or basalt). Without these convex constraints, adjoint-state and Wavefield Reconstruction Inversion get trapped in local minima for poor starting models.},
	keywords = {Presentation, SINBAD, SINBADFALL2015, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2015/Fall/esser2015SINBADFasd/esser2015SINBADFasd.pdf},
	url2 = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2015/Fall/esser2015SINBADFasd/esser2015SINBADFasd.mov},
	author = {Ernie Esser and Llu{\'\i}s Guasch and Felix J. Herrmann}
}
@conference {herrmann2015SEGWSasf,
	title = {Automatic salt flooding with constrained wavefield reconstruction inversion},
	booktitle = {SEG Summer Research Workshop on FWI Applications from Imaging to Reservoir Characterization; Houston},
	year = {2015},
	note = {(SEG Summer Workshop, Houston)},
	month = {07},
	keywords = {SEG, Wavefield Reconstruction Inversion, workshop},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2015/herrmann2015SEGWSasf/herrmann2015SEGWSasf_pres.pdf},
	author = {Felix J. Herrmann}
}
@conference {esser2015SEGWSasf,
	title = {Automatic salt flooding with hinged FWI},
	booktitle = {SEG Workshop on Subsalt model buiding long to short wavelengths; New Orleans},
	year = {2015},
	note = {(SEG, New Orleans)},
	month = {10},
	keywords = {SEG, waveform inversion, workshop},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2015/esser2015SEGWSasf/esser2015SEGWSasf_pres.pdf},
	author = {Ernie Esser and Llu{\'\i}s Guasch and Felix J. Herrmann}
}
@mastersthesis {petrenko2014THaih,
	title = {Accelerating an iterative Helmholtz solver using reconfigurable hardware},
	year = {2014},
	note = {(MSc)},
	month = {04},
	school = {The University of British Columbia},
	type = {masters},
	address = {Vancouver},
	abstract = {An implementation of seismic wave simulation on a platform consisting of a conventional host processor and a reconfigurable hardware accelerator is presented. This research is important in the field of exploration for oil and gas resources, where a 3D model of the subsurface of the Earth is frequently required. By comparing seismic data collected in a real-world survey with synthetic data generated by simulated waves, it is possible to deduce such a model. However this requires many time-consuming simulations with different Earth models to find the one that best fits the measured data. Speeding up the wave simulations would allow more models to be tried, yielding a more accurate estimate of the subsurface. The reconfigurable hardware accelerator employed in this work is a field programmable gate array (FPGA). FPGAs are computer chips that consist of electronic building blocks that the user can configure and reconfigure to represent their algorithm in hardware. Whereas a traditional processor can be viewed as a pipeline for processing instructions, an FPGA is a pipeline for processing data. The chief advantage of the FPGA is that all the instructions in the algorithm are already hardwired onto the chip. This means that execution time depends only on the amount of data to be processed, and not on the complexity of the algorithm. The main contribution is an implementation of the well-known Kaczmarz row projection algorithm on the FPGA, using techniques of dataflow programming. This kernel is used as the preconditioning step of CGMN, a modified version of the conjugate gradients method that is used to solve the time-harmonic acoustic isotropic constant density wave equation. Using one FPGA-based accelerator, the current implementation allows seismic wave simulations to be performed over twice as fast, compared to running on one Intel Xeon E5-2670 core. I also discuss the effect of modifications of the algorithm necessitated by the hardware on the convergence properties of CGMN. Finally, a specific plan for future work is set-out in order to fully exploit the accelerator platform, and the work is set in its larger context.},
	keywords = {CG, CGMN, FPGA, Helmholtz, Kaczmarz, linear solver, Maxeler, MSc, thesis, wave equation},
	url = {https://slim.gatech.edu/Publications/Public/Thesis/2014/petrenko2014THaih/petrenko2014THaih.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Thesis/2014/petrenko2014THaih/petrenko2014THaih_pres.pdf},
	author = {Art Petrenko}
}
@conference {petrenko2014EAGEaih,
	title = {Accelerating an iterative Helmholtz solver with FPGAs},
	booktitle = {EAGE Annual Conference Proceedings},
	year = {2014},
	month = {06},
	abstract = {We implement the Kaczmarz row-projection algorithm (Kaczmarz (1937)) on a CPU host + FPGA accelerator platform using techniques of dataflow programming. This algorithm is then used as the preconditioning step in CGMN, a modified version of the conjugate gradients method (Bj{\"o}rck and Elfving (1979)) that we use to solve the time-harmonic acoustic isotropic constant density wave equation. Using one accelerator we achieve a speed-up of over 2{\texttimes} compared with one Intel core.},
	keywords = {CGMN, EAGE, FPGA, Helmholtz equation, Kaczmarz, reconfigurable computing},
	doi = {10.3997/2214-4609.20141141},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2014/petrenko2014EAGEaih/petrenko2014EAGEaih.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2014/petrenko2014EAGEaih/petrenko2014EAGEaih_pres.pdf},
	author = {Art Petrenko and Tristan van Leeuwen and Diego Oriato and Simon Tilbury and Felix J. Herrmann}
}
@presentation {petrenko2014SINBADaih,
	title = {Accelerating an iterative Helmholtz solver with FPGAs},
	year = {2014},
	publisher = {SINBAD},
	abstract = {An implementation of seismic wave simulation on a platform consisting of a conventional host processor and a reconfigurable hardware accelerator is presented. This research is important in the field of exploration for oil and gas resources, where a 3D model of the subsurface is frequently required. By comparing seismic data collected in a real-world survey with synthetic data generated by simulated waves, it is possible to deduce such a model. However this requires many time-consuming simulations with different Earth models to find the one that best fits the measured data. Speeding up the wave simulations would allow more models to be tried, yielding a more accurate estimate of the subsurface. The reconfigurable hardware accelerator employed in this work is a field programmable gate array (FPGA). FPGAs are computer chips that consist of electronic building blocks that the user can configure and reconfigure to represent their algorithm in hardware. Whereas a traditional processor can be viewed as a pipeline for processing instructions, an FPGA is a pipeline for processing data. The chief advantage of the FPGA is that all the instructions in the algorithm are already hardwired onto the chip. This means that execution time depends only on the amount of data to be processed, and not on the complexity of the algorithm. The main contribution is an implementation of the well-known Kaczmarz row projection algorithm on the FPGA, using techniques of dataflow programming. This kernel is used as the preconditioning step of CGMN, a modified version of the conjugate gradients method that is used to solve the time-harmonic acoustic isotropic constant density wave equation. Using one FPGA accelerator, the current implementation allows seismic wave simulations to be performed over twice as fast, compared to running on one Intel Xeon E5-2670 core. I also discuss the effect of modifications of the algorithm necessitated by the hardware on the convergence properties of CGMN. Finally, a specific plan for future work is set-out in order to fully exploit the accelerator platform, and my work is set in its larger context},
	keywords = {Presentation, SINBAD, SINBADSPRING2014, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2014/Spring/petrenko2014SINBADaih/petrenko2014SINBADaih.pdf},
	author = {Art Petrenko and Tristan van Leeuwen and Diego Oriato and Simon Tilbury and Felix J. Herrmann}
}
@conference {petrenko2014OGHPCaih,
	title = {Accelerating an iterative Helmholtz solver with FPGAs},
	booktitle = {OGHPC},
	year = {2014},
	month = {03},
	abstract = {We implement the Kaczmarz row-projection algorithm [Kaczmarz, 1937] on a CPU host + FPGA accelerator platform using techniques of dataflow programming. This algorithm is then used as the preconditioning step in CGMN, a modified version of the conjugate gradients method [Bj?rck and Elfving, 1979] that we use to solve the time-harmonic acoustic isotropic constant density wave equation.},
	keywords = {CGMN, FPGA, Helmholtz equation, Kaczmarz, OGHPC, reconfigurable computing},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/OGHPC/2014/petrenko2014OGHPCaih/petrenko2014OGHPCaih.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/OGHPC/2014/petrenko2014OGHPCaih/petrenko2014OGHPCaih_poster.pdf},
	author = {Art Petrenko and Felix J. Herrmann and Diego Oriato and Simon Tilbury and Tristan van Leeuwen}
}
@presentation {warner2014SINBADawi,
	title = {Adaptive waveform inversion - FWI without cycle skipping},
	year = {2014},
	publisher = {SINBAD},
	abstract = {Conventional FWI minimises the direct differences between observed and predicted seismic datasets. Because seismic data are oscillatory, this approach will suffer from the detrimental effects of cycle skipping if the starting model is inaccurate. We reformulate FWI so that it instead adapts the predicted data to the observed data using Wiener filters, and then iterates to improve the model by forcing the Wiener filters towards zero-lag delta functions. This adaptive FWI scheme is demonstrated on synthetic data where it is shown to be immune to cycle skipping, and is able to invert successfully data for which conventional FWI fails entirely. The new method does not require low frequencies or a highly accurate starting model to be successful. Adaptive FWI has some features in common with wave-equation migration velocity analysis, but it works for all types of arrivals including multiples and refractions, and it does not have the high computational costs of WEMVA in 3D.},
	keywords = {Presentation, SINBAD, SINBADSPRING2014, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2014/Spring/warner2014SINBADawi/warner2014SINBADawi.pdf},
	author = {Mike Warner}
}
@presentation {yilmaz2014SINBADadc,
	title = {Analog-to-digital conversion in compressive sampling},
	year = {2014},
	publisher = {SINBAD},
	abstract = {Compressive sampling theory is now established as an effective method for dimension reduction when the underlying signals (e.g., seismic data) are sparse with respect to some suitable basis or frame (e.g., curvelets in the case of seismic). One important problem directly related to the acquisition of analog signals is how to perform analog-to-digital conversion. This is directly related to two important issues: (i) how accurately one can acquire a signal using compressive sampling (in terms of bit depth), and (ii) how {\textquoteleft}{\textquoteleft}compressed{\textquoteright}{\textquoteright} is compressive sampling (in terms of the total number of bits one ends up using after acquiring the signal). We will present recent results that provide answers to these questions. Specifically, we provide an analog-to-digital conversion method that achieves nearly optimal compression using cheap analog devices with a large margin for imperfections.},
	keywords = {Presentation, SINBAD, SINBADFALL2014, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2014/Fall/yilmaz2014SINBADadc/yilmaz2014SINBADadc.pdf},
	author = {Ozgur Yilmaz}
}
@conference {esser2014EAGEacp,
	title = {Application of a convex phase retrieval method to blind seismic deconvolution},
	booktitle = {EAGE Annual Conference Proceedings},
	year = {2014},
	month = {06},
	abstract = {A classical strategy for blind seismic deconvolution is to first estimate the autocorrelation of the unknown source wavelet from the data and then recover the wavelet by assuming it has minimum phase. However, computing the minimum phase wavelet directly from the amplitude spectrum can be sensitive to even extremely small errors, especially in the coefficients close to zero. Since the minimum phase requirement follows from an assumption that the wavelet should be as impulsive as possible, we propose to directly estimate an impulsive wavelet by minimizing a weighted l2 penalty subject to a constraint on its amplitude spectrum. This nonconvex model has the form of a phase retrieval problem, in this case recovering a signal given only estimates of the magnitudes of its Fourier coefficients. Following recent work on convex relaxations of phase retrieval problems, we propose a convex semidefinite program for computing an impulsive minimum phase wavelet whose amplitude spectrum is close to a given estimate, and we show that this can be robustly solved by a Douglas Rachford splitting method for convex optimization.},
	keywords = {blind deconvolution, convex phase retrieval, EAGE, source wavelet estimation},
	doi = {10.3997/2214-4609.20141590},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2014/esser2014EAGEacp/esser2014EAGEacp.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2014/esser2014EAGEacp/esser2014EAGEacp_poster.pdf},
	author = {Ernie Esser and Felix J. Herrmann}
}
@conference {zheglova2014EAGEams,
	title = {Application of matrix square root and its inverse to downward wavefield extrapolation},
	booktitle = {EAGE Annual Conference Proceedings},
	year = {2014},
	month = {06},
	abstract = {In this paper we propose a method for computation of the square root of the Helmholtz operator and its inverse that arise in downward extrapolation methods based on one-way wave equation. Our approach involves factorization of the discretized Helmholtz operator at each depth by extracting the matrix square root after performing the spectral projector in order to eliminate the evanescent modes. The computation of the square root of the discrete Helmholtz operator and its inverse is done using polynomial recursions and can be combined with low rank matrix approximations to reduce the computational cost for large problems. The resulting square root operator is able to model the propagating modes kinematically correctly at the angles of up to 90 degree. Preliminary results on convergence of iterations are presented in this abstract. Potential applications include seismic modeling, imaging and inversion.},
	keywords = {EAGE, extrapolation, Modelling, one-way wave equation, square root},
	doi = {10.3997/2214-4609.20141184},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2014/zheglova2014EAGEams/zheglova2014EAGEams.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2014/zheglova2014EAGEams/zheglova2014EAGEams_pres.pdf},
	author = {Polina Zheglova and Felix J. Herrmann}
}
@presentation {petrenko2013SINBADaih,
	title = {Accelerating an iterative Helmholtz solver with FPGAs},
	year = {2013},
	publisher = {SINBAD},
	abstract = {Solution of the Helmholtz equation is the main computational burden of full-waveform inversion in the frequency domain. For this task we employ the CARP-CG algorithm (Gordon \& Gordon 2010), an iterative solver that preconditions the original Helmholtz system into an equivalent symmetric positive definite system and then applies the method of conjugate gradients. Forming the matrix for the new system is not necessary as its multiplicative action on a vector is implemented using a series of projections onto the rows of the original system. Our contribution is implementing CARP-CG for a host + accelerator (FPGA) computing environment. The computational paradigm is one of dataflow: vector and matrix elements are streamed from memory through the accelerator which applies the row projections. The advantage of an FPGA to process streams of data is that unless the algorithm is memory bandwidth limited, computation time is directly proportional to the amount of data. The complexity of the algorithm implemented on the FPGA is irrelevant since all the operations programmed onto the FPGA happen in the same clock tick. In contrast, on a CPU, more complex algorithms require more clock ticks as the instructions are executed sequentially, or with only a small amount of parallelism. Ongoing work porting the CARP-CG algorithm to the accelerator is presented.},
	keywords = {Presentation, SINBAD, SINBADFALL2013, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2013/Fall/petrenko2013SINBADaih/petrenko2013SINBADaih.pdf},
	author = {Art Petrenko and Tristan van Leeuwen and Felix J. Herrmann and Diego Oriato and Simon Tilbury}
}
@conference {miao2013CSEGaospsa,
	title = {Acceleration on sparse promoting seismic applications},
	booktitle = {CSEG Annual Conference Proceedings},
	year = {2013},
	month = {05},
	abstract = {Sparse promoting oriented problems are never new in seismic applications. Back in 1970s, geophysicists had well exploited the robustness of sparse solutions. Moreover, with the emerging usage of compressed sensing in recent years, sparse recovery have been favored in dealing with {\textquoteright}curse of dimensionality{\textquoteright} in various seismic field acquisition, data processing, and imaging applications. Although sparsity has provided a promising approach, solving for it presents a big challenge. How to work efficiently with the extremely large-scale seismic problem, and how to improve the convergence rate reducing computation time are most frequently asked questions in this content. In this abstract, the author proposed a new algorithm {\textendash} PQN$\ell_1$, trying to address those questions. One example on seismic data processing is included.},
	keywords = {CSEG, Projected Quasi Newton, sparsity-promotion, SPG$\ell_1$},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/CSEG/2013/miao2013CSEGaospsa/miao2013CSEGaospsa.pdf},
	author = {Lina Miao and Felix J. Herrmann}
}
@article {shahidi2013GPars,
	title = {Application of randomized sampling schemes to curvelet-based sparsity-promoting seismic data recovery},
	journal = {Geophysical Prospecting},
	volume = {61},
	number = {5},
	year = {2013},
	month = {09},
	pages = {973-997},
	abstract = {Reconstruction of seismic data is routinely used to improve the quality and resolution of seismic data from incomplete acquired seismic recordings. Curvelet-based Recovery by Sparsity-promoting Inversion, adapted from the recently-developed theory of compressive sensing, is one such kind of reconstruction, especially good for recovery of undersampled seismic data. Like traditional Fourier-based methods, it performs best when used in conjunction with randomized subsampling, which converts aliases from the usual regular periodic subsampling into easy-to-eliminate noise. By virtue of its ability to control gap size, along with the random and irregular nature of its sampling pattern, jittered (sub)sampling is one proven method that has been used successfully for the determination of geophone positions along a seismic line. In this paper, we extend jittered sampling to two-dimensional acquisition design, a more difficult problem, with both underlying Cartesian, and hexagonal grids. We also study what we term separable and non-separable two-dimensional jittered samplings. We find hexagonal jittered sampling performs better than Cartesian jittered sampling, while fully non-separable jittered sampling performs better than separable jittered sampling. Two other 2D randomized sampling methods, Poisson Disk sampling and Farthest Point sampling, both known to possess blue-noise spectra, are also shown to perform well.},
	keywords = {curvelets, Geophysical Prospecting, randomized sampling},
	doi = {10.1111/1365-2478.12050},
	url = {https://slim.gatech.edu/Publications/Public/Journals/GeophysicalProspecting/2013/shahidi2013GPars/shahidi2013GPars.pdf},
	author = {Reza Shahidi and Gang Tang and Jianwei Ma and Felix J. Herrmann}
}
@presentation {esser2013SINBADasr,
	title = {Applications of phase retrieval methods to blind seismic deconvolution},
	year = {2013},
	publisher = {SINBAD},
	abstract = {Phase retrieval is the non-convex optimization problem of recovering a signal from magnitudes of complex linear measurements. Solving convex semi-definite program (SDP) relaxations has been shown to be a robust approach, but it remains too expensive to apply to large problems. We will discuss methods for accelerating computations and explore applications to seismic deconvolution.},
	keywords = {Presentation, SINBAD, SINBADFALL2013, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2013/Fall/esser2013SINBADasr/esser2013SINBADasr.pdf},
	author = {Ernie Esser and Felix J. Herrmann}
}
@conference {oghenekohwo2013CSEGnratld,
	title = {Assessing the need for repeatability in acquisition of time-lapse data},
	booktitle = {CSEG Annual Conference Proceedings},
	year = {2013},
	month = {05},
	abstract = {There are several factors that affect the repeatability of 4D(time-lapse) seismic data. One of the most significant factors is the repeatability of the acquisition, particularly the locations of the sources and receivers. It is important to repeat the source-receiver locations, used during the baseline survey, in the monitor or repeat survey. Also, it is essential that the stacked data volumes used for time-lapse analysis are created using the same offset ranges for each survey. This condition is crucial in order to be able to produce an image of the same location over a period of time and enhances proper reservoir characterization. The cost of repeating the seismic acquisition is very expensive, as often times, the receiver array has to be left at the same location over the period for which the data will be acquired. In other words, it is important to repeat the acquisition geometry as much as possible. In this talk, we investigate the results of changing the acquisition geometry, by a random placement of the receivers for both the baseline surveys and newer (monitor) surveys. Results show that we are still able to observe any time-lapse effects from the proposed acquisition geometry. Our experiments have been performed on a synthetic model.},
	keywords = {Acquisition, CSEG, migration, time-lapse},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/CSEG/2013/oghenekohwo2013CSEGnratld/oghenekohwo2013CSEGnratld.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/CSEG/2013/oghenekohwo2013CSEGnratld/oghenekohwo2013CSEGnratld_pres.pdf},
	author = {Felix Oghenekohwo and Felix J. Herrmann}
}
@conference {kumar2013SEGAVA,
	title = {AVA analysis and geological dip estimation via two-way wave-equation based extended images},
	booktitle = {SEG Technical Program Expanded Abstracts},
	volume = {32},
	year = {2013},
	month = {09},
	pages = {423-427},
	abstract = {In this paper, we present an efficient way to compute extended images for all subsurface offsets without explicitly calculating the source and receiver wavefields for all the sources. Because the extended images contain all possible subsurface offsets, we compute the angle-domain image gathers by selecting the subsurface offset that is aligned with the local dip. We also propose a method to compute the local dip information directly from common-image-point gathers. To assess the quality of the angle-domain common-image-points gathers we compute the angle-dependent reflectivity coefficients and compare them with theoretical reflectivity coefficients yielded by the (linearized) Zoeppritz equations for a few synthetic models.},
	keywords = {AVA, dip, extended images, SEG, wave-equation},
	doi = {10.1190/segam2013-1348.1},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2013/kumar2013SEGAVA/kumar2013SEGAVA.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2013/kumar2013SEGAVA/kumar2013SEGAVA_pres.pdf},
	author = {Rajiv Kumar and Tristan van Leeuwen and Felix J. Herrmann}
}
@conference {herrmann2012SEGals,
	title = {Accelerated large-scale inversion with message passing},
	booktitle = {SEG Technical Program Expanded Abstracts},
	volume = {31},
	year = {2012},
	month = {11},
	pages = {1-6},
	publisher = {SEG},
	organization = {SEG},
	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 = {Compressive Sensing, Imaging, Optimization, SEG},
	doi = {10.1190/segam2012-0847.1},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2012/herrmann2012SEGals/herrmann2012SEGals.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2012/herrmann2012SEGals/herrmann2012SEGals_pres.pdf},
	author = {Felix J. Herrmann}
}
@presentation {miao2012SINBADasp,
	title = {Accelerating on sparse promoting recovery and its benefits in seismic application},
	year = {2012},
	publisher = {SINBAD},
	abstract = {Sparse promoting recovery problem arises more and more frequently with the broad application of compressed sensing tool in exploration seismology. Because of the curse of dimensionality, the prohibitive computation burden on iteratively evaluating objective functions is one of the key issues that constrain high performance l1 solver. In this paper, we try to further improve the convergence performance of SPGl1, one of the state-of-the-art large scale sparse recovery solver, and as a result limit the number of objective function evaluations by introducing a projected quasi Newton method. Examples showing acceleration on seismic data collection, data processing as well as inversion are included.},
	keywords = {Presentation, SINBAD, SINBADFALL2012, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2012/Fall/miao2012SINBADasp/miao2012SINBADasp_pres.pdf},
	author = {Lina Miao}
}
@conference {mansour2012ICASSadapt,
	title = {Adaptive compressed sensing for video acquisition},
	booktitle = {ICASSP},
	year = {2012},
	abstract = {In this paper, we propose an adaptive compressed sensing scheme that utilizes a support estimate to focus the measurements on the large valued coefficients of a compressible signal. We embed a "sparse-filtering" stage into the measurement matrix by weighting down the contribution of signal coefficients that are outside the support estimate. We present an application which can benefit from the proposed sampling scheme, namely, video compressive acquisition. We demonstrate that our proposed adaptive CS scheme results in a significant improvement in reconstruction quality compared with standard CS as well as adaptive recovery using weighted $\ell_1$ minimization.},
	keywords = {ICASSP},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/ICASSP/2012/MansourYilmazICASSPaCS/MansourYilmazICASSPaCS.pdf},
	author = {Hassan Mansour and Ozgur Yilmaz}
}
@presentation {hargreaves2012SINBADavs,
	title = {Analysis versus synthesis in weighted sparse recovery},
	year = {2012},
	publisher = {SINBAD},
	abstract = {The synthesis model for compressive sensing has been the model of choice for many years and various weighting schemes have been shown to improve it{\textquoteright}s performance (see Yilmaz, Mansour, and Ghadermarzy talks). However, there is a counterpart model to synthesis, namely the analysis model, which has been less popular but recently attracted more attention (see Lin{\textquoteright}s talk). In this talk, weighting in the analysis model is discussed and applied to the seismic trace interpolation problem.},
	keywords = {Presentation, SINBAD, SINBADFALL2012, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2012/Fall/hargreaves2012SINBADavs/hargreaves2012SINBADavs_pres.pdf},
	author = {Brock Hargreaves}
}
@presentation {warner2012SINBADafw,
	title = {Anisotropic 3D full-waveform inversion of the Tommeliten Alpha field},
	year = {2012},
	publisher = {SINBAD},
	abstract = {We have implemented a robust and practical scheme for anisotropic 3D acoustic full-waveform inversion. We demonstrate this scheme on a field data set, applying it to a four-component ocean-bottom survey over the Tommeliten Alpha field in the North Sea. This shallow-water data set provides good azimuthal coverage to offsets of 7 km, with reduced coverage to a maximum offset of about 11 km. The reservoir lies at the crest of a high-velocity antiformal chalk section, overlain by about 3000 m of clastics within which a low-velocity gas cloud produces a seismic obscured area. We inverted only the hydrophone data, and we retained free-surface multiples and ghosts within the field data. We invert in six narrow frequency bands, in the range 3 to 6.5 Hz. At each iteration, we selected only a subset of sources, using a different subset at each iteration; this strategy is more efficient than inverting all the data every iteration. Our starting velocity model was obtained using standard PSDM model building including anisotropic reflection tomography, and contained epsilon values as high as 20\%. We have also attempted full-elastic inversion of these data to recover a shallow isotropic model of both p and s-wave velocities. The final FWI velocity model shows a network of shallow high-velocity channels that match similar features in the reflection data. Deeper in the section, the FWI velocity model reveals a sharper and more-intense low-velocity region associated with the gas cloud in which low-velocity fingers match the location of gas-filled faults visible in the reflection data. The resulting velocity model provides a better match to well logs, and better flattens common image gathers, than does the starting model. Reverse-time migration, using the FWI velocity model, provides significant uplift to the migrated image, simplifying the planform of the reservoir section at depth. The workflows, inversion strategy, and algorithms that we have used have broad application to invert a wide-range of analogous field data sets.},
	keywords = {Presentation, SINBAD, SINBADFALL2012, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2012/Fall/warner2012SINBADafw/warner2012SINBADafw_pres.pdf},
	author = {Mike Warner}
}
@conference {herrmann2012SSPamp,
	title = {Approximate message passing meets exploration seismology},
	booktitle = {2012 IEEE Statistical Signal Processing Workshop (SSP) (SSP{\textquoteright}12)},
	year = {2012},
	month = {03},
	publisher = {IEEE},
	organization = {IEEE},
	address = {Ann Arbor, Michigan, USA},
	abstract = {Data collection, data processing, and imaging in exploration seismology increasingly hinge on large-scale sparsity promoting solvers to remove artifacts caused by efforts to reduce costs. We show how the inclusion of a {\textquoteright}message term{\textquoteright} in the calculation of the residuals improves the convergence of these iterative solvers by breaking correlations that develop between the model iterate and the linear system that needs to be inverted. We compare this message-passing scheme to state-of-the-art solvers for problems in missing-trace interpolation and in dimensionality-reduced imaging with phase en- coding.},
	keywords = {Compressive Sensing, Exploration seismology, seismic imaging, transform-domain sparsity promotion},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SSP/2012/herrmann2012SSPamp/herrmann2012SSPamp.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SSP/2012/herrmann2012SSPamp/herrmann2012SSPamp_pres.pdf},
	author = {Felix J. Herrmann}
}
@presentation {friedlander2010SINBADaso,
	title = {Algorithms for sparse optimization},
	year = {2010},
	publisher = {SINBAD},
	keywords = {Presentation, SINBAD, SINBADFALL2010, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2010/Fall/friedlander2010SINBADaso/friedlander2010SINBADaso_pres.pdf},
	author = {Michael P. Friedlander}
}
@conference {friedlander2009NUalssr,
	title = {Algorithms for large-scale sparse reconstruction},
	booktitle = {IEMS},
	year = {2009},
	publisher = {IEMS Colloquim Speaker},
	organization = {IEMS Colloquim Speaker},
	address = {Northwestern University},
	keywords = {minimization, SLIM},
	author = {Michael P. Friedlander}
}
@conference {friedlander2008SIAMasa,
	title = {Active-set approaches to basis pursuit denoising},
	booktitle = {SIAM Optimization},
	year = {2008},
	month = {05},
	publisher = {SIAM Optimization},
	organization = {SIAM Optimization},
	keywords = {SLIM},
	url = {http://www.cs.ubc.ca/ mpf/public/mpf08siopt.pdf},
	author = {Michael P. Friedlander}
}
@conference {friedlander2008WCOMasm,
	title = {Active-set methods for basis pursuit},
	booktitle = {WCOM},
	year = {2008},
	month = {07},
	publisher = {West Coast Opitmization Meeting (WCOM)},
	organization = {West Coast Opitmization Meeting (WCOM)},
	abstract = {Many imaging and compressed sensing applications seek sparse solutions to large under-determined least-squares problems. The basis pursuit (BP) approach minimizes the 1-norm of the solution, and the BP denoising (BPDN) approach balances it against the least-squares fit. The duals of these problems are conventional linear and quadratic programs. We introduce a modified parameterization of the BPDN problem and explore the effectiveness of active-set methods for solving its dual. Our basic algorithm for the BP dual unifies several existing algorithms and is applicable to large-scale examples.},
	url = {http://www.cs.ubc.ca/ mpf/public/mpf08siopt.pdf},
	author = {Michael P. Friedlander and M. A. Saunders}
}
@conference {herrmann2008SINBADacd2,
	title = {Adaptive curvelet-domain primary-multiple separation},
	booktitle = {SINBAD},
	year = {2008},
	note = {SINBAD 2008},
	publisher = {SINBAD},
	organization = {SINBAD},
	abstract = {In many exploration areas, successful separation of primaries and multiples greatly determines the quality of seismic imaging. Despite major advances made by Surface-Related Multiple Elimination (SRME), amplitude errors in the predicted multiples remain a problem. When these errors vary for each type of multiple differently (as a function of offset, time and dip), these amplitude errors pose a serious challenge for conventional least-squares matching and for the recently introduced separation by curvelet-domain thresholding. We propose a data-adaptive method that corrects amplitude errors, which vary smoothly as a function of location, scale (frequency band) and angle. In that case, the amplitudes can be corrected by an element-wise curvelet-domain scaling of the predicted multiples. We show that this scaling leads to a successful estimation of the primaries, despite amplitude, sign, timing and phase errors in the predicted multiples. Our results on synthetic and real data show distinct improvements over conventional least-squares matching, in terms of better suppression of multiple energy and high-frequency clutter and better recovery of the estimated primaries.},
	keywords = {Presentation, SINBAD, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2008/herrmann2008SINBADacd2/herrmann2008SINBADacd2.pdf},
	author = {Felix J. Herrmann}
}
@article {herrmann2008GEOPacd,
	title = {Adaptive curvelet-domain primary-multiple separation},
	journal = {Geophysics},
	volume = {73},
	number = {3},
	year = {2008},
	month = {08},
	pages = {A17-A21},
	publisher = {SEG},
	abstract = {In many exploration areas, successful separation of primaries and multiples greatly determines the quality of seismic imaging. Despite major advances made by surface-related multiple elimination (SRME), amplitude errors in the predicted multiples remain a problem. When these errors vary for each type of multiple in different ways (as a function of offset, time, and dip), they pose a serious challenge for conventional least-squares matching and for the recently introduced separation by curvelet-domain thresholding. We propose a data-adaptive method that corrects amplitude errors, which vary smoothly as a function of location, scale (frequency band), and angle. With this method, the amplitudes can be corrected by an elementwise curvelet-domain scaling of the predicted multiples. We show that this scaling leads to successful estimation of primaries, despite amplitude, sign, timing, and phase errors in the predicted multiples. Our results on synthetic and real data show distinct improvements over conventional least-squares matching in terms of better suppression of multiple energy and high-frequency clutter and better recovery of estimated primaries. \copyright2008 Society of Exploration Geophysicists},
	keywords = {Geophysics, Processing, SLIM},
	doi = {10.1190/1.2904986},
	url = {https://slim.gatech.edu/Publications/Public/Journals/Geophysics/2008/herrmann08GEOacd/herrmann08GEOacd.pdf},
	author = {Felix J. Herrmann and Deli Wang and D. J. Verschuur}
}
@conference {friedlander2008SINBADafl,
	title = {Algorithms for large-scale sparse reconstruction},
	booktitle = {SINBAD 2008},
	year = {2008},
	abstract = {Many signal processing applications seek to approximate a signal as a linear combination of only a few elementary atoms drawn from a large collection. This is known as sparse reconstruction, and the theory of compressed sensing allows us to pose it as a structured convex optimization problem. I will discuss the role of duality in revealing some unexpected and useful properties of these problems, and will show how they can lead to practical, large-scale algorithms. I will also describe some applications of these algorithms.},
	keywords = {SINBAD, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2008/friedlander2008SINBADafl/friedlander2008SINBADafl.pdf},
	author = {Michael P. Friedlander}
}
@conference {lebed2008SINBADaoc1,
	title = {Applications of curvelets/surfacelets to seismic data processing},
	booktitle = {SINBAD},
	year = {2008},
	abstract = {In this talk we explore several applications of the curvelet and surfacelet transforms to seismic data processing. The first application is stable signal recovery in the physical domain - seismic data acquisition is often limited by physical and economic constraints, and the goal is to interpolate the data from a given subset of seismic traces. The second application is signal recovery in a transform domain - we assume that our data comes in a form of a random subset of temporal frequencies and the goal is to recover the missing frequencies from this data. Since seismic signals are generally not bandwidth limited, this in fact becomes an anti-aliasing problem. In both these problems the recovery is resolved via a robust $\ell$_1 solver that exploits the sparsity of the signals in curvelet/surfacelet domains. In the last application we explore the problem of primary-multiple separation by simple thresholding.},
	keywords = {Presentation, SINBAD, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2008/lebed2008SINBADaoc1/lebed2008SINBADaoc1.pdf},
	author = {Evgeniy Lebed}
}
@conference {hennenfent2006SEGaos,
	title = {Application of stable signal recovery to seismic data interpolation},
	booktitle = {SEG Technical Program Expanded Abstracts},
	year = {2006},
	pages = {2797-2801},
	publisher = {SEG},
	organization = {SEG},
	abstract = {We propose a method for seismic data interpolation based on 1) the reformulation of the problem as a stable signal recovery problem and 2) the fact that seismic data is sparsely represented by curvelets. This method does not require information on the seismic velocities. Most importantly, this formulation potentially leads to an explicit recovery condition. We also propose a large-scale problem solver for the 1-regularization minimization involved in the recovery and successfully illustrate the performance of our algorithm on 2D synthetic and real examples. \copyright2006 Society of Exploration Geophysicists},
	keywords = {amplitude, continuity, curvelets, fast transform, interpolation, iterative thresholding, Presentation, regularization minimization, SEG, seismic data, SLIM},
	doi = {10.1190/1.2370105},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2006/hennenfent06SEGaos/hennenfent06SEGaos.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2006/hennenfent06SEGaos/hennenfent06SEGaos_pres.pdf},
	author = {Gilles Hennenfent and Felix J. Herrmann}
}
