@presentation {louboutin2017SINBADFldi,
	title = {Latest developments in Devito},
	year = {2017},
	publisher = {SINBAD},
	abstract = {We present an overview of the latest developments in Devito. We introduced Devito in the previous meeting as a prototype finite-difference DSL for seismic modelling and inversion. We are presenting here the latest improvements and functionalities of Devito. We will also discuss the current future plans as well as non-supported features that the audience may be interested in. This presentation will be followed by/mixed with a hands-in tutorial if the time and resources allows it.},
	keywords = {Presentation, SINBAD, SINBADFALL2017, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2017/Fall/louboutin2017SINBADFldi/louboutin2017SINBADFldi.pdf},
	url2 = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2017/Fall/louboutin2017SINBADFldi/louboutin2017SINBADFldi.mov},
	author = {Mathias Louboutin and Michael Lange and Fabio Luporini and Navjot Kurjeka and Jan Hueckelheim and Gerard Gorman and Philipp A. Witte and Felix J. Herrmann}
}
@presentation {graff2017SINBADFlrp,
	title = {Low-rank representation of omnidirectional subsurface extended image volumes},
	year = {2017},
	publisher = {SINBAD},
	abstract = {Extended image volumes are an important migration tool in seismic exploration. However the computation and the storage of omnidirectional subsurface extended image volumes are usually prohibitive. That is why some solutions have been already proposed for instance by focusing on horizontal offsets only. In our work, we will consider a linear algebra approach to deal with the low-rank representation of extended image volumes with full offsets. We will never build entirely the resulting matrix but get only actions of it on well-chosen probing vectors, based on Low-Rank decomposition or randomized SVD. This representation allows us to have access to all the energy of the extended image volume matrix and still limits the storage of the information and the computational cost.},
	keywords = {Presentation, SINBAD, SINBADFALL2017, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2017/Fall/graff2017SINBADFlrp/graff2017SINBADFlrp.pdf},
	url2 = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2017/Fall/graff2017SINBADFlrp/graff2017SINBADFlrp.mov},
	author = {Marie Graff-Kray and Rajiv Kumar and Felix J. Herrmann}
}
@presentation {kumar2017SINBADFmdt,
	title = {Multi-domain target-oriented imaging using extreme-scale matrix factorization},
	year = {2017},
	publisher = {SINBAD},
	abstract = {In this work, we present an alternative approach to redatum both source and receivers at depth, under the framework of reflectivity-based extended images with two-way wave propagation in the background medium. We propose a randomized svd based probing scheme that takes advantage of the algebraic structure of the extended imaging system to overcome the computational cost and memory usage associated with the number of wave-equation solutions and explicit storage employed by conventional migration methods. Experimental results on complex geological models demonstrate the efficacy of proposed methodology in performing multi-domain target imaging.},
	keywords = {Presentation, SINBAD, SINBADFALL2017, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2017/Fall/kumar2017SINBADFmdt/kumar2017SINBADFmdt.pdf},
	url2 = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2017/Fall/kumar2017SINBADFmdt/kumar2017SINBADFmdt.mov},
	author = {Rajiv Kumar and Marie Graff-Kray and Ivan Vasconcelos and Felix J. Herrmann}
}
@presentation {gorman2016SINBADFopp,
	title = {Open Performance portablE SeismiC Imaging{\textendash}-OPESCI},
	year = {2016},
	publisher = {SINBAD},
	abstract = {In this project, we introduce OPESCI-FD, a Python package built on symbolic mathematics to automatically generate Finite Difference models from a high-level description of the model equations. We investigate applying this framework to generate the propagator program used in seismic imaging. We implement the 3D acoustic and anisotropic FD scheme as an example and demonstrate the advantages of usability, flexibility and accuracy of the framework. The design of OPESCI-FD aims to allow rapid development, analysis and optimisation of Finite Difference programs. OPESCI-FD is the foundation for continuing development by the OPESCI project team, building on the research presented in this report. This talk concludes by reviewing the further developments that are already under way, as well as the scope for extension to cater for other equations and numerical schemes. This joint work with SINBAD and SENAI CIMATEC and has received additional funding from Intel.},
	keywords = {Presentation, private, SINBAD, SINBADFALL2016, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2016/Fall/gorman2016SINBADFopp/gorman2016SINBADFopp.pdf},
	url2 = {https://slim.gatech.edu/Publications/Private/Conferences/SINBAD/2016/Fall/gorman2016SINBADFopp/gorman2016SINBADFopp.mov},
	author = {Gerard Gorman and Marcos de Aguiar and David Ham and Felix J. Herrmann and Paul H. J. Kelly and Navjot Kukreja and Michael Lange and Mathias Louboutin and Fabio Luporini and Paulius Velesko and Vincenzo Pandolfo and Felippe Vieira Zacarias}
}
@presentation {peters2015SINBADF3dw,
	title = {3D WRI},
	year = {2015},
	publisher = {SINBAD},
	abstract = {The Wavefield Reconstruction Inversion (WRI) approach to seismic inversion is a topic of active research in the SLIM group. Several variants have been proposed, all of which rely on the solution of a linear least-squares problem with a Helmholtz discretization. While algorithms based on LU or QR factorization are very efficient for 2D problems, 3D problems required the development of a factorization-free iterative method. This talk introduces the current version of the algorithm, which requires significantly less memory and computation and uses existing Helmholtz solvers as an important building block. We plan to discuss early results of 3-D WRI on a small 3-D synthetic example.},
	keywords = {Presentation, SINBAD, SINBADFALL2015, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2015/Fall/peters2015SINBADF3dw/peters2015SINBADF3dw.pdf},
	url2 = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2015/Fall/peters2015SINBADF3dw/peters2015SINBADF3dw.mov},
	author = {Bas Peters and Chen Greif 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}
}
@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 {peters2015SINBADswr,
	title = {Solving WRI{\textquoteright}s data-augmented wave equation in 3D},
	year = {2015},
	publisher = {SINBAD},
	abstract = {The Wavefield Reconstruction Inversion (WRI) approach to seismic inversion is a topic of active research in the SLIM group. Several variants have been proposed, all of which rely on the solution of a linear least-squares problem with a Helmholtz discretization. While algorithms based on LU or QR factorization are very efficient for 2D problems, 3D problems required the development of a factorization-free iterative method. This talk introduces the current version of the algorithm, which requires significantly less memory and computation then a few months ago and uses existing Helmholtz solvers as an important building block.},
	keywords = {Presentation, SINBAD, SINBADSPRING2015, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2015/Spring/peters2015SINBADswr/peters2015SINBADswr.pdf},
	author = {Bas Peters and Chen Greif and Felix J. Herrmann}
}
@presentation {tu2014SINBADsis,
	title = {Sparse inversion simplified},
	year = {2014},
	publisher = {SINBAD},
	abstract = {Implementation of the SPGl1 solver in low-level computer languages such as C or Fortran may sound daunting to many. This talk is tailored for you if you would like to reap benefits from using sparse constraints to regularize your inversion problem, and at the same time want some easy-to-implement algorithm to solve it. We discuss in this talk the linearized Bregman projection method that embraces both ingredients, and show promising applications in fast least-squares imaging and seismic data interpolation problems.},
	keywords = {Presentation, SINBAD, SINBADFALL2014, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2014/Fall/tu2014SINBADsis/tu2014SINBADsis.pdf},
	author = {Ning Tu and Navid Ghadermarzy and Rajiv Kumar and Felix J. Herrmann}
}
@presentation {esser2014SINBADtvc,
	title = {Total variation constrained full waveform inversion with continuation},
	year = {2014},
	publisher = {SINBAD},
	abstract = {Adding a total variation constraint to the Wavefield Reconstruction Inversion model proposed by van Leeuwen and Herrmann can improve robustness and remove artifacts by encouraging piecewise smooth solutions. However, if the parameter controlling the strength of the TV regularization is not well chosen, important details can be lost. We investigate continuation strategies that gradually reduce the strength of the TV constraint so that these important details are eventually allowed back into the solution. Preliminary numerical experiments suggest that this can improve the solution path and lead to better velocity models than if TV regularization were not used during the intermediate steps.},
	keywords = {Presentation, SINBAD, SINBADFALL2014, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2014/Fall/esser2014SINBADtvc/esser2014SINBADtvc.pdf},
	author = {Ernie Esser and Llu{\'\i}s Guasch and Tristan van Leeuwen and Aleksandr Y. Aravkin and Felix J. Herrmann}
}
@presentation {ghadermarzy2014SINBADwrr,
	title = {Wavefield reconstruction via randomized sampling},
	year = {2014},
	publisher = {SINBAD},
	abstract = {Regular sampling along the time axis is a common approach for seismic imaging. However, seismic data are often spatially undersampled due to economical reasons as well as ground surface limitations. Operational conditions might result in noisy traces or even gaps in coverage and irregular sampling which often leads to image artifacts. Seismic trace interpolation aims to interpolate missing traces in an otherwise regularly sampled seismic data to a complete regular grid. In this talk, we explain some techniques, with low computational complexity, that can be used to improve the results. In particular, we talk about weighting, switching to midpoint-offset domain from frequency-space domain, and uniform versus jittered undersampling. We illustrate the advantages of these modifications using a real seismic line from the Gulf of Suez.},
	keywords = {Presentation, SINBAD, SINBADFALL2014, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2014/Fall/ghadermarzy2014SINBADwrr/ghadermarzy2014SINBADwrr.pdf},
	author = {Navid Ghadermarzy and Ozgur Yilmaz and Felix J. Herrmann}
}
@presentation {goh2013SINBADttt,
	title = {Taming time through tangents},
	year = {2013},
	publisher = {SINBAD},
	abstract = {Given two vectors of (possibly) different lengths, the edit distance considers all possible alignments between the two and picks the one that minimizes the number of operations needed to turn one into the other. Though highly non-smooth and riddled with local minima, we show a way to compute the convex envelope of this function, which opens the door to using the approximate edit distance as a surrogate for the L2 distance and comparing vectors of different lengths.},
	keywords = {Presentation, SINBAD, SINBADFALL2013, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2013/Fall/goh2013SINBADttt/goh2013SINBADttt.pdf},
	author = {Gabriel Goh and Michael P. Friedlander and Felix J. Herrmann}
}
@presentation {ghadermarzy2013SINBADups,
	title = {Using prior support information in approximate message passing algorithms},
	year = {2013},
	publisher = {SINBAD},
	abstract = {Consider the standard compressed sensing problem. We want to recover sparse compressible aorsignal from few linear measurements. In this talk we investigate recovery performance when we have prior information about the support, i.e., the indices of the non-zero entries, of the signal to be recovered. First we briefly review the results of "weighted $\ell_p$ minimization algorithm with p = 1 and 0 < p < 1". Then we derive a weighted approximate message passing (AMP) algorithm which incorporates prior support information into the AMP algorithm. We empirically show that this algorithm recovers sparse signals significantly faster than weighted $\ell_1$ minimization. We also introduce a reweighting scheme for AMP and weighted AMP which, we observe, substantially improves the recovery conditions of these algorithms. We illustrate our results with extensive numerical experiments on synthetic data and seismic data reconstruction.},
	keywords = {Presentation, SINBAD, SINBADFALL2013, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2013/Fall/ghadermarzy2013SINBADups/ghadermarzy2013SINBADups.pdf},
	author = {Navid Ghadermarzy and Ozgur Yilmaz and Felix J. Herrmann}
}
@presentation {ghadermarzy2012SINBADncc,
	title = {Non-convex compressed sensing using partial support information},
	year = {2012},
	publisher = {SINBAD},
	abstract = {In this talk, we will address the recovery conditions of weighted $\ell_p$ minimization for signal reconstruction from compressed sensing measurements when (possibly inaccurate) partial support information is available. First we will motivate the use of (weighted) $\ell_p$ minimization with $p<1$ and point out its advantages over weighted $\ell_1$ minimization when there is prior information on the support of the signal that is possibly partial and inaccurate. Then we will provide theoretical guarantees of sufficient recovery conditions for weighted $\ell_p$ minimization, which are better than those for (unweighted) $\ell_p$ minimization as well as those for weighted $\ell_1$. In the last part of the talk, we will illustrate our results with some numerical experiments stylized applications.},
	keywords = {Presentation, SINBAD, SINBADFALL2012, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2012/Fall/ghadermarzy2012SINBADncc/ghadermarzy2012SINBADncc_pres.pdf},
	author = {Navid Ghadermarzy}
}
