@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}
}
@presentation {akalin2013SINBADmtc,
	title = {Matrix and tensor completion for large-scale seismic interpolation: a comparative study},
	year = {2013},
	publisher = {SINBAD},
	abstract = {Owing to their high dimensionality, interpolating 3D seismic data volumes remains a computationally daunting task. In this work, we outline a comprehensive framework for sampling and interpolating such volumes based on the well-understood theory of Matrix and Tensor completion. This interpolation theory consists of three components major signal structure, structure-destroying sampling, and structure-restoring optimization. By viewing interpolation in the context of this theory, we are able to specify exactly when these approaches are expected to perform well. We also introduce structure-revealing transformations that promote the inherent low-rank structure in seismic data as well as a factorization approach that scales to large problem sizes. Our methods are able to handle large-scale data volumes more accurately and more quickly compared to other more ad-hoc approaches, as we will demonstrate. This is joint work with Curt Da Silva, Rajiv Kumar, Ben Recht, and Felix J. Herrmann.},
	keywords = {Presentation, SINBAD, SINBADFALL2013, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2013/Fall/akalin2013SINBADmtc/akalin2013SINBADmtc.pdf},
	author = {Okan Akalin and Curt Da Silva and Rajiv Kumar and Ben Recht and Felix J. Herrmann}
}
@presentation {Akalin2012SINBADlss,
	title = {Large scale seismic data interpolation with matrix completion},
	year = {2012},
	publisher = {SINBAD},
	abstract = {Seismic surveys amass large and incomplete data sets, and designing algorithms to interpolate the missing data at very large scales poses a daunting and critical challenge. We study how to apply scalable matrix completion methods to such interpolation problems. Recent studies in matrix completion have shown that a matrix that has low rank can be exactly completed when only a small number of observations are available. However, there are two challenges to applying matrix completion to seismic data. Matrix completion is typically applied to two dimensional or dyadic data whereas seismic data is often tensorial. Also successful matrix completion requires a low-rank matrix structure. We address these problems by organizing the seismic data on a matrix grid which exhibits a low-rank structure. This encoding allows us to apply the Jellyfish algorithm, developed at the University of Wisconsin, which achieves state-of-the-art performance for large-scale matrix completion. The proposed framework makes it possible to complete high-SNR interpolations of gigabytes of 4-D seismic data in minutes on standard multicore workstations. Our preliminary experimental results suggest that matrix completion provides a promising new approach to the seismic data interpolation problem.},
	keywords = {Presentation, SINBAD, SINBADFALL2012, SLIM},
	url = {https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2012/Fall/Akalin2012SINBADlss/Akalin2012SINBADlss_pres.pdf},
	author = {Okan Akalin}
}
