Lecture #15 Lecture Notes

Similar documents
2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.

Lecture 4: Principal components

Programming in Fortran 90 : 2017/2018

Simulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010

Machine Learning 9. week

Exercises (Part 4) Introduction to R UCLA/CCPR. John Fox, February 2005

Electrical analysis of light-weight, triangular weave reflector antennas

Analysis of Continuous Beams in General

Reading. 14. Subdivision curves. Recommended:

Structure from Motion

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

Mathematics 256 a course in differential equations for engineering students

Radial Basis Functions

What are the camera parameters? Where are the light sources? What is the mapping from radiance to pixel color? Want to solve for 3D geometry

Recognizing Faces. Outline

Lecture 5: Multilayer Perceptrons

Barycentric Coordinates. From: Mean Value Coordinates for Closed Triangular Meshes by Ju et al.

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Parallelism for Nested Loops with Non-uniform and Flow Dependences

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices

Computer Animation and Visualisation. Lecture 4. Rigging / Skinning

Model-Based Bundle Adjustment to Face Modeling

REFRACTION. a. To study the refraction of light from plane surfaces. b. To determine the index of refraction for Acrylic and Water.

ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices

On Some Entertaining Applications of the Concept of Set in Computer Science Course

Cluster Analysis of Electrical Behavior

Image Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline

Solutions to Programming Assignment Five Interpolation and Numerical Differentiation

Feature Reduction and Selection

S.P.H. : A SOLUTION TO AVOID USING EROSION CRITERION?

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur

K-means and Hierarchical Clustering

An Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method

High resolution 3D Tau-p transform by matching pursuit Weiping Cao* and Warren S. Ross, Shearwater GeoServices

UNIT 2 : INEQUALITIES AND CONVEX SETS

Outline. Self-Organizing Maps (SOM) US Hebbian Learning, Cntd. The learning rule is Hebbian like:

Hermite Splines in Lie Groups as Products of Geodesics

A Binarization Algorithm specialized on Document Images and Photos

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

Parallel Numerics. 1 Preconditioning & Iterative Solvers (From 2016)

APPLICATION OF A COMPUTATIONALLY EFFICIENT GEOSTATISTICAL APPROACH TO CHARACTERIZING VARIABLY SPACED WATER-TABLE DATA

Principal Component Inversion

Kiran Joy, International Journal of Advanced Engineering Technology E-ISSN

Face Recognition University at Buffalo CSE666 Lecture Slides Resources:

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms

A CLASS OF TRANSFORMED EFFICIENT RATIO ESTIMATORS OF FINITE POPULATION MEAN. Department of Statistics, Islamia College, Peshawar, Pakistan 2

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)

Some Tutorial about the Project. Computer Graphics

Outline. Midterm Review. Declaring Variables. Main Variable Data Types. Symbolic Constants. Arithmetic Operators. Midterm Review March 24, 2014

The Research of Ellipse Parameter Fitting Algorithm of Ultrasonic Imaging Logging in the Casing Hole

Solving two-person zero-sum game by Matlab

