@conference {hennenfent2008SINBADnii2,
	title = {New insights into one-norm solvers from the Pareto curve},
	booktitle = {SINBAD},
	year = {2008},
	abstract = {Several geophysical ill-posed inverse problems are successfully solved by promoting sparsity using one-norm regularization. The practicality of this approach depends on the effectiveness of the one-norm solver used and on its robustness under limited number of iterations. We propose an approach to understand the behavior and evaluate the performance of one-norm solvers. The technique consists of tracking on a graph the data misfit versus the one norm of successive iterates. By comparing the solution paths to the Pareto curve, we are able to assess the performance of the solvers and the quality of the solutions. Such an assessment is particularly relevant given the renewed interest in one-norm regularization.},
	keywords = {SINBAD, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2008/hennenfent2008SINBADnii2/hennenfent2008SINBADnii2.pdf},
	author = {Gilles Hennenfent}
}
@conference {johnson2008SINBADsdi,
	title = {Seismic data interpolation with symmetry},
	booktitle = {SINBAD 2008},
	year = {2008},
	abstract = {Due to the physics of reciprocity seismic data sets are symmetric in the source and receiver coordinates. Often seismic data sets are incomplete and the missing data must be interpolated. Typically, missing traces do not occur symmetrically. The purpose of this project is to extend the current formulation for solving the seismic interpolation problems in such a way that they enforce reciprocity. The method decomposes the seismic data volume into symmetric and antisymmetric parts. This decomposition leads to an augmented system of equations for the L1-solver that promotes sparsity in the curvelet domain. Interpolation is carried out on the entire system during which the asymmetric component of the volume is forced to zero, while the symmetric part of the data volume is matched to the measured data.},
	keywords = {Presentation, SINBAD, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2008/johnson2008SINBADsdi/johnson2008SINBADsdi.pdf},
	author = {James Johnson and Gilles Hennenfent}
}
@conference {hennenfent2008SINBADsdw2,
	title = {Simply denoise: wavefield reconstruction via jittered undersampling},
	booktitle = {SINBAD 2008},
	year = {2008},
	abstract = {We present a new discrete undersampling scheme designed to favor wavefield reconstruction by sparsity-promoting inversion with transform elements that are localized in the Fourier domain. Our work is motivated by empirical observations in the seismic community, corroborated by recent results from compressive sampling, which indicate favorable (wavefield) reconstructions from random as opposed to regular undersampling. As predicted by theory, random undersampling renders coherent aliases into harmless incoherent random noise, effectively turning the interpolation problem into a much simpler denoising problem. A practical requirement of wavefield reconstruction with localized sparsifying transforms is the control on the maximum gap size. Unfortunately, random undersampling does not provide such a control and the main purpose of this paper is to introduce a sampling scheme, coined jittered undersampling, that shares the benefits of random sampling, while offering control on the maximum gap size. Our contribution of jittered sub-Nyquist sampling proofs to be key in the formulation of a versatile wavefield sparsity-promoting recovery scheme that follows the principles of compressive sampling. After studying the behavior of the jittered-undersampling scheme in the Fourier domain, its performance is studied for curvelet recovery by sparsity-promoting inversion (CRSI). Our findings on synthetic and real seismic data indicate an improvement of several decibels over recovery from regularly-undersampled data for the same amount of data collected.},
	keywords = {Presentation, SINBAD, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2008/hennenfent2008SINBADsdw2/hennenfent2008SINBADsdw2.pdf},
	author = {Gilles Hennenfent}
}
@conference {hennenfent2007SINBADjdn,
	title = {Just denoise: nonlinear recovery from randomly sampled data},
	booktitle = {SINBAD 2007},
	year = {2007},
	abstract = {In this talk, we turn the interpolation problem of coarsely-sampled data into a denoising problem. From this point of view, we illustrate the benefit of random sampling at sub-Nyquist rate over regular sampling at the same rate. We show that, using nonlinear sparsity-promoting optimization, coarse random sampling may actually lead to significantly better wavefield reconstruction than equivalent regularly sampled data.},
	keywords = {Presentation, SINBAD, SLIM},
	author = {Gilles Hennenfent}
}
@conference {hennenfent2007SINBADrii,
	title = {Recent insights in $\ell_1$ solvers},
	booktitle = {SINBAD 2007},
	year = {2007},
	abstract = {During this talk, an overview is given on our work on norm-one solvers as part of the DNOISE project. Gilles will explain the ins and outs of our iterative thresholding solver based on log cooling while Felix will present the work of Michael Friedlander "A Newton root-finding algorithms for large-scale basis pursuit denoise". Both approaches involve the solution of the basis pursuit problem that seeks a minimum one-norm solution of an underdetermined least-squares problem. Basis pursuit denoise (BPDN) fits the least-squares problem only approximately, and a single parameter determines a curve that traces the trade-off between the least-squares fit and the one-norm of the solution. In the work of Friedlander, it is shown show that the function that describes this curve is convex and continuously differentiable over all points of interest. They describe an efficient procedure for evaluating this function and its derivatives. As a result, they can compute arbitrary points on this curve. Their method is suitable for large-scale problems. Only matrix-vector operations are required. This is joint work with Ewout van der Berg and Michael P. Friedlander},
	keywords = {Presentation, SINBAD, SLIM},
	author = {Gilles Hennenfent and Felix J. Herrmann}
}
@conference {hennenfent2006SINBADtnf,
	title = {The Nonuniform Fast Discrete Curvelet Transform (NFDCT)},
	booktitle = {SINBAD 2006},
	year = {2006},
	abstract = {The authors present an extension of the fast discrete curvelet transform (FDCT) to nonuniformly sampled data. This extension not only restores curvelet compression rates for nonuniformly sampled data but also removes noise and maps the data to a regular grid.},
	keywords = {Presentation, SINBAD, SLIM},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2006/hennenfent2006SINBADtnf/hennenfent2006SINBADtnf.pdf},
	author = {Gilles Hennenfent}
}
@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 {sastry2007SINBADrfu,
	title = {Recovery from unstructured data},
	booktitle = {SINBAD 2006},
	year = {2006},
	keywords = {Presentation, SINBAD, SLIM},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2006/sastry2007SINBADrfu/sastry2007SINBADrfu.pdf},
	author = {Challa S. Sastry and Gilles Hennenfent and Felix J. Herrmann}
}
@conference {hennenfent2006SINBADros,
	title = {Recovery of seismic data: practical considerations},
	booktitle = {SINBAD 2006},
	year = {2006},
	abstract = {We propose a method for seismic data interpolation based on 1) the reformulation of the problem as a stable signal recovery problem and 2) the fact that seismic data is sparsely represented by curvelets. This method does not require information on the seismic velocities. Most importantly, this formulation potentially leads to an explicit recovery condition. We also propose a large-scale problem solver for the l1-regularization minimization involved in the recovery and successfully illustrate the performance of our algorithm on 2D synthetic and real examples.},
	keywords = {Presentation, SINBAD, SLIM},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2006/hennenfent2006SINBADros/hennenfent2006SINBADros.pdf},
	author = {Gilles Hennenfent}
}
