Microseismic data denoising using a 3C group sparsity constrained time-frequency transform

Geophysics ◽  
2012 ◽  
Vol 77 (2) ◽  
pp. V21-V29 ◽  
Author(s):  
Ismael Vera Rodriguez ◽  
David Bonar ◽  
Mauricio Sacchi
Keyword(s):  
Signal To Noise Ratio ◽  
Superior Performance ◽  
Data Sets ◽  
Group Sparsity ◽  
Time Frequency ◽  
Sparsity Pattern ◽  
Microseismic Data ◽  
Arbitrary Phase ◽  
Low Pass ◽  
Three Components

Noise contamination is an important problem in microseismic data processing, due to the low magnitude of the seismic events induced during fluid injection. In this study, a noncoherent noise attenuation technique based on a constrained time-frequency transform is presented. When applied to 1C data, the transform corresponds to a sparse representation of the microseismic signal in terms of a dictionary of complex Ricker wavelets. The use of complex wavelets possesses the advantage that signals with arbitrary phase can be represented with enhanced sparsity. A synthetic example illustrates the superior performance of the sparse constraint for denoising objectives when compared to the standard least-squares regularization. As the arrival time and frequency content of any wavefront are equivalent in the three components of a single receiver, the extension of the sparse transform to 3C data is accomplished when the three components are considered to share the same sparsity pattern in the time-frequency plane. Application of the 3C sparse transform to synthetic and real microseismic data sets demonstrate the advantages of this technique when the denoised results are compared against the original and low-pass filtered version of the noisy data. Furthermore, a comparison of hodograms between original, low-pass, and denoised traces shows that the denoising process preserves the phase and relative amplitude information present in the input data. The benefits of the 3C transform are highlighted particularly in cases where the wave arrivals are measured in the three components of a receiver but are only visible in two components due to the prevailing signal-to-noise ratio.

Convolutional neural networks for microseismic waveform classification and arrival picking

Geophysics ◽  
2020 ◽  
Vol 85 (4) ◽  
pp. WA227-WA240 ◽  
Author(s):  
Guoyin Zhang ◽  
Chengyan Lin ◽  
Yangkang Chen
Keyword(s):  
Neural Network ◽  
Network Architecture ◽  
Signal To Noise Ratio ◽  
Data Sets ◽  
Data Set ◽  
Frequency Spectra ◽  
Time Frequency ◽  
Microseismic Data ◽  
Frequency Components ◽  
Specific Frequency

Microseismic data have a low signal-to-noise ratio (S/N). Existing waveform classification and arrival-picking methods are not effective enough for noisy microseismic data with low S/N. We have adopted a novel antinoise classifier for waveform classification and arrival picking by combining the continuous wavelet transform (CWT) and the convolutional neural network (CNN). The proposed CWT-CNN classifier is applied to synthetic and field microseismic data sets. Results show that CWT-CNN classifier has much better performance than the basic deep feedforward neural network (DNN), especially for microseismic data with low S/N. The CWT-CNN classifier has a shallow network architecture and small learning data set, and it can be trained quickly for different data sets. We have determined why CWT-CNN has better performance for noisy microseismic data. CWT can decompose the microseismic data into time-frequency spectra, where effective signals and interfering noise are easier to distinguish. With the help of CWT, CNN can focus on the specific frequency components to extract useful features and build a more effective classifier.

Robust estimation of instantaneous phase using a time-frequency adaptive filter

Geophysics ◽  
2013 ◽  
Vol 78 (1) ◽  
pp. O1-O7 ◽  
Author(s):  
Wen-kai Lu ◽  
Chang-Kai Zhang
Keyword(s):  
Adaptive Filter ◽  
Signal To Noise Ratio ◽  
Amplitude Spectrum ◽  
Estimation Method ◽  
Frequency Component ◽  
Data Sets ◽  
Time Frequency ◽  
Instantaneous Phase ◽  
The Hilbert Transform ◽  
Short Time

The instantaneous phase estimated by the Hilbert transform (HT) is susceptible to noise; we propose a robust approach for the estimation of instantaneous phase in noisy situations. The main procedure of the proposed method is applying an adaptive filter in time-frequency domain and calculating the analytic signal. By supposing that one frequency component with higher amplitude has higher signal-to-noise ratio, a zero-phase adaptive filter, which is constructed by using the time-frequency amplitude spectrum, enhances the frequency components with higher amplitudes and suppresses those with lower amplitudes. The estimation of instantaneous frequency, which is defined as the derivative of instantaneous phase, is also improved by the proposed robust instantaneous phase estimation method. Synthetic and field data sets are used to demonstrate the performance of the proposed method for the estimation of instantaneous phase and frequency, compared by the HT and short-time-Fourier-transform methods.

