Fault-Fracture charachterization in OpendTect

Slides:



Advertisements
Similar presentations
13.1 Vis_2003 Data Visualization Lecture 13 Visualization of Very Large Datasets.
Advertisements

Calypso Construction Features
Tutorial 3 Refractor assignment, Analysis, Modeling and Statics
A Graph based Geometric Approach to Contour Extraction from Noisy Binary Images Amal Dev Parakkat, Jiju Peethambaran, Philumon Joseph and Ramanathan Muthuganapathy.
NSF DUE ; Module 4.3. NSF DUE ; GeoTEd Partners Module name and number.
Section 7 Mesh Control.
Visualizing Prestack and Multi-Component Data in OpendTect
The Components There are three main components of inDepth Lite, inDepth and inDepth+ Real Time Component Reporting Package Configuration Tools.
Document Image Processing
Advanced Topics in Algorithms and Data Structures Lecture 7.1, page 1 An overview of lecture 7 An optimal parallel algorithm for the 2D convex hull problem,
Attribute Illumination of Basement Faults
Smoothing Linework June 2012, Planetary Mappers Meeting.
Data Quality Class 10. Agenda Review of Last week Cleansing Applications Guest Speaker.
3D Skeletons Using Graphics Hardware Jonathan Bilodeau Chris Niski.
Advanced uses of the Mathematics attribute OpendTect Master Class June 15, 2014.
How to apply SSIS on 2D Seismic G. de Bruin. Sequence stratigraphic interpretations The sequence stratigraphic analysis comprises of 3 steps: Setup and.
Fingerprint Recognition Professor Ostrovsky Andrew Ackerman.
Packard BioScience. Packard BioScience What is ArrayInformatics?
Evaluation of MineSet 3.0 By Rajesh Rathinasabapathi S Peer Mohamed Raja Guided By Dr. Li Yang.
A Novel 2D To 3D Image Technique Based On Object- Oriented Conversion.
Earth Study 360 Technology overview
Jacinto C. Nascimento, Member, IEEE, and Jorge S. Marques
E.G.M. PetrakisBinary Image Processing1 Binary Image Analysis Segmentation produces homogenous regions –each region has uniform gray-level –each region.
Digital Image Processing - (monsoon 2003) FINAL PROJECT REPORT Project Members Sanyam Sharma Sunil Mohan Ranta Group No FINGERPRINT.
Neighborhood Operations
4. Spectral Decomposition
CGMB 314 Intro to Computer Graphics Fill Area Primitives.
UNDERSTANDING DYNAMIC BEHAVIOR OF EMBRYONIC STEM CELL MITOSIS Shubham Debnath 1, Bir Bhanu 2 Embryonic stem cells are derived from the inner cell mass.
Spatial Filtering: Basics
Image Restoration and Reconstruction (Noise Removal)
European Computer Driving Licence Syllabus version 5.0 Module 4 – Spreadsheets Chapter 22 – Functions Pass ECDL5 for Office 2007 Module 4 Spreadsheets.
Chapter 9.  Mathematical morphology: ◦ A useful tool for extracting image components in the representation of region shape.  Boundaries, skeletons,
S EGMENTATION FOR H ANDWRITTEN D OCUMENTS Omar Alaql Fab. 20, 2014.
CS 6825: Binary Image Processing – binary blob metrics
Marching Cubes: A High Resolution 3D Surface Construction Algorithm William E. Lorenson Harvey E. Cline General Electric Company Corporate Research and.
Lecture 2: Edge detection CS4670: Computer Vision Noah Snavely From Sandlot ScienceSandlot Science.
Ken YoussefiIntroduction to Engineering – E10 1. Various Blade designs Ken YoussefiIntroduction to Engineering – E10 2.
Digital Image Processing CCS331 Relationships of Pixel 1.
G52IVG, School of Computer Science, University of Nottingham 1 Edge Detection and Image Segmentation.
Chapter Five Vibration Analysis.
2D Output Primitives Points Lines Circles Ellipses Other curves Filling areas Text Patterns Polymarkers.
Calibration of curvature & coherence anomalies Example from Chicontepec, Mexico Ha T. Mai, Kurt J. Marfurt University of Oklahoma, Norman, USA Sergio Chávez-Pérez.
How to create property volumes
Digital Image Processing - (monsoon 2003) FINAL PROJECT REPORT Project Members Sanyam Sharma Sunil Mohan Ranta Group No FINGERPRINT.
CMP 131 Introduction to Computer Programming Violetta Cavalli-Sforza Week 3, Lecture 1.
Computer Graphics Rendering 2D Geometry CO2409 Computer Graphics Week 2.
Petrel Workflow Tools 5 Day Introduction Course
NA-MIC National Alliance for Medical Image Computing Slicer3 Tutorial: Registration Library Case 15 AC-PC Alignment Dominik Meier, Ron.
NA-MIC National Alliance for Medical Image Computing Diffusion Tensor Imaging tutorial Sonia Pujol, PhD Surgical Planning Laboratory.
Overview of Stark Reality Plugins for OpendTect Coming soon to a workstation near you.
By: David Gelbendorf, Hila Ben-Moshe Supervisor : Alon Zvirin
October 1, 2013Computer Vision Lecture 9: From Edges to Contours 1 Canny Edge Detector However, usually there will still be noise in the array E[i, j],
2D Output Primitives Points Lines Circles Ellipses Other curves Filling areas Text Patterns Polymarkers.
Computing Attributers on Depth-Migrated Data Name : Tengfei Lin Major : Geophysics Advisor : Kurt J. Marfurt AASPI,The University of Oklahoma 1.
Kuwait Foreign Petroleum Exploration Co. K.S.C. A Subsidiary of Kuwait Petroleum Corporation Kuwait Foreign Petroleum Exploration Co. K.S.C. A Subsidiary.
Image Segmentation Nitin Rane. Image Segmentation Introduction Thresholding Region Splitting Region Labeling Statistical Region Description Application.
Tracking Groups of People for Video Surveillance Xinzhen(Elaine) Wang Advisor: Dr.Longin Latecki.
Course 5 Edge Detection. Image Features: local, meaningful, detectable parts of an image. edge corner texture … Edges: Edges points, or simply edges,
Chapter 6 Skeleton & Morphological Operation. Image Processing for Pattern Recognition Feature Extraction Acquisition Preprocessing Classification Post.
Topical Analysis and Visualization of (Network) Data Using Sci2 Ted Polley Research & Editorial Assistant Cyberinfrastructure for Network Science Center.
What you need: In order to use these programs you need a program that sends out OSC messages in TUIO format. There are a few options in programs that.
1 Berger Jean-Baptiste
Viewshed Analysis A viewshed refers to the portion of the land surface that is visible from one or more viewpoints. The process for deriving viewsheds.
April 21, 2016Introduction to Artificial Intelligence Lecture 22: Computer Vision II 1 Canny Edge Detector The Canny edge detector is a good approximation.
Date of download: 10/11/2017 Copyright © ASME. All rights reserved.
Digital Image Processing - (monsoon 2003) FINAL PROJECT REPORT
Intelligent Interpretation: From Here to Where?
Volumetric aberrancy: a complement to coherence and curvature
EE4271 VLSI Design, Fall 2016 VLSI Channel Routing.
Classes of seismic attributes?
Presentation transcript:

