@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}
}
@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}
}
@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 {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 {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 {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}
}
