@presentation {fang2017SINBADFpfg,
	title = {PDE-free Gauss-Newton Hessian for Wavefield Reconstruction Inversion},
	year = {2017},
	publisher = {SINBAD},
	abstract = {In this work, we present a PDE-free Gauss-Newton Hessian for Wavefield Reconstruction Inversion. With this PDE-free Gauss-Newton Hessian, we can compute matrix-vector products without additional PDE solves. Thus, we are able to use the second order optimization method Gauss-Newton method with a roughly equal computational cost of first-order methods such as the gradient-descent method.},
	keywords = {Presentation, SINBAD, SINBADFALL2017, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2017/Fall/fang2017SINBADFpfg/fang2017SINBADFpfg.pdf},
	url2 = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2017/Fall/fang2017SINBADFpfg/fang2017SINBADFpfg.mov},
	author = {Zhilong Fang and Felix J. Herrmann}
}
@presentation {witte2016SINBADFpve,
	title = {Phase velocity error minimizing scheme for the anisotropic pure P-wave equation},
	year = {2016},
	publisher = {SINBAD},
	abstract = {Pure P-wave equations for acoustic modeling in transverse isotropic media are derived by approximating the exact pure P-wave dispersion relation. In this work, we present an alternative to the common Taylor expansion based equations, in which we approximate the exact dispersion relation through a polynomial expansion and determine its coefficients by solving a least squares problem that minimizes the phase velocity error over the complete range of phase angles. We show that this approach is up to an order of magnitude more accurate than other pure P-wave equations at a comparable computational cost.},
	keywords = {Presentation, SINBAD, SINBADFALL2016, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2016/Fall/witte2016SINBADFpve/witte2016SINBADFpve.pdf},
	url2 = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2016/Fall/witte2016SINBADFpve/witte2016SINBADFpve.mov},
	author = {Philipp A. Witte and Christiaan C. Stolk and Felix J. Herrmann}
}
@presentation {fang2013SINBADp3dfwi,
	title = {Parallel 3D FWI with simultaneous shots},
	year = {2013},
	publisher = {SINBAD},
	abstract = {In this work, we manage to build the workflow for the parallel 3D full-waveform inversion. In the forward simulation part, we generate the Helmholtz matrix in parallel and use parallel CARPCG to solve the Helmholtz equation. In the inversion process, simultaneous shots are used to reduce the computational costs. Additionally, we propose a method to select the number of simultaneous shots and tolerance of CARPCG dynamically, to reach a compromise between the computational costs and accuracy.},
	keywords = {Presentation, SINBAD, SINBADFALL2013, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2013/Fall/fang2013SINBADp3dfwi/fang2013SINBADp3dfwi.pdf},
	author = {Zhilong Fang and Tristan van Leeuwen and Felix J. Herrmann}
}
@presentation {smithyman2013SINBADprb,
	title = {Phase-residual based quality-control methods and techniques for mitigating cycle skips},
	year = {2013},
	publisher = {SINBAD},
	abstract = {Most full-waveform inversion algorithms use local optimization methods to iteratively improve the numerical earth model. All of these make the implicit assumption that the the model close to the true earth to avoid cycle. In practice this may not be true. We explore two questions: 1. How do we understand and visualize the cycle skip phenomenon in order to recognize it if it exists? 2. How do we automate this quality control step and use the rich information from multiple data to mitigate cycle skips and avoid local minima?},
	keywords = {Presentation, SINBAD, SINBADFALL2013, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2013/Fall/smithyman2013SINBADprb/smithyman2013SINBADprb.pdf},
	author = {Brendan R. Smithyman and Felix J. Herrmann}
}
@presentation {pong2013SINBADppg,
	title = {The proximal-proximal gradient algorithm},
	year = {2013},
	publisher = {SINBAD},
	abstract = {In many applications, one has to minimize the sum of a smooth loss function modeling misfit and a regularization term inducing structures. In this talk, we consider the case when the regularization is a composition of a convex function, whose proximal mapping is easy to compute, and a nonzero linear map. Such instances arise in system identification and realization problems. In this talk, we present a new algorithm, the proximal-proximal gradient algorithm, which admits easy subproblems. Our algorithm reduces to the proximal gradient algorithm if the linear map is just the identity map, and can be viewed as "very inexact" inexact proximal gradient algorithm. We show that the whole sequence generated from the algorithm converges to an optimal solution, and establish an upper bound on iteration complexity.},
	keywords = {Presentation, SINBAD, SINBADFALL2013, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2013/Fall/pong2013SINBADppg/pong2013SINBADppg.pdf},
	author = {Ting Kei Pong and Michael P. Friedlander and Felix J. Herrmann}
}
@presentation {nutini2013SINBADpcb,
	title = {Putting the curvature back into sparse solvers},
	year = {2013},
	publisher = {SINBAD},
	abstract = {For many problems in signal and image processing, we seek a sparse solution that solves that approximately solves the problem Ax $\approx$ b, where A is an m-by-n matrix and b is an m-vector. Many of the most used approaches to problem thissuch as iterative soft thresholding SPGL1 andare first-order methods. As a result, these methods can sometimes be slow to converge. In this talk, we present an approach that takes advantage of the easily-obtainable second-order information. By exploiting this available second-order information, we are able to put the curvature back into sparse solvers and improve upon the convergence rates of existing solvers.},
	keywords = {Presentation, SINBAD, SINBADFALL2013, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2013/Fall/nutini2013SINBADpcb/nutini2013SINBADpcb.pdf},
	author = {Julie Nutini and Michael P. Friedlander and Felix J. Herrmann}
}
@presentation {min2011SINBADpss,
	title = {Parameter-selection strategy for density in frequency-domain elastic waveform inversion},
	year = {2011},
	publisher = {SINBAD},
	keywords = {Presentation, SINBAD, SINBADFALL2011, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2011/Fall/min2011SINBADpss/min2011SINBADpss_pres.pdf},
	author = {Dong-Joo Min}
}
@presentation {vanleeuwen2011SINBADpei,
	title = {Probing the extended image volume},
	year = {2011},
	publisher = {SINBAD},
	keywords = {Presentation, SINBAD, SINBADSPRING2011, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2011/Spring/vanleeuwen2011SINBADpei/vanleeuwen2011SINBADpei_pres.pdf},
	author = {Tristan van Leeuwen}
}
@presentation {kumar2010SINBADpoe,
	title = {Parallelizing operations with ease using Parallel SPOT},
	year = {2010},
	publisher = {SINBAD},
	keywords = {Presentation, SINBAD, SINBADFALL2010, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2010/Fall/kumar2010SINBADpoe/kumar2010SINBADpoe_pres.pdf},
	author = {Nameet Kumar}
}
@conference {herrmann2008SINBADpsm,
	title = {Phase-space matched filtering and migration preconditioning},
	booktitle = {SINBAD 2008},
	year = {2008},
	abstract = {During this talk, I will report on new phase-space regularization functionals defined in terms of splines. This spline representation reduces the dimensionality of estimating our phase-space matched filter. We will discuss how this filter can be used in migration preconditioning. This is joint work with Christiaan Stolk.},
	keywords = {Presentation, SINBAD, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2008/herrmann2008SINBADpsm/herrmann2008SINBADpsm.pdf},
	author = {Felix J. Herrmann}
}
@conference {herrmann2006SINBADpms,
	title = {Primary-multiple separation by curvelet frames},
	booktitle = {SINBAD 2006},
	volume = {170},
	year = {2006},
	pages = {781-799},
	publisher = {Geophysical Journal International},
	organization = {Geophysical Journal International},
	abstract = {Predictive multiple suppression methods consist of two main steps: a prediction step, during which multiples are predicted from seismic data, and a primary-multiple separation step, during which the predicted multiples are {\textquoteright}matched{\textquoteright} with the true multiples in the data and subsequently removed. The last step is crucial in practice: an incorrect separation will cause residual multiple energy in the result or may lead to a distortion of the primaries, or both. To reduce these adverse effects, a new transformed-domain method is proposed where primaries and multiples are separated rather than matched. This separation is carried out on the basis of differences in the multiscale and multidirectional characteristics of these two signal components. Our method uses the curvelet transform, which maps multidimensional data volumes into almost orthogonal localized multidimensional prototype waveforms that vary in directional and spatio-temporal content. Primaries-only and multiples-only signal components are recovered from the total data volume by a nonlinear optimization scheme that is stable under noisy input data. During the optimization, the two signal components are separated by enhancing sparseness (through weighted l1-norms) in the transformed domain subject to fitting the observed data as the sum of the separated components to within a user-defined tolerance level. Whenever the prediction for the two signal components in the transformed domain correlate, the recovery is suppressed while for regions where the correlation is small the method seeks the sparsest set of coefficients that represent each signal component. Our algorithm does not seek a matched filter and as such it differs fundamentally from traditional adaptive subtraction methods. The method derives its stability from the sparseness obtained by a non-parametric multiscale and multidirectional overcomplete signal representation. This sparsity serves as prior information and allows for a Bayesian interpretation of our method during which the log-likelihood function is minimized while the two signal components are assumed to be given by a superposition of prototype waveforms, drawn independently from a probability function that is weighted by the predicted primaries and multiples. In this paper, the predictions are based on the data-driven surface-related multiple elimination (SRME) method. Synthetic and field data examples show a clean separation leading to a considerable improvement in multiple suppression compared to the conventional method of adaptive matched filtering. This improved separation translates into an improved stack.},
	keywords = {Presentation, SINBAD, SLIM},
	doi = {10.1111/j.1365-246X.2007.03360.x},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2006/herrmann2006SINBADpms/herrmann2006SINBADpms.pdf},
	author = {Felix J. Herrmann and Urs Boeniger and D. J. Verschuur}
}
@conference {herrmann2006SINBADapo1,
	title = {A primer on sparsity transforms: curvelets and wave atoms},
	booktitle = {SINBAD 2006},
	year = {2006},
	abstract = {During this presentation an overview will be given on the different sparsity transforms that are used at SLIM. Emphasis will be on two directional and multiscale wavelet transforms, namely the curvelet and the recently introduced wave-atom transforms. The main properties of these transforms will be listed and their performance on seismic data will be discussed.},
	keywords = {Presentation, SINBAD, SLIM},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2006/hennenfent2006SINBADapo/hennenfent2006SINBADapo.pdf},
	author = {Felix J. Herrmann}
}
@conference {hennenfent2006SINBADapo,
	title = {A primer on sparsity transforms: curvelets and wave atoms},
	booktitle = {SINBAD 2006},
	year = {2006},
	abstract = {During this presentation an introduction will be given on the method of stable recovery from noisy and incomplete data. Strong recovery conditions that guarantee the recovery for arbitrary acquisition geometries will be reviewed and numerical recovery examples will be presented.},
	keywords = {Presentation, SINBAD, SLIM},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2006/hennenfent2006SINBADapo/hennenfent2006SINBADapo.pdf},
	author = {Gilles Hennenfent}
}
@conference {herrmann2006SINBADapow,
	title = {A primer on weak conditions for stable recovery},
	booktitle = {SINBAD 2006},
	year = {2006},
	abstract = {During this presentation an introduction will be given on the method of stable recovery from noisy and incomplete data. Weak recovery conditions that guarantee the recovery for typical acquisition geometries will be reviewed and numerical recovery examples will be presented. The advantage of these weak conditions is that they are less pessimistic and {\textquoteleft}verifiable{\textquoteright} or very large-scale acquisition geometries.},
	keywords = {Presentation, SINBAD, SLIM},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2006/herrmann2006SINBADapow/herrmann2006SINBADapow.pdf},
	author = {Felix J. Herrmann}
}
@conference {thomson2006SINBADppe,
	title = {(P)SLIMPy: parallel extension},
	booktitle = {SINBAD 2006},
	year = {2006},
	abstract = {The parallel extensions to the SLIMpy environment enable pipe-based processing of large data sets in an MPI-based parallel environment. Parallel processing can be done by straightforward slicing of data, or by using an overlapping domain decomposition that requires communication between different processors. The principal aim of the parallel extensions is to leave abstract numerical algorithms (ANA{\textquoteright}s) and applications programmed for use in SLIMpy untouched when moving to parallel processing. The object-oriented functionality of Python makes this possible.},
	keywords = {Presentation, SINBAD, SLIM},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2006/thomson2006SINBADppe/thomson2006SINBADppe.pdf},
	author = {Darren Thomson}
}
