@conference {zhang2019SEGhfw,
	title = {High-frequency wavefield recovery with weighted matrix factorizations},
	booktitle = {SEG Technical Program Expanded Abstracts},
	year = {2019},
	note = {(SEG, San Antonio)},
	month = {09},
	pages = {3959-3963},
	abstract = {Acquired seismic data is normally not the fully sampled data we would like to work with since traces are missing due to physical constraints or budget limitations. Rank minimization is an effective way to recovering the missing trace data. Unfortunately, this technique{\textquoteright}s performance may deteriorate at higher frequency because high-frequency data can not necessarily be captured accurately by low-rank matrix factorizations albeit remedies exist such as hierarchical semi-separable matrices. As a result, recovered data often suffers from low signal to noise ratio S/Rs at the higher frequencies. To deal with this situation, we propose a weighted recovery method that improves the performance at the high frequencies by recursively using information from matrix factorizations at neighboring lower frequencies. Essentially, we include prior information from previously reconstructed frequency slices during the wavefield reconstruction. We apply our method to data collected from the Gulf of Suez, which shows that our method performs well compared to the traditional method without weighting.},
	keywords = {algorithm, data reconstruction, frequency-domain, interpolation, Processing, SEG},
	doi = {10.1190/segam2019-3215103.1},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2019/zhang2019SEGhfw/zhang2019SEGhfw.html},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2019/zhang2019SEGhfw/zhang2019SEGhfw_pres.pdf},
	author = {Yijun Zhang and Shashin Sharan and Felix J. Herrmann}
}
@conference {sharan2017SEGhrf,
	title = {High resolution fast microseismic source collocation and source time function estimation},
	booktitle = {SEG Technical Program Expanded Abstracts},
	year = {2017},
	note = {(SEG, Houston)},
	month = {09},
	pages = {2778-2783},
	abstract = {Sparsity promotion based joint microseismic source collocation and source time function estimation, using Linearized Bregman algorithm, although simple to implement, suffers from slow convergence. This is due to the fact that Linearized Bregman algorithm has only first order of convergence. In this work, we propose to accelerate the existing Linearized Bregman algorithm using the L-BFGS algorithm. Without any initial guess for the source location or source time function, our method is able to estimate the source location and source time function for kinematically correct smooth velocity model. We demonstrate the effectiveness of our method for multiple sources spaced within half a wavelength. We also compare our results with Linearized Bregman based method in {\textquoteleft}{\textquoteleft}2.5{\textquoteleft}{\textquoteleft}D instead of {\textquoteleft}{\textquoteleft}2{\textquoteleft}{\textquoteleft}D.},
	keywords = {algorithm, Full-waveform inversion, microseismic, passive imaging, SEG, wave equation},
	doi = {10.1190/segam2017-17787749.1},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2017/sharan2017SEGhrf/sharan2017SEGhrf.html},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2017/sharan2017SEGhrf/sharan2017SEGhrf_pres.pdf},
	author = {Shashin Sharan and Rongrong Wang 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}
}
@presentation {herrmann2017SINBADFhrc,
	title = {Highly repeatable 3D compressive full-azimuth towed-streamer time-lapse acquisition {\textendash}- a numerical feasibility study at scale},
	year = {2017},
	publisher = {SINBAD},
	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 during this session.},
	keywords = {Presentation, SINBAD, SINBADFALL2017, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2017/Fall/herrmann2017SINBADFhrc/herrmann2017SINBADFhrc.pdf},
	url2 = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2017/Fall/herrmann2017SINBADFhrc/herrmann2017SINBADFhrc.mov},
	author = {Felix J. Herrmann and Rajiv Kumar and Haneet Wason and Shashin Sharan and Felix Oghenekohwo}
}
@article {oghenekohwo2017hrt,
	title = {Highly repeatable time-lapse seismic with distributed Compressive Sensing{\textendash}-mitigating effects of calibration errors},
	journal = {The Leading Edge},
	volume = {36},
	number = {8},
	year = {2017},
	note = {(The Leading Edge)},
	month = {08},
	pages = {688-694},
	abstract = {Recently, we demonstrated that combining joint recovery with low-cost non-replicated randomized sampling tailored to time-lapse seismic can give us access to high fidelity, highly repeatable, dense prestack vintages, and high-grade time-lapse. To arrive at this result, we assumed well-calibrated surveys{\textendash}-i.e., we presumed accurate post-plot source/receiver positions. Unfortunately, in practice seismic surveys are prone to calibration errors, which are unknown deviations between actual and post-plot acquisition geometry. By means of synthetic experiments, we analyze the possible impact of these errors on vintages and on time-lapse data obtained with our joint recovery model from compressively sampled surveys. Supported by these experiments, we demonstrate that highly repeatable time-lapse vintages are attainable despite the presence of unknown calibration errors in the positions of the shots. We assess the repeatability quantitatively for two scenarios by studying the impact of calibration errors on conventional dense but irregularly sampled surveys and on low-cost compressed surveys. To separate time-lapse effects from calibration issues, we consider the idealized case where the subsurface remains unchanged and the practical situation where time-lapse changes are restricted to a subset of the data. In both cases, the quality of the recovered vintages and time-lapse decreases gracefully for low-cost compressed surveys with increasing calibration errors. Conversely, the quality of vintages from expensive densely periodically sampled surveys decreases more rapidly as unknown and difficult to control calibration errors increase.},
	keywords = {calibration errors, joint-recovery method, marine, random sampling, time-lapse seismic},
	doi = {10.1190/tle36080688.1},
	url = {https://slim.gatech.edu/Publications/Public/Journals/TheLeadingEdge/2017/oghenekohwo2017hrt/oghenekohwo2017hrt.html},
	author = {Felix Oghenekohwo and Felix J. Herrmann}
}
@presentation {sharan2016SINBADFhrm,
	title = {High resolution microseismic source collocation},
	year = {2016},
	publisher = {SINBAD},
	abstract = {Microseismic waves generated by hydraulic fracturing are used to locate the fractures created in the reservoir. Most of the existing source collocation methods have their limitations in terms of resolution of very closely spaced microseismic events. In this work we propose a method to collocate microseismic events with high resolution along with simultaneous estimation of source time function. In the context of waves, the finite-difference modelling operator acts as an analysis operator for wavefields. This implies that wavefields under the action of a finite-difference modelling kernel can be focused to sources generating these wavefields. We exploit this property of wavefields to locate microseismic events and estimate the source time function jointly. To arrive at a computational feasible scheme, we use the accelerated version of Linearized Bregman (LBR) algorithm to solve the above mentioned problem. This is joint work with Rongrong Wang.},
	keywords = {Presentation, SINBAD, SINBADFALL2016, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2016/Fall/sharan2016SINBADFhrm/sharan2016SINBADFhrm.pdf},
	url2 = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2016/Fall/sharan2016SINBADFhrm/sharan2016SINBADFhrm.mov},
	author = {Shashin Sharan and Rongrong Wang and Felix J. Herrmann}
}
@presentation {louboutin2016SINBADFhps,
	title = {High-performance seismic applications of OPESCI},
	year = {2016},
	publisher = {SINBAD},
	abstract = {We present our latest geophysical applications built on OPESCI. By using a high-level symbolic API, we allow for fast development and easy implementation of various (acoustic, VT, TTI) wave propagators relevant to exploration geophysics. We start by highlighting possibilities in an acoustic setting including classical operators such as forward modelling and linearised forward (Born) modelling as well as more advanced operators deriving from wave equations with double dipoles and the application of the PDE to a wavefield instead of applying its inverse. We will also show that the performance (time to solution) of this code is on par with industrial software libraries (10\% faster on the full SEAM model). We finally present our implementation of 3D TTI modelling and its adjoint including out comprehensive testing framework. This is joint work with Gerard Gorman},
	keywords = {Presentation, SINBAD, SINBADFALL2016, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2016/Fall/louboutin2016SINBADFhps/louboutin2016SINBADFhps.pdf},
	url2 = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2016/Fall/louboutin2016SINBADFhps/louboutin2016SINBADFhps.mov},
	author = {Mathias Louboutin and Felix J. Herrmann}
}
@presentation {lago2014SINBADhfw,
	title = {Heuristics in full-waveform inversion},
	year = {2014},
	publisher = {SINBAD},
	abstract = {For many full-waveform inversion techniques, the most computationally intensive step is the computation of a numerical solution for the wave equation on every iteration. In the frequency domain approach, this requires the solution of very large, complex, sparse, ill-conditioned linear systems. In this abstract we bring out attention specifically to CGMN method for solving PDEs, known for being flexible (i.e. it is able to treat equally acoustic data as well as visco-elastic or more complex scenarios) efficient with respect both to memory and computation time, and controllable accuracy of the final approximation. We propose an improvement for the known CGMN method by imposing a minimal residual condition, which incurs in one extra model vector storage. The resulting algorithm called CRMN enjoys several interesting properties as monotonically nonincreasing behaviour of the norm of the residual and minimal residual, guaranteeing optimal convergence for the relative residual criterion. We discuss numerical experiments both in an isolated PDE solve and also within the inversion procedure, showing that in a realistic scenario we can expect a speedup around 25\% when using CRMN rather than CGMN. Joint work with Art Petrenko, Zhilong Fang, Felix J. Herrmann.},
	keywords = {Presentation, SINBAD, SINBADSPRING2014, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2014/Spring/lago2014SINBADhfw/lago2014SINBADhfw.pdf},
	author = {Rafael Lago and Felix J. Herrmann}
}
@conference {dasilva2013EAGEhtucktensor,
	title = {Hierarchical Tucker tensor optimization - applications to 4D seismic data interpolation},
	booktitle = {EAGE Annual Conference Proceedings},
	year = {2013},
	month = {06},
	abstract = {In this work, we develop optimization algorithms on the manifold of Hierarchical Tucker (HT) tensors, an extremely efficient format for representing high-dimensional tensors exhibiting particular low-rank structure. With some minor alterations to existing theoretical developments, we develop an optimization framework based on the geometric understanding of HT tensors as a smooth manifold, a generalization of smooth curves/surfaces. Building on the existing research of solving optimization problems on smooth manifolds, we develop Steepest Descent and Conjugate Gradient methods for HT tensors. The resulting algorithms converge quickly, are immediately parallelizable, and do not require the computation of SVDs. We also extend ideas about favourable sampling conditions for missing-data recovery from the field of Matrix Completion to Tensor Completion and demonstrate how the organization of data can affect the success of recovery. As a result, if one has data with randomly missing source pairs, using these ideas, coupled with an efficient solver, one can interpolate large-scale seismic data volumes with missing sources and/or receivers by exploiting the multidimensional dependencies in the data. We are able to recover data volumes amidst extremely high subsampling ratios (in some cases, > 75\%) using this approach.},
	keywords = {3D data interpolation, EAGE, riemannian optimization, structured tensor},
	doi = {10.3997/2214-4609.20130390},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2013/dasilva2013EAGEhtucktensor/dasilva2013EAGEhtucktensor.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2013/dasilva2013EAGEhtucktensor/dasilva2013EAGEhtucktensor_pres.pdf},
	author = {Curt Da Silva and Felix J. Herrmann}
}
@presentation {dasilva2013SINBADSPRhtuck,
	title = {Hierarchical Tucker tensor optimization - applications to 4D seismic data interpolation},
	year = {2013},
	publisher = {SINBAD},
	abstract = {In this work, we develop optimization algorithms on the manifold of Hierarchical Tucker (HT) tensors, an extremely efficient format for representing high-dimensional tensors exhibiting particular low-rank structure. With some minor alterations to existing theoretical developments, we develop an optimization framework based on the geometric understanding of HT tensors as a smooth manifold, a generalization of smooth curves/surfaces. Building on the existing research of solving optimization problems on smooth manifolds, we develop Steepest Descent and Conjugate Gradient methods for HT tensors. The resulting algorithms converge quickly, are immediately parallelizable, and do not require the computation of SVDs. We also derive efficient Gauss-Newton based algorithms which converge much faster than standard, first-order methods. We also extend ideas about favourable sampling conditions for missing-data recovery from the field of Matrix Completion to Tensor Completion and demonstrate how the organization of data can affect the success of recovery. As a result, if one has data with randomly missing source pairs, using these ideas, coupled with an efficient solver, one can interpolate large-scale seismic data volumes with missing sources and/or receivers by exploiting the multidimensional dependencies in the data. We are able to recover data volumes amidst extremely high subsampling ratios (in some cases, > 75\%) using this approach and we demonstrate our recovery on a synthetic 5D data set provided to us by BG.},
	keywords = {3D data interpolation, hierarchical tucker, Presentation, SINBAD, SINBADSPRING2013, SLIM, structured tensor},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2013/Spring/dasilva2013SINBADSPRhtuck/dasilva2013SINBADSPRhtuck.pdf},
	author = {Curt Da Silva and Felix J. Herrmann}
}
@conference {dasilva2013SAMPTAhtuck,
	title = {Hierarchical Tucker tensor optimization - applications to tensor completion},
	year = {2013},
	month = {07},
	abstract = {In this work, we develop an optimization framework for problems whose solutions are well-approximated by Hierarchical Tucker tensors, an efficient structured tensor format based on recursive subspace factorizations. Using the differential geometric tools presented here, we construct standard optimization algorithms such as Steepest Descent and Conjugate Gradient, for interpolating tensors in HT format. We also empirically examine the importance of one{\textquoteright}s choice of data organization in the success of tensor recovery by drawing upon insights from the Matrix Completion literature. Using these algorithms, we recover various seismic data sets with randomly missing source pairs.},
	keywords = {differential geometry, hierarchical tucker, riemannian optimization, SAMPTA, structured tensor, tensor interpolation},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SAMPTA/2013/dasilva2013SAMPTAhtuck/dasilva2013SAMPTAhtuck.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SAMPTA/2013/dasilva2013SAMPTAhtuck/dasilva2013SAMPTAhtuck_pres.pdf},
	author = {Curt Da Silva and Felix J. Herrmann}
}
@presentation {dasilva2012SINBADhtt,
	title = {Hierarchical Tucker tensor optimization - applications to 4D seismic data interpolation},
	year = {2012},
	publisher = {SINBAD},
	abstract = {There has been a swell of research in the scientific computing community in the last couple of years which tries to extend notions of linear algebra (rank, the SVD, linear systems, etc.) to higher dimensional arrays, or tensors. Much work has been proposed to try to overcome the so called "curse of dimensionality", the O(N^d) storage required for a d-dimensional array, where N is the size of each dimension. The hierarchical Tucker format is one such tensor representation which manages to decompose a hierarchy of dimensions into parameter matrices of very manageable size, requiring at most dNK + (d - 2)K^3 + K^2 parameters, where K is an internal rank parameter. In this work, we extend ideas of matrix completion to the tensor case, where we only know a small number of randomly distributed entries from various 4D frequency slices, and try to recover the fully sampled tensor based on the knowledge that it has low hierarchical tucker rank in a particular arrangement of dimensions. Using this approach, we exploit the multi-dimensional dependencies within the full data in order to achieve very promising interpolation results even from heavily subsampled data.},
	keywords = {Presentation, SINBAD, SINBADFALL2012, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2012/Fall/dasilva2012SINBADhtt/dasilva2012SINBADhtt_pres.pdf},
	author = {Curt Da Silva}
}
@article {Friedlander11TRhdm,
	title = {Hybrid deterministic-stochastic methods for data fitting},
	journal = {SIAM Journal on Scientific Computing},
	volume = {34},
	number = {3},
	year = {2012},
	month = {01},
	pages = {A1380-A1405},
	abstract = {Many structured data-fitting applications require the solution of an optimization problem involving a sum over a potentially large number of measurements. Incremental gradient algorithms (both deterministic and randomized) offer inexpensive iterations by sampling only subsets of the terms in the sum. These methods can make great progress initially, but often slow as they approach a solution. In contrast, full gradient methods achieve steady convergence at the expense of evaluating the full objective and gradient on each iteration. We explore hybrid methods that exhibit the benefits of both approaches. Rate of convergence analysis and numerical experiments illustrate the potential for the approach.},
	keywords = {Optimization},
	doi = {10.1137/110830629},
	author = {Michael P. Friedlander and Mark Schmidt}
}
@conference {vanleeuwen2011AMPhsdmwi,
	title = {A hybrid stocahstic-deterministic method for waveform inversion},
	booktitle = {AMP},
	year = {2011},
	note = {Presented at AMP Medical and Seismic Imaging, 2011, Vancouver BC},
	month = {07},
	publisher = {WAVES 2011},
	organization = {WAVES 2011},
	abstract = {A lot of seismic and medical imaging problems can be written as a least-squares data- fitting problem. In particular, we consider the case of multi-experiment data, where the data consists of a large number of "independent" measurements. Solving the inverse problem then involves repeatedly forward modeling the data for each of these experiments. In case the number of experiments is large and the modeling kernel expensive to apply, such an approach may be prohibitively expensive. We review techniques from stochastic optimization which aim at dramatically reducing the number of experiments that need to be modeled at each iteration. This reduction is typically achieved by randomly subsampling the data. Special care needs to be taken in the optimization to deal with the stochasticity that is introduced in this way.},
	keywords = {Presentation},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/ICIAM/2011/vanleeuwen2011AMPhsdmwi/vanleeuwen2011AMPhsdmwi.pdf},
	author = {Tristan van Leeuwen and Mark Schmidt and Michael P. Friedlander and Felix J. Herrmann}
}
@presentation {vanleeuwen2011SINBADfwiso,
	title = {A hybrid stochastic-deterministic method for waveform inversion},
	year = {2011},
	publisher = {SINBAD},
	keywords = {Presentation, SINBAD, SINBADSPRING2011, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2011/Spring/vanleeuwen2011SINBADfwiso/vanleeuwen2011SINBADfwiso_pres.pdf},
	author = {Tristan van Leeuwen}
}
@conference {vanleeuwen2011EAGEhsdomwi,
	title = {A hybrid stochastic-deterministic optimization method for waveform inversion},
	booktitle = {EAGE Annual Conference Proceedings},
	year = {2011},
	month = {05},
	abstract = {Present-day high quality 3D acquisition can give us lower frequencies and longer offsets with which to invert. However, the computational costs involved in handling this data explosion are tremendous. Therefore, recent developments in full-waveform inversion have been geared towards reducing the computational costs involved. A key aspect of several approaches that have been proposed is a dramatic reduction in the number of sources used in each iteration. A reduction in the number of sources directly translates to less PDE-solves and hence a lower computational cost. Recent attention has been drawn towards reducing the sources by randomly combining the sources in to a few supershots, but other strategies are also possible. In all cases, the full data misfit, which involves all the sequential sources, is replaced by a reduced misfit that is much cheaper to evaluate because it involves only a small number of sources (batchsize). The batchsize controls the accuracy with which the reduced misfit approximates the full misfit. The optimization of such an inaccurate, or noisy, misfit is the topic of stochastic optimization. In this paper, we propose an optimization strategy that borrows ideas from the field of stochastic optimization. The main idea is that in the early stage of the optimization, far from the true model, we do not need a very accurate misfit. The strategy consists of gradually increasing the batchsize as the iterations proceed. We test the proposed strategy on a synthetic dataset. We achieve a very reasonable inversion result at the cost of roughly 13 evaluations of the full misfit. We observe a speed-up of roughly a factor 20.},
	keywords = {EAGE, Full-waveform inversion, Optimization, Presentation},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2011/vanleeuwen11EAGEhsdomwi/vanleeuwen11EAGEhsdomwi.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2011/vanleeuwen11EAGEhsdomwi/vanleeuwen11EAGEhsdomwi_pres.pdf},
	url2 = {http://earthdoc.eage.org/publication/publicationdetails/?publication=50341},
	author = {Tristan van Leeuwen and Felix J. Herrmann and Mark Schmidt and Michael P. Friedlander}
}
@presentation {schmidt2010SINBADhsd,
	title = {Hybrid stochastic-deterministic methods},
	year = {2010},
	publisher = {SINBAD},
	keywords = {Presentation, SINBAD, SINBADFALL2010, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2010/Fall/schmidt2010SINBADhsd/schmidt2010SINBADhsd_pres.pdf},
	author = {Mark Schmidt}
}
@conference {tang2009SEGhdb,
	title = {Higher dimensional blue-noise sampling schemes for curvelet-based seismic data recovery},
	booktitle = {SEG Technical Program Expanded Abstracts},
	volume = {28},
	year = {2009},
	month = {10},
	pages = {191-195},
	publisher = {SEG},
	organization = {SEG},
	abstract = {In combination with compressive sensing, a successful reconstruction scheme called Curvelet-based Recovery by Sparsity-promoting Inversion (CRSI) has been developed, and has proven to be useful for seismic data processing. One of the most important issues for CRSI is the sampling scheme, which can greatly affect the quality of reconstruction. Unlike usual regular undersampling, stochastic sampling can convert aliases to easy-to-eliminate noise. Some stochastic sampling methods have been developed for CRSI, e.g. jittered sampling, however most have only been applied to 1D sampling along a line. Seismic datasets are usually higher dimensional and very large, thus it is desirable and often necessary to develop higher dimensional sampling methods to deal with these data. For dimensions higher than one, few results have been reported, except uniform random sampling, which does not perform well. In the present paper, we explore 2D sampling methodologies for curvelet-based reconstruction, possessing sampling spectra with blue noise characteristics, such as Poisson Disk sampling, Farthest Point Sampling, and the 2D extension of jittered sampling. These sampling methods are shown to lead to better recovery and results are compared to the other more traditional sampling protocols.},
	keywords = {Presentation, SEG},
	doi = {10.1190/1.3255230},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2009/tang09SEGhdb/tang09SEGhdb.pdf},
	author = {Gang Tang and Reza Shahidi and Felix J. Herrmann and Jianwei Ma}
}
@conference {lebed2008SEGhggt,
	title = {A hitchhiker{\textquoteright}s guide to the galaxy of transform-domain sparsification},
	booktitle = {SEG Technical Program Expanded Abstracts},
	year = {2008},
	publisher = {SEG},
	organization = {SEG},
	abstract = {The ability to efficiently and sparsely represent seismic data is becoming an increasingly important problem in geophysics. Over the last decade many transforms such as wavelets, curvelets, contourlets, surfacelets, shearlets, and many other types of {\textquoteright}x-lets{\textquoteright} have been developed to try to resolve this issue. In this abstract we compare the properties of four of these commonly used transforms, namely the shift-invariant wavelets, complex wavelets, curvelets and surfacelets. We also briefly explore the performance of these transforms for the problem of recovering seismic wavefields from incomplete measurements.},
	keywords = {SEG},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2008/lebed08SEGhggt/lebed08SEGhggt.pdf},
	author = {Evgeniy Lebed and Felix J. Herrmann}
}
@techreport {lebed08TRhgg,
	title = {A hitchhiker{\textquoteright}s guide to the galaxy of transform-domain sparsification},
	number = {TR-EOAS-2008-4},
	year = {2008},
	institution = {UBC Earth and Ocean Sciences Department},
	abstract = {The ability to efficiently and sparsely represent seismic data is becoming an increasingly important problem in geophysics. Over the last decade many transforms such as wavelets, curvelets, contourlets, surfacelets, shearlets, and many other types of {\textquoteright}x-lets{\textquoteright} have been developed to try to resolve this issue. In this abstract we compare the properties of four of these commonly used transforms, namely the shift-invariant wavelets, complex wavelets, curvelets and surfacelets. We also briefly explore the performance of these transforms for the problem of recovering seismic wavefields from incomplete measurements.},
	keywords = {SLIM},
	url = {https://slim.gatech.edu/Publications/Public/TechReport/2008/lebed08TRhgg/lebed08TRhgg.pdf},
	author = {Evgeniy Lebed and Felix J. Herrmann}
}
