Presentation is loading. Please wait.

Presentation is loading. Please wait.

Using multidimensional scaling and kernel principal component analysis to interpret seismic signatures of thin shaly-sand reservoirs Piyapa Dejtrakulwong1,

Published byBlaze Ross Modified over 8 years ago

Similar presentations

Presentation on theme: "Using multidimensional scaling and kernel principal component analysis to interpret seismic signatures of thin shaly-sand reservoirs Piyapa Dejtrakulwong1,"— Presentation transcript:

1 Using multidimensional scaling and kernel principal component analysis to interpret seismic signatures of thin shaly-sand reservoirs Piyapa Dejtrakulwong1, Tapan Mukerji2, and Gary Mavko1 1Stanford Rock Physics Laboratory (SRB), Department of Geophysics, 2Stanford Center for Reservoir Forecasting (SCRF), Department of Energy Resources and Engineering, Stanford University

2 Motivation Limitation in seismic resolvability
Interpretations of the sub-resolution layers Goal: To investigate seismic signatures of thin shaly-sand reservoirs with statistical attributes multidimensional scaling (MDS) and kernel principal component analysis (KPCA)

3 Thin sand-shale sequences
Workflow Markov Chains Rock Physics Sand/shale model Thin sand-shale sequences Interpretation Net-to-gross ratios Saturations Attributes MDS/KPCA Seismic Responses

4 Markov chain for lithologies
Discrete states: sand, shaly sand, sandy shale, shale Transition probability matrix: 100 m

5 Properties from rock physics
Sand Shaly-sand Sandy-Shale Shale Dvorkin and Gutierrez (2001)

6 Properties from rock physics
Marion (1990) and Yin (1992)

7 Generate Seismic Response
Full waveform, normally-incident, reflected seismograms are simulated using the Kennett algorithm (Kennett, 1983) with a 30-Hz, zero-phase Ricker wavelet

8 Generate Seismic Response
Multiple realizations (Monte Carlo simulation)

9 Multidimensional scaling (MDS)
transforms the dissimilarity matrix into points in lower dimensional (Euclidean) space configures points such that their Euclidean distances (dij) in the space match the original dissimilarity (δij ) of the objects as much as possible

10 Multidimensional scaling (MDS)
Atlanta Chicago Denver Houston Los Angeles Miami New York San Francisco Seattle Washington DC Kruskal and Wish 1978

11 Kernel principal component analysis (KPCA)
Perform linear PCA Map from 2D to 3D 2-D 3-D Linearly separable

12 Distance Functions General Minkowski metric r = 2: Euclidean distance

13 Dynamic Distance Function
Li et al. (2003) Dynamic Partial Function Dm : set of smallest m d’s from {d1,…,dn} The features for measuring similarity depend on the objects being compared pairwise

14 Dynamic Similarity Kernel function
Dynamic similarity kernel (Yan et al., 2006) (Li et al., 2003) and Δm = {the smallest m δ’s of (δ1,…, δn)}

15 Kernel functions Gaussian kernel
Dynamic similarity kernel (Yan et al., 2006) Inverse multi-quadric kernel Polynomial kernel (Li et al., 2003) and Δm = {the smallest m δ’s of (δ1,…, δn)}

16 Projections of seismograms
MDS/KPCA Results from MDS and KPCA: projections of input seismograms onto selected principal components Measure of dissimilarity among seismograms Dissimilarity matrix or kernel matrix Configuration of points color-coded by net-to-gross ratios or other properties

17 Investigate net-to-gross ratios and saturations
Effect of net-to-gross ratios: we study a set of aggrading-type transition matrices with various net-to-gross ratios. (Sw=0.1 for sand layers and 1 for the others) Effect of saturations: we generate sequences from the same transition matrix but now vary saturation (in the sand layers only)

18 Net-to-gross ratios (MDS)
Classical MDS Metric MDS Non-metric MDS Classification success rate 56% 74% 73%

