Our Calibrated Model has No Predictive Value: An Example from the Petroleum Industry
|
|
- Gordon Palmer
- 5 years ago
- Views:
Transcription
1 Our Calibrated Model as No Predictive Value: An Example from te Petroleum Industry J.N. Carter a, P.J. Ballester a, Z. Tavassoli a and P.R. King a a Department of Eart Sciences and Engineering, Imperial College, London, SW7 2AZ, United Kingdom. j.n.carter@imperial.ac.uk. Abstract: It is often assumed tat once a model as been calibrated to measurements ten it will ave some level of predictive capability, altoug tis may be limited. If te model does not ave predictive capability ten te assumption is tat te model needs to be improved in some way. Using an example from te petroleum industry, we sow tat cases can exit were calibrated models ave no predictive capability. Tis occurs even wen tere is no modelling error present. It is also sown tat te introduction of a small modelling error can make it impossible to obtain any models wit useful predictive capability. We ave been unable to find ways of identifying wic calibrated models will ave some predictive capacity and tose wic will not. Keywords: Prediction, Calibration, Uncertainty, Petroleum 1. INTRODUCTION In many studies involving numeric models of complex real world situations, for example petroleum reservoirs and climate modelling, it is implicitly assumed tat if te model as been carefully calibrated to reproduce previously observed beaviour, ten te model will ave some predictive capacity. It is recognised tat predictability may only be acievable for a finite period of time, and tat any prediction will be uncertain to some extent. Two types of error are considered in most calibration exercises: measurement error and model error. Measurement errors are fixed at te time te measurement was made, tey generally ave well defined statistics and can be andled appropriately. Model errors are due to approximations, suc as a loss of spatial, or temporal, resolution, and te noninclusion of all of te relevant pysics. Te assumption tat is normally made is tat if te model errors are sufficiently unimportant, so tat wen te model as been calibrated to measurement data, ten we ave some level of acceptable predictability. If te model does not ave predictability, ten te model errors are assumed to be too large and we need to use a better model. Were better probably means improved resolution, spatial or temporal, and/or te inclusion of more pysics. In tis paper we present te results of a study, for a petroleum reservoir, were a well calibrated model as no predictive value. Even toug te calibration and trut models ad identical pysics and identical spatial and temporal resolution. A second study sows Correspondence to J.N. Carter
2 tat were tere are sligt differences in te pysics between te calibration and trut models, ten te problems encountered are even worse. In te next section te experimental set-up is described, tis is followed by te results for cases wit/witout modelling errors. Finally we draw some conclusions from our observations. 2. EXPERIMENTAL SET-UP In tis section we describe our tree parameter reservoir model and our metodology for calibrating te model against te available measurements Model Description Our model is a cross-section of a simple layered reservoir, wit a single vertical fault midway between an injector producer pair, as sown in figure 1. Te model tat we calibrate as tree parameters: te vertical displacement (trow) of te fault; te permeability of te poor quality sand; and te permeability of te good quality sand. Te geological layers are assumed to be omogeneous (ie tey ave constant pysical properties). Te trut case, wic is used to generate te measurements for te calibration, is a variant of te calibration model, but wit fixed parameter values. In te case of no model error, ten te trut case is a member of te set of all possible calibration models. Te size and type of model error is cosen by ow a specific calibration model is perturbed to obtain te trut case. In te work presented in tis paper, te model error is obtained by introducing small variations into te spatial properties of te geological layers. Te permeability and porosity in eac grid block are randomly perturbed. Te maximum variations tat are allowed is ±1% of te unperturbed mean values. Tese perturbations are muc lower tan would be expected for a real world rock tat ad been classified as omogeneous. A more extensive description of te model can be found a paper tat deals wit estimating model errors[4] Calibration Metodology Our procedure to produce a calibrated model is as follows: 1. Coose trut values for te tree model parameters; 2. Select te level of measurement and model error to be used; 3. From te trut case produce te measurements required for te calibration process (tree years of montly data); 4. Calibrate te model against te measurements; 5. Predict te beaviour for years 4-1.
3 Poor sand (Permeability k p ) Good sand (Permeability k g ) Trow () Figure 1. Reservoir model sowing te fault trow and te geological, and simulation, layers. We ave considered te trut case: = 1.4, k p = 1.31 and k g = wit and witout model error. No measurement error was added, but we assumed Gaussian noise wit a 1% standard deviation wen calculating te likeliood tat a proposed calibration matces te trut. In order to quantify te degree of te model calibration against measurements, we define first an objective function for te calibration period, m, as follows m = j=1 k=1 sim(j, k) obj(j, k) 2σ jk (1) were sim(j, k) is te simulated response for production series k of te model at time j, obj(j, k) is te corresponding true value and σ jk, an estimation of wat would be te associated measurement error. We consider tree production series: Oil Production Rate, Water Production Rate (or Water Cut) and Water Injection Rate. Likewise, te objective function for te prediction period, f, is f = j=37 k=1 sim(j, k) obj(j, k) 2σ jk (2) Te ranges tat te model parameters were allowed to take are: (, 6), k g (1, 2) and k p (, 5).
4 exp( Dm/.15) exp( Df/.15) Figure 2. Calibrations of te model (wit no modelling error) to a) istory period, b) prediction period Genetic Algoritm Our cosen searc metod is a Steady-state Real-parameter Genetic Algoritm. Tis is used because we need to searc for multiple good optima witin a parameter space tat seems to contain very many local optima. It is a development of a previously publised study [1] and as been developed to solve te type of problem described in tis paper. In brief te details are: a steady-state population of 5 individuals is used, parents are selected randomly (witout reference to teir fitness), crossover is performed using vsbx[1, 3], and culling is carried out using a form of tournament selection involving 1 individuals, a total of 7 individuals are generated. 3. RESULTS In tis section we present te results of two studies: te first is wit no modelling error present; te second as a low level of modelling error Calibration wit No Modelling Error Figure 2a sows te result of calibrating te model against te data for te first 36 monts. Te trut model as exactly te same pysics and structure as te calibration models, and te trut model is a member of te set of possible calibration models. Te very large spike, wit 1, corresponds to te trut case. We can also see notable local optima wit < < 8, 3 < < 38 and 4 < < 45. Te global optimum as a small basin of attraction around it and as proved difficult to identify in previous work[2], te easiest optimum to find as been te one wit 3 < < 38. Te rater noisy structure of te objective surface is largely an artifact of te of te way tat k g is sampled. Any point wit an acceptable objective value is plotted no matter wat value of k g was used. Tis means tat it is possible for two points to ave identical values for and k p but different values of te objective function. Hence a vertical line would be plotted. Figure 3 sows a contour plot, centred on = 5. and k p = 1.65, of te objective
5 Dm(opt) Figure 3. Surface plot for m, were k g as been optimised so as to minimise m, (3.5, 6.5) and k p (1.4, 1.9) function m. Te figure was generated by conducting a grid searc on a fine grid. At eac point on te grid, k g was optimised, tis results in a muc smooter representation of te objective. Figure 2b sows te result of calibrating te model to te prediction period. Te only substantial point found corresponds to te trut model. All of te oter local optima tat can be seen in figure 2a are unable to matc te observations during te prediction period. We conclude tat for tis model you can only obtain a good prediction from te trut case, and tat good matces from te istory matcing pase ave no predictive value Calibration wit Modelling Error Te result of matcing te calibration model to data generated by a trut case tat includes modelling errors is sown in figure 4a. Superficially te figure is similar to figure 2a. Te important difference is tat te global optima now occurs for 32. Tis is witin te largest basin of attraction and is usually found by most searc algoritms. Te optima associated wit te true parameter values is of muc lower quality. If we now look at te calibration to te prediction period, figure 4b, we see tat te global optimum for te istory matcing period as no predictive value. None of te models tat ave some predictive value correspond to te trut case (te spike at 1 as te wrong values for k p and k g ). Te objective values obtained are low compared to tose in figure 2b. 4. CONCLUSIONS In tis paper we ave examined, for a particular case, our ability to calibrate a model and ten to make accurate predictions. Tis as been carried out for cases wit and witout modelling errors, but no measurement error. From tese studies we make te following observations:
6 exp( Dm/.15) exp( Df/.15) Figure 4. Calibrations of te model (wit modelling error) to a) istory period, b) prediction period. Te basin of attraction a round a global optimum may be sufficiently small tat searc algoritms may not find tem. Te basins of attraction associated wit oter local optima may be muc larger and ence easier to find. Wen tere is no modelling error present, some of te non-global optima may be of quite good quality. However only te global optimum is able to make an accurate prediction. Wen small amounts of modelling error are present, ten te global optimum is no longer associated wit te trut. Te local optimum tat as parameter values of te trut case is not of significant quality and could easily be disregarded. None of te models tested in te presence of modelling errors ave valuable predictive power. In particular te global optima from te istory matcing period was unable to provide an accurate prediction. In summary: in te absence of model errors, and wit very low measurement errors, it is possible to obtain calibrated models tat do not ave any predictive capability; suc models may be significantly easier to identify tan te correct model; we are unable to differentiate between calibrated models wit or witout predictive capabilities; te introduction of even small model errors may make it impossible to obtain a calibrated model wit predictive value. In tis analysis tere is noting tat seems to be unique to tis model. In particular tere is te issue of data availability, adding more measurements does not appear to offer a guaranty of avoiding tis dilemma. If te observations made wit tis model are not unique to te model, and we ave no reason to believe tat te model is unique, ten tis presents a potentially serious obstacle to te use of models of tis type for prediction. Our concern is tat if we cannot successfully calibrate and make predictions wit a model as simple as tis, were does tis leave us wen are models are more complex, ave substantive modelling errors, and we ave poor quality measurement data.
7 REFERENCES 1. P.J. Ballester and J.N. Carter,Real-parameter Genetic Algoritms for Finding Multiple Optimal Solutions in Multi-modal Optimisation, Genetic and Evolutionary Computation Conference 23:76, Lecture Notes in Computer Science 2723, Pub Springer-Verlag, Heidelberg, M.D. Bus and J.N. Carter, Applications of a Modified Genetic Algoritm to Parameter Estimation in te Petroleum Industry, Intelligent Engineering Systems Troug Artificial Neural Networks 6:397, J.N. Carter, Introduction to using Genetic Algoritms, in Soft Computing and Intelligent Data Analysis in Oil Exploration, Eds M. Nikraves, F. Aminzade and L.A. Zade, Developments in Petroleum Science 51, Elsevier Science, J.N. Carter, Using Bayesian Statistics to Capture te Effects of Modelling Errors in Inverse Problems, Matematical Geology, 36:187, 24.
A012 A REAL PARAMETER GENETIC ALGORITHM FOR CLUSTER IDENTIFICATION IN HISTORY MATCHING
1 A012 A REAL PARAMETER GENETIC ALGORITHM FOR CLUSTER IDENTIFICATION IN HISTORY MATCHING Jonathan N Carter and Pedro J Ballester Dept Earth Science and Engineering, Imperial College, London Abstract Non-linear
More information4.2 The Derivative. f(x + h) f(x) lim
4.2 Te Derivative Introduction In te previous section, it was sown tat if a function f as a nonvertical tangent line at a point (x, f(x)), ten its slope is given by te it f(x + ) f(x). (*) Tis is potentially
More informationBounding Tree Cover Number and Positive Semidefinite Zero Forcing Number
Bounding Tree Cover Number and Positive Semidefinite Zero Forcing Number Sofia Burille Mentor: Micael Natanson September 15, 2014 Abstract Given a grap, G, wit a set of vertices, v, and edges, various
More information4.1 Tangent Lines. y 2 y 1 = y 2 y 1
41 Tangent Lines Introduction Recall tat te slope of a line tells us ow fast te line rises or falls Given distinct points (x 1, y 1 ) and (x 2, y 2 ), te slope of te line troug tese two points is cange
More informationMAPI Computer Vision
MAPI Computer Vision Multiple View Geometry In tis module we intend to present several tecniques in te domain of te 3D vision Manuel Joao University of Mino Dep Industrial Electronics - Applications -
More informationSection 2.3: Calculating Limits using the Limit Laws
Section 2.3: Calculating Limits using te Limit Laws In previous sections, we used graps and numerics to approimate te value of a it if it eists. Te problem wit tis owever is tat it does not always give
More informationHaar Transform CS 430 Denbigh Starkey
Haar Transform CS Denbig Starkey. Background. Computing te transform. Restoring te original image from te transform 7. Producing te transform matrix 8 5. Using Haar for lossless compression 6. Using Haar
More information2 The Derivative. 2.0 Introduction to Derivatives. Slopes of Tangent Lines: Graphically
2 Te Derivative Te two previous capters ave laid te foundation for te study of calculus. Tey provided a review of some material you will need and started to empasize te various ways we will view and use
More informationInvestigating an automated method for the sensitivity analysis of functions
Investigating an automated metod for te sensitivity analysis of functions Sibel EKER s.eker@student.tudelft.nl Jill SLINGER j..slinger@tudelft.nl Delft University of Tecnology 2628 BX, Delft, te Neterlands
More informationMATH 5a Spring 2018 READING ASSIGNMENTS FOR CHAPTER 2
MATH 5a Spring 2018 READING ASSIGNMENTS FOR CHAPTER 2 Note: Tere will be a very sort online reading quiz (WebWork) on eac reading assignment due one our before class on its due date. Due dates can be found
More informationComparison of the Efficiency of the Various Algorithms in Stratified Sampling when the Initial Solutions are Determined with Geometric Method
International Journal of Statistics and Applications 0, (): -0 DOI: 0.9/j.statistics.000.0 Comparison of te Efficiency of te Various Algoritms in Stratified Sampling wen te Initial Solutions are Determined
More information3.6 Directional Derivatives and the Gradient Vector
288 CHAPTER 3. FUNCTIONS OF SEVERAL VARIABLES 3.6 Directional Derivatives and te Gradient Vector 3.6.1 Functions of two Variables Directional Derivatives Let us first quickly review, one more time, te
More informationThe Euler and trapezoidal stencils to solve d d x y x = f x, y x
restart; Te Euler and trapezoidal stencils to solve d d x y x = y x Te purpose of tis workseet is to derive te tree simplest numerical stencils to solve te first order d equation y x d x = y x, and study
More informationFast Calculation of Thermodynamic Properties of Water and Steam in Process Modelling using Spline Interpolation
P R E P R N T CPWS XV Berlin, September 8, 008 Fast Calculation of Termodynamic Properties of Water and Steam in Process Modelling using Spline nterpolation Mattias Kunick a, Hans-Joacim Kretzscmar a,
More informationUnsupervised Learning for Hierarchical Clustering Using Statistical Information
Unsupervised Learning for Hierarcical Clustering Using Statistical Information Masaru Okamoto, Nan Bu, and Tosio Tsuji Department of Artificial Complex System Engineering Hirosima University Kagamiyama
More informationEconomic design of x control charts considering process shift distributions
J Ind Eng Int (2014) 10:163 171 DOI 10.1007/s40092-014-0086-2 ORIGINAL RESEARCH Economic design of x control carts considering process sift distributions Vijayababu Vommi Rukmini V. Kasarapu Received:
More informationTwo Modifications of Weight Calculation of the Non-Local Means Denoising Method
Engineering, 2013, 5, 522-526 ttp://dx.doi.org/10.4236/eng.2013.510b107 Publised Online October 2013 (ttp://www.scirp.org/journal/eng) Two Modifications of Weigt Calculation of te Non-Local Means Denoising
More informationCHAPTER 7: TRANSCENDENTAL FUNCTIONS
7.0 Introduction and One to one Functions Contemporary Calculus 1 CHAPTER 7: TRANSCENDENTAL FUNCTIONS Introduction In te previous capters we saw ow to calculate and use te derivatives and integrals of
More information, 1 1, A complex fraction is a quotient of rational expressions (including their sums) that result
RT. Complex Fractions Wen working wit algebraic expressions, sometimes we come across needing to simplify expressions like tese: xx 9 xx +, xx + xx + xx, yy xx + xx + +, aa Simplifying Complex Fractions
More information2.8 The derivative as a function
CHAPTER 2. LIMITS 56 2.8 Te derivative as a function Definition. Te derivative of f(x) istefunction f (x) defined as follows f f(x + ) f(x) (x). 0 Note: tis differs from te definition in section 2.7 in
More informationLinear Interpolating Splines
Jim Lambers MAT 772 Fall Semester 2010-11 Lecture 17 Notes Tese notes correspond to Sections 112, 11, and 114 in te text Linear Interpolating Splines We ave seen tat ig-degree polynomial interpolation
More informationAn Overview of New Features in
6. LS-DYNA Anwenderforum, Frankental 2007 Optimierung An Overview of New Features in LS-OPT Version 3.3 Nielen Stander*, Tusar Goel*, David Björkevik** *Livermore Software Tecnology Corporation, Livermore,
More informationSoftware Fault Prediction using Machine Learning Algorithm Pooja Garg 1 Mr. Bhushan Dua 2
IJSRD - International Journal for Scientific Researc & Development Vol. 3, Issue 04, 2015 ISSN (online): 2321-0613 Software Fault Prediction using Macine Learning Algoritm Pooja Garg 1 Mr. Busan Dua 2
More informationChapter K. Geometric Optics. Blinn College - Physics Terry Honan
Capter K Geometric Optics Blinn College - Pysics 2426 - Terry Honan K. - Properties of Ligt Te Speed of Ligt Te speed of ligt in a vacuum is approximately c > 3.0µ0 8 mês. Because of its most fundamental
More informationCubic smoothing spline
Cubic smooting spline Menu: QCExpert Regression Cubic spline e module Cubic Spline is used to fit any functional regression curve troug data wit one independent variable x and one dependent random variable
More informationProceedings. Seventh ACM/IEEE International Conference on Distributed Smart Cameras (ICDSC 2013) Palm Spring, CA
Proceedings Of te Sevent ACM/IEEE International Conference on Distributed Smart Cameras (ICDSC ) Palm Spring, CA October 9 November st Parameter-Unaware Autocalibration for Occupancy Mapping David Van
More informationNumerical Derivatives
Lab 15 Numerical Derivatives Lab Objective: Understand and implement finite difference approximations of te derivative in single and multiple dimensions. Evaluate te accuracy of tese approximations. Ten
More informationRedundancy Awareness in SQL Queries
Redundancy Awareness in QL Queries Bin ao and Antonio Badia omputer Engineering and omputer cience Department University of Louisville bin.cao,abadia @louisville.edu Abstract In tis paper, we study QL
More information15-122: Principles of Imperative Computation, Summer 2011 Assignment 6: Trees and Secret Codes
15-122: Principles of Imperative Computation, Summer 2011 Assignment 6: Trees and Secret Codes William Lovas (wlovas@cs) Karl Naden Out: Tuesday, Friday, June 10, 2011 Due: Monday, June 13, 2011 (Written
More informationANTENNA SPHERICAL COORDINATE SYSTEMS AND THEIR APPLICATION IN COMBINING RESULTS FROM DIFFERENT ANTENNA ORIENTATIONS
NTNN SPHRICL COORDINT SSTMS ND THIR PPLICTION IN COMBINING RSULTS FROM DIFFRNT NTNN ORINTTIONS llen C. Newell, Greg Hindman Nearfield Systems Incorporated 133. 223 rd St. Bldg. 524 Carson, C 9745 US BSTRCT
More informationMore on Functions and Their Graphs
More on Functions and Teir Graps Difference Quotient ( + ) ( ) f a f a is known as te difference quotient and is used exclusively wit functions. Te objective to keep in mind is to factor te appearing in
More informationCESILA: Communication Circle External Square Intersection-Based WSN Localization Algorithm
Sensors & Transducers 2013 by IFSA ttp://www.sensorsportal.com CESILA: Communication Circle External Square Intersection-Based WSN Localization Algoritm Sun Hongyu, Fang Ziyi, Qu Guannan College of Computer
More informationMinimizing Memory Access By Improving Register Usage Through High-level Transformations
Minimizing Memory Access By Improving Register Usage Troug Hig-level Transformations San Li Scool of Computer Engineering anyang Tecnological University anyang Avenue, SIGAPORE 639798 Email: p144102711@ntu.edu.sg
More informationAVL Trees Outline and Required Reading: AVL Trees ( 11.2) CSE 2011, Winter 2017 Instructor: N. Vlajic
1 AVL Trees Outline and Required Reading: AVL Trees ( 11.2) CSE 2011, Winter 2017 Instructor: N. Vlajic AVL Trees 2 Binary Searc Trees better tan linear dictionaries; owever, te worst case performance
More informationAn Algorithm for Loopless Deflection in Photonic Packet-Switched Networks
An Algoritm for Loopless Deflection in Potonic Packet-Switced Networks Jason P. Jue Center for Advanced Telecommunications Systems and Services Te University of Texas at Dallas Ricardson, TX 75083-0688
More informationFault Localization Using Tarantula
Class 20 Fault localization (cont d) Test-data generation Exam review: Nov 3, after class to :30 Responsible for all material up troug Nov 3 (troug test-data generation) Send questions beforeand so all
More informationCommunicator for Mac Quick Start Guide
Communicator for Mac Quick Start Guide 503-968-8908 sterling.net training@sterling.net Pone Support 503.968.8908, option 2 pone-support@sterling.net For te most effective support, please provide your main
More informationAlternating Direction Implicit Methods for FDTD Using the Dey-Mittra Embedded Boundary Method
Te Open Plasma Pysics Journal, 2010, 3, 29-35 29 Open Access Alternating Direction Implicit Metods for FDTD Using te Dey-Mittra Embedded Boundary Metod T.M. Austin *, J.R. Cary, D.N. Smite C. Nieter Tec-X
More informationYou Try: A. Dilate the following figure using a scale factor of 2 with center of dilation at the origin.
1 G.SRT.1-Some Tings To Know Dilations affect te size of te pre-image. Te pre-image will enlarge or reduce by te ratio given by te scale factor. A dilation wit a scale factor of 1> x >1enlarges it. A dilation
More informationMAP MOSAICKING WITH DISSIMILAR PROJECTIONS, SPATIAL RESOLUTIONS, DATA TYPES AND NUMBER OF BANDS 1. INTRODUCTION
MP MOSICKING WITH DISSIMILR PROJECTIONS, SPTIL RESOLUTIONS, DT TYPES ND NUMBER OF BNDS Tyler J. lumbaug and Peter Bajcsy National Center for Supercomputing pplications 605 East Springfield venue, Campaign,
More informationData Structures and Programming Spring 2014, Midterm Exam.
Data Structures and Programming Spring 2014, Midterm Exam. 1. (10 pts) Order te following functions 2.2 n, log(n 10 ), 2 2012, 25n log(n), 1.1 n, 2n 5.5, 4 log(n), 2 10, n 1.02, 5n 5, 76n, 8n 5 + 5n 2
More informationSection 1.2 The Slope of a Tangent
Section 1.2 Te Slope of a Tangent You are familiar wit te concept of a tangent to a curve. Wat geometric interpretation can be given to a tangent to te grap of a function at a point? A tangent is te straigt
More informationPiecewise Polynomial Interpolation, cont d
Jim Lambers MAT 460/560 Fall Semester 2009-0 Lecture 2 Notes Tese notes correspond to Section 4 in te text Piecewise Polynomial Interpolation, cont d Constructing Cubic Splines, cont d Having determined
More informationA Statistical Approach for Target Counting in Sensor-Based Surveillance Systems
Proceedings IEEE INFOCOM A Statistical Approac for Target Counting in Sensor-Based Surveillance Systems Dengyuan Wu, Decang Cen,aiXing, Xiuzen Ceng Department of Computer Science, Te George Wasington University,
More information13.5 DIRECTIONAL DERIVATIVES and the GRADIENT VECTOR
13.5 Directional Derivatives and te Gradient Vector Contemporary Calculus 1 13.5 DIRECTIONAL DERIVATIVES and te GRADIENT VECTOR Directional Derivatives In Section 13.3 te partial derivatives f x and f
More informationCS 234. Module 6. October 16, CS 234 Module 6 ADT Dictionary 1 / 33
CS 234 Module 6 October 16, 2018 CS 234 Module 6 ADT Dictionary 1 / 33 Idea for an ADT Te ADT Dictionary stores pairs (key, element), were keys are distinct and elements can be any data. Notes: Tis is
More information1.4 RATIONAL EXPRESSIONS
6 CHAPTER Fundamentals.4 RATIONAL EXPRESSIONS Te Domain of an Algebraic Epression Simplifying Rational Epressions Multiplying and Dividing Rational Epressions Adding and Subtracting Rational Epressions
More informationA Cost Model for Distributed Shared Memory. Using Competitive Update. Jai-Hoon Kim Nitin H. Vaidya. Department of Computer Science
A Cost Model for Distributed Sared Memory Using Competitive Update Jai-Hoon Kim Nitin H. Vaidya Department of Computer Science Texas A&M University College Station, Texas, 77843-3112, USA E-mail: fjkim,vaidyag@cs.tamu.edu
More informationUUV DEPTH MEASUREMENT USING CAMERA IMAGES
ABCM Symposium Series in Mecatronics - Vol. 3 - pp.292-299 Copyrigt c 2008 by ABCM UUV DEPTH MEASUREMENT USING CAMERA IMAGES Rogerio Yugo Takimoto Graduate Scool of Engineering Yokoama National University
More informationCoarticulation: An Approach for Generating Concurrent Plans in Markov Decision Processes
Coarticulation: An Approac for Generating Concurrent Plans in Markov Decision Processes Kasayar Roanimanes kas@cs.umass.edu Sridar Maadevan maadeva@cs.umass.edu Department of Computer Science, University
More informationHash-Based Indexes. Chapter 11. Comp 521 Files and Databases Spring
Has-Based Indexes Capter 11 Comp 521 Files and Databases Spring 2010 1 Introduction As for any index, 3 alternatives for data entries k*: Data record wit key value k
More informationCSCE476/876 Spring Homework 5
CSCE476/876 Spring 2016 Assigned on: Friday, Marc 11, 2016 Due: Monday, Marc 28, 2016 Homework 5 Programming assignment sould be submitted wit andin Te report can eiter be submitted wit andin as a PDF,
More informationMAC-CPTM Situations Project
raft o not use witout permission -P ituations Project ituation 20: rea of Plane Figures Prompt teacer in a geometry class introduces formulas for te areas of parallelograms, trapezoids, and romi. e removes
More informationAll truths are easy to understand once they are discovered; the point is to discover them. Galileo
Section 7. olume All truts are easy to understand once tey are discovered; te point is to discover tem. Galileo Te main topic of tis section is volume. You will specifically look at ow to find te volume
More information11. Transceiver Link Debugging Using the System Console
November 2011 QII53029-11.1.0 11. Transceiver Link Debugging Using te System Console QII53029-11.1.0 Tis capter describes ow to use te Transceiver Toolkit in te Quartus II sotware. Te Transceiver Toolkit
More informationVector Processing Contours
Vector Processing Contours Andrey Kirsanov Department of Automation and Control Processes MAMI Moscow State Tecnical University Moscow, Russia AndKirsanov@yandex.ru A.Vavilin and K-H. Jo Department of
More informationSingle and Multi-View Reconstruction of Structured Scenes
ACCV2002: Te 5t Asian Conference on Computer Vision 23 25 January 2002 Melbourne Australia 1 Single and Multi-View econstruction of Structured Scenes Etienne Grossmann Diego Ortin and José Santos-Victor
More informationHash-Based Indexes. Chapter 11. Comp 521 Files and Databases Fall
Has-Based Indexes Capter 11 Comp 521 Files and Databases Fall 2012 1 Introduction Hasing maps a searc key directly to te pid of te containing page/page-overflow cain Doesn t require intermediate page fetces
More information8/6/2010 Assignment Previewer
Week 4 Friday Homework (1321979) Question 1234567891011121314151617181920 1. Question DetailsSCalcET6 2.7.003. [1287988] Consider te parabola y 7x - x 2. (a) Find te slope of te tangent line to te parabola
More informationOptimal In-Network Packet Aggregation Policy for Maximum Information Freshness
1 Optimal In-etwork Packet Aggregation Policy for Maimum Information Fresness Alper Sinan Akyurek, Tajana Simunic Rosing Electrical and Computer Engineering, University of California, San Diego aakyurek@ucsd.edu,
More informationDensity Estimation Over Data Stream
Density Estimation Over Data Stream Aoying Zou Dept. of Computer Science, Fudan University 22 Handan Rd. Sangai, 2433, P.R. Cina ayzou@fudan.edu.cn Ziyuan Cai Dept. of Computer Science, Fudan University
More informationMean Shifting Gradient Vector Flow: An Improved External Force Field for Active Surfaces in Widefield Microscopy.
Mean Sifting Gradient Vector Flow: An Improved External Force Field for Active Surfaces in Widefield Microscopy. Margret Keuper Cair of Pattern Recognition and Image Processing Computer Science Department
More informationTHANK YOU FOR YOUR PURCHASE!
THANK YOU FOR YOUR PURCHASE! Te resources included in tis purcase were designed and created by me. I ope tat you find tis resource elpful in your classroom. Please feel free to contact me wit any questions
More informationOn Calibrating a Camera Network Using Parabolic Trajectories of a Bouncing Ball
On Calibrating a Camera Network Using Parabolic rajectories of a ouncing all Kuan-Wen Cen, Yi-Ping Hung,, Yong-Seng Cen 3 Department of Computer Science and Information Engineering, National aiwan Uniersity,
More informationMeasuring Length 11and Area
Measuring Lengt 11and Area 11.1 Areas of Triangles and Parallelograms 11.2 Areas of Trapezoids, Romuses, and Kites 11.3 Perimeter and Area of Similar Figures 11.4 Circumference and Arc Lengt 11.5 Areas
More information2.3 Additional Relations
3 2.3 Additional Relations Figure 2.3 identiies additional relations, indicating te locations o te object and image, and te ratio o teir eigts (magniication) and orientations. Ray enters te lens parallel
More informationCHAPTER The elevation can be determined as. The partial derivatives can be evaluated,
1 CHAPTER 14 14.1 Te elevation can be determined as (.8,1. (.81. 1.5(1. 1.5(.8 Te partial derivatives can be evaluated,.5 (1..5(.8.4 1.5 4 (.8 1.5 4(1. 1.7 (1. 5 5.4 wic can be used to determine te gradient
More informationMulti-Objective Particle Swarm Optimizers: A Survey of the State-of-the-Art
Multi-Objective Particle Swarm Optimizers: A Survey of te State-of-te-Art Margarita Reyes-Sierra and Carlos A. Coello Coello CINVESTAV-IPN (Evolutionary Computation Group) Electrical Engineering Department,
More informationSymmetric Tree Replication Protocol for Efficient Distributed Storage System*
ymmetric Tree Replication Protocol for Efficient Distributed torage ystem* ung Cune Coi 1, Hee Yong Youn 1, and Joong up Coi 2 1 cool of Information and Communications Engineering ungkyunkwan University
More informationComputer Physics Communications. Multi-GPU acceleration of direct pore-scale modeling of fluid flow in natural porous media
Computer Pysics Communications 183 (2012) 1890 1898 Contents lists available at SciVerse ScienceDirect Computer Pysics Communications ournal omepage: www.elsevier.com/locate/cpc Multi-GPU acceleration
More informationPedestrian Detection Algorithm for On-board Cameras of Multi View Angles
Pedestrian Detection Algoritm for On-board Cameras of Multi View Angles S. Kamijo IEEE, K. Fujimura, and Y. Sibayama Abstract In tis paper, a general algoritm for pedestrian detection by on-board monocular
More informationClassify solids. Find volumes of prisms and cylinders.
11.4 Volumes of Prisms and Cylinders Essential Question How can you find te volume of a prism or cylinder tat is not a rigt prism or rigt cylinder? Recall tat te volume V of a rigt prism or a rigt cylinder
More informationUtilizing Call Admission Control to Derive Optimal Pricing of Multiple Service Classes in Wireless Cellular Networks
Utilizing Call Admission Control to Derive Optimal Pricing of Multiple Service Classes in Wireless Cellular Networks Okan Yilmaz and Ing-Ray Cen Computer Science Department Virginia Tec {oyilmaz, ircen}@vt.edu
More informationMulti-Stack Boundary Labeling Problems
Multi-Stack Boundary Labeling Problems Micael A. Bekos 1, Micael Kaufmann 2, Katerina Potika 1 Antonios Symvonis 1 1 National Tecnical University of Atens, Scool of Applied Matematical & Pysical Sciences,
More informationFollow this and additional works at: Part of the Geology Commons
University of Wyoming Wyoming Scolars Repository Geology and Geopysics Faculty Publications Geology and Geopysics 5-1-2011 An Accurate Ray-Based Offset-To-Angle Transform from Normal Moveout Uncorrected
More informationAsynchronous Power Flow on Graphic Processing Units
1 Asyncronous Power Flow on Grapic Processing Units Manuel Marin, Student Member, IEEE, David Defour, and Federico Milano, Senior Member, IEEE Abstract Asyncronous iterations can be used to implement fixed-point
More informationNotes: Dimensional Analysis / Conversions
Wat is a unit system? A unit system is a metod of taking a measurement. Simple as tat. We ave units for distance, time, temperature, pressure, energy, mass, and many more. Wy is it important to ave a standard?
More informationAn Iterative Approach to the Hand-Eye and Base-World Calibration Problem
Proceedings of te 2001 IEEE International Conference on Robotics & Automation Seoul, Korea. May 21-26, 2001 An Iterative Approac to te Hand-Eye and Base-World Calibration Problem Robert Lee Hirs Guilerme
More informationNon-Interferometric Testing
NonInterferometric Testing.nb Optics 513 - James C. Wyant 1 Non-Interferometric Testing Introduction In tese notes four non-interferometric tests are described: (1) te Sack-Hartmann test, (2) te Foucault
More informationPLK-B SERIES Technical Manual (USA Version) CLICK HERE FOR CONTENTS
PLK-B SERIES Technical Manual (USA Version) CLICK ERE FOR CONTENTS CONTROL BOX PANEL MOST COMMONLY USED FUNCTIONS INITIAL READING OF SYSTEM SOFTWARE/PAGES 1-2 RE-INSTALLATION OF TE SYSTEM SOFTWARE/PAGES
More informationGrid Adaptation for Functional Outputs: Application to Two-Dimensional Inviscid Flows
Journal of Computational Pysics 176, 40 69 (2002) doi:10.1006/jcp.2001.6967, available online at ttp://www.idealibrary.com on Grid Adaptation for Functional Outputs: Application to Two-Dimensional Inviscid
More informationOn the Use of Radio Resource Tests in Wireless ad hoc Networks
Tecnical Report RT/29/2009 On te Use of Radio Resource Tests in Wireless ad oc Networks Diogo Mónica diogo.monica@gsd.inesc-id.pt João Leitão jleitao@gsd.inesc-id.pt Luis Rodrigues ler@ist.utl.pt Carlos
More informationYou should be able to visually approximate the slope of a graph. The slope m of the graph of f at the point x, f x is given by
Section. Te Tangent Line Problem 89 87. r 5 sin, e, 88. r sin sin Parabola 9 9 Hperbola e 9 9 9 89. 7,,,, 5 7 8 5 ortogonal 9. 5, 5,, 5, 5. Not multiples of eac oter; neiter parallel nor ortogonal 9.,,,
More informationClassification of Osteoporosis using Fractal Texture Features
Classification of Osteoporosis using Fractal Texture Features V.Srikant, C.Dines Kumar and A.Tobin Department of Electronics and Communication Engineering Panimalar Engineering College Cennai, Tamil Nadu,
More informationMulti-View Clustering with Constraint Propagation for Learning with an Incomplete Mapping Between Views
Multi-View Clustering wit Constraint Propagation for Learning wit an Incomplete Mapping Between Views Eric Eaton Bryn Mawr College Computer Science Department Bryn Mawr, PA 19010 eeaton@brynmawr.edu Marie
More information2.5 Evaluating Limits Algebraically
SECTION.5 Evaluating Limits Algebraically 3.5 Evaluating Limits Algebraically Preinary Questions. Wic of te following is indeterminate at x? x C x ; x x C ; x x C 3 ; x C x C 3 At x, x isofteform 0 xc3
More informationThe navigability variable is binary either a cell is navigable or not. Thus, we can invert the entire reasoning by substituting x i for x i : (4)
A Multi-Resolution Pyramid for Outdoor Robot Terrain Perception Micael Montemerlo and Sebastian Trun AI Lab, Stanford University 353 Serra Mall Stanford, CA 94305-9010 {mmde,trun}@stanford.edu Abstract
More informationarxiv: v1 [cs.cv] 4 Aug 2016
UnitBox: An Advanced Object Detection Network Jiaui Yu 1,2 Yuning Jiang 2 Zangyang Wang 1 Zimin Cao 2 Tomas Huang 1 1 University of Illinois at Urbana Campaign 2 Megvii Inc {jyu79, zwang119, t-uang1}@illinois.edu,
More informationLaser Radar based Vehicle Localization in GPS Signal Blocked Areas
International Journal of Computational Intelligence Systems, Vol. 4, No. 6 (December, 20), 00-09 Laser Radar based Veicle Localization in GPS Signal Bloced Areas Ming Yang Department of Automation, Sangai
More informationDesign of PSO-based Fuzzy Classification Systems
Tamkang Journal of Science and Engineering, Vol. 9, No 1, pp. 6370 (006) 63 Design of PSO-based Fuzzy Classification Systems Cia-Cong Cen Department of Electronics Engineering, Wufeng Institute of Tecnology,
More informationExcel based finite difference modeling of ground water flow
Journal of Himalaan Eart Sciences 39(006) 49-53 Ecel based finite difference modeling of ground water flow M. Gulraiz Akter 1, Zulfiqar Amad 1 and Kalid Amin Kan 1 Department of Eart Sciences, Quaid-i-Azam
More informationCapacity on Demand User s Guide
System z Capacity on Demand User s Guide SC28-6846-02 Level 02c, October 2009 System z Capacity on Demand User s Guide SC28-6846-02 Level 02c, October 2009 Note Before using tis information and te product
More informationeach node in the tree, the difference in height of its two subtrees is at the most p. AVL tree is a BST that is height-balanced-1-tree.
Data Structures CSC212 1 AVL Trees A binary tree is a eigt-balanced-p-tree if for eac node in te tree, te difference in eigt of its two subtrees is at te most p. AVL tree is a BST tat is eigt-balanced-tree.
More informationCS211 Spring 2004 Lecture 06 Loops and their invariants. Software engineering reason for using loop invariants
CS211 Spring 2004 Lecture 06 Loops and teir invariants Reading material: Tese notes. Weiss: Noting on invariants. ProgramLive: Capter 7 and 8 O! Tou ast damnale iteration and art, indeed, ale to corrupt
More informationImage Registration via Particle Movement
Image Registration via Particle Movement Zao Yi and Justin Wan Abstract Toug fluid model offers a good approac to nonrigid registration wit large deformations, it suffers from te blurring artifacts introduced
More informationAnnouncements. Lilian s office hours rescheduled: Fri 2-4pm HW2 out tomorrow, due Thursday, 7/7. CSE373: Data Structures & Algorithms
Announcements Lilian s office ours resceduled: Fri 2-4pm HW2 out tomorrow, due Tursday, 7/7 CSE373: Data Structures & Algoritms Deletion in BST 2 5 5 2 9 20 7 0 7 30 Wy migt deletion be arder tan insertion?
More informationRECONSTRUCTING OF A GIVEN PIXEL S THREE- DIMENSIONAL COORDINATES GIVEN BY A PERSPECTIVE DIGITAL AERIAL PHOTOS BY APPLYING DIGITAL TERRAIN MODEL
IV. Évfolyam 3. szám - 2009. szeptember Horvát Zoltán orvat.zoltan@zmne.u REONSTRUTING OF GIVEN PIXEL S THREE- DIMENSIONL OORDINTES GIVEN Y PERSPETIVE DIGITL ERIL PHOTOS Y PPLYING DIGITL TERRIN MODEL bsztrakt/bstract
More informationA Geostatistical and Flow Simulation Study on a Real Training Image
A Geostatistical and Flow Simulation Study on a Real Training Image Weishan Ren (wren@ualberta.ca) Department of Civil & Environmental Engineering, University of Alberta Abstract A 12 cm by 18 cm slab
More informationThe (, D) and (, N) problems in double-step digraphs with unilateral distance
Electronic Journal of Grap Teory and Applications () (), Te (, D) and (, N) problems in double-step digraps wit unilateral distance C Dalfó, MA Fiol Departament de Matemàtica Aplicada IV Universitat Politècnica
More informationHASH ALGORITHMS: A DESIGN FOR PARALLEL CALCULATIONS
HASH ALGORITHMS: A DESIGN FOR PARALLEL CALCULATIONS N.G.Bardis Researc Associate Hellenic Ministry of te Interior, Public Administration and Decentralization 8, Dragatsaniou str., Klatmonos S. 0559, Greece
More information