scholarly journals CHIPIN: ChIP-seq inter-sample normalization based on signal invariance across transcriptionally constant genes

2021 ◽  
Vol 22 (1) ◽  
Author(s):  
Lélia Polit ◽  
Gwenneg Kerdivel ◽  
Sebastian Gregoricchio ◽  
Michela Esposito ◽  
Christel Guillouf ◽  
...  
Keyword(s):  
Signal To Noise Ratio ◽  
R Package ◽  
Superior Performance ◽  
Open Chromatin ◽  
Data Sets ◽  
Drug Treatments ◽  
On Chip ◽  
Genomic Regions ◽  
Signal Normalization ◽  
User Friendly

Abstract Background Multiple studies rely on ChIP-seq experiments to assess the effect of gene modulation and drug treatments on protein binding and chromatin structure. However, most methods commonly used for the normalization of ChIP-seq binding intensity signals across conditions, e.g., the normalization to the same number of reads, either assume a constant signal-to-noise ratio across conditions or base the estimates of correction factors on genomic regions with intrinsically different signals between conditions. Inaccurate normalization of ChIP-seq signal may, in turn, lead to erroneous biological conclusions. Results We developed a new R package, CHIPIN, that allows normalizing ChIP-seq signals across different conditions/samples when spike-in information is not available, but gene expression data are at hand. Our normalization technique is based on the assumption that, on average, no differences in ChIP-seq signals should be observed in the regulatory regions of genes whose expression levels are constant across samples/conditions. In addition to normalizing ChIP-seq signals, CHIPIN provides as output a number of graphs and calculates statistics allowing the user to assess the efficiency of the normalization and qualify the specificity of the antibody used. In addition to ChIP-seq, CHIPIN can be used without restriction on open chromatin ATAC-seq or DNase hypersensitivity data. We validated the CHIPIN method on several ChIP-seq data sets and documented its superior performance in comparison to several commonly used normalization techniques. Conclusions The CHIPIN method provides a new way for ChIP-seq signal normalization across conditions when spike-in experiments are not available. The method is implemented in a user-friendly R package available on GitHub: https://github.com/BoevaLab/CHIPIN

Underwater Target Recognition Using Time-Frequency Analysis and Elliptical Fuzzy Clustering Classifications

2009 ◽  
Author(s):  
Hui Ou ◽  
John S. Allen ◽  
Vassilis L. Syrmos
Keyword(s):  
Clustering Algorithm ◽  
Target Recognition ◽  
Signal To Noise Ratio ◽  
High Signal ◽  
Formation Mechanisms ◽  
Data Sets ◽  
Time Frequency ◽  
Underwater Target ◽  
Clustering Pattern ◽  
Acoustic Responses

A novel underwater target recognition approach has been developed based on the use of Wigner-type Time-Frequency (TF) analysis and the elliptical Gustafson-Kessel (GK) clustering algorithm. This method is implemented for the acoustic backscattered signals of the targets, and more precisely from the examination of echo formation mechanisms in the TF plane. For each of the training signals, we generate a clustering distribution which represents the signal’s TF characteristics by a small number of clusters. A feature template is created by combining the clustering distributions for the signals from the same training target. In the classification process, we calculate the clustering distribution of the test signal and compare it with the feature templates. The target is discriminated in terms of the best match of the clustering pattern. The advantages of GK clustering are that it allows elliptical-shaped clusters, and it automatically adjusts their shapes according to the distribution of the TF feature patterns. The recognition scheme has been applied to discriminate four spherical shell targets filled with different fluids. The data sets are the simulated acoustic responses from these targets, including the interferences caused by the seafloor interaction. [J. A. Fawcett, W. L. J. Fox, and A. Maguer, J. Acoust. Soc. Am. 104, 3296–3304 (1998)]. To evaluate the system robustness, white Gaussian noise is added to the acoustic responses. More than 95% of correct classification is obtained for high Signal-to-Noise Ratio (SNR), and it is maintained around 70% for very low SNRs.

Minimum semblance weighted stacking with polarity correction for surface microseismic data processing

