@techreport {kumar2015EAGElse,
	title = {Least-squares extended imaging with surface-related multiples},
	number = {TR-EOAS-2015-1},
	year = {2015},
	month = {01},
	institution = {UBC},
	abstract = {Common image gathers are used in building velocity models, inverting for anisotropy parameters, and analyzing reservoir attributes. Typically, only primary reflections are used to form image gathers as multiples can cause artifacts that interfere with the events of interest. However, it has been shown that multiples can actually provide extra illumination of the subsurface, especially for delineating the near-surface features. In this paper, we aim to form common image gathers directly from the data with surface related multiples by applying concepts that have been used to successfully deal with surface-related multiples in imaging. We achieve this by effectively inverting an extended migration operator. This results in extended images with better near-surface illumination that are free of artifacts that can hamper velocity analysis. In addition, being able to generate extended images directly from the total data avoids the need for (time-consuming) pre-processing. Synthetic examples on a layered model show that the proposed formulation is promising.},
	keywords = {image gathers, surface-related multiples},
	url = {https://slim.gatech.edu/Publications/Public/TechReport/2015/kumar2015EAGElse/kumar2015EAGElse.html},
	author = {Rajiv Kumar and Ning Tu and Tristan van Leeuwen and Felix J. Herrmann}
}
@techreport {kumar2015EAGEtjm,
	title = {Time-jittered marine acquisition: low-rank v/s sparsity},
	number = {TR-EOAS-2015-2},
	year = {2015},
	month = {01},
	institution = {UBC},
	abstract = {Time-jittered simultaneous marine acquisition has been recognized as an economic way of improving the spatial sampling, and speedup acquisition, where a single (or multiple) source vessel fires at {\textendash} jittered source locations and instances in time. It has been shown in the past that this problem can be setup as a {\textendash} compressed sensing problem, where conventional seismic data is reconstructed from blended data via a sparsity-promoting optimization formulation. While the recovery quality of deblended data is very good, the recovery process is computationally very expensive. In this paper, we present a computationally efficient rank-minimization algorithm to deblend the seismic data. The proposed algorithm is suitable for large-scale seismic data, since it avoids SVD computations and uses a low-rank factorized formulation instead. Results are illustrated with simulations of time-jittered marine acquisition, which translates to jittered source locations for a given speed of the source vessel, for a single source vessel with two airgun arrays.},
	keywords = {deblending, low-rank},
	url = {https://slim.gatech.edu/Publications/Public/TechReport/2015/kumar2015EAGEtjm/kumar2015EAGEtjm.html},
	author = {Rajiv Kumar and Haneet Wason and Felix J. Herrmann}
}
@techreport {kumar2014SEGmcu,
	title = {Matrix completion on unstructured grids : 2-D seismic data regularization and interpolation},
	number = {TR-EOAS-2014-3},
	year = {2014},
	month = {04},
	institution = {UBC},
	abstract = {Seismic data interpolation via rank-minimization techniques has been recently introduced in the seismic community. All the existing rank-minimization techniques assume the recording locations to be on a regular grid, e.g. sampled periodically, but seismic data are typically irregularly sampled along spatial axes. Other than the irregularity of the sampled grid, we often have missing data. In this paper, we study the effect of grid irregularity to conduct matrix completion on a regular grid for unstructured data. We propose an improvement of existing rank-minimization techniques to do regularization. We also demonstrate that we can perform seismic data regularization and interpolation simultaneously. We illustrate the advantages of the modification using a real seismic line from the Gulf of Suez to obtain high quality results for regularization and interpolation, a key application in exploration geophysics.},
	keywords = {interpolation, matrix completion, NFFT, regularization},
	url = {https://slim.gatech.edu/Publications/Public/TechReport/2014/kumar2014SEGmcu/kumar2014SEGmcu.html},
	author = {Rajiv Kumar and Oscar Lopez and Ernie Esser 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}
}
@techreport {rajiv2012SEGFRM,
	title = {Fast methods for rank minimization with applications to seismic-data interpolation},
	number = {TR-EOAS-2012-3},
	year = {2012},
	month = {04},
	institution = {Department of Earth and Ocean Sciences},
	address = {University of British Columbia, Vancouver},
	abstract = {Rank penalizing techniques are an important direction in seismic inverse problems, since they allow improved recovery by exploiting low-rank structure. A major downside of current state of the art techniques is their reliance on the SVD of seismic data structures, which can be prohibitively expensive. Fortunately, recent work allows us to circumvent this problem by working with matrix factorizations. We review a novel approach to rank penalization, and successfully apply it to the seismic interpolation problem by exploiting the low-rank structure of seismic data in the midpoint-offset domain. Experiments for the recovery of 2D monochromatic data matrices and seismic lines represented as 3D volumes support the feasibility and potential of the new approach.},
	keywords = {Optimization, Rank, Seismic data Interpolation},
	url = {https://slim.gatech.edu/Publications/Public/TechReport/2012/rajiv2012SEGFRM/rajiv2012SEGFRM.pdf},
	author = {Rajiv Kumar and Aleksandr Y. Aravkin and Felix J. Herrmann}
}
