@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