2019 ◽  
Vol 38 (8) ◽  
pp. 630-636 ◽  
Author(s):  
Jincheng Xu ◽  
Wei Zhang ◽  
Xaofei Chen ◽  
Quanshi Guo
Keyword(s):  
Signal To Noise Ratio ◽  
Real Data ◽  
Data Sets ◽  
Source Imaging ◽  
Microseismic Data ◽  
True Source ◽  
Source Mechanisms ◽  
Polarity Correction ◽  
Microseismic Location ◽  
Location Methods

Diffraction-stack-based algorithms are the most popular microseismic location methods for surface microseismic data. They can accommodate microseismic data with low signal-to-noise ratio by stacking a large number of traces. However, changes in waveform polarity across the receiver line due to source mechanisms may prevent stacking methods from locating the true source. Imaging functions based on simple stacks have low resolution, producing large uncertainty in the final location result. To solve these issues, we introduce a minimum semblance weighted stacking method with polarity correction, which uses an amplitude trend least-squares fitting algorithm to correct the polarity across the receiver line. We adapt the semblance weighted stacking for better coherency measure to improve the imaging resolution. Moreover, the minimum semblance is used to further improve the resolution of location results. Application to both synthetic and real data sets demonstrates good performance of our proposed location method.

Denoising with weak signal preservation by group-sparsity transform learning

Geophysics ◽  
2019 ◽  
Vol 84 (6) ◽  
pp. V351-V368 ◽  
Author(s):  
Xiaojing Wang ◽  
Bihan Wen ◽  
Jianwei Ma
Keyword(s):  
Seismic Data ◽  
Signal To Noise Ratio ◽  
Random Noise ◽  
Synthetic Data ◽  
Tight Frame ◽  
Seismic Exploration ◽  
Weak Signal ◽  
Group Sparsity ◽  
Sparsity Pattern ◽  
Group Data

Weak signal preservation is critical in the application of seismic data denoising, especially in deep seismic exploration. It is hard to separate those weak signals in seismic data from random noise because it is less compressible or sparsifiable, although they are usually important for seismic data analysis. Conventional sparse coding models exploit the local sparsity through learning a union of basis, but it does not take into account any prior information about the internal correlation of patches. Motivated by an observation that data patches within a group are expected to share the same sparsity pattern in the transform domain, so-called group sparsity, we have developed a novel transform learning with group sparsity (TLGS) method that jointly exploits local sparsity and internal patch self-similarity. Furthermore, for weak signal preservation, we extended the TLGS method and developed the transform learning with external reference. External clean or denoised patches are applied as the anchored references, which are grouped together with similar corrupted patches. They are jointly modeled under a sparse transform, which is adaptively learned. This is achieved by jointly learning a subset of the transform for each group data. Our method achieves better denoising performance than existing denoising methods, in terms of signal-to-noise ratio values and visual preservation of weak signal. Comparisons of experimental results on one synthetic data and three field data using the [Formula: see text]-[Formula: see text] deconvolution method and the data-driven tight frame method are also provided.

scholarly journals Hyperspectral Image Super-Resolution Based on Spatial Group Sparsity Regularization Unmixing

2020 ◽  
Vol 10 (16) ◽  
pp. 5583 ◽  
Author(s):  
Jun Li ◽  
Yuanxi Peng ◽  
Tian Jiang ◽  
Longlong Zhang ◽  
Jian Long
Keyword(s):  
Spatial Resolution ◽  
Spatial Information ◽  
Hyperspectral Image ◽  
Super Resolution ◽  
Superior Performance ◽  
High Spectral Resolution ◽  
Data Sets ◽  
Group Sparsity ◽  
Sparsity Regularization ◽  
High Spatial Resolution Image

A hyperspectral image (HSI) contains many narrow spectral channels, thus containing efficient information in the spectral domain. However, high spectral resolution usually leads to lower spatial resolution as a result of the limitations of sensors. Hyperspectral super-resolution aims to fuse a low spatial resolution HSI with a conventional high spatial resolution image, producing an HSI with high resolution in both the spectral and spatial dimensions. In this paper, we propose a spatial group sparsity regularization unmixing-based method for hyperspectral super-resolution. The hyperspectral image (HSI) is pre-clustered using an improved Simple Linear Iterative Clustering (SLIC) superpixel algorithm to make full use of the spatial information. A robust sparse hyperspectral unmixing method is then used to unmix the input images. Then, the endmembers extracted from the HSI and the abundances extracted from the conventional image are fused. This ensures that the method makes full use of the spatial structure and the spectra of the images. The proposed method is compared with several related methods on public HSI data sets. The results demonstrate that the proposed method has superior performance when compared to the existing state-of-the-art.