Vanishing Hull. Jinhui Hu, Suya You, Ulrich Neumann University of Southern California {jinhuihu,suyay,

TN348: Openlab Module - Colocalization

Angle-Independent 3D Reconstruction. Ji Zhang Mireille Boutin Daniel Aliaga

Smoothing Spline ANOVA for variable screening

Module 6: FEM for Plates and Shells Lecture 6: Finite Element Analysis of Shell

Shape Representation Robust to the Sketching Order Using Distance Map and Direction Histogram

Notes on Organizing Java Code: Packages, Visibility, and Scope

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

Multi-stable Perception. Necker Cube

Sequential search. Building Java Programs Chapter 13. Sequential search. Sequential search

Extraction of Uncorrelated Sparse Sources from Signal Mixtures using a. Clustering Method

CMPS 10 Introduction to Computer Science Lecture Notes

Classifier Selection Based on Data Complexity Measures *

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION

USING GRAPHING SKILLS

Simplification of 3D Meshes

S1 Note. Basis functions.


Detection of an Object by using Principal Component Analysis

THE THEORY OF REGIONALIZED VARIABLES

7/12/2016. GROUP ANALYSIS Martin M. Monti UCLA Psychology AGGREGATING MULTIPLE SUBJECTS VARIANCE AT THE GROUP LEVEL

CS 534: Computer Vision Model Fitting

Intra-Parametric Analysis of a Fuzzy MOLP

Outline. Type of Machine Learning. Examples of Application. Unsupervised Learning

Wavefront Reconstructor

AMath 483/583 Lecture 21 May 13, Notes: Notes: Jacobi iteration. Notes: Jacobi with OpenMP coarse grain

Optimization Methods: Integer Programming Integer Linear Programming 1. Module 7 Lecture Notes 1. Integer Linear Programming

Kent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming

Edge Detection in Noisy Images Using the Support Vector Machines

Lecture 5: Probability Distributions. Random Variables

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

Sixth-Order Difference Scheme for Sigma Coordinate Ocean Models

Analysis of 3D Cracks in an Arbitrary Geometry with Weld Residual Stress

Unsupervised Learning

Complex Filtering and Integration via Sampling

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics

Discussion. History and Outline. Smoothness of Indirect Lighting. Irradiance Caching. Irradiance Calculation. Advanced Computer Graphics (Fall 2009)

AVO Modeling of Monochromatic Spherical Waves: Comparison to Band-Limited Waves

Harmonic Coordinates for Character Articulation PIXAR

Region Segmentation Readings: Chapter 10: 10.1 Additional Materials Provided

Programming Assignment Six. Semester Calendar. 1D Excel Worksheet Arrays. Review VBA Arrays from Excel. Programming Assignment Six May 2, 2017

Storm Surge and Tsunami Simulator in Oceans and Coastal Areas

Announcements. Supervised Learning

Brave New World Pseudocode Reference

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

Transcription:

Lecture #15 Lecture Notes The ocean water column s very much a 3-D spatal entt and we need to represent that structure n an economcal way to deal wth t n calculatons. We wll dscuss one way to do so, emprcal orthogonal functons, n what follows. A.1. EOF s Let us assume a representaton of the 3D soundspeed feld (though t can actually be ANY ocean feld) by c c( c( x, As we have been dong wth our other lnear nverse problems, let s thnk of ths n matrx form. In partcular, let s consder a real world case where we have done sx CTD profles to get the ocean sourdspeed profle at sx dfferent (x, ponts. Let s also consder 4 vertcal ponts of each profle as gvng a far samplng of the vertcal structure. (We could always use more f the vertcal profle has a lot of structure we ust pck four here as an example.) Then the sx CTD s and four levels let us form a 4x6 matrx, as you can see n my beautful handwrtng below: 1

Subtractng the mean soundspeed at each depth level (seen n equaton above) from each measurement, we get the 4x6 soundspeed varance matrx seen above,.e. the c A matrx. Ths s OK, but we really want to work wth square matrces. No problem we ust multply the A matrx by ts transpose, whch s a 6x4 matrx,.e. 2

Ths s nce, because the dmenson of the matrx s ust the number of vertcal levels we want to use, generally of order ~10. Often we have many CTD casts, or vertcal profles from towed CTD s lke Scanfsh, to deal wth, so that M>>N n general. The bg gan here s that T AA s a standard egenvalue problem! The (column vectors) belongng to each (the egenvalues whch represent the energy n each mode) are called the Emprcal Orthogonal Functons and wll be seen to be very useful. Let s dscuss ther propertes for a second. Frst, they are the modes of the covarance matrx they express the varablty of c(x, about the mean profle n a modal representaton. Second, they are emprcal because they are data based no theory or model nvolved. And they are orthogonal T because the relaton holds. There are also two other propertes of the EOF s that turn out to be very useful. Frst, they put the most energy possble nto the lowest modes,.e. they produce the reddest modal spectrum possble. Ths s useful because the ocean dynamcal modes also have a red spectrum, so that the EOF s provde a good match to the ocean dynamcs. And second, due to ths red propert one can often truncate the modal sum wth lttle or no harm to the results a nce computatonal savng. Let s look closer at the EOF modal representaton, whch s: c( x, c( N 1 a ( Ths expresson s nce, but have we done anythng better than wrte c(x, n a dfferent way? Um,yeah. We had c(x, only at our measurement stes, and now wth ths representaton, we can fnd c(x, everywhere n a way that s consstent wth the ocean dynamcs. To see ths, let s frst get the a at the measurement stes. c( x, N 1 a ( 3

Followng standard procedure, we use the orthogonalty of the EOF s to proect out the ( on the RHS,.e. we multply the equaton above by ( and ntegrate over z. So we have or ( c( x, dz a N 1 a c( x, ( dz ( ( dz We now have the EOF coeffcents at the (x, coordnates of our measurements. Ths s what we need, as we can nterpolate the a n the x-y plane on a mode by mode bass, as seen below! In the lttle cartoon above, we want the 3D oceanography along the source to recever acoustc lne for some acoustcs purpose or at the want spot. But we ust have the a at the measurement ponts n the regon. But, f we nterpolate those coeffcents n 2D (an easy enough exercse, as we wll see) on a mode by mode bass, we can get the feld anywhere we want, e.g. the want spot on the pcture, or along the S/R track. And not only can we do ths ths s perhaps the best, most consstent nterpolaton we can do, as we wll see n the next secton. A.2. Gauss Markov nterpolaton - theory We can nterpolate the EOF coeffcents n (x, va canned routne 2D nterpolators to get a 3D ocean feld, and there s no law to stop us. But there are better and worse ways to do the nterpolaton. In sayng ths, we re not talkng about effcenc but rather respectng the dynamc scales of the medum so that we don t nterpolate entrely uncorrelated ponts! We wll look here at the so-called Gauss Markov 4

nterpolator, whch s both effcent, and also takes nto account the scales of the ocean medum. Assume that a measurement (e.g. the a that consttute our measurement at each r=(x, poston) conssts of a true value plus some nose (whch can be computed from the error/nose n our c(x, measurements). So If the error s spatally uncorrelated, and also not correlated to the true value,.e. [ ] where s the error varance [ ] Then (wthout showng the proof) the least squares optmal estmator of gven by at any pont t s [ ] In the above, n s the number of measurements (data ponts) one uses n framng the estmate and the A,B matrces are gven by: [ ] ( ) ( ) where C s the spatal correlaton functon. We see that ths formalsm explctly nects the spatal scale(s) of the ocean medum nto the problem, so that the estmate for the soundspeed (or temperature or whatever) feld has both reasonable modal structure (the EOF modes and ocean modes are smlar) and also the correct correlaton scales for the ocean modes. Moreover, n dong the sums above, one only has to consder the n data ponts that are wthn a correlaton length of the pont we are tryng to nterpolate to. Ths makes the scheme more numercally effcent as well. Often, for ocean work, we can use a smple radal form for the correlaton functon, e.g. a Gaussan, where the wdth of the Gaussan s the radal spatal correlaton length. In consderng ocean eddes (as an example), we can take ths correlaton length to be the Rossby radus of deformaton, whch descrbes how the Corols effect moves the water n a crcular path gven the lattude and speed of the feature. Specfcall ( ) 5

phase velocty of the feature of nterest As an example, we can use ~ 50 km at 45 degrees for deep ocean eddes, and set the correlaton length to ths number. Another way to get the correlaton functon, f one has lots of data, s the data-data correlaton functon, whch we defne va ( ) ( ) ( ) ( ) ( ) We wll generally get a more rregularly shaped correlaton functon from the real data, but t wll be a correct one. We also not n passng that for the EOF s (and any other such modal representaton), each mode has ts own correlaton length,.e.. A.3. Gauss Markov nterpolaton some examples Let me post some old calculated examples of usng the Gauss Markov nterpolator n varous crcumstances. The frst example s a Harvard Open Ocean model secton of the Gulf Stream. We look at the soundspeed contours at some depth (whch doesn t so much matter for now), and get the sold lne result from the model. Now, f we remove all the grd ponts of the model except for the ones wth astersks (a drastc decmaton of the data), we want to retreve an nterpolated verson of the Gulf Stream SSP usng a Gauss Markov nterpolaton. Usng the data-data correlaton functon, we were able to get the dashed lne result a very good match to the orgnal 3D feld! 6

Another useful example to show s how one can nterpolate through bathymetrc change usng the Gauss Markov nterpolator. By lookng at the average soundspeed at each depth level, whch can have a dfferent number of ponts, and assgnng the water soundpeed n the sedment to be the average of the water column ponts at that level, we get reasonable answers, e.g. 7

An example of ths s nterpolatng n the vcnty of a seamount. Ths s a crude old MATLAB result, but shows qute well that the nterpolaton wth and wthout bathymetry s consstent. The only dfference n the results s nsde the seamount, where the result s meanngless anyway! 8

9

MIT OpenCourseWare http://ocw.mt.edu 2.682 Acoustcal Oceanography Sprng 2012 For nformaton about ctng these materals or our Terms of Use, vst: http://ocw.mt.edu/terms.