Dictionary learning based on dip patch selection training for random noise attenuation

Geophysics ◽  
2019 ◽  
Vol 84 (3) ◽  
pp. V169-V183 ◽  
Author(s):  
Shaohuan Zu ◽  
Hui Zhou ◽  
Rushan Wu ◽  
Maocai Jiang ◽  
Yangkang Chen
Keyword(s):  
Sparse Representation ◽  
Dictionary Learning ◽  
Simple Structure ◽  
Random Noise ◽  
Critical Role ◽  
Selection Method ◽  
Random Selection ◽  
Patch Selection ◽  
Data Set ◽  
Seismic Image

In recent years, sparse representation is seeing increasing application to fundamental signal and image-processing tasks. In sparse representation, a signal can be expressed as a linear combination of a dictionary (atom signals) and sparse coefficients. Dictionary learning has a critical role in obtaining a state-of-the-art sparse representation. A good dictionary should capture the representative features of the data. The whole signal can be used as training patches to learn a dictionary. However, this approach suffers from high computational costs, especially for a 3D cube. A common method is to randomly select some patches from given data as training patches to accelerate the learning process. However, the random selection method without any prior information will damage the signal if the selected patches for training are inappropriately chosen from a simple structure (e.g., training patches are chosen from a simple structure to recover the complex structure). We have developed a dip-oriented dictionary learning method, which incorporates an estimation of the dip field into the selection procedure of training patches. In the proposed approach, patches with a large dip value are selected for the training. However, it is not easy to estimate an accurate dip field from the noisy data directly. Hence, we first apply a curvelet-transform noise reduction method to remove some fine-scale components that presumably contain mostly random noise, and we then calculate a more reliable dip field from the preprocessed data to guide the patch selection. Numerical tests on synthetic shot records and field seismic image examples demonstrate that the proposed method can obtain a similar result compared with the method trained on the entire data set and obtain a better denoised result compared with the random selection method. We also compare the performance using of the proposed method and those methods based on curvelet thresholding and rank reduction on a synthetic shot record.

Parabolic dictionary learning for seismic wavefield reconstruction across the streamers

Geophysics ◽  
2018 ◽  
Vol 83 (4) ◽  
pp. V263-V282 ◽  
Author(s):  
Pierre Turquais ◽  
Endrias G. Asgedom ◽  
Walter Söllner ◽  
Leiv Gelius
Keyword(s):  
Sparse Representation ◽  
Dictionary Learning ◽  
Sufficient Information ◽  
Data Sets ◽  
Data Set ◽  
Parabolic Structure ◽  
Robustness To Noise ◽  
3D Acquisition ◽  
Seismic Wavefield ◽  
Basis Vectors

Dictionary learning (DL) methods are effective tools to automatically find a sparse representation of a data set. They train a set of basis vectors on the data to capture the morphology of the redundant signals. The basis vectors are called atoms, and the set is referred to as the dictionary. This dictionary can be used to represent the data in a sparse manner with a linear combination of a few of its atoms. In conventional DL, the atoms are unstructured and are only numerically defined over a grid that has the same sampling as the data. Consequently, the atoms are unknown away from this sampling grid, and a sparse representation of the data in the dictionary domain is not sufficient information to interpolate the data. To overcome this limitation, we have developed a DL method called parabolic DL, in which each learned atom is constrained to represent an elementary waveform that has a constant amplitude along a parabolic traveltime moveout. The parabolic structure is consistent with the physics inherent to the seismic wavefield and can be used to easily interpolate or extrapolate the atoms. Hence, we have developed a parabolic DL-based process to interpolate and regularize seismic data. Briefly, it consists of learning a parabolic dictionary from the data, finding a sparse representation of the data in the dictionary domain, interpolating the dictionary atoms over the desired grid, and, finally, taking the sparse representation of the data in the interpolated dictionary domain. We examine three characteristics of this method, i.e., the parabolic structure, the sparsity promotion, and the adaptation to the data, and we conclude that they strengthen robustness to noise and to aliasing and that they increase the accuracy of the interpolation. For both synthetic and field data sets, we have successful seismic wavefield reconstructions across the streamers for typical 3D acquisition geometries.

scholarly journals Variable Length K-SVD: A New Dictionary Learning Approach and Multi-Stage OMP Method for Sparse Representation

2021 ◽  
Author(s):  
Mahdi Marsousi
Keyword(s):  
Sparse Representation ◽  
Dictionary Learning ◽  
Input Data ◽  
Matching Pursuit ◽  
Computational Cost ◽  
Research Field ◽  
Learning Approach ◽  
Data Set ◽  
Multi Stage ◽  
Blocking Artifact

