Automatic Fault Detection for 3D Seismic Data
|
|
- Merryl Kennedy
- 6 years ago
- Views:
Transcription
1 Atomatic Falt Detection for 3D Seismic Data David Gibson 1, Michael Spann 1 and Jonathan Trner 1 School of Electronic Engineering, Universit of Birmingham, Edgbaston, Birmingham, B15 TT, U.K. {gibsond, spannm}@eee.bham.ac.k School of Geograph and Earth Sciences, Universit of Birmingham, Edgbaston, Birmingham, B15 TT, U.K. J.P.Trner@bham.ac.k Abstract. A novel approach to the atomatic detection of falt srface images in 3D seismic datasets is presented. Based on the premise that seismic falting introdces discontinities into the rock laering (that is, the horizons), a coherenc measre is sed to detect points of significant horizon discontinit. A highest confidence first (HCF) merging strateg is then combined with a fleible srface model to estimate the 3D falt srfaces iterativel. 1. Introdction Largel felled b the petrolem indstr, major resorces are targeted at the problem of imaging ndergrond rock strctres. Using acostic reflection technolog, large 3D datasets can be generated showing the changes in acostic impedance as a fnction of depth. Most seismic reflections in a 3D seismic dataset are manifestations of rock laering, or horizons. These represent the sbhorizontal sedimentar laering within petrolem-bearing sedimentar basins. A tpical vertical D slice throgh a 3D data set is shown in Fig. 1. (a). In this, the depth below grond is shown verticall, with the horizontal ais representing a horizontal position on the grond. The barcode-like pattern clearl shows the sedimentar laers of the rocks. To the geologicall-trained ee the patterns present in these 3D data sets provide sefl insights into the rock formation and geological strctre, as well as sch things as the location and shape of geological strctres in which hdrocarbons are trapped. De to the compleit and size of these data sets it is perhaps not srprising that image processing techniqes have been broght to bear on a nmber of 3D seismic data interpretation problems. Most notable of these are horizon-trackers [1]. In this contet, horizons are srfaces representing individal sedimentar laers of rock. Referring to Fig. 1(a), each black and white stripe represents an horizon (noting of corse that the horizon is 3D not D). A nmber of horizon trackers have been sccessfll developed, and commercial prodcts are available eploiting this technolog. Research has now moved to the more difficlt problem of seismic faltdetection. A falt is cased b the near-vertical, relative movement of adjacent rocks, reslting in the termination of horizons. This effect is shown in Fig. 1(b). 81
2 (a) (b) Fig. 1. (a) D slice of 3D seismic data set, (b) Illstration of a seismic falt (highlighted) Seismic data sets tpicall contain a large nmber of falts at man different spatial scales. Knowledge of the location of the falts is critical to nderstanding a geological sstem. One effect that falts have, which is of real commercial significance, is that the act as membranes to the movement of hdrocarbons. Therefore having a good nderstanding of the falt positions is critical for the effective planning of drilling sites in order to maimise otpt efficienc. However, despite the significant progress in the development of horizon atotrackers, crrent approaches for ëpickingí falts are largel manal, and involve laborios handpicking of discontinities on a slice-b-slice basis, one falt at a time. This is time consming reslting in hndreds of man-hors of work, performed b trained geologists. It is estimated that for ever si months saved in the work leading p to the onset of prodction from a new oilfield, 5% will be saved from the total prodction bill. Hence, there is a strong financial imperative for this work. Or proposal is for an atomatic strateg for falt srface detection [,3]. In practice this proves to be an etremel difficlt problem to solve de to noise, imaging artefacts, and large nmbers of interacting falts at different spatial scales.. Proposed Approach The proposed approach aims to eploit the idea that the presence of seismic falting will reslt in discontinities in the horizons. Detection of the consistenc of the horizons constittes the first step of the process. Following this, small planar patches representing small parts of the falt srfaces are generated. Finall, these small planar patches are merged into larger srfaces, sing a highest confidence first (HCF) merging strateg. These steps are described in more detail in the following sections. 8
3 .1 Semblance Matching Firstl we make the assmption that seismic horizons can be modelled as locall planar, in the absence of seismic falting. For a given point (,,z) on the image, this assmption is then tested. This is done b considering a series of h slices of seismic data, centred arond (,,z), orientated with a normal n. This is illstrated in Fig.. Fig.. Illstration of h slices of data, orientated with normal n, centred arond point (,,z) The data contained in the w b w arra of interpolated data for slice r (0 r h-1) is represented b the vector v r. A normalised measre of the data variabilit averaged over the h slices is then compted sing: S h 1 ( vr ) r= 0 = 1 h h ( v r ) r= 0 where the normal n is the estimated localised normal to the seismic horizons estimated from the strctral tensor [5] as follows : T = z σ G σ z z z z T = T * () where,, z, are the respective seismic image gradients, G σ is a Gassian kernel, ë*í is the convoltion operation, and n is the eigenvector corresponding to the largest eigenvale of T σ. (1) 83
4 The net reslt is a semblance map S which gives a measre of horizon continit, with S(,,z)=0 representing the worst case fit, and S(,,z)=1 indicating the ideal horizon continit case. This semblance map, however, is onl based on local constraints, given b the dimensions of the bo sed for the estimation (h*w*w). As falt srfaces, b definition, are not isolated phenomena, we can se this fact as an addition contetal constraint. In practice this can be achieved b appling a directed spatial filter to the semblance map S, as a post-processing step. The filter kernel is directed to concentrate the filtering action along the direction of the falt srfaces, which in trn is estimated sing the same procedre as that sed to estimate the normal to the horizons (sing eqation (), bt this time sing the semblance map and not the raw seismic data). The filtered reslt, S f is illstrated alongside the original seismic slice in Fig. 3, and shows good correlation between the areas of faltiness on the left image, with darkened areas (lower semblance match) on the right image. (a) (b) Fig. 3. (a) D slice of seismic data, (b) Eqivalent semblance match (darker areas indicate increasing horizon discontinit). Patch Estimation The semblance data is then thresholded against a pre-defined threshold. This is done on a point-b-point basis, with points having a semblance vale below a predefined threshold being labelled as falt points. This 3D binar map of falt points is then spatiall sb-sampled to give a set of seed points as shown in Fig
5 Fig. 4. Seed points overlaid onto a seismic slice Given a set of seed points, these can be groped into small planar patches, representing small sections of a falt srface. More formall, for a set of seed points P, a neighborhood relationship is defined, so that two points p 1 and p taken from P are neighbors if the fall within a spatial distance d. p1 Ν( p ) and p Ν( p 1 ) if p 1 p < d (3) where N(p ) represents the set of points neighboring p. A proposed planar model centred arond each point, p P is generated based on p and all of the neighbors of p. A compatibilit fnction C(p ) gives an indication of how well a grop of points, centred on p, wold be represented b a planar model, where, C( p ) = p N ( p ) C( p, p ) # N( p ) This reslts in the mean compatibilit vale between p and all of its neighbors, where C(p, p ) defines the compatibilit of a pair of points p and p and can be calclated as: ( 1 n. r n. r )( n. n ) C( p, p ) = (5) where n and n are the estimated normal nit-vectors to the points p and p respectivel (as calclated earlier), and r is the nit position vector between p and p. C(p, p ) tends towards nit when the estimated srface normals to the points p, and p line p, and are perpendiclar to the position vector between p, and p. Starting with the planar model with the corresponding highest confidence vale, the planar model is constrcted, and the points removed from P. This is repeated ntil the confidence vale of all remaining clsters is below a pre-specified threshold. (4) 85
6 .3 Srface Merging Althogh a planar model can well describe a small patch of a mch larger falt srface, it is inadeqate for describing larger segments, or complete falts. To describe larger falt srfaces we make se of a combined parametric and residal field [4], the parametric model (in or case planar) models the basic strctre of the falt srface, with the residal field modelling the srface irreglarities and crvatre. More formall, a planar model is described b a set of vectors {Ω, Ω, Ω n, Ω o }, where Ω, Ω and Ω n, are mtall perpendiclar vectors, with Ω n representing the normal to the plane. A known point on the plane is denoted Ω o, and represents the approimate centre of the sbseqent falt srface model. This is illstrated in Fig. 5(a). In combination with this planar model is a residal field, constrcted sing a D mesh of vectors, normal to the plane and of varing lengths (see Fig. 5(b)). Ω n [ Ω o + i Ω + j Ω ] + fi, j Ω n Ω Ω o Ω (a) Ω + i Ω + j Ω ] [ o i j (b) Fig. 5. (a) Illstration of the planar model, (b) Planar model pls residal mesh field The resltant srface is then formed b interpolating this mesh, an illstrated in Fig. 6. Fig. 6. Illstration of the srface formation as an interpolation of the residal field overlaid onto the planar model 86
7 Given a set a points, P, a srface model can be generated b firstl compting the planar model based on a simple least sqares fit of the points in P. The distance of each point p P from the planar srface is then compted, and is denoted ε. The residal field can be described as a mesh of vectors M, as shown b the arrows in Fig. 5(b). The end position of the (i, j) th vector in M will then be of the form, m Ω (6) i, j = [ Ω o + i Ω + j Ω ] + f i, j where f i,j represents the length of the vector m i,j, [Ω o +i Ω + j Ω ] is the start position, on the plane, of the vector corresponding to the inde (i, j), and is a constant which specifies the residal field mesh spacing. The vales of f i,j for all vales of i and j can then be calclated as a weighted average, f i, j = p P ε w( p ) p P w( p ) where w(p ) is a weighting fnction which diminishes with distance, n w ( ) = ep( ω / σ ) (8) p for which ω is the distance between the point p and the point [Ω o +i Ω + j Ω ]. The net reslt is a completel defined falt srface made p of a combination of the planar and residal models. Given a srface model definition, a merging strateg based on the HCF principle is adopted, in mch the same manner as in the last section. Firstl, all of the planar patches from the previos section are promoted into srfaces. All possible pairs of srfaces are considered for merging, with a compatibilit fnction for two srfaces s 1 and s defined as, ( ε ( s1) ) + mean( ε( s) ) ( ε( s & s ) ) K + mean C( s1, s) = (9) mean 1 where mean( ε(s ) ) is the mean residal field magnitde vale, (s 1 & s ) represents the combination of srfaces, and K is a constant which encorages small srfaces to merge. The merging of srfaces is contined iterativel ntil the confidence vale falls below a predefined vale. (7) 3. Reslts Natral falt sstems are present at a wide range of spatial scales, from falts that cover the entire data set nder consideration, to falts that are smaller than the spatial resoltion of the data. Or aim is to estimate the set of large falts that make p the general strctre of the falt field. In order to evalate the performance of the method a manall labelled set of falt srfaces have been identified b a geologist. An eample set or reslts showing vertical D slices of the seismic data are presented 87
8 providing a comparison between the atomaticall generated reslts prodced sing the proposed method, with manall labelled images. These reslts are shown in Fig. 7, with the atomaticall generated and manall generated reslts overlaid in white and black respectivel. It shold be noted, of corse, that the lines shown on the figres are the reslt of slicing the srfaces. In effect, the srfaces can be imagined coming ot of, and going into the page. (a) Fig. 7. (a) Estimated falts, (b) Eqivalent, manall labelled falts (b) As can be seen from the comparative reslts there is a broad agreement between the placement of man of the falts from the atomatic detection and manall labelled methods. A 3D view of the detected srfaces along with the eqivalent manall labelled falts is shown in Fig. 8. The proposed method performs well at detecting the larger falts, althogh it misses some of the smaller, less well-defined falts. Problems can also occr if two falts are spatiall ver close together. This can reslt in over-merging of falts, the net reslt being one srface poorl representing two falts. 4. Conclsions and Ftre Work A method has been presented to tackle the difficlt and resorce consming task of falt detection in 3D seismic datasets. Based on a mlti-stage approach, it first detects points of horizon discontinit, and progressivel grops these points into larger srfaces. The final srface representation is a combined parametric and residal field model, which allows for a highl fleible srface representation. Comparative reslts with manall labelled falts show promising reslts. One of the ke qestions not addressed in this work is that of combining the atomatic falt detection approach with some element of hman inpt, to give a semiatomatic falt detection tool. We believe that sch an abilit to edit, refine, direct, or impose prior constraints on the problem cold provide considerable prodctivit gains over and above a manal approach, whilst allowing the fleibilit reqired for comple data sets with low signal to noise ratio and mltiple interacting falting. 88
9 (a) Fig. 8. (a) Estimated falts, (b) Eqivalent, manall labelled falts (b) 89
10 References 1. Arnhammer, M., Tˆ nnies, K.D., Maoral, R.: A Genetic Algorithm for Constrained Seismic Horizon Correlation. Proceedings of the International Conference on Compter Vision Pattern Recognition and Image Processing (CVPRIP 00), pp , Drham, North Carolina USA, 8-14 March, 00.. Randen, T., Pedersen, S.I., Signer, C., Snneland, L.: Image Processing Tools for Geologic Unconformit Etraction. IEEE SYMPOSIUM, Sem GjestegÂrd, Asker, Norge, 9-11, September, Tingdahl, K.T., Steen, ÿ., Meldahl, P., Herald, J.: Semi-atomatic detection of falts in 3-D seismic signals. SEG/San Antonio Black, M.J., Jepson, A.: Estimating Optical Flow in Segmented Images sing Variable- Order Parametric Models with Local Deformations. IEEE Transactions on Pattern Analsis and Machine Intelligence, Vol. 18, No. 10, Oct. 1996, pp Fehmers, G., Hocker, F.W.: Fast Strctral Interpretation with Strctre-orientated Filtering. Geophsics, Vol. 68, No. 4, Agst, 003, pp
Pavlin and Daniel D. Corkill. Department of Computer and Information Science University of Massachusetts Amherst, Massachusetts 01003
From: AAAI-84 Proceedings. Copyright 1984, AAAI (www.aaai.org). All rights reserved. SELECTIVE ABSTRACTION OF AI SYSTEM ACTIVITY Jasmina Pavlin and Daniel D. Corkill Department of Compter and Information
More informationEvaluating Influence Diagrams
Evalating Inflence Diagrams Where we ve been and where we re going Mark Crowley Department of Compter Science University of British Colmbia crowley@cs.bc.ca Agst 31, 2004 Abstract In this paper we will
More informationFault Tolerance in Hypercubes
Falt Tolerance in Hypercbes Shobana Balakrishnan, Füsn Özgüner, and Baback A. Izadi Department of Electrical Engineering, The Ohio State University, Colmbs, OH 40, USA Abstract: This paper describes different
More informationImage Enhancement in the Frequency Domain Periodicity and the need for Padding:
Prepared B: Dr. Hasan Demirel PhD Image Enhancement in the Freqenc Domain Periodicit and the need for Padding: Periodicit propert of the DFT: The discrete Forier Transform and the inverse Forier transforms
More informationPARAMETER OPTIMIZATION FOR TAKAGI-SUGENO FUZZY MODELS LESSONS LEARNT
PAAMETE OPTIMIZATION FO TAKAGI-SUGENO FUZZY MODELS LESSONS LEANT Manfred Männle Inst. for Compter Design and Falt Tolerance Univ. of Karlsrhe, 768 Karlsrhe, Germany maennle@compter.org Brokat Technologies
More informationNormalized averaging using adaptive applicability functions with application in image reconstruction from sparsely and randomly sampled data
Normalized averaging sing adaptive applicability fnctions with application in image reconstrction from sparsely and randomly sampled data Tan Q. Pham, Lcas J. van Vliet Pattern Recognition Grop, Faclty
More informationBias of Higher Order Predictive Interpolation for Sub-pixel Registration
Bias of Higher Order Predictive Interpolation for Sb-pixel Registration Donald G Bailey Institte of Information Sciences and Technology Massey University Palmerston North, New Zealand D.G.Bailey@massey.ac.nz
More informationNash Convergence of Gradient Dynamics in General-Sum Games. Michael Kearns.
Convergence of Gradient Dynamics in General-Sm Games Satinder Singh AT&T Labs Florham Park, NJ 7932 bavejaresearch.att.com Michael Kearns AT&T Labs Florham Park, NJ 7932 mkearnsresearch.att.com Yishay
More information10.2 Solving Quadratic Equations by Completing the Square
. Solving Qadratic Eqations b Completing the Sqare Consider the eqation We can see clearl that the soltions are However, What if the eqation was given to s in standard form, that is 6 How wold we go abot
More informationImage Compression Compression Fundamentals
Compression Fndamentals Data compression refers to the process of redcing the amont of data reqired to represent given qantity of information. Note that data and information are not the same. Data refers
More informationThe effectiveness of PIES comparing to FEM and BEM for 3D elasticity problems
The effectiveness of PIES comparing to FEM and BEM for 3D elasticit problems A. Boltc, E. Zienik, K. Sersen Faclt of Mathematics and Compter Science, Universit of Bialstok, Sosnowa 64, 15-887 Bialstok,
More informationNetworks An introduction to microcomputer networking concepts
Behavior Research Methods& Instrmentation 1978, Vol 10 (4),522-526 Networks An introdction to microcompter networking concepts RALPH WALLACE and RICHARD N. JOHNSON GA TX, Chicago, Illinois60648 and JAMES
More informationIDENTIFICATION OF THE AEROELASTIC MODEL OF A LARGE TRANSPORT CIVIL AIRCRAFT FOR CONTROL LAW DESIGN AND VALIDATION
ICAS 2 CONGRESS IDENTIFICATION OF THE AEROELASTIC MODEL OF A LARGE TRANSPORT CIVIL AIRCRAFT FOR CONTROL LAW DESIGN AND VALIDATION Christophe Le Garrec, Marc Hmbert, Michel Lacabanne Aérospatiale Matra
More informationPOWER-OF-2 BOUNDARIES
Warren.3.fm Page 5 Monday, Jne 17, 5:6 PM CHAPTER 3 POWER-OF- BOUNDARIES 3 1 Ronding Up/Down to a Mltiple of a Known Power of Ronding an nsigned integer down to, for eample, the net smaller mltiple of
More informationComputer-Aided Mechanical Design Using Configuration Spaces
Compter-Aided Mechanical Design Using Configration Spaces Leo Joskowicz Institte of Compter Science The Hebrew University Jersalem 91904, Israel E-mail: josko@cs.hji.ac.il Elisha Sacks (corresponding athor)
More informationChapter 6: Pipelining
CSE 322 COPUTER ARCHITECTURE II Chapter 6: Pipelining Chapter 6: Pipelining Febrary 10, 2000 1 Clothes Washing CSE 322 COPUTER ARCHITECTURE II The Assembly Line Accmlate dirty clothes in hamper Place in
More informationReal-time mean-shift based tracker for thermal vision systems
9 th International Conference on Qantitative InfraRed Thermography Jly -5, 008, Krakow - Poland Real-time mean-shift based tracker for thermal vision systems G. Bieszczad* T. Sosnowski** * Military University
More informationCS 4204 Computer Graphics
CS 424 Compter Graphics Crves and Srfaces Yong Cao Virginia Tech Reference: Ed Angle, Interactive Compter Graphics, University of New Mexico, class notes Crve and Srface Modeling Objectives Introdce types
More informationReview Multicycle: What is Happening. Controlling The Multicycle Design
Review lticycle: What is Happening Reslt Zero Op SrcA SrcB Registers Reg Address emory em Data Sign etend Shift left Sorce A B Ot [-6] [5-] [-6] [5-] [5-] Instrction emory IR RegDst emtoreg IorD em em
More informationTu P7 15 First-arrival Traveltime Tomography with Modified Total Variation Regularization
T P7 15 First-arrival Traveltime Tomography with Modified Total Variation Reglarization W. Jiang* (University of Science and Technology of China) & J. Zhang (University of Science and Technology of China)
More informationMethod to build an initial adaptive Neuro-Fuzzy controller for joints control of a legged robot
Method to bild an initial adaptive Nero-Fzzy controller for joints control of a legged robot J-C Habmremyi, P. ool and Y. Badoin Royal Military Academy-Free University of Brssels 08 Hobbema str, box:mrm,
More informationMulti-lingual Multi-media Information Retrieval System
Mlti-lingal Mlti-media Information Retrieval System Shoji Mizobchi, Sankon Lee, Fmihiko Kawano, Tsyoshi Kobayashi, Takahiro Komats Gradate School of Engineering, University of Tokshima 2-1 Minamijosanjima,
More informationMultiple-Choice Test Chapter Golden Section Search Method Optimization COMPLETE SOLUTION SET
Mltiple-Choice Test Chapter 09.0 Golden Section Search Method Optimization COMPLETE SOLUTION SET. Which o the ollowing statements is incorrect regarding the Eqal Interval Search and Golden Section Search
More informationFast Obstacle Detection using Flow/Depth Constraint
Fast Obstacle etection sing Flow/epth Constraint S. Heinrich aimlerchrylser AG P.O.Box 2360, -89013 Ulm, Germany Stefan.Heinrich@aimlerChrysler.com Abstract The early recognition of potentially harmfl
More informationAppearance Based Tracking with Background Subtraction
The 8th International Conference on Compter Science & Edcation (ICCSE 213) April 26-28, 213. Colombo, Sri Lanka SD1.4 Appearance Based Tracking with Backgrond Sbtraction Dileepa Joseph Jayamanne Electronic
More informationBlended Deformable Models
Blended Deformable Models (In IEEE Trans. Pattern Analysis and Machine Intelligence, April 996, 8:4, pp. 443-448) Doglas DeCarlo and Dimitri Metaxas Department of Compter & Information Science University
More informationOptimal Sampling in Compressed Sensing
Optimal Sampling in Compressed Sensing Joyita Dtta Introdction Compressed sensing allows s to recover objects reasonably well from highly ndersampled data, in spite of violating the Nyqist criterion. In
More informationAn Optimization of Granular Network by Evolutionary Methods
An Optimization of Granlar Networ by Evoltionary Methods YUN-HEE HAN, KEUN-CHANG KWAK* Dept. of Control, Instrmentation, and Robot Engineering Chosn University 375 Seos-dong, Dong-g, Gwangj, 50-759 Soth
More informationOn the Computational Complexity and Effectiveness of N-hub Shortest-Path Routing
1 On the Comptational Complexity and Effectiveness of N-hb Shortest-Path Roting Reven Cohen Gabi Nakibli Dept. of Compter Sciences Technion Israel Abstract In this paper we stdy the comptational complexity
More informationFINITE ELEMENT APPROXIMATION OF CONVECTION DIFFUSION PROBLEMS USING GRADED MESHES
FINITE ELEMENT APPROXIMATION OF CONVECTION DIFFUSION PROBLEMS USING GRADED MESHES RICARDO G. DURÁN AND ARIEL L. LOMBARDI Abstract. We consider the nmerical approximation of a model convection-diffsion
More informationHardware-Accelerated Free-Form Deformation
Hardware-Accelerated Free-Form Deformation Clint Cha and Ulrich Nemann Compter Science Department Integrated Media Systems Center University of Sothern California Abstract Hardware-acceleration for geometric
More informationOPTI-502 Optical Design and Instrumentation I John E. Greivenkamp Homework Set 7 Fall, 2018
Assigned: 10/10/18 Lectre 15 De: 10/17/18 Lectre 17 Midterm Exam: Wednesda October 24 (Lectre 19) The eqation sheet for the exam has been posted on the corse website. This eqation sheet will be inclded
More informationThe extra single-cycle adders
lticycle Datapath As an added bons, we can eliminate some of the etra hardware from the single-cycle path. We will restrict orselves to sing each fnctional nit once per cycle, jst like before. Bt since
More informationA Hybrid Weight-Based Clustering Algorithm for Wireless Sensor Networks
Open Access Library Jornal A Hybrid Weight-Based Clstering Algorithm for Wireless Sensor Networks Cheikh Sidy Mohamed Cisse, Cheikh Sarr * Faclty of Science and Technology, University of Thies, Thies,
More informationSwitched state-feedback controllers with multi-estimators for MIMO systems
Proceedings of the th WEA Int Conf on COMPUTATIONAL INTELLIGENCE MAN-MACHINE YTEM AND CYBERNETIC Venice Ital November - 6 89 witched state-feedback controllers with mlti-estimators for MIMO sstems LIBOR
More informationOPTI-502 Optical Design and Instrumentation I John E. Greivenkamp Homework Set 9 Fall, 2018
OPTI-502 Optical Design and Instrmentation I John E. Greivenkamp Assigned: 10/31/18 Lectre 21 De: 11/7/18 Lectre 23 Note that in man 502 homework and exam problems (as in the real world!!), onl the magnitde
More informationA GENERIC MODEL OF A BASE-ISOLATED BUILDING
Chapter 5 A GENERIC MODEL OF A BASE-ISOLATED BUILDING This chapter draws together the work o Chapters 3 and 4 and describes the assembly o a generic model o a base-isolated bilding. The irst section describes
More informationCS 450: COMPUTER GRAPHICS REVIEW: CLIPPING SPRING 2015 DR. MICHAEL J. REALE
CS 45: COMPUTER GRAPHICS REVIEW: CLIPPING SPRING 215 DR. MICHAEL J. REALE CLIPPING Clipping = removing part or all of the primitives otside of the clipping volme/window Clipping volme in OpenGL nit cbe
More informationEECS 487: Interactive Computer Graphics f
Interpolating Key Vales EECS 487: Interactive Compter Graphics f Keys Lectre 33: Keyframe interpolation and splines Cbic splines The key vales of each variable may occr at different frames The interpolation
More informationAUTOMATIC REGISTRATION FOR REPEAT-TRACK INSAR DATA PROCESSING
AUTOMATIC REGISTRATION FOR REPEAT-TRACK INSAR DATA PROCESSING Mingsheng LIAO, Li ZHANG, Zxn ZHANG, Jiangqing ZHANG Whan Technical University of Srveying and Mapping, Natinal Lab. for Information Eng. in
More informationThe multicycle datapath. Lecture 10 (Wed 10/15/2008) Finite-state machine for the control unit. Implementing the FSM
Lectre (Wed /5/28) Lab # Hardware De Fri Oct 7 HW #2 IPS programming, de Wed Oct 22 idterm Fri Oct 2 IorD The mlticycle path SrcA Today s objectives: icroprogramming Etending the mlti-cycle path lti-cycle
More informationReview: Computer Organization
Review: Compter Organization Pipelining Chans Y Landry Eample Landry Eample Ann, Brian, Cathy, Dave each have one load of clothes to wash, dry, and fold Washer takes 3 mintes A B C D Dryer takes 3 mintes
More informationConstrained Routing Between Non-Visible Vertices
Constrained Roting Between Non-Visible Vertices Prosenjit Bose 1, Matias Korman 2, André van Renssen 3,4, and Sander Verdonschot 1 1 School of Compter Science, Carleton University, Ottawa, Canada. jit@scs.carleton.ca,
More informationREPLICATION IN BANDWIDTH-SYMMETRIC BITTORRENT NETWORKS. M. Meulpolder, D.H.J. Epema, H.J. Sips
REPLICATION IN BANDWIDTH-SYMMETRIC BITTORRENT NETWORKS M. Melpolder, D.H.J. Epema, H.J. Sips Parallel and Distribted Systems Grop Department of Compter Science, Delft University of Technology, the Netherlands
More informationUncertainty Determination for Dimensional Measurements with Computed Tomography
Uncertainty Determination for Dimensional Measrements with Compted Tomography Kim Kiekens 1,, Tan Ye 1,, Frank Welkenhyzen, Jean-Pierre Krth, Wim Dewlf 1, 1 Grop T even University College, KU even Association
More informationAdvanced Techniques for Predicting Mechanical Product Design via COMSOL Multiphysics
Advanced Techniqes for Predicting Mechanical Prodct Design via COMSOL Mltiphsics Shobing Zhang 1 1 CAEaid, Inc. *Corresponding athor: 184 Jeffs Ln, Astin, TX 78717, shobing.hang@caeaid.com Abstract: Mechanical
More informationPicking and Curves Week 6
CS 48/68 INTERACTIVE COMPUTER GRAPHICS Picking and Crves Week 6 David Breen Department of Compter Science Drexel University Based on material from Ed Angel, University of New Mexico Objectives Picking
More informationImage Restoration Image Degradation and Restoration
Image Degradation and Restoration hxy Image Degradation Model: Spatial domain representation can be modeled by: g x y h x y f x y x y Freqency domain representation can be modeled by: G F N Prepared By:
More informationPipelining. Chapter 4
Pipelining Chapter 4 ake processor rns faster Pipelining is an implementation techniqe in which mltiple instrctions are overlapped in eection Key of making processor fast Pipelining Single cycle path we
More informationWhat do we have so far? Multi-Cycle Datapath
What do we have so far? lti-cycle Datapath CPI: R-Type = 4, Load = 5, Store 4, Branch = 3 Only one instrction being processed in datapath How to lower CPI frther? #1 Lec # 8 Spring2 4-11-2 Pipelining pipelining
More informationSZ-1.4: Significantly Improving Lossy Compression for Scientific Data Sets Based on Multidimensional Prediction and Error- Controlled Quantization
SZ-1.4: Significantly Improving Lossy Compression for Scientific Data Sets Based on Mltidimensional Prediction and Error- Controlled Qantization Dingwen Tao (University of California, Riverside) Sheng
More informationResolving Linkage Anomalies in Extracted Software System Models
Resolving Linkage Anomalies in Extracted Software System Models Jingwei W and Richard C. Holt School of Compter Science University of Waterloo Waterloo, Canada j25w, holt @plg.waterloo.ca Abstract Program
More informationTopic Continuity for Web Document Categorization and Ranking
Topic Continity for Web ocment Categorization and Ranking B. L. Narayan, C. A. Mrthy and Sankar. Pal Machine Intelligence Unit, Indian Statistical Institte, 03, B. T. Road, olkata - 70008, India. E-mail:
More informationPlenoPatch: Patch-based Plenoptic Image Manipulation
1 PlenoPatch: Patch-based Plenoptic Image Maniplation Fang-Le Zhang, Member, IEEE, Je Wang, Senior Member, IEEE, Eli Shechtman, Member, IEEE, Zi-Ye Zho, Jia-Xin Shi, and Shi-Min H, Member, IEEE Abstract
More informationThe final datapath. M u x. Add. 4 Add. Shift left 2. PCSrc. RegWrite. MemToR. MemWrite. Read data 1 I [25-21] Instruction. Read. register 1 Read.
The final path PC 4 Add Reg Shift left 2 Add PCSrc Instrction [3-] Instrction I [25-2] I [2-6] I [5 - ] register register 2 register 2 Registers ALU Zero Reslt ALUOp em Data emtor RegDst ALUSrc em I [5
More informationImage Analysis & Retrieval Lec 05 - Interesting Points Detection
CS/ 5590 / NG 401 Special Topics Spring 018 mage Analsis & Retrieal Lec 05 - nteresting Points Detection Zh Li Dept of CS UMKC Office: FH560 mail: lizh@mkc.ed Ph: 346. http://l.web.mkc.ed/lizh mage Analsis
More informationImage Denoising Algorithms
Image Denoising Algorithms Xiang Hao School of Compting, University of Utah, USA, hao@cs.tah.ed Abstract. This is a report of an assignment of the class Mathematics of Imaging. In this assignment, we first
More informationStereo Matching and 3D Visualization for Gamma-Ray Cargo Inspection
Stereo Matching and 3D Visalization for Gamma-Ray Cargo Inspection Zhigang Zh *ab, Y-Chi H bc a Department of Compter Science, The City College of New York, New York, NY 3 b Department of Compter Science,
More informationVessel Tracking for Retina Images Based on Fuzzy Ant Colony Algorithm
Vessel Tracking for Retina Images Based on Fzzy Ant Colony Algorithm Sina Hooshyar a, Rasol Khayati b and Reza Rezai c a,b,c Department of Biomedical Engineering, Engineering Faclty, Shahed University,
More informationPlenoPatch: Patch-based Plenoptic Image Manipulation
1 PlenoPatch: Patch-based Plenoptic Image Maniplation Fang-Le Zhang, Member, IEEE, Je Wang, Senior Member, IEEE, Eli Shechtman, Member, IEEE, Zi-Ye Zho, Jia-Xin Shi, and Shi-Min H, Member, IEEE Abstract
More informationBasics of Digital Logic Design
ignals, Logic Operations and Gates E 675.2: Introdction to ompter rchitectre asics of igital Logic esign Rather than referring to voltage levels of signals, we shall consider signals that are logically
More informationCombined cine- and tagged-mri for tracking landmarks on the tongue surface
INTERSPEECH 2015 Combined cine- and tagged-mri for tracking landmarks on the tonge srface Honghao Bao 1, Wenhan L 1, Kiyoshi Honda 2,*, Jiango Wei 1, Qiang Fang 3, Jianw Dang 2, 4 1 School of Compter Software,
More informationNetwork layer. Two Key Network-Layer Functions. Datagram Forwarding table. IP datagram format. IP Addressing: introduction
Netork laer transport segment sending to receiing host on sending side encapslates segments into grams on rcing side, deliers segments to transport laer laer protocols in eer host, roter roter eamines
More informationA RECOGNITION METHOD FOR AIRPLANE TARGETS USING 3D POINT CLOUD DATA
A RECOGNITION METHOD FOR AIRPLANE TARGETS USING 3D POINT CLOUD DATA Mei Zho*, Ling-li Tang, Chan-rong Li, Zhi Peng, Jing-mei Li Academy of Opto-Electronics, Chinese Academy of Sciences, No.9, Dengzhang
More informationThe single-cycle design from last time
lticycle path Last time we saw a single-cycle path and control nit for or simple IPS-based instrction set. A mlticycle processor fies some shortcomings in the single-cycle CPU. Faster instrctions are not
More informationOPTI-202R Homework John E. Greivenkamp Spring ) An air-spaced triplet objective is comprised of three thin lenses in air:
Set #5 Assigned: De: 2/7/18 (Wed) 2/14/18 (Wed) MIDTERM I: Frida March 16 8:00-8:50 5-1) An air-spaced triplet objective is comprised of three thin lenses in air: Focal Length Spacing Lens 1 100 mm 25
More informationEXAMINATIONS 2010 END OF YEAR NWEN 242 COMPUTER ORGANIZATION
EXAINATIONS 2010 END OF YEAR COPUTER ORGANIZATION Time Allowed: 3 Hors (180 mintes) Instrctions: Answer all qestions. ake sre yor answers are clear and to the point. Calclators and paper foreign langage
More informationStatistical Methods in functional MRI. Standard Analysis. Data Processing Pipeline. Multiple Comparisons Problem. Multiple Comparisons Problem
Statistical Methods in fnctional MRI Lectre 7: Mltiple Comparisons 04/3/13 Martin Lindqist Department of Biostatistics Johns Hopkins University Data Processing Pipeline Standard Analysis Data Acqisition
More informationEEC 483 Computer Organization
EEC 483 Compter Organization Chapter 4.4 A Simple Implementation Scheme Chans Y The Big Pictre The Five Classic Components of a Compter Processor Control emory Inpt path Otpt path & Control 2 path and
More informationABSOLUTE DEFORMATION PROFILE MEASUREMENT IN TUNNELS USING RELATIVE CONVERGENCE MEASUREMENTS
Proceedings th FIG Symposim on Deformation Measrements Santorini Greece 00. ABSOUTE DEFORMATION PROFIE MEASUREMENT IN TUNNES USING REATIVE CONVERGENCE MEASUREMENTS Mahdi Moosai and Saeid Khazaei Mining
More informationNETWORK PRESERVATION THROUGH A TOPOLOGY CONTROL ALGORITHM FOR WIRELESS MESH NETWORKS
ETWORK PRESERVATIO THROUGH A TOPOLOGY COTROL ALGORITHM FOR WIRELESS MESH ETWORKS F. O. Aron, T. O. Olwal, A. Krien, Y. Hamam Tshwane University of Technology, Pretoria, Soth Africa. Dept of the French
More informationIsilon InsightIQ. Version 2.5. User Guide
Isilon InsightIQ Version 2.5 User Gide Pblished March, 2014 Copyright 2010-2014 EMC Corporation. All rights reserved. EMC believes the information in this pblication is accrate as of its pblication date.
More information5 Performance Evaluation
5 Performance Evalation his chapter evalates the performance of the compared to the MIP, and FMIP individal performances. We stdy the packet loss and the latency to restore the downstream and pstream of
More informationIllumina LIMS. Software Guide. For Research Use Only. Not for use in diagnostic procedures. Document # June 2017 ILLUMINA PROPRIETARY
Illmina LIMS Software Gide Jne 2017 ILLUMINA PROPRIETARY This docment and its contents are proprietary to Illmina, Inc. and its affiliates ("Illmina"), and are intended solely for the contractal se of
More information5.0 Curve and Surface Theory
5. Cre and Srface Theor 5.1 arametric Representation of Cres Consider the parametric representation of a cre as a ector t: t [t t t] 5.1 The deriatie of sch a ector ealated at t t is gien b t [ t t t ]
More informationFeature extraction: Corners Harris Corners Pkwy, Charlotte, NC
Featre etraction: Corners 9300 Harris Corners Pkw Charlotte NC Wh etract featres? Motiation: panorama stitching We hae two images how do we combine them? Wh etract featres? Motiation: panorama stitching
More informationCurves and Surfaces. CS 537 Interactive Computer Graphics Prof. David E. Breen Department of Computer Science
Crves and Srfaces CS 57 Interactive Compter Graphics Prof. David E. Breen Department of Compter Science E. Angel and D. Shreiner: Interactive Compter Graphics 6E Addison-Wesley 22 Objectives Introdce types
More information4.13 Advanced Topic: An Introduction to Digital Design Using a Hardware Design Language 345.e1
.3 Advanced Topic: An Introdction to Digital Design Using a Hardware Design Langage 35.e.3 Advanced Topic: An Introdction to Digital Design Using a Hardware Design Langage to Describe and odel a Pipeline
More information3-D SURFACE ROUGHNESS PROFILE OF 316-STAINLESS STEEL USING VERTICAL SCANNING INTERFEROMETRY WITH A SUPERLUMINESCENT DIODE
IMEKO 1 TC3, TC5 and TC Conferences Metrology in Modern Context November 5, 1, Pattaya, Chonbri, Thailand 3-D SURFACE ROUGHNESS PROFILE OF 316-STAINLESS STEEL USING VERTICAL SCANNING INTERFEROMETRY WITH
More informationConstructing and Comparing User Mobility Profiles for Location-based Services
Constrcting and Comparing User Mobility Profiles for Location-based Services Xihi Chen Interdisciplinary Centre for Secrity, Reliability and Trst, University of Lxemborg Jn Pang Compter Science and Commnications,
More informationMinimal Edge Addition for Network Controllability
This article has been accepted for pblication in a ftre isse of this jornal, bt has not been flly edited. Content may change prior to final pblication. Citation information: DOI 10.1109/TCNS.2018.2814841,
More informationPART I: Adding Instructions to the Datapath. (2 nd Edition):
EE57 Instrctor: G. Pvvada ===================================================================== Homework #5b De: check on the blackboard =====================================================================
More informationThe Disciplined Flood Protocol in Sensor Networks
The Disciplined Flood Protocol in Sensor Networks Yong-ri Choi and Mohamed G. Goda Department of Compter Sciences The University of Texas at Astin, U.S.A. fyrchoi, godag@cs.texas.ed Hssein M. Abdel-Wahab
More informationSeismic trace interpolation with approximate message passing Navid Ghadermarzy and Felix Herrmann and Özgür Yılmaz, University of British Columbia
Seismic trace interpolation with approximate message passing Navid Ghadermarzy and Felix Herrmann and Özgür Yılmaz, University of British Colmbia SUMMARY Approximate message passing (AMP) is a comptationally
More informationDIRECT AND PROGRESSIVE RECONSTRUCTION OF DUAL PHOTOGRAPHY IMAGES
DIRECT AND PROGRESSIVE RECONSTRUCTION OF DUAL PHOTOGRAPHY IMAGES Binh-Son Ha 1 Imari Sato 2 Kok-Lim Low 1 1 National University of Singapore 2 National Institte of Informatics, Tokyo, Japan ABSTRACT Dal
More informationOPTI-502 Optical Design and Instrumentation I John E. Greivenkamp Final Exam In Class Page 1/15 Fall, 2012
OPTI-502 Optical Design and Instrmentation I John E. Greivenkamp Final Exam In Class Page 1/15 Fall, 2012 Name Closed book; closed notes. Time limit: 2 hors. An eqation sheet is attached and can be removed.
More informationMultiView: Improving Trust in Group Video Conferencing Through Spatial Faithfulness David T. Nguyen, John F. Canny
MltiView: Improving Trst in Grop Video Conferencing Throgh Spatial Faithflness David T. Ngyen, John F. Canny CHI 2007, April 28 May 3, 2007, San Jose, California, USA Presented by: Stefan Stojanoski 1529445
More informationTDT4255 Friday the 21st of October. Real world examples of pipelining? How does pipelining influence instruction
Review Friday the 2st of October Real world eamples of pipelining? How does pipelining pp inflence instrction latency? How does pipelining inflence instrction throghpt? What are the three types of hazard
More informationh-vectors of PS ear-decomposable graphs
h-vectors of PS ear-decomposable graphs Nima Imani 2, Lee Johnson 1, Mckenzie Keeling-Garcia 1, Steven Klee 1 and Casey Pinckney 1 1 Seattle University Department of Mathematics, 901 12th Avene, Seattle,
More informationNew-Sum: A Novel Online ABFT Scheme For General Iterative Methods
New-Sm: A Novel Online ABFT Scheme For General Iterative Methods Dingwen Tao (University of California, Riverside) Shaiwen Leon Song (Pacific Northwest National Laboratory) Sriram Krishnamoorthy (Pacific
More informationApplication of Gaussian Curvature Method in Development of Hull Plate Surface
Marine Engineering Frontiers (MEF) Volme 2, 204 Application of Gassian Crvatre Method in Development of Hll Plate Srface Xili Zh, Yjn Li 2 Dept. of Infor., Dalian Univ., Dalian 6622, China 2 Dept. of Naval
More informationLecture 10. Diffraction. incident
1 Introdction Lectre 1 Diffraction It is qite often the case that no line-of-sight path exists between a cell phone and a basestation. In other words there are no basestations that the cstomer can see
More informationStereopsis Raul Queiroz Feitosa
Stereopsis Ral Qeiroz Feitosa 5/24/2017 Stereopsis 1 Objetie This chapter introdces the basic techniqes for a 3 dimensional scene reconstrction based on a set of projections of indiidal points on two calibrated
More informationUse Trigonometry with Right Triangles
. a., a.4, 2A.2.A; G.5.D TEKS Use Trigonometr with Right Triangles Before Yo sed the Pthagorean theorem to find lengths. Now Yo will se trigonometric fnctions to find lengths. Wh? So o can measre distances
More informationFast Ray Tetrahedron Intersection using Plücker Coordinates
Fast Ray Tetrahedron Intersection sing Plücker Coordinates Nikos Platis and Theoharis Theoharis Department of Informatics & Telecommnications University of Athens Panepistemiopolis, GR 157 84 Ilissia,
More informationChapter 4: Network Layer. TDTS06 Computer networks. Chapter 4: Network Layer. Network layer. Two Key Network-Layer Functions
Chapter : Netork Laer TDTS06 Compter s Lectre : Netork laer II Roting algorithms Jose M. Peña, jospe@ida.li.se ID/DIT, LiU 009-09- Chapter goals: nderstand principles behind laer serices: laer serice models
More informationReading. 13. Texture Mapping. Non-parametric texture mapping. Texture mapping. Required. Watt, intro to Chapter 8 and intros to 8.1, 8.4, 8.6, 8.8.
Reading Reqired Watt, intro to Chapter 8 and intros to 8.1, 8.4, 8.6, 8.8. Recommended 13. Textre Mapping Pal S. Heckbert. Srvey of textre mapping. IEEE Compter Graphics and Applications 6(11): 56--67,
More informationarxiv: v1 [cs.cg] 26 Sep 2018
Convex partial transversals of planar regions arxiv:1809.10078v1 [cs.cg] 26 Sep 2018 Vahideh Keikha Department of Mathematics and Compter Science, University of Sistan and Balchestan, Zahedan, Iran va.keikha@gmail.com
More informationSTABILITY OF SIMULTANEOUS RECURRENT NEURAL NETWORK DYNAMICS FOR STATIC OPTIMIZATION
STABILITY OF SIMULTANEOUS RECURRENT NEURAL NETWOR DYNAMICS FOR STATIC OPTIMIZATION Grsel Serpen and Yifeng X Electrical Engineering and Compter Science Department, The University of Toledo, Toledo, OH
More informationChapter 6: Pipelining
Chapter 6: Pipelining Otline An overview of pipelining A pipelined path Pipelined control Data hazards and forwarding Data hazards and stalls Branch hazards Eceptions Sperscalar and dynamic pipelining
More information