4.7 Article

A structural rank reduction operator for removing artifacts in least-squares reverse time migration

Journal

COMPUTERS & GEOSCIENCES
Volume 117, Issue -, Pages 9-20

Publisher

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cageo.2018.04.003

Keywords

Geological structure; Rank reduction; Singular value decomposition; Least-square reverse time migration

Funding

  1. starting fund at North China University of Water Resources and Electric Power
  2. National Natural Science Foundation of China [41704121]
  3. starting fund at North China University of Water Resources and Electric Power [20170500211/4CE201705003]
  4. Sinopec Key Laboratory of Geophysics [33550006-15-FW2099-0017]
  5. State Key Laboratory of Geodesy and Earth's Dynamics (Institute of Geodesy and Geophysics, CAS) [SKLGED2017-4-3-E]

Ask authors/readers for more resources

Least-square reverse time migration (LSRTM) has been widely accepted because of its exceptional performance in mitigating migration artifacts and preserving the reflection amplitude. Due to the ill-posedness of the inverse problem, regularization methods or constraints must be applied to the reflectivity model. In this paper, we propose a novel iterative LSRTM framework that is regularized by a lowrank constraint. The lowrank constraint is applied along the geological structure of the subsurface reflectivity image and thus can also be called structural lowrank constraint. The lowrank constraint is applied by iteratively applying a rank reduction operator that is based on the lowrank approximation theory. The rank reduction operator applied along the structure direction can effectively remove those artifacts caused from sparse shot/receiver sampling or other circumstances. Compared with the traditionally used smoothness based constraint, the lowrank constraint is more capable of removing noise while preserving edge details. Since the constraint is applied in post-stack seismic image, the extra computational cost caused by the singular value decomposition (SVD) of the rank reduction operator is negligible compared with the computational cost of the migration operator. Numerical examples with different levels of structural complexity are used to demonstrate the effectiveness and validity of the proposed algorithm.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available