12.540 Principles of the Global Positioning System Lecture 12 Prof. Thomas Herring Room 54-820A; 253-5941

Slides:



Advertisements
Similar presentations
SMA 6304 / MIT / MIT Manufacturing Systems Lecture 11: Forecasting Lecturer: Prof. Duane S. Boning Copyright 2003 © Duane S. Boning. 1.
Advertisements

Principles of the Global Positioning System Prof. Thomas Herring Room A;
State Space Models. Let { x t :t T} and { y t :t T} denote two vector valued time series that satisfy the system of equations: y t = A t x t + v t (The.
Rapid prototyping of GLOBK solutions Lecture 11
Directed Graphs 3/6/121. Normal Person’s Graph x y y = f(x) 3/6/122.
Eigen Decomposition and Singular Value Decomposition
Probabilistic Reasoning over Time
Noise & Data Reduction. Paired Sample t Test Data Transformation - Overview From Covariance Matrix to PCA and Dimension Reduction Fourier Analysis - Spectrum.
Principles of the Global Positioning System Lecture 19 Prof. Thomas Herring Room A;
On the alternative approaches to ITRF formulation. A theoretical comparison. Department of Geodesy and Surveying Aristotle University of Thessaloniki Athanasios.
ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: The FIR Adaptive Filter The LMS Adaptive Filter Stability and Convergence.
Lecture 6 Power spectral density (PSD)
Mobile Intelligent Systems 2004 Course Responsibility: Ola Bengtsson.
Dimensional reduction, PCA
Visual Recognition Tutorial1 Random variables, distributions, and probability density functions Discrete Random Variables Continuous Random Variables.
Ordinary least squares regression (OLS)
© 2003 by Davi GeigerComputer Vision November 2003 L1.1 Tracking We are given a contour   with coordinates   ={x 1, x 2, …, x N } at the initial frame.
Principal Component Analysis Principles and Application.
Probability theory 2008 Outline of lecture 5 The multivariate normal distribution  Characterizing properties of the univariate normal distribution  Different.
Principles of the Global Positioning System Lecture 14 Prof. Thomas Herring Room A;
Statistical Methods for long-range forecast By Syunji Takahashi Climate Prediction Division JMA.
Lecture II-2: Probability Review
Modern Navigation Thomas Herring
Principles of the Global Positioning System Lecture 10 Prof. Thomas Herring Room A;
Multivariate Data and Matrix Algebra Review BMTRY 726 Spring 2012.
Separate multivariate observations
Elec471 Embedded Computer Systems Chapter 4, Probability and Statistics By Prof. Tim Johnson, PE Wentworth Institute of Technology Boston, MA Theory and.
Review of Probability.
Principles of the Global Positioning System Lecture 13 Prof. Thomas Herring Room A;
Principles of the Global Positioning System Lecture 11 Prof. Thomas Herring Room A;
Colorado Center for Astrodynamics Research The University of Colorado STATISTICAL ORBIT DETERMINATION Project Report Unscented kalman Filter Information.
Random Process The concept of random variable was defined previously as mapping from the Sample Space S to the real line as shown below.
STAT 497 LECTURE NOTES 2.
Mathematical Preliminaries. 37 Matrix Theory Vectors nth element of vector u : u(n) Matrix mth row and nth column of A : a(m,n) column vector.
Modern Navigation Thomas Herring
ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: Definitions Random Signal Analysis (Review) Discrete Random Signals Random.
N– variate Gaussian. Some important characteristics: 1)The pdf of n jointly Gaussian R.V.’s is completely described by means, variances and covariances.
Elements of Stochastic Processes Lecture II
Modern Navigation Thomas Herring MW 11:00-12:30 Room
Operations on Multiple Random Variables
Issues in GPS Error Analysis What are the sources of the errors ? How much of the error can we remove by better modeling ? Do we have enough information.
Principles of the Global Positioning System Lecture 12 Prof. Thomas Herring Room ;
Lecture#10 Spectrum Estimation
Chapter 1 Random Process
ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: Normal Equations The Orthogonality Principle Solution of the Normal Equations.
BASIC STATISTICAL CONCEPTS Statistical Moments & Probability Density Functions Ocean is not “stationary” “Stationary” - statistical properties remain constant.
Error Modeling Thomas Herring Room ;
Discrete-time Random Signals
Joint Moments and Joint Characteristic Functions.
Random Processes Gaussian and Gauss-Markov processes Power spectrum of random processes and white processes.
SVY207: Lecture 10 Computation of Relative Position from Carrier Phase u Observation Equation u Linear dependence of observations u Baseline solution –Weighted.
Colorado Center for Astrodynamics Research The University of Colorado 1 STATISTICAL ORBIT DETERMINATION Kalman Filter with Process Noise Gauss- Markov.
Learning Theory Reza Shadmehr Distribution of the ML estimates of model parameters Signal dependent noise models.
CARMA Models for Stochastic Variability (or how to read a PSD) Jim Barrett University of Birmingham.
Issues in GPS Error Analysis What are the sources of the errors ? How much of the error can we remove by better modeling ? Do we have enough information.
Principal Components Analysis ( PCA)
Central limit theorem - go to web applet. Correlation maps vs. regression maps PNA is a time series of fluctuations in 500 mb heights PNA = 0.25 *
Econometrics III Evgeniya Anatolievna Kolomak, Professor.
STATISTICAL ORBIT DETERMINATION Coordinate Systems and Time Kalman Filtering ASEN 5070 LECTURE 21 10/16/09.
ASEN 5070: Statistical Orbit Determination I Fall 2014
Tracking We are given a contour G1 with coordinates G1={x1 , x2 , … , xN} at the initial frame t=1, were the image is It=1 . We are interested in tracking.
9.3 Filtered delay embeddings
Computational Data Analysis
Kalman Filtering: Control with Limited/Noisy Measurements
Random Process The concept of random variable was defined previously as mapping from the Sample Space S to the real line as shown below.
Matrix Algebra and Random Vectors
Principles of the Global Positioning System Lecture 11
Principles of the Global Positioning System Lecture 13
16. Mean Square Estimation
Presentation transcript:

