3,191 research outputs found
Blind Curvelet based Denoising of Seismic Surveys in Coherent and Incoherent Noise Environments
The localized nature of curvelet functions, together with their frequency and
dip characteristics, makes the curvelet transform an excellent choice for
processing seismic data. In this work, a denoising method is proposed based on
a combination of the curvelet transform and a whitening filter along with
procedure for noise variance estimation. The whitening filter is added to get
the best performance of the curvelet transform under coherent and incoherent
correlated noise cases, and furthermore, it simplifies the noise estimation
method and makes it easy to use the standard threshold methodology without
digging into the curvelet domain. The proposed method is tested on
pseudo-synthetic data by adding noise to real noise-less data set of the
Netherlands offshore F3 block and on the field data set from east Texas, USA,
containing ground roll noise. Our experimental results show that the proposed
algorithm can achieve the best results under all types of noises (incoherent or
uncorrelated or random, and coherent noise)
The curvelet transform for image denoising
We describe approximate digital implementations of two new mathematical transforms, namely, the ridgelet transform and the curvelet transform. Our implementations offer exact reconstruction, stability against perturbations, ease of implementation, and low computational complexity. A central tool is Fourier-domain computation of an approximate digital Radon transform. We introduce a very simple interpolation in the Fourier space which takes Cartesian samples and yields samples on a rectopolar grid, which is a pseudo-polar sampling set based on a concentric squares geometry. Despite the crudeness of our interpolation, the visual performance is surprisingly good. Our ridgelet transform applies to the Radon transform a special overcomplete wavelet pyramid whose wavelets have compact support in the frequency domain. Our curvelet transform uses our ridgelet transform as a component step, and implements curvelet subbands using a filter bank of a` trous wavelet filters. Our philosophy throughout is that transforms should be overcomplete, rather than critically sampled. We apply these digital transforms to the denoising of some standard images embedded in white noise. In the tests reported here, simple thresholding of the curvelet coefficients is very competitive with "state of the art" techniques based on wavelets, including thresholding of decimated or undecimated wavelet transforms and also including tree-based Bayesian posterior mean methods. Moreover, the curvelet reconstructions exhibit higher perceptual quality than wavelet-based reconstructions, offering visually sharper images and, in particular, higher quality recovery of edges and of faint linear and curvilinear features. Existing theory for curvelet and ridgelet transforms suggests that these new approaches can outperform wavelet methods in certain image reconstruction problems. The empirical results reported here are in encouraging agreement
Continuous Curvelet Transform: II. Discretization and Frames
We develop a unifying perspective on several decompositions exhibiting directional parabolic scaling. In each decomposition, the individual atoms are highly anisotropic at fine scales, with effective support obeying the parabolic scaling principle length â width^2. Our comparisons allow to extend Theorems known for one decomposition to others. We start from a Continuous Curvelet Transform f â Î_f (a, b, θ) of functions f(x_1, x_2) on R^2, with parameter space indexed by scale a > 0, location b â R^2, and orientation θ. The transform projects f onto a curvelet Îł_(abθ), yielding coefficient Î_f (a, b, θ) = f, _(Îłabθ); the corresponding curvelet Îł_(abθ) is defined by parabolic dilation in polar frequency domain coordinates. We establish a reproducing formula and Parseval relation for the transform, showing that these curvelets provide a continuous tight frame. The CCT is closely related to a continuous transform introduced by Hart Smith in his study of Fourier Integral Operators. Smithâs transform is based on true affine parabolic
scaling of a single mother wavelet, while the CCT can only be viewed as true affine parabolic scaling in euclidean coordinates by taking a slightly different mother wavelet at each scale. Smithâs transform, unlike the CCT, does not provide a continuous tight frame. We show that, with the right underlying wavelet in Smithâs transform, the analyzing elements of the two transforms become increasingly similar at increasingly fine scales.
We derive a discrete tight frame essentially by sampling the CCT at dyadic intervals in scale a_j = 2^âj, at equispaced intervals in direction, θ_(jâ), = 2Ď2^(âj/2)â, and equispaced sampling on a rotated anisotropic grid in space. This frame is a complexification of the âCurvelets 2002â frame constructed by Emmanuel Candès et al. [1, 2, 3]. We compare this discrete frame with a composite system which at coarse scales is the same as this frame but
at fine scales is based on sampling Smithâs transform rather than the CCT. We are able to show a very close approximation of the two systems at fine scales, in a strong operator norm sense. Smithâs continuous transform was intended for use in forming molecular decompositions
of Fourier Integral Operators (FIOâs). Our results showing close approximation of the curvelet frame by a composite frame using true affine paraboblic scaling at fine scales allow us to cross-apply Smithâs results, proving that the discrete curvelet transform gives sparse representations of FIOâs of order zero. This yields an alternate proof of a recent result of Candès and Demanet about the sparsity of FIO representations in discrete curvelet frames
Face recognition using curvelet transform
This paper presents a new method for the problem of human face recognition from still images. This is based on a multiresolution analysis tool called Digital Curvelet Transform. Curvelet transform has better directional and edge representation abilities than wavelets. Due to these attractive attributes of curvelets, we introduce this idea for feature extraction by applying the curvelet transform of face images twice. The curvelet coefficients create a representative feature set for classification. These coefficients set are then used to train gradient descent backpropagation neural network (NN). A comparative study with wavelet-based, curvelet-based, and traditional Principal Component Analysis (PCA) techniques is also presented. High accuracy rate of 97 achieved by the proposed method for two well-known databases indicates the potential of this curvelet based curvelet feature extraction method
Wavelets, ridgelets and curvelets on the sphere
We present in this paper new multiscale transforms on the sphere, namely the
isotropic undecimated wavelet transform, the pyramidal wavelet transform, the
ridgelet transform and the curvelet transform. All of these transforms can be
inverted i.e. we can exactly reconstruct the original data from its
coefficients in either representation. Several applications are described. We
show how these transforms can be used in denoising and especially in a Combined
Filtering Method, which uses both the wavelet and the curvelet transforms, thus
benefiting from the advantages of both transforms. An application to component
separation from multichannel data mapped to the sphere is also described in
which we take advantage of moving to a wavelet representation.Comment: Accepted for publication in A&A. Manuscript with all figures can be
downloaded at http://jstarck.free.fr/aa_sphere05.pd
Automatic Side-Scan Sonar Image Enhancement in Curvelet Transform Domain
We propose a novel automatic side-scan sonar image enhancement algorithm based on curvelet transform. The proposed algorithm uses the curvelet transform to construct a multichannel enhancement structure based on human visual system (HVS) and adopts a new adaptive nonlinear mapping scheme to modify the curvelet transform coefficients in each channel independently and automatically. Firstly, the noisy and low-contrast sonar image is decomposed into a low frequency channel and a series of high frequency channels by using curvelet transform. Secondly, a new nonlinear mapping scheme, which coincides with the logarithmic nonlinear enhancement characteristic of the HVS perception, is designed without any parameter tuning to adjust the curvelet transform coefficients in each channel. Finally, the enhanced image can be reconstructed with the modified coefficients via inverse curvelet transform. The enhancement is achieved by amplifying subtle features, improving contrast, and eliminating noise simultaneously. Experiment results show that the proposed algorithm produces better enhanced results than state-of-the-art algorithms
Curvelet Approach for SAR Image Denoising, Structure Enhancement, and Change Detection
In this paper we present an alternative method for SAR image denoising, structure enhancement, and change detection based on the curvelet transform. Curvelets can be denoted as a two dimensional further development of the well-known wavelets. The original image is decomposed into linear ridge-like structures, that appear in different scales (longer or shorter structures), directions (orientation of the structure) and locations. The influence of these single components on the original image is weighted by the corresponding coefficients. By means of these coefficients one has direct access to the linear structures present in the image. To suppress noise in a given SAR image weak structures indicated by low coefficients can be suppressed by setting the corresponding coefficients to zero. To enhance structures only coefficients in the scale of interest are preserved and all others are set to zero. Two same-sized images assumed even a change detection can be done in the curvelet coefficient domain. The curvelet coefficients of both images are differentiated and manipulated in order to enhance strong and to suppress small scale (pixel-wise) changes. After the inverse curvelet transform the resulting image contains only those structures, that have been chosen via the coefficient manipulation. Our approach is applied to TerraSAR-X High Resolution Spotlight images of the city of Munich. The curvelet transform turns out to be a powerful tool for image enhancement in fine-structured areas, whereas it fails in originally homogeneous areas like grassland. In the change detection context this method is very sensitive towards changes in structures instead of single pixel or large area changes. Therefore, for purely urban structures or construction sites this method provides excellent and robust results. While this approach runs without any interaction of an operator, the interpretation of the detected changes requires still much knowledge about the underlying objects
A novel facial expression recognition based on the curevlet features
Curvelet transform has been recently proved to be a powerful tool for multi-resolution analysis on images. In this paper we propose a new approach for facial expression recognition based on features extracted via curvelet transform. First curvelet transform is presented and its advantages in image analysis are described. Then the coefficients of curvelet in selected scales and angles are used as features for image analysis. Consequently the Principal Component Analysis (PCA) and Linear Discriminate Analysis (LDA) are used to reduce and optimize the curvelet features. Finally we use the nearest neighbor classifier to recognize the facial expressions based on these features. The experimental results on JAFFE and Cohn Kanade two benchmark databases show that the proposed approach outperforms the PCA and LDA techniques on the original image pixel values as well as its counterparts with the wavelet features
- âŚ