Many modern seismic data interpolation and redatuming algorithms rely on the promotion of transform-domain sparsity for high-quality results. Amongst the large diversity of methods and different ways of realizing sparse reconstruction lies a central question that often goes unaddressed: is it better for the transform-domain sparsity to be achieved through explicit construction of sparse representations (e.g., by thresholding of small transform-domain coefficients), or by demanding that the algorithm return physical signals which produces sparse coefficients when hit with the forward transform? Recent results show that the two approaches give rise to different solutions when the transform is redundant, and that the latter approach imposes a whole new class of constraints related to where the forward transform produces zero coefficients. From this framework, a new reconstruction algorithm is proposed which may allow better reconstruction from subsampled signaled than what the sparsity assumption alone would predict. In this work we apply the new framework and algorithm to the case of seismic data interpolation under the curvelet domain, and show that it admits better reconstruction than some existing L1 sparsity-based methods derived from compressive sensing for a range of subsampling factors.


Article metrics loading...

Loading full text...

Full text loading...

This is a required field
Please enter a valid email address
Approval was a Success
Invalid data
An Error Occurred
Approval was partially successful, following selected items could not be processed due to error