@article {lopez2015IEEEogl,
	title = {Off-the-grid low-rank matrix recovery and seismic data reconstruction},
	journal = {IEEE Journal of Selected Topics in Signal Processing},
	volume = {10},
	number = {4},
	year = {2016},
	note = {(IEEE Journal of Selected Topics in Signal Processing)},
	month = {06},
	pages = {658-671},
	abstract = {Matrix sensing problems capitalize on the knowledge that a data matrix of interest exhibits low rank properties. This low dimensional structure often arises because the data matrix is obtained by sampling a smooth function on a regular (or structured) grid. However, in many practical situations the measurements are taken on an irregular grid (that is accurately known). This results in an "unstructured data matrix" that is less fit for the low rank model in comparison to its regular counterpart and therefore subject to degraded reconstruction via rank penalization techniques. In this paper, we propose and analyze a modified low-rank matrix recovery work-flow that admits unstructured observations. By incorporating a regularization operator which accurately maps structured data to unstructured data, into the nuclear-norm minimization problem, we are able to compensate for data irregularity. Furthermore, by construction our formulation yields output that is supported on a structured grid. We establish recovery error bounds for our methodology and offer matrix sensing and matrix completion numerical experiments including applications to seismic trace interpolation to demonstrate the potential of the approach.},
	keywords = {data regularization, matrix completion, matrix sensing, nonuniform discrete Fourier transform, nuclear-norm relaxation, seismic data, seismic trace interpolation},
	doi = {10.1109/JSTSP.2016.2555482},
	url = {https://slim.gatech.edu/Publications/Public/Journals/IEEESignalProcessingMagazine/2016/lopez2015IEEEogl/lopez2015IEEEogl.pdf},
	url2 = {http://ieeexplore.ieee.org/xpl/login.jsp?tp=\&arnumber=7454674},
	author = {Oscar Lopez and Rajiv Kumar and Ozgur Yilmaz and Felix J. Herrmann}
}
@conference {lopez2016CMSogl,
	title = {Off-the-grid low-rank matrix recovery: seismic data reconstruction},
	booktitle = {Canadian Mathematical Society Summer Meeting},
	year = {2016},
	note = {(CMS, Edmonton, Alberta)},
	month = {06},
	abstract = {This talk discusses a modified low-rank matrix recovery work-flow that admits unstructured observations. By incorporating a regularization operator which accurately maps structured data to unstructured data, into the nuclear-norm minimization problem, this approach is able to compensate for data irregularity. Furthermore, by construction this formulation yields output that is supported on a structured grid. Recovery error bounds are established for the methodology with matrix sensing and matrix completion numerical experiments including applications to seismic trace interpolation to demonstrate the potential of the approach.},
	keywords = {CMS, matrix completion, matrix sensing, nonuniform discrete Fourier transform, nuclear-norm, Seismic data Interpolation},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/CMS/2016/lopez2016CMSogl/lopez2016CMSogl_pres.pdf},
	author = {Oscar Lopez and Rajiv Kumar and Ozgur Yilmaz and Felix J. Herrmann}
}
@conference {wang2015SIAMwds,
	title = {Wavefield-denoising and source encoding},
	booktitle = {SIAM Conference on Mathematical and Computational Issues in the Geosciences},
	year = {2015},
	note = {(SIAM Conference on Mathematical and Computational Issues in the Geosciences, Stanford University, California)},
	month = {06-07},
	keywords = {SIAM, source encoding, WRI},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SIAM/2015/wang2015SIAMwds/wang2015SIAMwds_pres.pdf},
	author = {Rongrong Wang and Ozgur Yilmaz and Felix J. Herrmann}
}
@presentation {yilmaz2014SINBADadc,
	title = {Analog-to-digital conversion in compressive sampling},
	year = {2014},
	publisher = {SINBAD},
	abstract = {Compressive sampling theory is now established as an effective method for dimension reduction when the underlying signals (e.g., seismic data) are sparse with respect to some suitable basis or frame (e.g., curvelets in the case of seismic). One important problem directly related to the acquisition of analog signals is how to perform analog-to-digital conversion. This is directly related to two important issues: (i) how accurately one can acquire a signal using compressive sampling (in terms of bit depth), and (ii) how {\textquoteleft}{\textquoteleft}compressed{\textquoteright}{\textquoteright} is compressive sampling (in terms of the total number of bits one ends up using after acquiring the signal). We will present recent results that provide answers to these questions. Specifically, we provide an analog-to-digital conversion method that achieves nearly optimal compression using cheap analog devices with a large margin for imperfections.},
	keywords = {Presentation, SINBAD, SINBADFALL2014, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2014/Fall/yilmaz2014SINBADadc/yilmaz2014SINBADadc.pdf},
	author = {Ozgur Yilmaz}
}
@techreport {wang2014SEGfwi,
	title = {Full waveform inversion with interferometric measurements},
	number = {TR-EOAS-2014-5},
	year = {2014},
	month = {04},
	institution = {UBC},
	abstract = {In this note, we design new misfit functions for full-waveform inversion by using interferometric measurements to reduce sensitivity to phase errors. Though established within a completely different setting from the linear case, we obtain a similar observation: the interferometry can improve robustness under certain modeling errors. Moreover, in order to deal with errors on both source and receiver sides, we propose a higher order interferometry, which, as a generalization of the usual definition, involves the cross correlation of four traces. A proof of principle simulations is included on a stylized example.},
	keywords = {FWI},
	url = {https://slim.gatech.edu/Publications/Public/TechReport/2014/wang2014SEGfwi/wang2014SEGfwi.html},
	author = {Rongrong Wang and Ozgur Yilmaz and Felix J. Herrmann}
}
@article {ghadermarzy2013ncs,
	title = {Non-convex compressed sensing using partial support information},
	journal = {Journal of Sampling Theory in Signal and Image Processing},
	volume = {13},
	number = {3},
	year = {2014},
	pages = {249-270},
	abstract = {In this paper we address the recovery conditions of weighted $\ell_p$ minimization for signal reconstruction from compressed sensing measurements when partial support in- formation is available. We show that weighted $\ell_p$ minimization with 0 < p < 1 is stable and robust under weaker sufficient conditions compared to weighted $\ell_1$ minimization. Moreover, the sufficient recovery conditions of weighted $\ell_p$ are weaker than those of regular $\ell_p$ minimization if at least 50\% of the support estimate is accurate. We also review some algorithms which exist to solve the non-convex $\ell_p$ problem and illustrate our results with numerical experiments.},
	keywords = {compressed sensing, nonconvex optimization, sparse reconstruction, weighted $\ell_p$},
	url = {http://arxiv.org/abs/1311.3773},
	author = {Navid Ghadermarzy and Hassan Mansour and Ozgur Yilmaz}
}
@conference {ghadermarzy2014SEGsti,
	title = {Seismic trace interpolation with approximate message passing},
	booktitle = {SEG Technical Program Expanded Abstracts},
	year = {2014},
	note = {(SEG)},
	month = {10},
	pages = {3621-3626},
	abstract = {Approximate message passing (AMP) is a computationally effective algorithm for recovering high dimensional signals from a few compressed measurements. In this paper we use AMP to solve the seismic trace interpolation problem. We also show that we can exploit the fast AMP algorithm to improve the recovery results of seismic trace interpolation in curvelet domain, both in terms of convergence speed and recovery performance by using AMP in Fourier domain as a preprocessor for the L1 recovery in Curvelet domain.},
	keywords = {AMP, interpolation, SEG},
	doi = {http://dx.doi.org/10.1190/segam2014-0577.1},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2014/ghadermarzy2014SEGsti/ghadermarzy2014SEGsti.html},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2014/ghadermarzy2014SEGsti/ghadermarzy2014SEGsti_pres.pdf},
	author = {Navid Ghadermarzy and Ozgur Yilmaz 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 {hargreaves2013SINBADbfo,
	title = {The bridge from orthogonal to redundant transforms and weighted $\ell_1$ optimization},
	year = {2013},
	publisher = {SINBAD},
	abstract = {Traditional arguments in synthesis $\ell_1$ -optimization require our forward operator to be orthogonal, though we use redundant transforms in practice. These traditional arguments do not translate to redundant transforms, and other arguments require impractical conditions on our effective measurement matrix. Recent theory in one-norm analysis, namely the optimal dual $\ell_1$ analysis of Shidong et al, have provided point-wise reconstruction error estimates for synthesis using an equivalence relationship where we can use weaker assumptions. This exposes an important model assumption indicating why analysis might outperform synthesis, for which careful consideration in seismic is necessary, and the need for models such as the cosparse model. In this talk we will discuss these ideas, provide evidence which indicates this theory should generalize to uniform error estimates(and thus not signal dependent), and how redundancy, support information, and weighting play important roles.},
	keywords = {Presentation, SINBAD, SINBADFALL2013, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2013/Fall/hargreaves2013SINBADbfo/hargreaves2013SINBADbfo.pdf},
	author = {Brock Hargreaves and Ozgur Yilmaz 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}
}
@article {mansour2013GEOPiwr,
	title = {Improved wavefield reconstruction from randomized sampling via weighted one-norm minimization},
	journal = {Geophysics},
	volume = {78},
	number = {5},
	year = {2013},
	month = {08},
	pages = {V193-V206},
	abstract = {Missing-trace interpolation aims to recover the gaps caused by physical obstacles or deliberate subsampling to control acquisition costs in otherwise regularly sampled seismic wavefields. Although transform-domain sparsity promotion has proven to be an effective tool to solve this recovery problem, current recovery techniques do not fully utilize a priori information derived from the locations of the transform-domain coefficients, especially when curvelet domain sparsity is exploited. We use recovery by weighted one-norm minimization, which exploits correlations between the locations of significant curvelet coefficients of different partitions, e.g., shot records, common-offset gathers, or frequency slices of the acquired data. We use these correlations to define a sequence of 2D curvelet-based recovery problems that exploit 3D continuity exhibited by seismic wavefields without relying on the highly redundant 3D curvelet transform. To test the performance of our weighted algorithm, we compared recoveries from different data sorting and partitioning scenarios for a seismic line from the Gulf of Suez. These tests demonstrated that our method is superior to standard $\ell_1$ minimization in terms of antialiasing capability, reconstruction quality and computational memory requirements.},
	keywords = {compressed sensing, randomized sampling, Trace interpolation, weighted one-norm minimization},
	doi = {10.1190/geo2012-0383.1},
	url = {https://slim.gatech.edu/Publications/Public/Journals/Geophysics/2013/mansour2013GEOPiwr/mansour2013GEOPiwr.pdf},
	author = {Hassan Mansour and Felix J. Herrmann and Ozgur Yilmaz}
}
@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}
}
@conference {mansour2012ICASSadapt,
	title = {Adaptive compressed sensing for video acquisition},
	booktitle = {ICASSP},
	year = {2012},
	abstract = {In this paper, we propose an adaptive compressed sensing scheme that utilizes a support estimate to focus the measurements on the large valued coefficients of a compressible signal. We embed a "sparse-filtering" stage into the measurement matrix by weighting down the contribution of signal coefficients that are outside the support estimate. We present an application which can benefit from the proposed sampling scheme, namely, video compressive acquisition. We demonstrate that our proposed adaptive CS scheme results in a significant improvement in reconstruction quality compared with standard CS as well as adaptive recovery using weighted $\ell_1$ minimization.},
	keywords = {ICASSP},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/ICASSP/2012/MansourYilmazICASSPaCS/MansourYilmazICASSPaCS.pdf},
	author = {Hassan Mansour and Ozgur Yilmaz}
}
@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}
}
@article {Herrmann11TRfcd,
	title = {Fighting the curse of dimensionality: compressive sensing in exploration seismology},
	journal = {Signal Processing Magazine, IEEE},
	volume = {29},
	number = {3},
	year = {2012},
	month = {05},
	pages = {88-100},
	abstract = {Many seismic exploration techniques rely on the collection of massive data volumes that are mined for information during processing. This approach has been extremely successful, but current efforts toward higher resolution images in increasingly complicated regions of Earth continue to reveal fundamental shortcomings in our typical workflows. The "curse" of dimensionality is the main roadblock and is exemplified by Nyquist{\textquoteright}s sampling criterion, which disproportionately strains current acquisition and processing systems as the size and desired resolution of our survey areas continues to increase.},
	keywords = {dimensionality curse, Earth, geographic information systems, higher-resolution images, massive data volumes, Nyquist sampling criterion, seismic exploration techniques, seismology, strains current acquisition system, strains current processing system},
	issn = {1053-5888},
	doi = {10.1109/MSP.2012.2185859},
	url = {https://slim.gatech.edu/Publications/Public/Journals/IEEESignalProcessingMagazine/2012/Herrmann11TRfcd/Herrmann11TRfcd.pdf},
	author = {Felix J. Herrmann and Michael P. Friedlander and Ozgur Yilmaz}
}
@article {mansour2012IEEETITrcs,
	title = {Recovering compressively sampled signals using partial support information},
	journal = {IEEE Transactions on Information Theory},
	volume = {58},
	number = {2},
	year = {2012},
	month = {02},
	pages = {1122-1134},
	publisher = {Department of Computer Science},
	address = {University of British Columbia, Vancouver},
	abstract = {We study recovery conditions of weighted $\ell_1$ minimization for signal reconstruction from compressed sensing measurements when partial support information is available. We show that if at least 50\% of the (partial) support information is accurate, then weighted $\ell_1$ minimization is stable and robust under weaker sufficient conditions than the analogous conditions for standard $\ell_1$ minimization. Moreover, weighted $\ell_1$ minimization provides better upper bounds on the reconstruction error in terms of the measurement noise and the compressibility of the signal to be recovered. We illustrate our results with extensive numerical experiments on synthetic data and real audio and video signals.},
	keywords = {Compressive Sensing},
	doi = {10.1109/TIT.2011.2167214},
	url = {https://slim.gatech.edu/Publications/Public/Journals/IEEETransInformationTheory/2012/mansour2012IEEETITrcs/mansour2012IEEETITrcs.pdf},
	author = {Michael P. Friedlander and Hassan Mansour and Rayan Saab and Ozgur Yilmaz}
}
@conference {mansour2012ICASSsupport,
	title = {Support driven reweighted $\ell_1$ minimization},
	booktitle = {ICASSP},
	year = {2012},
	abstract = {In this paper, we propose a support driven reweighted $\ell_1$ minimization algorithm (SDRL1) that solves a sequence of weighted $\ell_1$ problems and relies on the support estimate accuracy. Our SDRL1 algorithm is related to the IRL1 algorithm proposed by Candes, Wakin, and Boyd. We demonstrate that it is sufficient to find support estimates with good accuracy and apply constant weights instead of using the inverse coefficient magnitudes to achieve gains similar to those of IRL1. We then prove that given a support estimate with sufficient accuracy, if the signal decays according to a specific rate, the solution to the weighted $\ell_1$ minimization problem results in a support estimate with higher accuracy than the initial estimate. We also show that under certain conditions, it is possible to achieve higher estimate accuracy when the intersection of support estimates is considered. We demonstrate the performance of SDRL1 through numerical simulations and compare it with that of IRL1 and standard $\ell_1$ minimization.},
	keywords = {ICASSP},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/ICASSP/2012/MansourYilmazICASSPwL1/MansourYilmazICASSPwL1.pdf},
	author = {Hassan Mansour and Ozgur Yilmaz}
}
@presentation {yilmaz2012SINBADwms,
	title = {Weighted methods in sparse recovery},
	year = {2012},
	publisher = {SINBAD},
	abstract = {In the recent years we have successfully employed "weighted" algorithms to recover sparse signals from few linear, non-adaptive measurements. The general principle here is to use prior knowledge about the signal to be recovered, e.g., approximate locations of large-in-magnitude transform coefficients, if such information is available. An example for this is the use of weighted 1-norm minimization to improve wavefield reconstruction from randomized (sub)sampling. We will review these results and outline some new directions we have explored during the last year, such as weighted non-convex sparse recovery (see Ghadermarzy{\textquoteright}s talk), weighted analysis-based recovery (see Hargreaves{\textquoteright}s talk), and a weighted randomized Kaczmarz algorithm for solving large overdetermined systems of equations that are known to admit a (nearly) sparse solution. Various examples in seismic will be shown.},
	keywords = {Presentation, SINBAD, SINBADFALL2012, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2012/Fall/yilmaz2012SINBADwms/yilmaz2012SINBADwms_pres.pdf},
	author = {Ozgur Yilmaz}
}
@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}
}
@conference {Mansour11TRwmmw,
	title = {Weighted -$\ell_1$ minimization with multiple weighting sets},
	booktitle = {Proc. SPIE},
	volume = {8138},
	year = {2011},
	month = {09},
	pages = {813809-813809-13},
	abstract = {In this paper, we study the support recovery conditions of weighted -$\ell_1$ minimization for signal reconstruction from compressed sensing measurements when multiple support estimate sets with different accuracy are available. We identify a class of signals for which the recovered vector from -$\ell_1$ minimization provides an accurate support estimate. We then derive stability and robustness guarantees for the weighted -$\ell_1$ minimization problem with more than one support estimate. We show that applying a smaller weight to support estimate that enjoy higher accuracy improves the recovery conditions compared with the case of a single support estimate and the case with standard, i.e., non-weighted,-$\ell_1$ minimization. Our theoretical results are supported by numerical simulations on synthetic signals and real audio signals.},
	keywords = {Compressive Sensing, Optimization},
	doi = {10.1117/12.894165},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SPIE/2011/Mansour11TRwmmw/Mansour11TRwmmw.pdf},
	author = {Hassan Mansour and Ozgur Yilmaz}
}
@presentation {yilmaz2010SINBADsac,
	title = {Sparse approximations and compressive sensing: an overview},
	year = {2010},
	publisher = {SINBAD},
	keywords = {Presentation, SINBAD, SINBADFALL2010, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2010/Fall/yilmaz2010SINBADsac/yilmaz2010SINBADsac_pres.pdf},
	author = {Ozgur Yilmaz}
}
@article {saab2008ACHAsrb,
	title = {Sparse recovery by non-convex optimization - instance optimality},
	journal = {Applied and Computational Harmonic Analysis},
	volume = {29},
	number = {1},
	year = {2010},
	month = {07},
	pages = {30-48},
	abstract = {In this note, we address the theoretical properties of $\Delta_p$, a class of compressed sensing decoders that rely on $l^p$ minimization with $p \in (0,1)$ to recover estimates of sparse and compressible signals from incomplete and inaccurate measurements. In particular, we extend the results of Cand{\textquoteleft}es, Romberg and Tao [3] and Wojtaszczyk [30] regarding the decoder $\Delta_1$, based on $\ell^1$ minimization, to $Δp$ with $p \in (0,1)$. Our results are two-fold. First, we show that under certain sufficient conditions that are weaker than the analogous sufficient conditions for $\Delta_1$ the decoders $\Delta_p$ are robust to noise and stable in the sense that they are $(2,p)$ instance optimal. Second, we extend the results of Wojtaszczyk to show that, like $\Delta_1$, the decoders $\Delta_p$ are (2,2) instance optimal in probability provided the measurement matrix is drawn from an appropriate distribution. While the extension of the results of [3] to the setting where $p \in (0,1)$ is straightforward, the extension of the instance optimality in probability result of [30] is non-trivial. In particular, we need to prove that the $LQ_1$ property, introduced in [30], and shown to hold for Gaussian matrices and matrices whose columns are drawn uniformly from the sphere, generalizes to an $LQ_p$ property for the same classes of matrices. Our proof is based on a result by Gordon and Kalton [18] about the Banach-Mazur distances of p-convex bodies to their convex hulls.},
	keywords = {Compressive Sensing, non-convex},
	doi = {10.1016/j.acha.2009.08.002},
	url = {http://www.sciencedirect.com/science/article/pii/S1063520309000864},
	url2 = {https://slim.gatech.edu/Publications/Public/Journals/ACHA/2010/saab2008ACHAsrb/saab2008ACHAsrb.pdf},
	author = {Rayan Saab and Ozgur Yilmaz}
}
@conference {saab2009SAMPTAnccs,
	title = {A short note on non-convex compressed sensing},
	booktitle = {SAMPTA technical program},
	year = {2009},
	publisher = {SAMPTA},
	organization = {SAMPTA},
	abstract = {In this note, we summarize the results we recently proved in\citeSY08 on the theoretical performance guarantees of the decoders $\Delta_p$. These decoders rely on $\ell^p$ minimization with $p {\i}n (0,1)$ to recover estimates of sparse and compressible signals from incomplete and inaccurate measurements. Our guarantees generalize the results of \citeCRT05 and \citeWojtaszczyk08 about decoding by $\ell_p$ minimization with $p = 1$, to the setting where $p {\i}n (0,1)$ and are obtained under weaker sufficient conditions. We also present novel extensions of our results in \citeSY08 that follow from the recent work of DeVore et al. in \citeDPW08. Finally, we show some insightful numerical experiments displaying the trade-off in the choice of $p \in (0,1]$ depending on certain properties of the input signal.},
	keywords = {Presentation},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SAMPTA/2009/saab09SAMPTAnccs/saab09SAMPTAnccs.pdf},
	author = {Rayan Saab and Ozgur Yilmaz}
}
@article {vandenberg2009ACMstf,
	title = {Sparco: a testing framework for sparse reconstruction},
	journal = {ACM Transactions on Mathematical Software},
	volume = {35},
	number = {4},
	year = {2009},
	month = {02},
	pages = {1-16},
	abstract = {Sparco is a framework for testing and benchmarking algorithms for sparse reconstruction. It includes a large collection of sparse reconstruction problems drawn from the imaging, compressed sensing, and geophysics literature. Sparco is also a framework for implementing new test problems and can be used as a tool for reproducible research. Sparco is implemented entirely in Matlab, and is released as open-source software under the GNU Public License.},
	keywords = {compressed sensing, linear operators, Sparse recovery},
	url = {http://doi.acm.org/10.1145/1462173.1462178},
	author = {Ewout van den Berg and Michael P. Friedlander and Gilles Hennenfent and Felix J. Herrmann and Rayan Saab and Ozgur Yilmaz}
}
@article {wang2008GEOPbws,
	title = {Bayesian wavefield separation by transform-domain sparsity promotion},
	journal = {Geophysics},
	volume = {73},
	number = {5},
	year = {2008},
	month = {07},
	pages = {1-6},
	abstract = {Successful removal of coherent noise sources greatly determines the quality of seismic imaging. Major advances were made in this direction, e.g., Surface-Related Multiple Elimination (SRME) and interferometric ground-roll removal. Still, moderate phase, timing, amplitude errors and clutter in the predicted signal components can be detrimental. Adopting a Bayesian approach along with the assumption of approximate curvelet-domain independence of the to-be-separated signal components, we construct an iterative algorithm that takes the predictions produced by for example SRME as input and separates these components in a robust fashion. In addition, the proposed algorithm controls the energy mismatch between the separated and predicted components. Such a control, which was lacking in earlier curvelet-domain formulations, produces improved results for primary-multiple separation on both synthetic and real data.},
	keywords = {curvelet transform, Geophysics, Optimization, Processing, SLIM},
	doi = {10.1190/1.2952571},
	url = {https://slim.gatech.edu/Publications/Public/Journals/Geophysics/2008/wang08GEObws/wang08GEObws.pdf},
	html_version = {https://slim.gatech.edu/Publications/Public/Journals/2008/wang08TRbss/paper_html/paper.html},
	author = {Deli Wang and Rayan Saab and Ozgur Yilmaz and Felix J. Herrmann}
}
@conference {wang2008SINBADrri,
	title = {Recent results in curvelet-based primary-multiple separation},
	booktitle = {SINBAD 2008},
	year = {2008},
	abstract = {We present a nonlinear curvelet-based sparsity-promoting formulation for the primary-multiple separation problem. We show that these coherent signal components can be separated robustly by explicitly exploiting the locality of curvelets in phase space (space-spatial frequency plane) and their ability to compress data volumes that contain wavefronts. This work is an extension of earlier results and the presented algorithms are shown to be stable under noise and moderately erroneous multiple predictions.},
	keywords = {Presentation, SINBAD, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2008/wang2008SINBADrri/wang2008SINBADrri.pdf},
	author = {Deli Wang and Rayan Saab and Ozgur Yilmaz and Felix J. Herrmann}
}
@conference {saab2008ICASSPssa,
	title = {Stable sparse approximations via nonconvex optimization},
	booktitle = {ICASSP},
	year = {2008},
	publisher = {ICASSP},
	organization = {ICASSP},
	abstract = {We present theoretical results pertaining to the ability of lp minimization to recover sparse and compressible signals from incomplete and noisy measurements. In particular, we extend the results of Cande{\textquoteleft}s, Romberg and Tao [1] to the p < 1 case. Our results indicate that depending on the restricted isometry constants (see, e.g.,[2] and [3]) and the noise level, lp minimization with certain values of p < 1 provides better theoretical guarantees in terms of stability and robustness than l1 minimization does. This is especially true when the restricted isometry constants are relatively large.},
	keywords = {ICASSP},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/ICASSP/2008/saab08ICASSPssa/saab08ICASSPssa.pdf},
	author = {Rayan Saab and Rick Chartrand and Ozgur Yilmaz}
}
@conference {yilmaz2008SINBADsse,
	title = {Stable sparse expansions via non-convex optimization},
	booktitle = {SINBAD 2008},
	year = {2008},
	abstract = {We present theoretical results pertaining to the ability of p-(quasi)norm minimization to recover sparse and compressible signals from incomplete and noisy measurements. In particular, we extend the results of Candes, Romberg and Tao for 1-norm to the p $\ll$ 1 case. Our results indicate that depending on the restricted isometry constants and the noise level, p-norm minimization with certain values of p $\ll$ 1 provides better theoretical guarantees in terms of stability and robustness compared to 1-norm minimization. This is especially true when the restricted isometry constants are relatively large, or equivalently, when the data is significantly undersampled.},
	keywords = {Presentation, SINBAD, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2008/yilmaz2008SINBADsse/yilmaz2008SINBADsse.pdf},
	author = {Ozgur Yilmaz}
}
@conference {saab2007SEGcbp,
	title = {Curvelet-based primary-multiple separation from a Bayesian perspective},
	booktitle = {SEG Technical Program Expanded Abstracts},
	volume = {26},
	year = {2007},
	pages = {2510-2514},
	publisher = {SEG},
	organization = {SEG},
	abstract = {In this 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. \copyright2007 Society of Exploration Geophysicists},
	keywords = {Presentation, SEG, SLIM},
	doi = {10.1190/1.2792988},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2007/saab07SEGcbp/saab07SEGcbp.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2007/saab07SEGcbp/saab07SEGcbp_pres.pdf},
	author = {Rayan Saab and Deli Wang and Ozgur Yilmaz and Felix J. Herrmann}
}
@conference {wang2007SEGrri,
	title = {Recent results in curvelet-based primary-multiple separation: application to real data},
	booktitle = {SEG Technical Program Expanded Abstracts},
	volume = {26},
	year = {2007},
	pages = {2500-2504},
	publisher = {SEG},
	organization = {SEG},
	abstract = {In this abstract, we present a nonlinear curvelet-based sparsity-promoting formulation for the primary-multiple separation problem. We show that these coherent signal components can be separated robustly by explicitly exploting the locality of curvelets in phase space (space-spatial frequency plane) and their ability to compress data volumes that contain wavefronts. This work is an extension of earlier results and the presented algorithms are shown to be stable under noise and moderately erroneous multiple predictions. \copyright2007 Society of Exploration Geophysicists},
	keywords = {Presentation, SEG, SLIM},
	doi = {10.1190/1.2792986},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2007/wang07SEGrri/wang07SEGrri.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2007/wang07SEGrri/wang07SEGrri_pres.pdf},
	author = {Deli Wang and Rayan Saab and Ozgur Yilmaz and Felix J. Herrmann}
}