19 Net-to-gross ratios (KPCA)
Kernel Gaussian Dynamic similarity Inverse multi-quadric Polynomial Classification success rate 81% 90% 79% 59% Classification of 3 NTG classes Stratified 10-fold cross validation

20 Saturations (MDS) (A) (B) (C) Non-metric MDS Classical MDS Metric MDS
Classification success rate 65% 66% 53% 67% 57% 69% 58%

21 Saturations (KPCA) Different transition matrices Same nominal NTG
More blocky sands

22 Saturations (KPCA) Dynamic similarity kernel (A) (B) (C) Brine sand
Oil sand

23 Inverse multi-quadric
Saturations (KPCA) (A) (B) (C) Kernel Gaussian Dynamic similarity Inverse multi-quadric Polynomial A B C Classification success rate 62% 73% 61% 88% 87% 84% 64% 67% 60% 65% 52% 3 saturation classes; stratified 10-fold cross validation

24 Selecting components (KPCA)
Parallel coordinates plot Use 1st and 2nd components: success rate = 60% Use 1st and 6th components: success rate =73% Use the first 10 components: success rate = 82%

25 Conclusions Dynamic Similarity Kernel (DSK) best differentiates both the net-to-gross classes and the saturation classes. The features for measuring similarity depend on the objects being compared Increasing coordinates improves classification. In addition a subset of most relevant coordinates for the property of interest can also be chosen. Similar workflow using MDS and KPCA can be applied to real seismic data to characterize thin shaly-sand reservoirs.

26 Interpreting seismic signatures
?? Time Coordinate 2 X ?? Coordinate 1 well unknown N/G

27 Acknowledgements Stanford Rock Physics and Borehole Geophysics project (SRB)and the Stanford Center for Reservoir Forecasting (SCRF)

Download ppt "Using multidimensional scaling and kernel principal component analysis to interpret seismic signatures of thin shaly-sand reservoirs Piyapa Dejtrakulwong1,"

Similar presentations

Noise & Data Reduction. Paired Sample t Test Data Transformation - Overview From Covariance Matrix to PCA and Dimension Reduction Fourier Analysis - Spectrum.

Noise & Data Reduction. Paired Sample t Test Data Transformation - Overview From Covariance Matrix to PCA and Dimension Reduction Fourier Analysis - Spectrum.
Input Space versus Feature Space in Kernel- Based Methods Scholkopf, Mika, Burges, Knirsch, Muller, Ratsch, Smola presented by: Joe Drish Department of.

Input Space versus Feature Space in Kernel- Based Methods Scholkopf, Mika, Burges, Knirsch, Muller, Ratsch, Smola presented by: Joe Drish Department of.
Dimensionality reduction. Outline From distances to points : – MultiDimensional Scaling (MDS) Dimensionality Reductions or data projections Random projections.

Dimensionality reduction. Outline From distances to points : – MultiDimensional Scaling (MDS) Dimensionality Reductions or data projections Random projections.
Face Recognition and Biometric Systems

Face Recognition and Biometric Systems
Non-linear Dimensionality Reduction CMPUT 466/551 Nilanjan Ray Prepared on materials from the book Non-linear dimensionality reduction By Lee and Verleysen,

Non-linear Dimensionality Reduction CMPUT 466/551 Nilanjan Ray Prepared on materials from the book Non-linear dimensionality reduction By Lee and Verleysen,
1 2014 AASPI Workplan Kurt J. Marfurt Kurt J. Marfurt Jamie Rich Vikram Jayaram Marcilio Matos OU AASPI Team Attribute-Assisted Seismic Processing and.

AASPI Workplan Kurt J. Marfurt Kurt J. Marfurt Jamie Rich Vikram Jayaram Marcilio Matos OU AASPI Team Attribute-Assisted Seismic Processing and.
A Comprehensive Study on Third Order Statistical Features for Image Splicing Detection Xudong Zhao, Shilin Wang, Shenghong Li and Jianhua Li Shanghai Jiao.