The Sparse representation research field and applications have been rapidly growing during the past 15 years. The use of overcomplete dictionaries in sparse representation has gathered extensive attraction. Sparse representation was followed by the concept of adapting dictionaries to the input data (dictionary learning). The K-SVD is a well-known dictionary learning approach and is widely used in different applications. In this thesis, a novel enhancement to the K-SVD algorithm is proposed which creates a learnt dictionary with a specific number of atoms adapted for the input data set. To increase the efficiency of the orthogonal matching pursuit (OMP) method, a new sparse representation method is proposed which applies a multi-stage strategy to reduce computational cost. A new phase included DCT (PI-DCT) dictionary is also proposed which significantly reduces the blocking artifact problem of using the conventional DCT. The accuracy and efficiency of the proposed methods are then compared with recent approaches that demonstrate the promising performance of the methods proposed in this thesis.

scholarly journals Attenuating seismic noise via incoherent dictionary learning

2018 ◽  
Vol 15 (4) ◽  
pp. 1327-1338
Author(s):  
Juan Wu ◽  
Min Bai
Keyword(s):  
Sparse Representation ◽  
Image Denoising ◽  
Dictionary Learning ◽  
Seismic Data ◽  
Learning Algorithm ◽  
Random Noise ◽  
Learning Technology ◽  
Image Patches ◽  
Seismic Images ◽  
Traditional Image

Abstract We propose to apply an incoherent dictionary learning algorithm for reducing random noise in seismic data. The image denoising algorithm based on incoherent dictionary learning is proposed for solving the problem of losing partial texture information using traditional image denoising methods. The noisy image is firstly divided into different image patches, and those patches are extracted for dictionary learning. Then, we introduce the incoherent dictionary learning technology to update the dictionary. Finally, sparse representation problem is solved to obtain sparse representation coefficients by sparse coding algorithm. The denoised data can be obtained by reconstructing the image using the sparse coefficients. Application of the incoherent dictionary learning method to seismic images presents successful performance and demonstrates its superiority to the state-of-the-art denoising methods.

scholarly journals Variable Length K-SVD: A New Dictionary Learning Approach and Multi-Stage OMP Method for Sparse Representation

2021 ◽  
Author(s):  
Mahdi Marsousi
Keyword(s):  
Sparse Representation ◽  
Dictionary Learning ◽  
Input Data ◽  
Matching Pursuit ◽  
Computational Cost ◽  
Research Field ◽  
Learning Approach ◽  
Data Set ◽  
Multi Stage ◽  
Blocking Artifact

The Sparse representation research field and applications have been rapidly growing during the past 15 years. The use of overcomplete dictionaries in sparse representation has gathered extensive attraction. Sparse representation was followed by the concept of adapting dictionaries to the input data (dictionary learning). The K-SVD is a well-known dictionary learning approach and is widely used in different applications. In this thesis, a novel enhancement to the K-SVD algorithm is proposed which creates a learnt dictionary with a specific number of atoms adapted for the input data set. To increase the efficiency of the orthogonal matching pursuit (OMP) method, a new sparse representation method is proposed which applies a multi-stage strategy to reduce computational cost. A new phase included DCT (PI-DCT) dictionary is also proposed which significantly reduces the blocking artifact problem of using the conventional DCT. The accuracy and efficiency of the proposed methods are then compared with recent approaches that demonstrate the promising performance of the methods proposed in this thesis.

scholarly journals Simultaneous denoising of multicomponent microseismic data by joint sparse representation with dictionary learning

Geophysics ◽  
2019 ◽  
Vol 84 (5) ◽  
pp. KS155-KS172
Author(s):  
Jie Shao ◽  
Yibo Wang ◽  
Yi Yao ◽  
Shaojiang Wu ◽  
Qingfeng Xue ◽  
...  
Keyword(s):  
Sparse Representation ◽  
Dictionary Learning ◽  
Matching Pursuit ◽  
Signal To Noise Ratio ◽  
Random Noise ◽  
Time Consistency ◽  
Denoising Method ◽  
Microseismic Data ◽  
Joint Sparse Representation ◽  
Consistency Constraint

Microseismic data usually have a low signal-to-noise ratio, necessitating the application of an effective denoising method. Most conventional denoising methods treat each component of multicomponent data separately, e.g., denoising methods with sparse representation. However, microseismic data are often acquired with a 3C receiver, especially in borehole monitoring cases. Independent denoising ignores the relative amplitudes and vector relationships between different components. We have developed a new simultaneous denoising method for 3C microseismic data based on joint sparse representation. The three components are represented by different dictionary atoms; the dictionary can be fixed or adaptive depending on the dictionary learning method that is used. Our method adds an extra time consistency constraint with simultaneous transformation of 3C data. The joint sparse optimization problem is solved using the extended orthogonal matching pursuit. Synthetic microseismic data with a double-couple source mechanism and two field downhole microseismic data were used for testing. Independent denoising of 1C data with the fixed dictionary method and simultaneous denoising of 3C data with the fixed dictionary and dictionary learning (3C-DL) methods were compared. The results indicate that among the three methods, the 3C-DL method is the most effective in suppressing random noise, preserving weak signals, and restoring polarization information; this is achieved by combining the time consistency constraint and dictionary learning.

