450
Views
11
CrossRef citations to date
0
Altmetric
Articles

Seismic data reconstruction via weighted nuclear-norm minimization

, , &
Pages 277-291 | Received 17 Oct 2013, Accepted 29 Jan 2014, Published online: 14 Mar 2014

References

  • Kabir M, Verschuur D. Restoration of missing offsets by parabolic radon transform. Geophys. Prospect. 1995;43:347–368.
  • Xu S, Zhang Y, Pham D, Lambarse G. Antileakage Fourier transform for seismic data regularization. Geophysics. 2005;70:87–95.
  • Naghizadeh M, Innanen K. Seismic data interpolation using a fast generalized Fourier transform. Geophysics. 2011;76:1–10.
  • Herrmann F, Hennenfent G. Non-parametric seismic data recovery with curvelet frames. Geophys. J. Int. 2008;173:233–248.
  • Shahidi R, Tang G, Ma J, Herrmann F. Application of randomized sampling schemes to curvelet-based sparsity-promoting seismic data recovery. Geophys. Prospect. 2013;61:973–997.
  • Trickett S, Burroughs L, Milton A, Walton L, Kelman R. Rank-reduction-based trace interpolation. SEG 80th Annual International Meeting. Expanded Abstracts; 2010; Denver, CO. p. 3829–3833.
  • Oropeza V, Sacchi M. Simultaneous seismic data denoising and reconstruction via multichannel singular spectrum analysis. Geophysics. 2011;76:25–32.
  • Naghizadeh M, Sacchi M. Multidimensional de-aliased Cadzow reconstruction of seismic records. Geophysics. 2013;78:1–5.
  • Yang Y, Ma J, Osher S. Seismic data reconstruction via matrix completion. Inverse Prob. Imaging. 2013;7:1379–1392.
  • Ma J. Three-dimensional irregular seismic data reconstruction via low-rank matrix completion. Geophysics. 2013;78:181–192.
  • Candes E, Recht B. Exact matrix completion via convex optimization. Found. Comput. Math. 2009;9:717–772.
  • Candes E, Tao T. The power of convex relaxation: near-optimal matrix completion. IEEE Trans. Inform. Theory. 2010;56:2053–2080.
  • Fazel M. Matrix rank minimization with applications [PhD thesis]. Stanford (CA): Stanford University; 2002.
  • Cai JF, Candes E, Shen ZW. A singular value thresholding algorithm for matrix completion. SIAM J. Optim. 2010;20:1956–1982.
  • Toh KC, Yun S. An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems. Pac. J. Optim. 2010;6:615–640.
  • Yang J, Yuan X. Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization. Math. Comput. 2013;82:301–329.
  • Ma S, Goldfarb D, Chen L. Fixed point and Bregman iterative methods for matrix rank minimization. Math. Prog. 2011;128:321–353.
  • Wen Z, Yin W, Zhang Y. Solving a low rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm. Math. Prog. Comput. 2012;4:333–361.
  • Gaiffas S, Lecue G. Weighted algorithms for compressed sensing and matrix completion, arXiv:1107.1638; Forthcoming 2011.
  • Keshavan R, Montanari A, Oh S. Matrix completion from a few entries. IEEE Trrans. Inform. Theory. 2010;56:2980–2998.
  • Cross D. Recovering low-rank matrices from few coefficients in any basis. IEEE Trrans. Inform. Theory. 2011;57:1548–1566.
  • Schaeffer H, Osher S. A low patch-rank interpretation of texture. SIAM J. Imaging Sci. 2013;6:226–262.
  • Wang Y, Yin W. Sparse signal reconstruction via iterative support detection. SIAM J. Imaging Sci. 2010;3:462–491.
  • Majumdar A. Matlab code for IST_MC.m. Available from: http://www.mathworks.com/matlabcentral/fileexchange/26395-matrix-completion-via-thresholding.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.