SEISMIC DATA DENOISINGAN APPLICATION TO CURVELET TRANSFORM

Under the supervision of: Dr. Debashis Ghosh Associate Prof. Electronics and Commuter Engineering Department IIT, Roorkee Presentation By: Mridula M.Tech, Comm.System 08531003

Outline
Introduction Wavelet analysis  Continuous Wavelet Transform (CWT)  Discrete Wavelet Transform (DWT)  Wavelet Selection  Applications  Denoising Point and curve discontinuities Curvelet Transform  Sub-band decomposition  Smooth partitioning  Renormalization  Ridgelet Transform Image Decomposition Image Reconstruction Advantages Result Conclusion References

Introduction
One of the main task of geophysical exploration is to remove random noises in seismic data processing to improve the signal-to-noise ratio. A commonly used de-noising method is by Fourier analysis. In Fourier theory, signal is expressed as the sum of a, possibly infinite, series of sines and cosines. This sum is also referred to as a Fourier expansion. One of the main disadvantage of a Fourier expansion is that it has only frequency resolution and no time resolution. To overcome this problem in the past decades several solutions have been developed which are more or less able to represent a signal in the time and frequency domain at the same time. The idea behind these time-frequency joint representations is to cut the signal of interest into several parts and then analyze the parts separately.

 Recently wavelet theory is applied widely to remove random noises in seismic data processing. Since 1990s, wavelet transform has been well used in speech recognition, image processing and seismic data Denoising for its nice localization characteristics . A new multi-scale transform which is developed on wavelet transform, known as curvelet transform is most recent technique used for image denoising. Curvelet transform has better directional characteristics than that of wavelet transform.

Wavelet Analysis
A wavelet is a wave-like oscillation with an amplitude that starts out at zero, increases, and then decreases back to zero. The nature of the real signal is non-periodic and transient and such signals cannot easily be analyzed by conventional transforms. Wavelet is developed to overcome the shortcomings of STFT. The Wavelet Transform provides a time-frequency representation of the signal. The Wavelet Transform uses multi-resolution technique by which different frequencies are analyzed with different resolutions. Also the signal to noise ratio based on prior knowledge of the signal characteristics is improved.

A wave

A Wavelet

 Continuous Wavelet Transform (CWT):

K ( s ,X ) !

f ( t )] s*,X ( t ) dt

--(1)

The variables s and , scale and translation (location) factor respectively, are the new dimensions after the wavelet transform.

Inverse Wavelet Transform:

f (t) ! K (s,X ) s,X (t)dXds ]

--(2) (t), the so called

The wavelets are generated from a single basic wavelet mother wavelet, by scaling and translation

1 s ,X (t ) ! s

