Efficient large-scale 5D seismic data acquisition and processing using rank-minimization

Seismic data collection is becoming challenging because of increased demands for high-quality, long-offset and wide-azimuth data. Leveraging ideas from CS, in this work we establish a cost effective acquisition and processing techniques, which are no longer dominated by survey area size but by the sparsity of seismic data volumes. In the first part of abstract, we establish connections between random time dithering and jittered sampling in space. Specifically, we recover high-quality 5D seismic data volumes from time-jittered marine acquisition where the average inter-shot time is significantly reduced, leading to cheaper surveys due to fewer overlapping shots. The time-jittered acquisition, in conjunction with the shot separation by Singular-Value Decomposition (SVD)-free factorization based rank-minimization approach, allows us to recover high quality 5D seismic data volumes. Results are illustrated for simulations of simultaneous time-jittered continuous recording for a 3D ocean-bottom cable survey, where we outperforms existing techniques, by an order of magnitude computational speedup and using 1/20th of the memory, that use sparsity in transforms domains. The second part of abstract focussed on leveraging low-rank structure in seismic data to solve extremely large data recovery (interpolation) problems. We introduced a large–scale SVD-free optimization framework that is robust with respect to outliers and that uses information on the support. We test the efficacy of the proposed interpolation framework on a large-scale 5D seismic data, generated from the geologically complex synthetic 3D Compass velocity model, where 80% of the data has been removed. Our findings show that major computational and memory gains are possible compared to curvelet-based reconstruction.

https://slim.gatech.edu/Publications/Public/Conferences/SINBAD/2016/Fall...