@presentation {lin2012SINBADics,
	title = {An introduction to cosparse signal reconstruction},
	year = {2012},
	publisher = {SINBAD},
	abstract = {Undersampling techniques in exploration seismology usually relies 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. 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. The cosparsity of the signal permits recovery guarantees that are completely separate from sparsity-based models, and gives rise to distinct sets of reconstruction algorithms and performances compared to sparsity-based approaches. We present in this talk some initial findings on the viability of cosparse reconstruction for a variety of seismic applications that previously relied on sparse signal reconstruction, such as data interpolation and source separation.},
	keywords = {Presentation, SINBAD, SINBADFALL2012, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2012/Fall/lin2012SINBADics/lin2012SINBADics_pres.pdf},
	author = {Tim T.Y. Lin}
}
@presentation {Lin2012SINBADrdr,
	title = {Recent developments on the robust estimation of primaries by sparse inversion},
	year = {2012},
	publisher = {SINBAD},
	abstract = {Robust estimation of primaries by sparse inversion is a next-generation surface multiple removal technique with an objective to truly invert an operator that models the free-surface. Key to the success of this approach is the imposition of a sparsity constraint on the primary impulse response in the time domain. This is accomplished by carefully applying large-scale convex optimization techniques on an extended L1 minimization problem. One of the benefits of our approach is that many extensions to the algorithm can be devised under this optimization framework to improve the quality of the solution given fixed computational costs and mitigating various shortcomings in field data. This talk will first review the basic technique of Robust EPSI and follow with some highlights on recent further developments of the algorithm, including a discussion on the role of regularization by reciprocity and the interpolation of near-offset data, as well as investigations into optimality and robustness to data outliers.},
	keywords = {Presentation, SINBAD, SINBADFALL2012, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2012/Fall/Lin2012SINBADrdr/Lin2012SINBADrdr_pres.pdf},
	author = {Tim T.Y. Lin}
}
@presentation {herrmann2012SINBADhpc,
	title = {SLIM{\textquoteright}s perspective on HPC \& big data},
	year = {2012},
	publisher = {SINBAD},
	keywords = {Presentation, SINBAD, SINBADFALL2012, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2012/Fall/herrmann2012SINBADhpc/herrmann2012SINBADhpc_pres.pdf},
	author = {Tim T.Y. Lin and Tristan van Leeuwen and Felix J. Herrmann}
}
