4250 ROBUST CURVELET-DOMAIN PRIMARY-MULTIPLE SEPARATION WITH SPARSENESS CONSTRAINTS 1 FELIX J. HERRMANN1 and DIRK J. VERSCHUUR2 Department of Earth and Ocean Sciences, University of British Columbia, Canada 2 Faculty of Applied Sciences, Delft University of Technology, The Netherlands Abstract A non-linear primary-multiple separation method using curvelets frames is presented. The advantage of this method is that curvelets arguably provide an optimal sparse representation for both primaries and multiples. As such curvelets frames are ideal candidates to separate primaries from multiples given inaccurate predictions for these two data components. The method derives its robustness regarding the presence of noise; errors in the prediction and missing data from the curvelet frame’s ability (i) to represent both signal components with a limited number of multi-scale and directional basis functions; (ii) to separate the components on the basis of differences in location, orientation and scales and (iii) to minimize correlations between the coefficients of the two components. A brief sketch of the theory is provided as well as a number of examples on synthetic and real data. Separation by matched filtering In many complex areas, multiple suppression techniques based on move-out filtering fail due to the fact that the underlying assumptions are not met, i.e. hyperbolic move-out in the CMP-offset domain, separation of primaries and multiples based on move-out differences. Several attempts have been made to extend the move-out discrimination methods towards handling 3D complexities, e.g. by introducing apex-shifted hyperbolic transforms [5]. In many cases were the move-out filtering based methods fail, waveequation based predictive methods may provide a solution. However, prediction methods based on 2D input data [see e.g. 18, 1] are often not capable of correctly predicting the surface-related and internal multiples in a complex 3D world. In general, wave-equation based methods consist of two main steps: a prediction step and an adaptive subtraction step. In the latter, imperfections in the prediction stage are compensated, such as the water bottom reflectivity [see e.g. 2, 20, 11] or the source and receiver characteristics [18, 1, 8]. A straightforward solution, as described in [17], is based on an adaptive subtraction using a least-squares matched filtering approach: d0 (xr , xs , t) = d(xr , xs , t) − a(t) ∗ m(xr , xs , t), (1) where the multiples m(xr , xs , t) are matched to the true multiples in the input data d(xr , xs , t) by a matching filter a(t), which minimizes 1 ˆ a(t) = arg min d − a ∗t m pp (2) a(t) 2 for p = 1 or p = 2. Given an estimate for a(t), the primaries d0 (xr , xs , t) are calculated according Eq. 1. The adaptive subtraction is usually conducted in overlapping windows in source (xs ), receiver (xr ) and time (t) coordinates with a window size in the order of a few hundred milliseconds in the time and a few tens of traces in the space directions. Within each window a separate matching filter a = a(xr , xs , t) is estimated. Even though the above matched filtering procedure is able to absorb certain errors in the multiple predictions, the approach is bound to fail when the predictions are to far off w.r.t. the true multiples or when noise is present. This failure may lead to an erroneous treatment of the primaries and spurious multiples may remain in the data. Several attempts have been made to improve the situation by either making the multiple predictions more accurate or by devising a more robust subtraction/separation scheme. Methods based on model-driven time delays, as proposed by [12] and [13], or based on data-driven time delays [9] are examples of the first category. As an example of the second catergory, [10] decomposes the predicted multiples into coherent and incoherent parts, the latter mostly contain events related to diffracted multiples. Both parts are simultaneously subtracted from the input data. [19] also exploits extended subtraction techniques to better adapt to the true multiples without distorting the primaries by introducing an adaptation based on local time and phase shifts. In practice, extending the adaptive subtraction process to include non-stationarity of the matched filter may give rise to improved suppression results. However, the method is bound by intrinsic limits on matched filtering. These limits concern: (i) the allowed degree of non-stationarity for the error in the multiple prediction; (ii) the inherent sensitivity of matched filtering with regard to errors in the phase, location, dip and frequency characteristics of the predicted multiples; (iii) the presence of noise and problems with edge effects for the local filter. Given these limitations, we arrive at a point where the matched filtering techniques cannot deliver satisfactory results and the purpose of this paper is to come with a robust method that is able to separate primaries from multiples in the presence of noise and for predictions that exhibit non-stationary errors in the phase, location, dip and frequency content. With our method, we aim to (i) remove the relative strong sensitivity to the accuracy of the predicted multiples; (ii) avoid the creation of spurious artifacts or worse and (iii) avoid possible distortions of the primary energy. -3000 -2000 -1000 x [m] 0 1000 2000 3000 0 -2000 -1000 x [m] 0 1000 2000 3000 0 0.5 t [s] t [s] 0.5 -3000 1.0 1.5 2.0 (a) Cross-correlation primaries multiples for diracs -3000 -2000 -1000 x [m] 0 1000 2000 3000 0.5 t [s] 0 1.0 1.0 1.5 1.5 2.0 2.0 (b) Cross-correlation primaries multiples for wavelets (c) Cross-correlation primaries multiples for curvelets Figure 1: Correlations between the coefficients of the primaries and multiples are computed by multiplying the coefficients, followed by an inverse transform. Clearly, curvelets potentially separate the best because they are the least correlated. Curvelet-domain primary-multiple separation We propose a transform-domain method to separate primaries and multiples in the presence of noise. Our signal model reads s = s1 + s2 + n (3) and the question is to separate the data s into its two components s1 (primaries) and s2 (multiples) in the presence of a white Gaussian noise term n of strength σ. Following ideas close in spirit to [16, 5] and [15], we formulate the answer to the above signal separation problem as 1 ˆ c = arg min s − Tc 22 + c p,w , (4) c 2 in which ˆ ˜ ˆ ˜T ˆ ˜T T = T1 T2 , c = c1 c2 and w = w1 w2 (5) refer to the augmented system, with two frame compositions (T1 and T2 ): one for the primaries and one for the multiples, and to the frame coefficient vector c. c p,w stands for the p -norm on the coefficients weighted by the vector w ≥ 0. Typical examples of the above formalism are (i) linear (f − k)-filtering with T the inverse Fourier transform and p = 2 [21]; (ii) sparseness enhanced (p = 1) Radon filtering with T the adjoint of the linear or parabolic Radon transform (or combinations thereof) [16] and (iii) Morphological Component Analysis (MCA) where the 1 -norm is minimized for a redundant dictionary T [15]. This dictionary consists of mutually incoherent basis functions such as wavelets, curvelets and/or discrete cosines. As opposed to standard MCA – where texture- and edge-like signal components are separated by choosing transforms that are sparse for only one of the signal components and not for the other – similarities between primaries and multiples makes primarymultiple separation a challenge. This observation explains the partial success of (f − k) or Radon methods, even when predictions for the multiples ˘ s2 and primaries ˘ s1 = s − ˘ s1 are available [21]. Lack of sparseness in the transformed domain, non-locality of Fourier-like basis functions [21] are partially to blame for the less than optimal signal separation, which may gives rise to inadvertent primary energy removal and remaining spurious multiple energy. Unfortunately, primaries and multiples are both solutions to the wave equation admitting a sparse representation by curvelets but no separation. Inspired by our earlier work [7, 6], separation of the two components can be promoted by minimizing the correlation between the curvelet coefficients of the primaries and multiples. Since we are given predictions for the two components, we can separate the primaries and multiples by weighting the 1 -norms in Eq. 4 by the predictions, i.e w1 (λ) = λ|˘ c2 | and w2 = λ|˘ c1 |. This weighting in Eq. 4 drives the signal separation because the minimization attempts to minimize the weighted 1 -norms, which corresponds to jointly minimizing correlations between the estimated coefficients for the primaries and predicted multiples on the one hand and the estimated coefficients for the multiples and predicted primaries on the other hand. The success of this signalseparation procedure depends largely on the correlation between coefficients of the signal components in the basis. The smaller this correlation the better the performance will be of a signal separation based on Eq. 4 which maximizes the decorrelation. As Fig. 1 suggests, curvelet frames are the appropriate choice since these frames clearly accomplish the largest degree of decorrelation between primaries and multiples. The actual primary-multiple separation is carried out by using an iterative block solver [see e.g. 15, and the references therein ] to compute a solution for Eq. 4. During each iteration, estimates for the coefficients of the j th signal component are calculated with !! X m s m−1 ∗ m−1 cj = Swj (λm ) cj + Tj s − Ti ci for j = 1, 2, (6) i s Sw j (λm ) where is a soft thresholding operator with a threshold wj (λm ). The control parameter λm is decreased for each iteration. For large enough number of iterations m, Eq. 6 converges to the solution of Eq. 4 [see e.g. 15, 4]. Examples The above iterative primary-multiple separation method is applied to synthetic as well as real data. Fig. 2 demonstrates our method applied to noise-free (top-row) and noisy (bottom-row) data. Our method is clearly able to achieve good results on synthetic data even for the noisy case. Encouraging results are also obtained for real data. Fig. 3 demonstrates the effectiveness of multiple removal for a time slice from a 2D line from the Missippi Canyon (Gulf of Mexico). Note the recovery of primaries around shot 100 and shot 900. Discussion and conclusions The success of our approach can heuristically be explained by arguing that curvelets act as an “unconditional basis” for seismic data (both primaries and multiples). Whenever a basis is unconditional, one finds that (i) the data’s covariance is near diagonal in the basis and (ii) the norm (say p ) shrinks when shrinking the coefficients. Our argument that curvelets can be considered to be close to an unconditional basis for seismic data derives from the work on function spaces by [14] and from Theorem 1.1 of [3] which states that Green’s functions are nearly diagonalized by curvelets. Consequently, seismic data can be represented by a sparse coefficient vector rendering our signal-separation method effective for seismic data with events on arbitrary piece-wise twice differentiable curves. Moreover, our approach is robust under additive possibly colored noise and can relatively easily be generalized to 3-D; speeded by using more intelligent p -solvers such as IRLS. Acknowledgments The author would like to thank the authors of the Digital Curvelet Transform (Candes, Donoho, Demanet and Ying). This work was carried out as part of the SINBAD project with financial support, secured through ITF (the Industry Technology Facilitator), from the following organizations: BG Group, BP, ExxonMobil and SHELL. Additional funding came from the NSERC Discovery Grant 22R81254. References [1] A. J. Berkhout and D. J. Verschuur. Estimation of multiple scattering by iterative inversion, part I: theoretical considerations. Geophysics, 62(5):1586–1595, 1997. [2] J. R. Berryhill and Y. C. Kim. Deep-water peg legs and multiples: Emulation and suppression. Geophysics, 51(12):2177– 2184, 1986. [3] E. J. Cand`es and L. Demanet. The curvelet representation of wave propagators is optimally sparse. 2004. Preprint: http://www.acm.caltech.edu/ demanet. [4] I. Daubechies, M. Defrise, and C. de Mol. An iterative thresholding algorithm for linear inverse problems with a sparsity constrains. CPAM, pages 1413–1457, 2005. [5] N. Hargreaves, B. verWest, R. Wombell, and D. Trad. Multiple attenuation using apex-shifted radon transform. pages 1929– 1932, Dallas, 2003. SEG, Soc. Expl. Geophys., Expanded abstracts. [6] F. J. Herrmann and E. Verschuur. Curvelet-domain multiple elimination with sparseness constraints. In Expanded Abstracts, Tulsa, 2004. Soc. Expl. Geophys. [7] F. J. Herrmann and E. Verschuur. Separation of primaries and multiples by non-linear estimation in the curvelet domain. In Expanded Abstracts. EAGE, 2004. [8] L. Ikelle, G. Roberts, and A. Weglein. Source signature estimation based on the removal of first-order multiples. Geophysics, 62:1904–1920, 1997. [9] L. T. Ikelle and S. Yoo. An analysis of 2D and 3D inverse scattering multiple attenuation. pages 1973–1976, Calgary, 2000. SEG, Soc. Expl. Geophys., Expanded abstracts. [10] M. M. N. Kabir. Weighted subtraction for diffracted multiple attenuation. pages 1941–1944, Dallas, 2003. SEG, Soc. Expl. Geophys., Expanded abstracts. [11] D. Okstanov. Multiple supression by data-consitent deconvolution. Leading Edge, 18(1):115–119, 1999. [12] W. S. Ross. Multiple suppression: beyond 2-D. part I: theory. Delft Univ. Tech., pages 1387–1390, Dallas, 1997. Soc. Expl. Geophys., Expanded abstracts. [13] W. S. Ross, Y. Yu, and F. A. Gasparotto. Multiple suppression: beyond 2-D. part II: application to subsalt multiples. Delft Univ. Tech., pages 1391–1394, Dallas, 1997. Soc. Expl. Geophys., Expanded abstracts. [14] H. Smith. A Hardy space for fourier integral operators. J. Geom. Anal., 7, 1997. [15] J. L. Starck, M. Elad, and D. Donoho. Redundant multiscale transforms and their application to morphological component separation. Advances in Imaging and Electron Physics, 132, 2004. [16] D. O. Trad. Interpolation and multiple attenuation with migration operators. Geophysics, 68(6):2043–2054, 2003. [17] D. J. Verschuur and A. J. Berkhout. Estimation of multiple scattering by iterative inversion, part II: practical aspects and examples. Geophysics, 62(5):1596–1611, 1997. [18] D. J. Verschuur, A. J. Berkhout, and C. P. A. Wapenaar. Adaptive surface-related multiple elimination. Geophysics, 57(9):1166–1177, 1992. [19] Y. Wang. Multiple subtraction using an expanded multichannel matching filter. Geophysics, 68:346–354, 2003. [20] J. W. Wiggins. Attenuation of complex water-bottom multiples by wave-equation-based prediction and subtraction. Geophysics, 53(12):1527–1539, 1988. [21] B. Zhou and S. A. Greenhalgh. Wave-equation extrapolation-based multiple attenuation: 2-d filtering in the f-k domain. Geophysics, 59(10):1377–1391, 1994. Figure 2: Synthetic example. Top row: Data with primaries and multiples; Matched-filter estimated primaries; Curvelet predicted primaries. Second row: Noisy data; Curvelet-estimated primaries. trace number 20 40 60 80 100120140160180 trace number 20 40 60 80 100120140160180 trace number 20 40 60 80 100120140160180 200 200 400 400 400 400 600 600 Shot number 200 Shot number 200 Shot number Shot number trace number 20 40 60 80 100120140160180 600 600 800 800 800 800 1000 1000 1000 1000 Data with multiples Predicted multiples only Matched-filter result Curvelet domain result Figure 3: Real example: a time slice from a 2D Gulf of Mexico line. Data with primaries and multiples; Predicted multiples; Matched-filter estimated primaries; Curvelet predicted primaries.
- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- UBC Faculty Research and Publications /
- Robust curvelet-domain primary-multiple separation...
Open Collections
UBC Faculty Research and Publications
Robust curvelet-domain primary-multiple separation with sparseness constraints Herrmann, Felix J.; Verschuur, Dirk J. 2005
pdf
Page Metadata
Item Metadata
Title | Robust curvelet-domain primary-multiple separation with sparseness constraints |
Creator |
Herrmann, Felix J. Verschuur, Dirk J. |
Contributor | University of British Columbia. Seismic Laboratory for Imaging and Modeling |
Publisher | European Association of Geoscientists & Engineers |
Date Issued | 2005 |
Description | A non-linear primary-multiple separation method using curvelets frames is presented. The advantage of this method is that curvelets arguably provide an optimal sparse representation for both primaries and multiples. As such curvelets frames are ideal candidates to separate primaries from multiples given inaccurate predictions for these two data components. The method derives its robustness regarding the presence of noise; errors in the prediction and missing data from the curvelet frame's ability (i) to represent both signal components with a limited number of multi-scale and directional basis functions; (ii) to separate the components on the basis of differences in location, orientation and scales and (iii) to minimize correlations between the coefficients of the two components. A brief sketch of the theory is provided as well as a number of examples on synthetic and real data. |
Extent | 1991973 bytes |
Subject |
curvelets sparseness constraints primary separation multiple separation |
Genre |
Conference Paper |
Type |
Text |
File Format | application/pdf |
Language | eng |
Date Available | 2008-02-26 |
Provider | Vancouver : University of British Columbia Library |
Rights | All rights reserved |
DOI | 10.14288/1.0107386 |
URI | http://hdl.handle.net/2429/454 |
Affiliation |
Science, Faculty of Earth and Ocean Sciences, Department of |
Citation | Herrmann, Felix J., Verschuur, Dirk J. 2005. Robust curvelet-domain primary-multiple separation with sparseness constraints. EAGE 67th Conference & Exhibition Proceedings. |
Peer Review Status | Unreviewed |
Scholarly Level | Faculty |
Copyright Holder | Herrmann, Felix J. |
Aggregated Source Repository | DSpace |
Download
- Media
- 52383-EAGEM2005.pdf [ 1.9MB ]
- Metadata
- JSON: 52383-1.0107386.json
- JSON-LD: 52383-1.0107386-ld.json
- RDF/XML (Pretty): 52383-1.0107386-rdf.xml
- RDF/JSON: 52383-1.0107386-rdf.json
- Turtle: 52383-1.0107386-turtle.txt
- N-Triples: 52383-1.0107386-rdf-ntriples.txt
- Original Record: 52383-1.0107386-source.json
- Full Text
- 52383-1.0107386-fulltext.txt
- Citation
- 52383-1.0107386.ris
Full Text
Cite
Citation Scheme:
Usage Statistics
Share
Embed
Customize your widget with the following options, then copy and paste the code below into the HTML
of your page to embed this item in your website.
<div id="ubcOpenCollectionsWidgetDisplay">
<script id="ubcOpenCollectionsWidget"
src="{[{embed.src}]}"
data-item="{[{embed.item}]}"
data-collection="{[{embed.collection}]}"
data-metadata="{[{embed.showMetadata}]}"
data-width="{[{embed.width}]}"
async >
</script>
</div>
Our image viewer uses the IIIF 2.0 standard.
To load this item in other compatible viewers, use this url:
http://iiif.library.ubc.ca/presentation/dsp.52383.1-0107386/manifest