t X ) s ,X ( s

--(3)

s is the scale factor, is the translation factor and the factor s-1/2 is for energy normalization across the different scales.

Discrete Wavelet Transform (DWT):

The Discrete Wavelet Transform (DWT), is based on subband coding and is found to yield a fast computation of Wavelet Transform. It is easy to implement and reduces the computation time and resources required. In CWT, the signals are analyzed using a set of basis functions which relate to each other by simple scaling and translation. Whereas, in case of DWT, a time-scale representation of the digital signal is obtained using digital filtering techniques. The signal to be analyzed is passed through filters with different cutoff frequencies at different scales.

 The DWT is computed by successive lowpass and highpass filtering of the discrete time-domain signal. This is called the Mallat algorithm or Mallat-tree decomposition. Its significance is in the manner it connects the continuous-time mutiresolution to discrete-time filters.
Ho x[n] Go 2 Go 2 Go 2 a3[n] d1[n] Ho 2 d2[n] Ho 2 d3[n]

Three level wavelet decomposition tree

Wavelet Selection
To best characterize the spikes in a noisy signal the wavelet selection plays a very important role. Careful selection of mother wavelet will lead to better approximation and capture the transient spikes of the original signal. Mother wavelet not only determines how well we estimate the original signal but also, it will affect the frequency spectrum of the denoised signal. It can be selected based on correlation between the signal of interest and the wavelet-denoised signal, or based on the cumulative energy over some interval.

Applications
One of the prominent application is in the FBI fingerprint compression standard. The wavelet transforms enables high compression ratios with good quality of reconstruction. The application of wavelets for image compression is one the hottest areas of research. Recently, the Wavelet Transforms have been chosen for the JPEG 2000 compression standard. Wavelets also find application in speech compression, which reduces transmission time in mobile applications. They are also used in denoising, edge detection, feature extraction, speech recognition, and echo cancellation.

Denoising
The general wavelet denoising procedure is as follows: 1. Apply wavelet transform to the noisy signal to produce the noisy wavelet coefficients. 2. Select appropriate threshold limit at each level and threshold method (hard or soft thresholding) to best remove the noises. 3. Inverse wavelet transform of the thresholded wavelet coefficients to obtain a denoised signal.

Point and Curve Discontinuities

A discontinuity point affects all the Fourier coefficients in the domain.
Hence the FT doesnt handle points discontinuities well.

Using wavelets, it affects only a limited number of coefficients.

Hence the WT handles point discontinuities well.

Discontinuities across a simple curve affect all the wavelets coefficients on the curve.
Hence the WT doesnt handle curves discontinuities well.

Curvelets are designed to handle curves using only a small number of coefficients.
Hence the CvT handles curve discontinuities well.

Curvelet Transform
Candes and Donoho (1999)
Original FFT 2D Original image n*n IFFT 1D Radon Transform 2n*n Ridgelet Transform 2n*n image Sub-band decomposition

1-D Wavelet Transform

Smooth partitioning

frequency

Ridgelet Transform

Sub-band Decomposition f C P f , (1 f , ( 2 f , -
Dividing the image into resolution layers. Each layer contains details of different frequencies: P0 low-pass filter. (1, (2, band-pass (high-pass) filters. The original image can be reconstructed from the sub-bands: f ! P0 P0 f  ( s ( s f
s

f C P f , (1 f , ( 2 f , -

P0 f

(1 f

(2 f

Smooth Partitioning
Let Qs all the dyadic squares of the grid. Let w be a smooth windowing function with main support of size 2-sv2-s. For each square, wQ is a displacement of w, localized near Q. Multiplying (s f with wQ (QQs) produces a smooth dissection of the function into squares.

hQ ! wQ ( s f

Smooth Partitioning

Renormalization
Renormalization is centering each dyadic square to the unit square [0,1]v[0,1]. For each Q, the operator TQ is defined as:

T x , x ! 2 2 x  k , 2 x
s s s Q 1 2 1 1

 k2

Each square is renormalized:

g Q ! TQ hQ
1

Ridgelet Transform
Developed by E. Candes in PhD thesis, 1998. The Ridgelet transform allows the representation of arbitrary bivariate functions f(x1,x2) by superposition of elements of the form

] s ,X ,U ( x , x ) ! s  / ] (( x cos U  x sin U  X ) / s )
here is a wavelet, a>0 is a scale parameter, is an orientation parameter, and is a location and s is scalar parameter. The continuous Ridgelet transform provides a sparse representation of both smooth functions and of perfectly straight edges. These Ridgelets are constant along ridge line x1cos + x2sin , and along the orthogonal direction they are wavelets.

Image Decomposition
The curvelet decomposition is the sequence of the following steps: Subband Decomposition: The object f is decomposed into subbands: f (Pof, 1f, 2f,.). Smooth Partitioning: Each subband is smoothly windowed into squares of an appropriate scale (of sidelength ~ 2-s): hQ (wQ sf) Q Qs Renormalisation: Each resulting square is renormalized to unit scale gQ = (TQ)-1 (hQ) Ridgelet Analysis: Each Square is analyzed via the discrete Ridgelet transform.

Image Reconstruction
The Inverse of the Curvelet Transform: Ridgelet Synthesis: gQ ! Q, Renormalization: Smooth Integration:
hQ ! TQ g Q
(s f !

w
QQ s

hQ

Sub-band Recomposition: f

! P0 P0 f  ( s ( s f
s

Advantages
The curvelet reconstruction exhibit higher perceptual quality than wavelet-based reconstructions. They offer visually sharper images. High quality recovery of edges.

Results

Conclusion
Seismic profile actually also is one kind of image, including events of reflections, random noise and coherent noise. Therefore by applying curvelet transform, we can get better results than other filtering methods (such as Fourier transform and wavelet transform). L.Shan, J.Fu, Z.Junhua and et.al Curvelet Transform and its Application in Seismic Data Denoising, IEEE Conference on Information Technology and Computer Science, 2009,pp-396-399.

References
Mallat S. Multifrequency Channel Decompositions of Images and Wavelet Models IEEE Trans. On Acoustic Speech and Signal Processing, 1989,pp-2091-2110 Zhang Junhua, Lu Jimeng Application of wavelet transform in removing noise and improving resolution of seismic dataJournal of University of Petroleum,China, 1997, pp-18-21. L.Shan, J.Fu, Z.Junhua and et.al Curvelet Transform and its Application in Seismic Data Denoising, International Conference on Information Technology and Computer Science, 2009,pp-396-399 Cands E. J,Demanet L. Curvelets and Fourier Integral Operators URL:http://www.curvelet.org/papers. html,2002. Starck J. L., Cands E. J., Donoho D. L. The Curvelet transform for image Denoising IEEE Trans Image Proc, 2002, pp-670-684. Cands E. J., Demanet L., Donoho D. L., et al. Fast discrete curvelet transforms Applied and Computational Mathematics, California Institute ofTechnology,2006.