Fault-Fracture charachterization in OpendTect Version 5.0 OpendTect Master Class June 15, 2014

Outline Introduction Automatic Fault Extraction Algorithm Interface Examples New Fracture Attributes Overview

Introduction This presentation covers the concepts/workflows for Automatic fault extraction in OpendTect Two new fracture related attributes System Requirements: For visualization, a good system is required. Multicore processor RAM 8GB or higher, and a good graphics card (>1GB) Licence Requirements Automatic Fault Extraction Dip-Steering LICENSE New Fracture Attributes Dip-Steering LICENSE

Outline Introduction Automatic Fault Extraction Algorithm Interface Examples New Fracture Attributes Overview

Finger Vein Pattern Technique Introduction Used typically for fingerprint data processing Biomedical technique extended to seismic

Finger Vein Pattern Technique Algorithm for automatically tracking faults Input: A discontinuity volume with an enhanced fault pattern (e.g. Coherence or Similarity) Curvature based score calculation for 2D profiles oriented along various azimuths (per Z-slice) Extract connected components on each 2D profile (per Z-slice) Apply thinning, merging algorithms on each connected component to form sticks Sort and group sticks Output a set of faults or a fault stick-set

Compute Score which includes both magnitude and width of fault anomaly Finger Vein Pattern Technique Algorithm for automatically tracking faults Z-slice through a discontinuity volume, e.g. Coherence Compute Curvature of the discontinuity attribute, along a 2-D profile (AA`) oriented along azimuth ‘j’ Compute Score which includes both magnitude and width of fault anomaly Assign Score to the 2-D profile AA`

Finger Vein Pattern Technique Algorithm for automatically tracking faults Compute scores for all 2-D profiles along ‘4’ azimuths to get a “Capability slice” V(x, y) Compute “Confidence slices” along different azimuths and choose the one with max value. Move to next Z-slice

Outline Introduction Automatic Fault Extraction Algorithm Interface Examples New Fracture Attributes Overview

Fault Extraction Start Position Fault extraction produces two sets of outputs: Volumes: fault scores, dip and azimuth Faults: sticks or planes Volumes launch: Processing ->Create Seismic Output->Volume Builder Faults launch: Processing->Fault Extraction Volume Builder UI

Fault Auto Extraction Fault Planes User Interface The new Fault Auto Extraction tool is under the Processing menu General threshold parameter (0) Vertical parameters: Min sticks per fault (1) and Min vertical overlap rate (3) Horizontal (per Z-slice) parameters: Min fault length (4), Search step-out (2) and optionally Merging faults (5) 1 2 3 4 7

Fault Auto Extraction Interface: Parameter explanation Example Z-slice through a similarity volume. Note the faults lineaments with low similarity values (black). The “Minimum Fault Length per Z-slice” is the horizontal length of the fault on any Z-slice. 4 The “Minimum Number of Sticks” is the min number of Z-slices a fault must pass through, defines min vertical extent of fault 1

Fault Auto Extraction Interface: Parameter explanation The “Search stepout between Z-slices” is the the horizontal displacement of the searching window over the inline/crossline direction when extracting the fault surfaces Zslice-by-Zslice 2 The “Min vertical overlap rate” defines the minimum overlap between anomalies on adjacent Z-slices, in order for them to be considered part of one single fault. 3

Fault Auto Extraction Interface: Parameter explanation Z-Slice 1 1 1 Z-Slice 5 The “Minimum sticks per fault” is the min number of Z-slices a fault must pass through, i.e. it defines min vertical extent of fault.

Fault Auto Extraction Interface: Parameter explanation Z-Slice 1 2 1 2 Z-Slice 5 The “Search stepout between Z-slices” is the horizontal displacement of the searching window over the inline/crossline direction when extracting the fault surfaces Zslice-by-Zslice

Fault Auto Extraction Interface: Parameter explanation Z-Slice 1 1 2 3 3 Z-Slice 5 The “Min vertical overlap rate” defines the minimum overlap between anomalies on adjacent Z-slices, in order for them to be considered part of one single fault.

Fault Auto Extraction Interface: Parameter explanation Z-Slice 1 4 1 2 3 4 Z-Slice 5 The “Minimum fault Length per Z-slice” is the minimum horizontal length of the fault on any Z-slice.

Fault Auto Extraction Interface: Parameter explanation 5

Fault Auto Extraction Interface: Parameter explanation Either a “Fault Stick Set” or individual “Faults” can be outputted. 6 1 2 The “Number of top faults” is the maximum number of tracked faults on any Z-slice. In case of noisy data, use of a small number here may be helpful. 3 7 4 5 6 7

Outline Introduction Automatic Fault Extraction Algorithm Interface Examples New Fracture Attributes Overview

Fault tracker similarity Fault score Fault azimuth grey Biggest fault sticks All faults Volume components similarity Fault score Fault azimuth grey Binary faults 90% Binary faults 95% Fault azimuth color Volume components Biggest fault sticks All faults Sponsored by:

Fault Auto Extraction Example: Gulf of Mexico Inline showing stacked seismic data after Fault Enhancement Filter application. A min similarity volume, computed from this fault enhanced seismic volume, is used as input for Auto Fault Extraction algorithm.

Fault Auto Extraction Example: Gulf of Mexico Inline showing stacked seismic data after Fault Enhancement Filter application with automatically extracted faults on top. Fault points

Fault Auto Extraction Example: Gulf of Mexico Z-slice at 400ms showing stacked seismic data after Fault Enhancement Filter application.

Fault Auto Extraction Example: Gulf of Mexico Z-slice at 400ms showing Min Similarity computed from fault enhanced seismic.

Fault Auto Extraction Example: Gulf of Mexico Z-slice at 400 ms showing Min Similarity computed from fault enhanced seismic with automatically extracted faults.

Outline Introduction Automatic Fault Extraction Algorithm Interface Examples New Fracture Attributes Overview

New Fracture Attributes Overview Two new qualitative fracture characterization attributes, Fracture Proximity and Fracture Density, are going to be available in OpendTect v5.0 Fracture Proximity improves visualization of potential fracture anomalies. It computes the lateral distance (i.e. along Z-slice) from a trace location classified as a fracture. Whether a particular trace can be defined as being part of a fracture, is determined by a user-specified threshold, on various curvature/coherence related attributes such as Max Curvature. Fracture Density attribute is useful in pin-pointing locations with maximum fracture activity, within a user-defined radius. This “radius” can for example be linked to fracking radius for drilling. It computes the ratio of “number of traces classified as being fractures” to the “total number of traces present”, in a circle of given radius along Z-slices.

Outline Introduction Automatic Fault Extraction Algorithm Interface Examples New Fracture Attributes Overview

New Fracture Attributes Interface Input data should be a discontinuity attribute, e.g. Similarity & Curvature 1 Threshold value of input discontinuity attribute above which a fracture anomaly is expected 1 2 2 3 Choose to output either “Fracture Proximity” or “Fracture Density” 3 For “Fracture Density” a radius for scanning and computing the density of fracture anomalies, is also required. 4 4

Outline Introduction Automatic Fault Extraction Algorithm Interface Examples New Fracture Attributes Overview

New dip-steered attributes Example: Gulf of Mexico Max curvature is a possible input for Fracture Proximity and Density attributes. Input: Maximum curvature Inl/Crl stepout: 2 Steering input : Detailed steering Z-slice at 400 ms

New Fracture Attributes Example: Gulf of Mexico Max curvature value of more than 0.004 denotes a possible fracture. The distance from all those traces where max curvature is higher than the threshold is computed by the Fracture Proximity attribute. Fracture Proximity Input: Maximum curvature Fracture threshold: 0.004 Z-slice at 400 ms Colorbar unit = Meters

New Fracture Attributes Example: Gulf of Mexico Max curvature value of more than 0.004 denotes a possible fracture. The ratio of all those traces where max curvature is higher than the threshold to the total number of traces, present in a circle of radius 400m, is computed by the Fracture Density attribute. Fracture Density Input: Maximum curvature Fracture threshold: 0.004 Radius: 400 m Z-slice at 400 ms