@presentation {dasilva2016SINBADFccs,
	title = {Composite convex smooth optimization with seismic data processing applications},
	year = {2016},
	publisher = {SINBAD},
	abstract = {In this work, we show a general technique for solving optimization problems that are comprised of minimizing a composition of a convex, non-smooth function with a smooth function. We demonstrate this technique in the seismic data processing context applied to robust missing trace interpolation in the low-rank Hierarchical Tucker tensor format as well as cosparsity-based missing trace interpolation.},
	keywords = {Presentation, SINBAD, SINBADFALL2016, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2016/Fall/dasilva2016SINBADFccs/dasilva2016SINBADFccs.pdf},
	url2 = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2016/Fall/dasilva2016SINBADFccs/dasilva2016SINBADFccs.mov},
	author = {Curt Da Silva and Felix J. Herrmann}
}
@presentation {herrmann2016SINBADFcvp,
	title = {Constraints versus penalties for edge-preserving full-waveform inversion},
	year = {2016},
	publisher = {SINBAD},
	abstract = {Full-waveform inversion is challenging in complex geological areas. Even when provided with an accurate starting model, the inversion algorithms often struggle to update the velocity model. Contrary to other areas in applied geophysics, including prior information in full-waveform inversion is still relatively in its infancy. In part this is due to the fact that incorporating prior information that relates to geological settings where strong discontinuities in the velocity model dominate is difficult, because these settings call for non-smooth regularizations. We tackle this problem by including constraints on the spatial variations and value ranges of the inverted velocities, as opposed to adding penalties to the objective as is more customary in main stream geophysical inversion. By demonstrating the lack of predictability of edge-preserving inversion when the regularization is in the form of an added penalty term, we advocate the inclusion of constraints instead. Our examples show that the latter lead to more predictable results and to significant improvements in the delineation of Salt bodies. This is joint work with Bas Peters.},
	keywords = {Presentation, SINBAD, SINBADFALL2016, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2016/Fall/herrmann2016SINBADFcvp/herrmann2016SINBADFcvp.pdf},
	url2 = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2016/Fall/herrmann2016SINBADFcvp/herrmann2016SINBADFcvp.mov},
	author = {Felix J. Herrmann and Bas Peters}
}
@presentation {peters2016SINBADFcnc,
	title = {Convex \& non-convex constraint sets for full-waveform inversion},
	year = {2016},
	publisher = {SINBAD},
	abstract = {We extend some of our previous work on constrained formulations of full-waveform inversion. Some motivating examples illustrate why solving constrained problems directly is a simpler approach for solving non-linear inverse problems than penalized problem formulations. So far we used constraints which can be represented as convex sets, for which most optimization theory is developed. Some non-convex counterparts of convex sets are introduced and examples show that the algorithms developed for convex sets also work well with non-convex sets. The motivation to also explore non-convex sets, is that they sometimes translate prior geological knowledge into mathematical constraints in a more direct way. All presented material is available as a user-friendly toolbox. The toolbox works with any code which can provide a data-misfit function value and a gradient direction.},
	keywords = {Presentation, SINBAD, SINBADFALL2016, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2016/Fall/peters2016SINBADFcnc/peters2016SINBADFcnc.pdf},
	url2 = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2016/Fall/peters2016SINBADFcnc/peters2016SINBADFcnc.mov},
	author = {Bas Peters and Felix J. Herrmann}
}
@presentation {oghenekohwo2015SINBADFcst,
	title = {Comparative study of time-lapse FWI approaches},
	year = {2015},
	publisher = {SINBAD},
	abstract = {I will illustrate the performance of our joint recovery model for time-lapse FWI. Specifically, I will compare our method to other conventional methods, namely, parallel difference and sequential difference FWI. I will illustrate the robustness of our method compared to others especially in the presence of missing data caused by large acquisition gaps. In addition, I will assess the performance of these methods in the detectability of the time-lapse change in synthetic data. Analysis of these methods under different starting FWI model will also be highlighted.},
	keywords = {Presentation, SINBAD, SINBADFALL2015, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2015/Fall/oghenekohwo2015SINBADFcst/oghenekohwo2015SINBADFcst.pdf},
	url2 = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2015/Fall/oghenekohwo2015SINBADFcst/oghenekohwo2015SINBADFcst.mov},
	author = {Felix Oghenekohwo and Felix J. Herrmann}
}
@presentation {peters2014SINBADcda,
	title = {Challenges and developments arising from 2D FWI of a land VSP dataset in the Permian Basin},
	year = {2014},
	publisher = {SINBAD},
	abstract = {Full-waveform inversion was carried out to map 3D velocity structures for a site in the Permian Basin of Texas, USA. The data come from co-located surface and 3D VSP seismic surveys that share common source vibration points. This challenging on-land setting has been used as a testbed to evaluate our FWI algorithms and their effectiveness when applied to real-data problems. We discuss the challenges posed by this case study, and several new techniques and methodological refinements that have been developed and tested as a result. These include: regularization and incorporation of multiple datasets in an on-land FWI workflow; restrictions on the types of models allowed (viz., smoothness regularization) by quadratic penalty and by Projected Quasi-Newton (PQN) inversion; corrections to enable 2D FWI and recovery of 3D models; the state of ongoing work in WRI ({\textquoteleft}{\textquoteleft}Penalty Method{\textquoteright}{\textquoteright} inversion) and the handling of anisotropy.},
	keywords = {Presentation, SINBAD, SINBADFALL2014, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2014/Fall/peters2014SINBADcda/peters2014SINBADcda.pdf},
	author = {Brendan R. Smithyman and Bas Peters and Felix J. Herrmann}
}
@presentation {yeung2013SINBADcsr,
	title = {Compressed sensing, recovery of signals using random Turbo matrices},
	year = {2013},
	publisher = {SINBAD},
	abstract = {Compressed sensing is an emerging technique that allows us to recover an image using far fewer number of measurements than classical sampling techniques. Designing the measurement matrices with certain properties are critical to this task. Gaussian matrices are most commonly used. We discover a new class of random matrices that can outperform the Gaussian matrices when we are in a situation of taking an outrageously small number of samples.},
	keywords = {Presentation, SINBAD, SINBADFALL2013, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2013/Fall/yeung2013SINBADcsr/yeung2013SINBADcsr.pdf},
	author = {Enrico Au-Yeung and Ozgur Yilmaz and Felix J. Herrmann}
}
@presentation {tu2013SINBADrerand,
	title = {Controlling linearization errors with rerandomization},
	year = {2013},
	publisher = {SINBAD},
	abstract = {Least squares migration aims to fit the observed seismic data with data predicted by linearized modelling, by solving an PDE-constrained optimization problem. This problem is challenging mostly because of its prohibitive computational cost. To address the issue, dimensionality reduction techniques were proposed in the literature. However, the solution of the reduced problem can deviate from that of the full problem when there are components in the observed data that cannot be explained by linearized modelling. We solve the problem by rerandomizing our $\ell_1$ regularized inversion. In this presentation, I will explain the method and demonstrate what we can achieve with rerandomization, especially for resolving fine sub-salt structures.},
	keywords = {Presentation, SINBAD, SINBADSPRING2013, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2013/Spring/tu2013SINBADrerand/tu2013SINBADrerand.pdf},
	author = {Ning Tu and Felix J. Herrmann}
}
@presentation {lin2013SINBADcsd,
	title = {Cosparse seismic data interpolation},
	year = {2013},
	publisher = {SINBAD},
	abstract = {Over the years we have investigated seismic data interpolation and redatuming algorithms rely on on the assumption that seismic records and images permit sparse approximations under certain representations, such as Curvelet coefficients. Recent findings have suggested that for redundant representations (of which Curvelet is an example), the analysis operator that maps the physical signal to coefficients may also play a crucial role in recovering data from incomplete observations. This insight elevates the significance of a question that often goes unaddressed: is it better for the transform-domain sparsity to be achieved through explicit construction of sparse representations (e.g., by thresholding of small transform-domain coefficients), or by demanding that the algorithm return physical signals which produces sparse coefficients when hit with the forward transform? Recent results show that the two approaches give rise to different solutions when the transform is redundant, and that the latter approach imposes a whole new class of constraints. In particular, the number of zero-valued coefficients given by the analysis operator acting on the signal, referred to as its "cosparsity", have an analogous role to the sparsity of the signal in terms of the coefficients. From this framework, a new reconstruction algorithm is proposed which may allow better reconstruction from subsampled signaled than what the sparsity assumption alone would predict. In this work we apply the new framework and algorithm to the case of seismic data interpolation under the curvelet domain, and show that it admits better reconstruction than some existing L1 sparsity-based methods derived from compressive sensing for a range of subsampling factors. We will also investigate different analysis operators and their impact on both sparsity and cosparsity-based algorithms.},
	keywords = {Presentation, SINBAD, SINBADSPRING2013, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2013/Spring/lin2013SINBADcsd/lin2013SINBADcsd.pdf},
	author = {Tim T.Y. Lin and Felix J. Herrmann}
}
@presentation {petrenko2012SINBADcarp,
	title = {CARP-CG: a computational study},
	year = {2012},
	publisher = {SINBAD},
	abstract = {Forward modelling of the wave equation is a key ingredient in seismic full waveform inversion (FWI). Simulation in the time domain and solution of the wave equation in the frequency domain are two competing approaches to modelling. Frequency domain approaches can further be categorized as using either direct or iterative solvers. For 3D FWI, iterative solvers in the frequency domain are attractive, partly because they require less memory than the other methods. This is due to the fact that there is no need to store the wavefield at each time step, or compute a factorization of the Helmholtz operator that will not be as sparse as the original matrix. One iterative solver that has been applied to the Helmholtz equation is CARP-CG. CARP-CG uses Kaczmarz row projections for each block of a domain decomposition scheme to precondition the Helmholtz system into being symmetric and positive semidefinite. The method of conjugate gradients is then used to solve the preconditioned system. We present a comparison of the performance of CARP-CG implemented in several languages (MATLAB, C, FORTRAN, julia) and in two different hardware environments: the LIMA HPC cluster hosted at UBC, and the Checkers cluster which is part of the Westgrid consortium. Parallelization of the algorithm via domain decomposition implemented with MPI (distributed memory) and OMP (shared memory) is also examined.},
	keywords = {Presentation, SINBAD, SINBADFALL2012, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2012/Fall/petrenko2012SINBADcarp/petrenko2012SINBADcarp_pres.pdf},
	author = {Art Petrenko}
}
@presentation {oghenekohwo2012SINBADcs,
	title = {Compressed sensing: a tool for eliminating repeatability in acquisition of 4D (time-lapse) seismic data},
	year = {2012},
	publisher = {SINBAD},
	abstract = {In 4D (time-lapse) seismic data acquisition, a very significant step is the repeatability of the acquisition process. In other words, the geophones must be placed at the exact location as they were, during baseline survey and acquisition. This condition is required to be able to produce an image of the same location over time and this enhances a proper reservoir characterization. The cost of repeating the seismic acquisition is very expensive, as geophones (receivers) have to be left at the same location over the period for which the data will be acquired. In this talk, we attempt to highlight the effort of Compressed Sensing, to eliminate this condition of repeatability of the acquisition. We show that a random sampling of the shots or random placement of the geophones is able to reproduce the same image over time, hence eliminating any acquisition imprints on the final seismic image.},
	keywords = {Presentation, SINBAD, SINBADFALL2012, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2012/Fall/oghenekohwo2012SINBADcs/oghenekohwo2012SINBADcs_pres.pdf},
	author = {Felix Oghenekohwo}
}
@presentation {au-yeung2012SINBADcs,
	title = {Compressed sensing, random Fourier matrix and jitter sampling},
	year = {2012},
	publisher = {SINBAD},
	abstract = {Compressed sensing is an emerging signal processing technique that allows signals to be sampled well below the Nyquist rate, when the signal has a sparse representation in an orthonormal basis. By using a random Fourier matrix or a Gaussian matrix as our measurement matrix, we can reconstruct a signal from far fewer measurements than required by Shannon sampling theorem. In this talk, we will discuss the role of uniform versus jitter sampling, both in a theoretical and practical viewpoint.},
	keywords = {Presentation, SINBAD, SINBADFALL2012, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2012/Fall/au-yeung2012SINBADcs/au-yeung2012SINBADcs_pres.pdf},
	author = {Enrico Au-Yeung and Hassan Mansour and Ozgur Yilmaz}
}
@presentation {herrmann2011SINBADcoc,
	title = {Challenges and opportunities for compressive sensing in seismic acquisition},
	year = {2011},
	publisher = {SINBAD},
	keywords = {Presentation, SINBAD, SINBADFALL2011, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2011/Fall/herrmann2011SINBADcoc/herrmann2011SINBADcoc_pres.pdf},
	author = {Felix J. Herrmann}
}
@presentation {herrmann2011SINBADcos,
	title = {Challenges and opportunities in sparse wavefield inversion},
	year = {2011},
	publisher = {SINBAD},
	keywords = {Presentation, SINBAD, SINBADFALL2011, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2011/Fall/herrmann2011SINBADcos/herrmann2011SINBADcos_pres.pdf},
	author = {Felix J. Herrmann}
}
@presentation {yilmaz2011SINBADcsp,
	title = {Compressed sensing with prior information},
	year = {2011},
	publisher = {SINBAD},
	keywords = {Presentation, SINBAD, SINBADFALL2011, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2011/Fall/yilmaz2011SINBADcsp/yilmaz2011SINBADcsp_pres.pdf},
	author = {Ozgur Yilmaz}
}
@presentation {saab2010SINBADcsk,
	title = {Compressed sensing using Kronecker products},
	year = {2010},
	publisher = {SINBAD},
	keywords = {Presentation, SINBAD, SINBADFALL2010, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2010/Fall/saab2010SINBADcsk/saab2010SINBADcsk_pres.pdf},
	author = {Rayan Saab}
}
@presentation {li2010SINBADci,
	title = {Compressive imaging},
	year = {2010},
	publisher = {SINBAD},
	keywords = {Presentation, SINBAD, SINBADFALL2010, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2010/Fall/li2010SINBADci/li2010SINBADci_pres.pdf},
	author = {Xiang Li}
}
@presentation {herrmann2010SINBADcss,
	title = {Compressive sensing and sparse recovery in exploration seismology},
	year = {2010},
	publisher = {SINBAD},
	keywords = {Presentation, SINBAD, SINBADFALL2010, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2010/Fall/herrmann2010SINBADcss/herrmann2010SINBADcss_pres.pdf},
	author = {Felix J. Herrmann}
}
@conference {lin2008SINBADcwe,
	title = {Compressed wavefield extrapolation},
	booktitle = {SINBAD},
	year = {2008},
	keywords = {Presentation, SINBAD, SLIM},
	presentation = {https://slim.gatech.edu/sites/data/Papers/lin08cwe.pdf},
	author = {Tim T.Y. Lin and Felix J. Herrmann}
}
@conference {kumar2008SINBADcd,
	title = {Curvelet denoising},
	booktitle = {SINBAD 2008},
	year = {2008},
	abstract = {The separation of signal and noise is an important issue in seismic data processing. By noise we refer to the incoherent noise which is present in the data. In our case, we showed curvelets concentrate seismic signal energy in few significant coefficients unlike noise energy that is spread all over the coefficients. The sparsity of seismic data in the curvelet domain makes curvelets an ideal choice for separating the noise from the seismic data. In our approach the denoising problem is framed as curvelet-regularized inversion problem. After initial processing, we applied the algorithm to the poststack data and compared our results with conventional wavelet denoising.},
	keywords = {Presentation, SINBAD, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2008/kumar2008SINBADcd/kumar2008SINBADcd.pdf},
	author = {Vishal Kumar}
}
@conference {lebed2008SINBADaoc,
	title = {Curvelet / Surfacelet comparison},
	booktitle = {SINBAD},
	year = {2008},
	abstract = {Curvelets and Surfacelets are two transforms that aim to achieve a multiscale and a multidirectional decomposition of arbitrary N-dimensional ($N>=2$) signals. While both transforms are Fourier-based, their construction is intrinsically different. In this talk we will give and overview of the construction of the two transforms, and explore their properties such as frequency domain / spatial domain coherence, sparsity, redundancy and computational complexity.},
	keywords = {Presentation, SINBAD, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2008/lebed2008SINBADaoc/lebed2008SINBADaoc.pdf},
	author = {Evgeniy Lebed}
}
@conference {saab2008SINBADcps,
	title = {Curvelet-based primary-multiple separation from a Bayesian perspective},
	booktitle = {SINBAD 2008},
	year = {2008},
	abstract = {We present a novel primary-multiple separation scheme which makes use of the sparsity of both primaries and multiples in a transform domain, such as the curvelet transform, to provide estimates of each. The proposed algorithm utilizes seismic data as well as the output of a preliminary step that provides (possibly) erroneous predictions of the multiples. The algorithm separates the signal components, i.e., the primaries and multiples, by solving an optimization problem that assumes noisy input data and can be derived from a Bayesian perspective. More precisely, the optimization problem can be arrived at via an assumption of a weighted Laplacian distribution for the primary and multiple coefficients in the transform domain and of white Gaussian noise contaminating both the seismic data and the preliminary prediction of the multiples, which both serve as input to the algorithm.},
	keywords = {Presentation, SINBAD, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2008/saab2008SINBADcps/saab2008SINBADcp.pdf},
	author = {Rayan Saab}
}
@conference {kumar2008SINBADcrd,
	title = {Curvelet-regularized deconvolution},
	booktitle = {SINBAD 2008},
	year = {2008},
	abstract = {The removal of source signature from seismic data is an important step in seismic data processing. The Curvelet transform provides sparse representations for images that comprise smooth objects separated by piece-wise smooth discontinuities (e.g. seismic reflectivity). In this approach the sparseness of reflectivity in Curvelet domain is used as a prior to stabilize the inversion process. Our Curvelet-regularized deconvolution algorithm uses recently developed SPGL1 solver which does adaptive sampling of the trade-off curve. We applied the algorithm on a synthetic example and compared our results with that of Spiky deconvolution approach.},
	keywords = {Presentation, SINBAD, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2008/kumar2008SINBADcrd/kumar2008SINBADcrd.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2008/kumar08SINBADcrd/kumar08SINBADcrd_pres.pdf},
	author = {Vishal Kumar}
}
@conference {herrmann2007SINBADcwe,
	title = {Compressed wavefield extrapolation},
	booktitle = {SINBAD 2007},
	year = {2007},
	abstract = {An explicit algorithm for the extrapolation of one-way wavefields is proposed which combines recent developments in information theory and theoretical signal processing with the physics of wave propagation. Because of excessive memory requirements, explicit formulations for wave propagation have proven to be a challenge in 3-D. By using ideas from {\textquoteleft}{\textquoteleft}compressed sensing{\textquoteright}{\textquoteright}, we are able to formulate the (inverse) wavefield extrapolation problem on small subsets of the data volume, thereby reducing the size of the operators. According to compressed sensing theory, signals can successfully be recovered from an incomplete set of measurements when the measurement basis is incoherent with the representation in which the wavefield is sparse. In this new approach, the eigenfunctions of the Helmholtz operator are recognized as a basis that is incoherent with curvelets that are known to compress seismic wavefields. By casting the wavefield extrapolation problem in this framework, wavefields can successfully be extrapolated in the modal domain via a computationally cheaper operation. A proof of principle for the {\textquoteleft}{\textquoteleft}compressed sensing{\textquoteright}{\textquoteright} method is given for wavefield extrapolation in 2-D. The results show that our method is stable and produces identical results compared to the direct application of the full extrapolation operator. This is joint work with Tim Lin.},
	keywords = {Presentation, SINBAD, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2007/herrmann2007SINBADcwe/herrmann2007SINBADcwe.pdf},
	author = {Felix J. Herrmann}
}
@conference {lin2006SINBADci,
	title = {Compressed imaging},
	booktitle = {SINBAD 2006},
	year = {2006},
	abstract = {In 1998 Grimbergen et. al. introduced a new method for computing wavefield propagation which improved on the previously employed local explicit operator method in that it exhibited no dip limitation, accurately handled laterally varying background ground velocity models, and is unconditionally stable. These desirable properties are mainly attributed to bringing the propagation problem into an eigenvector basis that diagonalizes the propagation operators. This modal-transform method, however, requires at each depth-level the solution of a large-scale sparse eigenvalue problem to compute the square-root of the Helmholtz operator. By using recent results from compressed sensing, we hope to reduce these computational costs that typically involve the synthesizes of the imaging operators and the cost of matrix-vector products. To reduce these costs, we compress the extrapolation operators by using only a fraction of the positive eigenvalues and temporal frequencies. This reduction not only leads to smaller matrices but also to reduced synthesis costs. These reductions go at the expense of solving a recovery problem from incomplete data. During the presentation, we show that wavefields can accurately be extrapolated with a compressed operators and competitive costs.},
	keywords = {Presentation, SINBAD, SLIM},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2006/lin2006SINBADci/lin2006SINBADci.pdf},
	author = {Tim T.Y. Lin}
}