Principles of the Global Positioning System Lecture 12 Prof. Thomas Herring Room A;

3/15/ Lec 122 Estimation Summary –Examine correlations –Process noise White noise Random walk First-order Gauss Markov Processes –Kalman filters – Estimation in which the parameters to be estimated are changing with time

3/15/ Lec 123 Correlations Statistical behavior in which random variables tend to behave in related fashions Correlations calculated from covariance matrix. Specifically, the parameter estimates from an estimation are typically correlated Any correlated group of random variables can be expressed as a linear combination of uncorrelated random variables by finding the eigenvectors (linear combinations) and eigenvalues (variances of uncorrelated random variables).

3/15/ Lec 124 Eigenvectors and Eigenvalues The eigenvectors and values of a square matrix satisfy the equation Ax= x If A is symmetric and positive definite (covariance matrix) then all the eigenvectors are orthogonal and all the eigenvalues are positive. Any covariance matrix can be broken down into independent components made up of the eigenvectors and variances given by eigenvalues. One method of generating samples of any random process (ie., generate white noise samples with variances given by eigenvalues, and transform using a matrix made up of columns of eigenvectors.

3/15/ Lec 125 Error ellipses One special case is error ellipses. Normally coordinates (say North and East) are correlated and we find a linear combinations of North and East that are uncorrelated. Given their covariance matrix we have:

3/15/ Lec 126 Error ellipses These equations are often written explicitly as: The size of the ellipse such that there is P (0-1) probability of being inside is

3/15/ Lec 127 Error ellipses There is only 40% chance of being in 1-sigma error (compared to 68% of 1-sigma in one dimension) Commonly see 95% confidence ellipse which is 2.45-sigma (only 2-sigma in 1-D). Commonly used for GPS position and velocity results

3/15/ Lec 128 Example of error ellipse Covariance Eigenvalues 0.87 and 3.66, Angle -63 o

3/15/ Lec 129 Process noise models In many estimation problems there are parameters that need to be estimated but whose values are not fixed (ie., they themselves are random processes in some way) Examples include for GPS –Clock behavior in the receivers and satellites –Atmospheric delay parameters –Earth orientation parameters –Station position behavior after earthquakes

3/15/ Lec 1210 Process noise models There are several ways to handle these types of variations: –Often, new observables can be formed that eliminate the random parameter (eg., clocks in GPS can be eliminated by differencing data) –A parametric model can be developed and the parameters of the model estimated (eg., piece-wise linear functions can be used to represent the variations in the atmospheric delays) –In some cases, the variations of the parameters are slow enough that over certain intervals of time, they can be considered constant or linear functions of time (eg., EOP are estimated daily) –In some case, variations are fast enough that the process can be treated as additional noise

3/15/ Lec 1211 Process noise models Characterization of noise processes –Firstly need samples of the process (often not easy to obtain) –Auto-correlation functions –Power spectral density functions –Allan variances (frequency standards) –Structure functions (atmospheric delays) –(see Herring, T. A., J. L. Davis, and I. I. Shapiro, Geodesy by radio interferometry: The application of Kalman filtering to the analysis of VLBI data, J. Geophys. Res., 95, 12561–12581, 1990.

3/15/ Lec 1212 Characteristics of random processes Stationary: Property that statistical properties do not depend on time

3/15/ Lec 1213 Specific common processes White-noise: Autocorrelation is Dirac-delta function; PSD is flat; integral of power under PSD is variance of process (true in general) First-order Gauss-Markov process (one of most common in Kalman filtering)

3/15/ Lec 1214 Example of FOGM process

3/15/ Lec 1215 Longer correlation time

3/15/ Lec 1216 Shorter correlation time

Other noise processes Other noise processes can be generated with various algorithms (all computational expensive) –Most General: Given any spectrum for the noise; inverse Fourier transform to generate covariance function (careful of aliasing); find eigenvectors and eigenvalues. Generate white noise with variances given be eigenvalues, multiple by eigenvector matrix. Resultant time series has spectral index properties. –For flicker noise, specific expressions exist for the covariance matrix (Ma et al., JGR, 1997) –Rodrigues et al., Chaos, Solutions and Fractals, 39, 2009 give expression of f  type noise. 3/15/ Lec 1217

3/15/ Lec 1218 Summary Examples show behavior of different correlation sequences (see fogm.m on class web page). The standard deviation of the rate of change estimates will be greatly effected by the correlations. Next class we examine, how we can make an estimator that will account for these correlations.