scholarly journals Detection of Polyphase Codes Radar Signals in Low SNR

2016 ◽  
Vol 2016 ◽  
pp. 1-6 ◽  
Author(s):  
Runlan Tian ◽  
Guoyi Zhang ◽  
Rui Zhou ◽  
Wei Dong
Keyword(s):  
Hough Transform ◽  
Signal To Noise Ratio ◽  
Superior Performance ◽  
Radar Signal ◽  
Time Frequency ◽  
Low Snr ◽  
Radar Signals ◽  
Core Idea ◽  
Code Type ◽  
Electronic Intelligence

A novel effective detection method is proposed for electronic intelligence (ELINT) systems detecting polyphase codes radar signal in the low signal-to-noise ratio (SNR) scenario. The core idea of the proposed method is first to calculate the time-frequency distribution of polyphase codes radar signals via Wigner-Ville distribution (WVD); then the modified Hough transform (HT) is employed to cumulate all the energy of WVD’s ridges effectively to achieve signal detection. Compared with the generalised Wigner Hough transform (GWHT) method, the proposed method has a superior performance in low SNR and is not sensitive to the code type. Simulation results verify the validity of the proposed method.

scholarly journals A New Extension of Thinning-Based Integer-Valued Autoregressive Models for Count Data

Entropy ◽  
2020 ◽  
Vol 23 (1) ◽  
pp. 62
Author(s):  
Zhengwei Liu ◽  
Fukang Zhu
Keyword(s):  
Likelihood Estimation ◽  
Real Data ◽  
Autoregressive Models ◽  
Superior Performance ◽  
Data Sets ◽  
Binomial Thinning ◽  
Free Case ◽  
Two Parameters ◽  
Conditional Maximum ◽  
Thinning Operator

The thinning operators play an important role in the analysis of integer-valued autoregressive models, and the most widely used is the binomial thinning. Inspired by the theory about extended Pascal triangles, a new thinning operator named extended binomial is introduced, which is a general case of the binomial thinning. Compared to the binomial thinning operator, the extended binomial thinning operator has two parameters and is more flexible in modeling. Based on the proposed operator, a new integer-valued autoregressive model is introduced, which can accurately and flexibly capture the dispersed features of counting time series. Two-step conditional least squares (CLS) estimation is investigated for the innovation-free case and the conditional maximum likelihood estimation is also discussed. We have also obtained the asymptotic property of the two-step CLS estimator. Finally, three overdispersed or underdispersed real data sets are considered to illustrate a superior performance of the proposed model.

scholarly journals ECG Signal Denoising and Reconstruction Based on Basis Pursuit

2021 ◽  
Vol 11 (4) ◽  
pp. 1591
Author(s):  
Ruixia Liu ◽  
Minglei Shu ◽  
Changfang Chen
Keyword(s):  
Signal To Noise Ratio ◽  
Heart Diseases ◽  
Gaussian White Noise ◽  
Basis Pursuit ◽  
Signal Denoising ◽  
Ecg Signal ◽  
Penalty Term ◽  
Ecg Signals ◽  
Alternating Direction ◽  
Low Pass

The electrocardiogram (ECG) is widely used for the diagnosis of heart diseases. However, ECG signals are easily contaminated by different noises. This paper presents efficient denoising and compressed sensing (CS) schemes for ECG signals based on basis pursuit (BP). In the process of signal denoising and reconstruction, the low-pass filtering method and alternating direction method of multipliers (ADMM) optimization algorithm are used. This method introduces dual variables, adds a secondary penalty term, and reduces constraint conditions through alternate optimization to optimize the original variable and the dual variable at the same time. This algorithm is able to remove both baseline wander and Gaussian white noise. The effectiveness of the algorithm is validated through the records of the MIT-BIH arrhythmia database. The simulations show that the proposed ADMM-based method performs better in ECG denoising. Furthermore, this algorithm keeps the details of the ECG signal in reconstruction and achieves higher signal-to-noise ratio (SNR) and smaller mean square error (MSE).

Sign in / Sign up

Export Citation Format

Share Document