1887

Abstract

A novel implementation of the discrete curvelet transform is proposed in this work. The transform is based on the Fast Fourier Transform (FFT) and has the same order of complexity as the FFT. The discrete curvelet functions are defined by a parameterized family of smooth windowed functions that are 2-pi periodic and form a partition of unity. The transform is named the Uniform Discrete Curvelet Transform (UDCT) because the centers of the curvelet functions at each resolution are located on a uniform grid. The forward and inverse transforms form a tight frame, in the sense that they are the exact transpose of each other. The novel discrete transform has several advantages over existing transforms, such as lower redundancy, hierarchical data structure, ease of implementation and possible extension to N dimension. Finally, we present a simple initial application of the UDCT in sparseness constraint seismic data interpolation to recover missing traces.

Loading

Article metrics loading...

/content/papers/10.3997/2214-4609.20147873
2008-06-09
2020-04-10
Loading full text...

Full text loading...

http://instance.metastore.ingenta.com/content/papers/10.3997/2214-4609.20147873
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