Footprint removal from seismic data with residual dictionary learning

Geophysics ◽  
2020 ◽  
Vol 85 (4) ◽  
pp. V355-V365
Author(s):  
Julián L. Gómez ◽  
Danilo R. Velis
Keyword(s):  
Dictionary Learning ◽  
Seismic Data ◽  
Input Data ◽  
Random Noise ◽  
Coherent Noise ◽  
Edge Preservation ◽  
Data Set ◽  
Edge Preserving ◽  
Learned Dictionary ◽  
Data Volume

Dictionary learning (DL) is a machine learning technique that can be used to find a sparse representation of a given data set by means of a relatively small set of atoms, which are learned from the input data. DL allows for the removal of random noise from seismic data very effectively. However, when seismic data are contaminated with footprint noise, the atoms of the learned dictionary are often a mixture of data and coherent noise patterns. In this scenario, DL requires carrying out a morphological attribute classification of the atoms to separate the noisy atoms from the dictionary. Instead, we have developed a novel DL strategy for the removal of footprint patterns in 3D seismic data that is based on an augmented dictionary built upon appropriately filtering the learned atoms. The resulting augmented dictionary, which contains the filtered atoms and their residuals, has a high discriminative power in separating signal and footprint atoms, thus precluding the use of any statistical classification strategy to segregate the atoms of the learned dictionary. We filter the atoms using a domain transform filtering approach, a very efficient edge-preserving smoothing algorithm. As in the so-called coherence-constrained DL method, the proposed DL strategy does not require the user to know or adjust the noise level or the sparsity of the solution for each data set. Furthermore, it only requires one pass of DL and is shown to produce successful transfer learning. This increases the speed of the denoising processing because the augmented dictionary does not need to be calculated for each time slice of the input data volume. Results on synthetic and 3D public-domain poststack field data demonstrate effective footprint removal with accurate edge preservation.

Predictive and Descriptive CoMFA Models: The Effect of Variable Selection

2018 ◽  
Vol 21 (2) ◽  
pp. 117-124 ◽  
Author(s):  
Bakhtyar Sepehri ◽  
Nematollah Omidikia ◽  
Mohsen Kompany-Zareh ◽  
Raouf Ghavami
Keyword(s):  
Variable Selection ◽  
Predictive Power ◽  
Selection Method ◽  
Data Sets ◽  
Data Set ◽  
Comfa Model ◽  
Variable Selection Method

Aims & Scope: In this research, 8 variable selection approaches were used to investigate the effect of variable selection on the predictive power and stability of CoMFA models. Materials & Methods: Three data sets including 36 EPAC antagonists, 79 CD38 inhibitors and 57 ATAD2 bromodomain inhibitors were modelled by CoMFA. First of all, for all three data sets, CoMFA models with all CoMFA descriptors were created then by applying each variable selection method a new CoMFA model was developed so for each data set, 9 CoMFA models were built. Obtained results show noisy and uninformative variables affect CoMFA results. Based on created models, applying 5 variable selection approaches including FFD, SRD-FFD, IVE-PLS, SRD-UVEPLS and SPA-jackknife increases the predictive power and stability of CoMFA models significantly. Result & Conclusion: Among them, SPA-jackknife removes most of the variables while FFD retains most of them. FFD and IVE-PLS are time consuming process while SRD-FFD and SRD-UVE-PLS run need to few seconds. Also applying FFD, SRD-FFD, IVE-PLS, SRD-UVE-PLS protect CoMFA countor maps information for both fields.

Configurations to Superior Environmental Innovation Strategy: A Both–And Approach

2021 ◽  
pp. 108602662110316
Author(s):  
Tiziana Russo-Spena ◽  
Nadia Di Paola ◽  
Aidan O’Driscoll
Keyword(s):  
Climate Change ◽  
Value Chain ◽  
Critical Role ◽  
Well Being ◽  
Point Of View ◽  
Future Generations ◽  
Innovation Strategy ◽  
Environmental Innovation ◽  
Data Set

An effective climate change action involves the critical role that companies must play in assuring the long-term human and social well-being of future generations. In our study, we offer a more holistic, inclusive, both–and approach to the challenge of environmental innovation (EI) that uses a novel methodology to identify relevant configurations for firms engaging in a superior EI strategy. A conceptual framework is proposed that identifies six sets of driving characteristics of EI and two sets of beneficial outcomes, all inherently tensional. Our analysis utilizes a complementary rather than an oppositional point of view. A data set of 65 companies in the ICT value chain is analyzed via fuzzy-set comparative analysis (fsQCA) and a post-QCA procedure. The results reveal that achieving a superior EI strategy is possible in several scenarios. Specifically, after close examination, two main configuration groups emerge, referred to as technological environmental innovators and organizational environmental innovators.

Sign in / Sign up

Export Citation Format

Share Document