@article {kumar2014GEOPemc,
	title = {Efficient matrix completion for seismic data reconstruction},
	journal = {Geophysics},
	volume = {80},
	number = {5},
	year = {2015},
	note = {(Geophysics)},
	month = {09},
	pages = {V97-V114},
	abstract = {Despite recent developments in improved acquisition, seismic data often remain undersampled along source and receiver coordinates, resulting in incomplete data for key applications such as migration and multiple prediction. We have interpreted the missing-trace interpolation problem in the context of matrix completion (MC), and developed three practical principles for using low-rank optimization techniques to recover seismic data. Specifically, we strive for recovery scenarios wherein the original signal is low rank and the subsampling scheme increases the singular values of the matrix. We use an optimization program that restores this low-rank structure to recover the full volume. Omitting one or more of these principles can lead to poor interpolation results, as we found experimentally. In light of this theory, we compensate for the high-rank behavior of data in the source-receiver domain by using the midpoint-offset transformation for 2D data and a source-receiver permutation for 3D data to reduce the overall singular values. Simultaneously, to work with computationally feasible algorithms for large-scale data, we use a factorization-based approach to MC, which significantly speeds up the computations compared with repeated singular value decompositions without reducing the recovery quality. In the context of our theory and experiments, we also find that windowing the data too aggressively can have adverse effects on the recovery quality. To overcome this problem, we carried out our interpolations for each frequency independently while working with the entire frequency slice. The result is a computationally efficient, theoretically motivated framework for interpolating missing-trace data. Our tests on realistic 2D and 3D seismic data sets show that our method compares favorably in terms of computational speed and recovery quality with existing curvelet- and tensor-based techniques.},
	keywords = {2D, 3D, algorithm, interpolation, low-rank, signal processing},
	doi = {10.1190/geo2014-0369.1},
	url = {https://slim.gatech.edu/Publications/Public/Journals/Geophysics/2015/kumar2014GEOPemc/kumar2014GEOPemc.pdf},
	url2 = {http://library.seg.org/doi/abs/10.1190/geo2014-0369.1},
	author = {Rajiv Kumar and Curt Da Silva and Okan Akalin and Aleksandr Y. Aravkin and Hassan Mansour and Ben Recht and Felix J. Herrmann}
}
@conference {kumar2015IIPFWIrmb,
	title = {Rank minimization based seismic data processing and inversion},
	booktitle = {Inaugural Full-Waveform Inversion Workshop},
	year = {2015},
	note = {(Natal, Brazil)},
	month = {08-09},
	abstract = {We present the low-rank extensions of full-waveform inversion to mitigate the local-minima issues. The purpose formulation is computationally tractable and does not involve any extra computational cost compared to the adjoint-state method.},
	keywords = {FWI, inversion, Processing, rank minimization},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/IIPFWI/kumar2015IIPFWIrmb/kumar2015IIPFWIrmb_pres.pdf},
	author = {Rajiv Kumar and Curt Da Silva and Oscar Lopez and Aleksandr Y. Aravkin and Hassan Mansour and Haneet Wason and Ernie Esser and Felix J. Herrmann}
}
@article {aravkin2014SISCfmd,
	title = {Fast methods for denoising matrix completion formulations, with applications to robust seismic data interpolation},
	journal = {SIAM Journal on Scientific Computing},
	volume = {36},
	number = {5},
	year = {2014},
	note = {(SISC)},
	month = {10},
	pages = {S237-S266},
	abstract = {Recent SVD-free matrix factorization formulations have enabled rank minimization for systems with millions of rows and columns, paving the way for matrix completion in extremely large-scale applications, such as seismic data interpolation. In this paper, we consider matrix completion formulations designed to hit a target data-fitting error level provided by the user, and we propose an algorithm called LR-BPDN that is able to exploit factorized formulations to solve the corresponding optimization problem. Since practitioners typically have strong prior knowledge about target error level, this innovation makes it easy to apply the algorithm in practice, leaving only the factor rank to be determined. Within the established framework, we propose two extensions that are highly relevant to solving practical challenges of data interpolation. First, we propose a weighted extension that allows known subspace information to improve the results of matrix completion formulations. We show how this weighting can be used in the context of frequency continuation, an essential aspect to seismic data interpolation. Second, we propose matrix completion formulations that are robust to large measurement errors in the available data. We illustrate the advantages of LR-BPDN on collaborative filtering problems using the MovieLens 1M and 10M and Netflix 100M datasets. Then we use the new method, along with its robust and subspace reweighted extensions, to obtain high-quality reconstructions for large-scale seismic interpolation problems with real data, even in the presence of data contamination.},
	keywords = {factorized formulations, matrix completion, robust statistics, seismic trace interpolation, variational optimization},
	doi = {10.1137/130919210},
	url = {https://slim.gatech.edu/Publications/Public/Journals/SIAMJournalOnScientificComputing/2014/aravkin2014SISCfmd/aravkin2014SISCfmd.pdf},
	url2 = {http://epubs.siam.org/doi/abs/10.1137/130919210},
	author = {Aleksandr Y. Aravkin and Rajiv Kumar and Hassan Mansour and Ben Recht 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 {kumar2014EAGErank,
	title = {SVD-free low-rank matrix factorization : wavefield reconstruction via jittered subsampling and reciprocity},
	booktitle = {EAGE Annual Conference Proceedings},
	year = {2014},
	month = {06},
	abstract = {Recently computationally efficient rank optimization techniques have been studied extensively to develop a new mathematical tool for the seismic data interpolation. So far, matrix completion problems have been discussed where sources are subsample according to a discrete uniform distribution. In this paper, we studied the effect of two different subsampling techniques on seismic data interpolation using rank-regularized formulations, namely jittered subsampling over uniform random subsampling. The other objective of this paper is to combine the fact of source-receiver reciprocity with the rank-minimization techniques to enhance the accuracy of missing-trace interpolation. We illustrate the advantages of jittered subsampling and reciprocity using a seismic line from Gulf of Suez to obtain high quality results for interpolation, a key application in exploration geophysics.},
	keywords = {EAGE, interpolation, low-rank, reciprocity},
	doi = {10.3997/2214-4609.20141394},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2014/kumar2014EAGErank/kumar2014EAGErank.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2014/kumar2014EAGErank/kumar2014EAGErank_pres.pdf},
	author = {Rajiv Kumar and Aleksandr Y. Aravkin and Ernie Esser and Hassan Mansour 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}
}
@conference {kumar2013SEGHSS,
	title = {Reconstruction of seismic wavefields via low-rank matrix factorization in the hierarchical-separable matrix representation},
	booktitle = {SEG Technical Program Expanded Abstracts},
	volume = {32},
	year = {2013},
	month = {09},
	pages = {3628-3633},
	abstract = {Recent developments in matrix rank optimization have allowed for new computational approaches in the field of seismic data interpolation. In this paper, we propose an approach for seismic data interpolation which incorporates the Hierarchical Semi-Separable Structure (HSS) inside rank-regularized least-squares formulations for the missing-trace interpolation problem. The proposed approach is suitable for large scale problems, since it avoids SVD computations and uses a low-rank factorized formulation instead. We illustrate the advantages of the new HSS approach by interpolating a seismic line from the Gulf of Suez and compare the reconstruction with conventional rank minimization.},
	keywords = {HSS, interpolation, SEG},
	doi = {10.1190/segam2013-1165.1},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2013/kumar2013SEGHSS/kumar2013SEGHSS.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SEG/2013/kumar2013SEGHSS/kumar2013SEGHSS_pres.pdf},
	author = {Rajiv Kumar and Hassan Mansour and Aleksandr Y. Aravkin and Felix J. Herrmann}
}
@conference {kumar2013EAGEsind,
	title = {Seismic data interpolation and denoising using SVD-free low-rank matrix factorization},
	booktitle = {EAGE Annual Conference Proceedings},
	year = {2013},
	month = {06},
	abstract = {Recent developments in rank optimization have allowed new approaches for seismic data interpolation and denoising. In this paper, we propose an approach for simultaneous seismic data interpolation and denoising using robust rank-regularized formulations. The proposed approach is suitable for large scale problems, since it avoids SVD computations by using factorized formulations. We illustrate the advantages of the new approach using a seismic line from Gulf of Suez and 5D synthetic seismic data to obtain high quality results for interpolation and denoising, a key application in exploration geophysics.},
	keywords = {denoising, EAGE, interpolation},
	doi = {10.3997/2214-4609.20130388},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2013/kumar2013EAGEsind/kumar2013EAGEsind.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/EAGE/2013/kumar2013EAGEsind/kumar2013EAGEsind_pres.pdf},
	author = {Rajiv Kumar and Aleksandr Y. Aravkin and Hassan Mansour and Ben Recht and Felix J. Herrmann}
}
@presentation {kumar2013SINBADhss,
	title = {Seismic data interpolation via low-rank matrix factorization in the hierarchical semi-separable representation},
	year = {2013},
	publisher = {SINBAD},
	abstract = {Recent developments in matrix rank optimization have allowed for new computational approaches in the field of seismic data interpolation. One of the main requirements of exploiting rank-minimization approaches is that the target data set should exhibit a low-rank structure. Seismic frequency slices exhibit low-rank structure at the low-frequencies, but not at the high frequencies. This behavior is due to the increase in oscillations as we move from low to high-frequency slices, even though the energy remains focused around the diagonal. Therefore, interpolation via rank minimization in the high-frequency range requires extended formulations that incorporate low-rank structure. We propose an approach for seismic data interpolation which incorporates the Hierarchical Semi-Separable Structure (HSS) inside rank-regularized least-squares formulations for the missing-trace interpolation problem. The proposed approach is suitable for large scale problems, since it avoids SVD computations and uses a low-rank factorized formulation instead. We illustrate the advantages of the new HSS approach by interpolating a seismic line from the Gulf of Suez and compare the reconstruction with conventional rank minimization.},
	keywords = {Presentation, SINBAD, SINBADSPRING2013, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2013/Spring/kumar2013SINBADhss/kumar2013SINBADhss.pdf},
	author = {Rajiv Kumar and Hassan Mansour and Aleksandr Y. Aravkin and Felix J. Herrmann}
}
@techreport {kumar2013ICMLlr,
	title = {An SVD-free Pareto curve approach to rank minimization},
	number = {TR-EOAS-2013-2},
	year = {2013},
	month = {02},
	institution = {UBC},
	abstract = {Recent SVD-free matrix factorization formulations have enabled rank optimization for extremely large-scale systems (millions of rows and columns). In this paper, we consider rank-regularized formulations that only require a target data-fitting error level, and propose an algorithm for the corresponding problem. We illustrate the advantages of the new approach using the Netflix problem, and use it to obtain high quality results for seismic trace interpolation, a key application in exploration geophysics. We show that factor rank can be easily adjusted as the inversion proceeds, and propose a weighted extension that allows known subspace information to improve the results of matrix completion formulations. Using these methods, we obtain high-quality reconstructions for large scale seismic interpolation problems with real data.},
	keywords = {interpolation, low rank},
	url = {https://slim.gatech.edu/Publications/Public/TechReport/2013/kumar2013ICMLlr/kumar2013ICMLlr.pdf},
	author = {Aleksandr Y. Aravkin and Rajiv Kumar and Hassan Mansour and Ben Recht and Felix J. Herrmann}
}
@presentation {kumar2013SINBADwrs,
	title = {Wavefield reconstruction with SVD-free low-rank matrix factorization},
	year = {2013},
	publisher = {SINBAD},
	abstract = {As shown in past, we can leverage the ideas from the field of compressed sensing to cast problems like seismic data interpolation or sequential shot data recovery from simultaneous data, as a compressed sensing problem. In this work we will show how we can borrow the same ideas of compressed sensing and cast these problems as matrix completion problems. Instead of sparsity we will show that we can exploit the low-rank structure of seismic data to solve these problems. One of the impediments in rank-minimization problem is the computation of singular values. We will also show how we can solve the rank minimization problems SVD-free. The practical application is divided into three parts: 1. In case of sequential seismic data acquisition, how jittered subsampling helps to recover the better quality data as compared to random subsampling. 2. How the incorporation of reciprocity principles help to enhance the quality of recovered fully sampled data. 3. How we can recover the sequential source data from simultaneous source data.},
	keywords = {Presentation, SINBAD, SINBADFALL2013, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2013/Fall/kumar2013SINBADwrs/kumar2013SINBADwrs.pdf},
	author = {Rajiv Kumar and Aleksandr Y. Aravkin and Hassan Mansour and Ernie Esser 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}
}
@conference {mansour2012SSPwspgl1,
	title = {Beyond $\ell_1$ norm minimization for sparse signal recovery},
	booktitle = {2012 IEEE Statistical Signal Processing Workshop (SSP) (SSP{\textquoteright}12)},
	year = {2012},
	month = {03},
	publisher = {IEEE},
	organization = {IEEE},
	address = {Ann Arbor, Michigan, USA},
	abstract = {Sparse signal recovery has been dominated by the basis pursuit denoise (BPDN) problem formulation for over a decade. In this paper, we propose an algorithm that outperforms BPDN in finding sparse solutions to underdetermined linear systems of equations at no additional computational cost. Our algorithm, called WSPGL1, is a modification of the spectral projected gradient for $\ell_1$ minimization (SPGL1) algorithm in which the sequence of LASSO subproblems are replaced by a sequence of weighted LASSO subproblems with constant weights applied to a support estimate. The support estimate is derived from the data and is updated at every iteration. The algorithm also modifies the Pareto curve at every iteration to reflect the new weighted $\ell_1$ minimization problem that is being solved. We demonstrate through extensive simulations that the sparse recovery performance of our algorithm is superior to that of $\ell_1$ minimization and approaches the recovery performance of iterative re-weighted $\ell_1$ (IRWL1) minimization of Cand{\`e}s, Wakin, and Boyd. Moreover, our algorithm has the computational cost of a single BPDN problem.},
	keywords = {compressed sensing, iterative algorithms, partial support recovery, Sparse recovery, weighted $\ell_1$ minimization},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SSP/2012/mansour2012SSPwspgl1/mansour2012SSPwspgl1.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SSP/2012/mansour2012SSPwspgl1/mansour2012SSPwspgl1_pres.pdf},
	author = {Hassan Mansour}
}
@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 {Mansour11TRssma,
	title = {Randomized marine acquisition with compressive sampling matrices},
	journal = {Geophysical Prospecting},
	volume = {60},
	number = {4},
	year = {2012},
	month = {07},
	pages = {648-662},
	abstract = {Seismic data acquisition in marine environments is a costly process that calls for the adoption of simultaneous-source or randomized acquisition - an emerging technology that is stimulating both geophysical research and commercial efforts. Simultaneous marine acquisition calls for the development of a new set of design principles and post-processing tools. In this paper, we discuss the properties of a specific class of randomized simultaneous acquisition matrices and demonstrate that sparsity-promoting recovery improves the quality of reconstructed seismic data volumes. We propose a practical randomized marine acquisition scheme where the sequential sources fire airguns at only randomly time-dithered instances. We demonstrate that the recovery using sparse approximation from random time-dithering with a single source approaches the recovery from simultaneous-source acquisition with multiple sources. Established findings from the field of compressive sensing indicate that the choice of the sparsifying transform that is incoherent with the compressive sampling matrix can significantly impact the reconstruction quality. Leveraging these findings, we then demonstrate that the compressive sampling matrix resulting from our proposed sampling scheme is incoherent with the curvelet transform. The combined measurement matrix exhibits better isometry properties than other transform bases such as a non-localized multidimensional Fourier transform. We illustrate our results with simulations of "ideal" simultaneous-source marine acquisition, which dithers both in time and space, compared with periodic and randomized time-dithering.},
	keywords = {curvelet transform, Fourier, Marine acquisition},
	doi = {10.1111/j.1365-2478.2012.01075.x},
	url = {http://onlinelibrary.wiley.com/doi/10.1111/j.1365-2478.2012.01075.x/abstract},
	url2 = {https://slim.gatech.edu/Publications/Public/Journals/GeophysicalProspecting/2012/Mansour11TRssma/Mansour11TRssma.pdf},
	author = {Hassan Mansour and Haneet Wason and Tim T.Y. Lin and Felix J. Herrmann}
}
@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 {mansour2012SINBADsti,
	title = {Seismic trace interpolation via sparsity promoting reweighted algorithms},
	year = {2012},
	publisher = {SINBAD},
	abstract = {Missing-trace interpolation aims to reconstruct regularly sampled wavefields from periodically sampled data with gaps caused by physical constraints. While transform-domain sparsity promotion has proven to be an effective tool to solve this recovery problem, current recovery techniques make no use of a priori information on the transform-domain coefficients. To overcome these vulnerabilities in solving the recovery problem for large-scale problems, we propose recovery by weighted one-norm minimization, which exploits correlations between locations of significant coefficients of different partitions, e.g., shot records, common-offset gathers, or frequency slices, of the acquired data. Moreover, in situations where no prior support estimate is available, we propose the WSPGL1 algorithm that outperforms standard $\ell_1$ minimization in finding sparse solutions to underdetermined linear systems of equations. Our algorithm is a modification of the SPGL1 algorithm and enjoys better sparse recovery performance at no additional computational cost. We illustrate the improved recovery using WSPGL1 for randomly subsampled seismic traces.},
	keywords = {Presentation, SINBAD, SINBADFALL2012, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2012/Fall/mansour2012SINBADsti/mansour2012SINBADsti_pres.pdf},
	author = {Hassan Mansour}
}
@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}
}
@conference {mansour2011SBGFcspsma,
	title = {A compressive sensing perspective on simultaneous marine acquisition},
	booktitle = {SBGF},
	year = {2011},
	publisher = {SBGF},
	organization = {SBGF},
	abstract = {The high cost of acquiring seismic data in marine environments compels the adoption of simultaneous- source acquisition - an emerging technology that is stimulating both geophysical research and commercial efforts. In this paper, we discuss the properties of randomized simultaneous acquisition matrices and demonstrate that sparsity-promoting recovery improves the quality of the reconstructed seismic data volumes. Simultaneous marine acquisition calls for the development of a new set of design principles and post-processing tools. Leveraging established findings from the field of compressed sensing, the recovery from simultaneous sources depends on a sparsifying transform that compresses seismic data, is fast, and reasonably incoherent with the compressive sampling matrix. To achieve this incoherence, we use random time dithering where sequential acquisition with a single airgun is replaced by continuous acquisition with multiple airguns firing at random times and at random locations. We demonstrate our results with simulations of simultaneous Marine acquisition using periodic and randomized time dithering.},
	keywords = {Acquisition, Compressive Sensing, Presentation, SBGF},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SBGF/2011/Mansour11SBGFcspsma/Mansour11SBGFcspsma.pdf},
	presentation = {https://slim.gatech.edu/Publications/Public/Conferences/SBGF/2011/Mansour11SBGFcspsma/Mansour11SBGFcspsma.pdf},
	author = {Hassan Mansour and Haneet Wason and Tim T.Y. Lin and Felix J. Herrmann}
}
@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 {mansour2011SINBADwcw,
	title = {Why do curvelets work?},
	year = {2011},
	publisher = {SINBAD},
	keywords = {Presentation, SINBAD, SINBADFALL2011, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2011/Fall/mansour2011SINBADwcw/mansour2011SINBADwcw_pres.pdf},
	author = {Hassan Mansour}
}
@presentation {mansour2010SINBADrcs,
	title = {Recovering compressively sampled signals using partial support information},
	year = {2010},
	publisher = {SINBAD},
	keywords = {Presentation, SINBAD, SINBADFALL2010, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2010/Fall/mansour2010SINBADrcs/mansour2010SINBADrcs_pres.pdf},
	author = {Hassan Mansour}
}