A Comprehensive Study on Third Order Statistical Features for Image Splicing Detection Xudong Zhao, Shilin Wang, Shenghong Li and Jianhua Li Shanghai Jiao.
Dimensionality reduction. Outline From distances to points : – MultiDimensional Scaling (MDS) – FastMap Dimensionality Reductions or data projections.

Dimensionality reduction. Outline From distances to points : – MultiDimensional Scaling (MDS) – FastMap Dimensionality Reductions or data projections.
Prénom Nom Document Analysis: Data Analysis and Clustering Prof. Rolf Ingold, University of Fribourg Master course, spring semester 2008.

Prénom Nom Document Analysis: Data Analysis and Clustering Prof. Rolf Ingold, University of Fribourg Master course, spring semester 2008.
1 Numerical geometry of non-rigid shapes Spectral Methods Tutorial. Spectral Methods Tutorial 6 © Maks Ovsjanikov tosca.cs.technion.ac.il/book Numerical.

1 Numerical geometry of non-rigid shapes Spectral Methods Tutorial. Spectral Methods Tutorial 6 © Maks Ovsjanikov tosca.cs.technion.ac.il/book Numerical.
1 Data Analysis  Data Matrix Variables ObjectsX1X1 X2X2 X3X3 …XPXP 1 2 3. n.

1 Data Analysis  Data Matrix Variables ObjectsX1X1 X2X2 X3X3 …XPXP n.
SVD and PCA COS 323. Dimensionality Reduction Map points in high-dimensional space to lower number of dimensionsMap points in high-dimensional space to.

SVD and PCA COS 323. Dimensionality Reduction Map points in high-dimensional space to lower number of dimensionsMap points in high-dimensional space to.
Flattening via Multi- Dimensional Scaling Ron Kimmel www.cs.technion.ac.il/~ron Computer Science Department Geometric Image Processing Lab Technion-Israel.

Flattening via Multi- Dimensional Scaling Ron Kimmel Computer Science Department Geometric Image Processing Lab Technion-Israel.
A Global Geometric Framework for Nonlinear Dimensionality Reduction Joshua B. Tenenbaum, Vin de Silva, John C. Langford Presented by Napat Triroj.

A Global Geometric Framework for Nonlinear Dimensionality Reduction Joshua B. Tenenbaum, Vin de Silva, John C. Langford Presented by Napat Triroj.
SVD and PCA COS 323, Spring 05. SVD and PCA Principal Components Analysis (PCA): approximating a high-dimensional data set with a lower-dimensional subspacePrincipal.

SVD and PCA COS 323, Spring 05. SVD and PCA Principal Components Analysis (PCA): approximating a high-dimensional data set with a lower-dimensional subspacePrincipal.
Manifold learning: Locally Linear Embedding Jieping Ye Department of Computer Science and Engineering Arizona State University

Manifold learning: Locally Linear Embedding Jieping Ye Department of Computer Science and Engineering Arizona State University
The Tutorial of Principal Component Analysis, Hierarchical Clustering, and Multidimensional Scaling Wenshan Wang.

The Tutorial of Principal Component Analysis, Hierarchical Clustering, and Multidimensional Scaling Wenshan Wang.
Graph Embedding: A General Framework for Dimensionality Reduction Dong XU School of Computer Engineering Nanyang Technological University

Graph Embedding: A General Framework for Dimensionality Reduction Dong XU School of Computer Engineering Nanyang Technological University
Principal Coordinate Analysis, Correspondence Analysis and Multidimensional Scaling: Multivariate Analysis of Association Matrices BIOL4062/5062 Hal Whitehead.

Principal Coordinate Analysis, Correspondence Analysis and Multidimensional Scaling: Multivariate Analysis of Association Matrices BIOL4062/5062 Hal Whitehead.
Uncertainty Maps for Seismic Images through Geostatistical Model Randomization Lewis Li, Paul Sava, & Jef Caers 27 th SCRF Affiliates’ Meeting May 8-9.

Uncertainty Maps for Seismic Images through Geostatistical Model Randomization Lewis Li, Paul Sava, & Jef Caers 27 th SCRF Affiliates’ Meeting May 8-9.

Similar presentations

Ads by Google