TR2015-053

Efficient matrix completion for seismic data reconstruction


    •  Kumar, R.; Da Silva, C.; Akalin, O.; Aravkin, A.; Mansour, H.; Recht, B.; Herrmann, F., "Efficient Matrix Completion for Seismic Data Reconstruction", Geophysics, DOI: 10.1190/geo2014-0369.1, Vol. 20, No. 5, pp. 97-114, August 2015.
      BibTeX Download PDF
      • @article{Kumar2015jul,
      • author = {Kumar, R. and {Da Silva}, C. and Akalin, O. and Aravkin, A. and Mansour, H. and Recht, B. and Herrmann, F.},
      • title = {Efficient Matrix Completion for Seismic Data Reconstruction},
      • journal = {Geophysics},
      • year = 2015,
      • volume = 20,
      • number = 5,
      • pages = {97--114},
      • month = aug,
      • publisher = {Society of Exploration Geophysicists},
      • doi = {10.1190/geo2014-0369.1},
      • url = {http://www.merl.com/publications/TR2015-053}
      • }
  • MERL Contact:
  • Research Area:

    Multimedia


Despite recent developments in improved acquisition, seismic data often remains undersampled along source and receiver coordinates, resulting in incomplete data for key applications such as migration and multiple prediction. We interpret the missing-trace interpolation problem in the context of matrix completion and outline 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 employ 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 show experimentally. In light of this theory, we compensate for the high-rank behavior of data in the source-receiver domain by employing the midpoint-offset transformation for 2D data and a source-receiver permutation for 3D data to reduce the overall singular values. Simultaneously, in order to work with computationally feasible algorithms for large scale data, we use a factorization-based approach to matrix completion, which significantly speeds up the computations compared to repeated singular value decompositions without reducing the recovery quality. In the context of our theory and experiments, we also show that windowing the data too aggressively can have adverse effects on the recovery quality. To overcome this problem, we carry 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 two- and three-dimensional seismic data sets show that our method compares favorably, both in terms of computational speed and recovery quality, to existing curvelet-based and tensor-based techniques.