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