1 Reconstruction Algorithms for UHE Neutrino Events in Sea Water Simon Bevan.

Slides:



Advertisements
Similar presentations
Eigen Decomposition and Singular Value Decomposition
Advertisements

Chapter 28 – Part II Matrix Operations. Gaussian elimination Gaussian elimination LU factorization LU factorization Gaussian elimination with partial.
Generalised Inverses Modal Analysis and Modal Testing S. Ziaei Rad.
Linear Algebra Applications in Matlab ME 303. Special Characters and Matlab Functions.
Lecture 23 Exemplary Inverse Problems including Earthquake Location.
Computer vision: models, learning and inference
1cs542g-term High Dimensional Data  So far we’ve considered scalar data values f i (or interpolated/approximated each component of vector values.
Jonathan Richard Shewchuk Reading Group Presention By David Cline
Some useful linear algebra. Linearly independent vectors span(V): span of vector space V is all linear combinations of vectors v i, i.e.
Lecture 19 Quadratic Shapes and Symmetric Positive Definite Matrices Shang-Hua Teng.
CSci 6971: Image Registration Lecture 2: Vectors and Matrices January 16, 2004 Prof. Chuck Stewart, RPI Dr. Luis Ibanez, Kitware Prof. Chuck Stewart, RPI.
1 Neural Nets Applications Vectors and Matrices. 2/27 Outline 1. Definition of Vectors 2. Operations on Vectors 3. Linear Dependence of Vectors 4. Definition.
Math for CSTutorial 41 Contents: 1.Least squares solution for overcomplete linear systems. 2.… via normal equations 3.… via A = QR factorization 4.… via.
Lecture 20 SVD and Its Applications Shang-Hua Teng.
Linear and generalised linear models
Math for CSLecture 51 Function Optimization. Math for CSLecture 52 There are three main reasons why most problems in robotics, vision, and arguably every.
Basics of regression analysis
Linear and generalised linear models Purpose of linear models Least-squares solution for linear models Analysis of diagnostics Exponential family and generalised.
1cs542g-term Notes  Extra class next week (Oct 12, not this Friday)  To submit your assignment: me the URL of a page containing (links to)
Jonathan Perkin ARENA May 05 Acoustic Cosmic Ray Neutrino Experiment FUTURE PROSPECTS simulation…
Solving System of Linear Equations. 1. Diagonal Form of a System of Equations 2. Elementary Row Operations 3. Elementary Row Operation 1 4. Elementary.
1 Statistical Analysis Professor Lynne Stokes Department of Statistical Science Lecture 5QF Introduction to Vector and Matrix Operations Needed for the.
Properties of Graphs of Quadratic Functions
Boyce/DiPrima 9th ed, Ch 7.3: Systems of Linear Equations, Linear Independence, Eigenvalues Elementary Differential Equations and Boundary Value Problems,
Wireless Communication Elec 534 Set IV October 23, 2007
CSE554AlignmentSlide 1 CSE 554 Lecture 8: Alignment Fall 2014.
Computing the Fundamental matrix Peter Praženica FMFI UK May 5, 2008.
Chapter 15 Modeling of Data. Statistics of Data Mean (or average): Variance: Median: a value x j such that half of the data are bigger than it, and half.
Algorithms for a large sparse nonlinear eigenvalue problem Yusaku Yamamoto Dept. of Computational Science & Engineering Nagoya University.
Day 1 Eigenvalues and Eigenvectors
Day 1 Eigenvalues and Eigenvectors
© 2005 Yusuf Akgul Gebze Institute of Technology Department of Computer Engineering Computer Vision Geometric Camera Calibration.
A Singular Value Decomposition Method For Inverting Line Integrated Electron Density Measurements in Magnetically Confined Plasma Christopher Carey, The.
Unit 6 : Matrices.
CHAPTER 2 MATRICES 2.1 Operations with Matrices Matrix
Scientific Computing Singular Value Decomposition SVD.
Parameter estimation. 2D homography Given a set of (x i,x i ’), compute H (x i ’=Hx i ) 3D to 2D camera projection Given a set of (X i,x i ), compute.
MATH 685/ CSI 700/ OR 682 Lecture Notes Lecture 4. Least squares.
Colorado Center for Astrodynamics Research The University of Colorado 1 STATISTICAL ORBIT DETERMINATION ASEN 5070 LECTURE 11 9/16,18/09.
A Flexible New Technique for Camera Calibration Zhengyou Zhang Sung Huh CSPS 643 Individual Presentation 1 February 25,
3.6 Solving Systems Using Matrices You can use a matrix to represent and solve a system of equations without writing the variables. A matrix is a rectangular.
Chapter 2-OPTIMIZATION G.Anuradha. Contents Derivative-based Optimization –Descent Methods –The Method of Steepest Descent –Classical Newton’s Method.
Matrices and Matrix Operations. Matrices An m×n matrix A is a rectangular array of mn real numbers arranged in m horizontal rows and n vertical columns.
STROUD Worked examples and exercises are in the text Programme 5: Matrices MATRICES PROGRAMME 5.
2.5 – Determinants and Multiplicative Inverses of Matrices.
1 Chapter 8 – Symmetric Matrices and Quadratic Forms Outline 8.1 Symmetric Matrices 8.2Quardratic Forms 8.3Singular ValuesSymmetric MatricesQuardratic.
Parameter estimation class 5 Multiple View Geometry CPSC 689 Slides modified from Marc Pollefeys’ Comp
Chapter 61 Chapter 7 Review of Matrix Methods Including: Eigen Vectors, Eigen Values, Principle Components, Singular Value Decomposition.
STROUD Worked examples and exercises are in the text PROGRAMME 5 MATRICES.
Boot Camp in Linear Algebra TIM 209 Prof. Ram Akella.
Unsupervised Learning II Feature Extraction
Future plans for the ACoRNE collaboration Lee F. Thompson University of Sheffield ARENA Conference, University of Northumbria, 30th June 2006.
CSE 554 Lecture 8: Alignment
Lecture 16: Image alignment
55:148 Digital Image Processing Chapter 11 3D Vision, Geometry
Continuum Mechanics (MTH487)
Gauss-Siedel Method.
CHE 391 T. F. Edgar Spring 2012.
Parameter estimation class 5
Singular Value Decomposition
Hellenic Open University
Parallelization of Sparse Coding & Dictionary Learning
6.5 Taylor Series Linearization
Outline Singular Value Decomposition Example of PCA: Eigenfaces.
Maths for Signals and Systems Linear Algebra in Engineering Lectures 13 – 14, Tuesday 8th November 2016 DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR)
Maths for Signals and Systems Linear Algebra in Engineering Lectures 9, Friday 28th October 2016 DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL.
Maths for Signals and Systems Linear Algebra in Engineering Lecture 6, Friday 21st October 2016 DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL.
Unfolding with system identification
The Elements of Linear Algebra
Linear Algebra: Matrix Eigenvalue Problems – Part 2
Presentation transcript:

1 Reconstruction Algorithms for UHE Neutrino Events in Sea Water Simon Bevan

2 Contents Techniques Analytically Look-up Table Minimum Number of Hydrophones Unknown detector location Passive Detector Fitting The Future

3 Methods Analytically – Fast, but assumes linear propagation of waves Look-up Table – Slow, but can incorporate non-linear propagation models

4 Analytically distancetimespee d The basic Equation: -

5 Finding the Vertex Therefore both P and Q are known If we can find t s, we can find the vertex

6 Singular Value Decomposition But notice M -1 If the system is over constrained, more than 4 hit hydrophones, M becomes non symmetric and can't be inverted If M is singular (the determinant is zero), then M can't be inverted But there is another way – SVD For every m x n matrix, if m>=n, the matrix can be written as M = ULV T Where U and V are orthogonal matrices, containing the column and row eigenvectors respectively, and L is a diagonal matrix containing the eigenvalues in decreasing order. Giving M -1 = VL -1 U T

7 Nearly there….. Now we can solve for P and Q And in the vertex equation only t s is unknown Can we solve t s ? ….of course.

8 t s and But this is a quadratic, how do we pick the right solution? Take the positive solution, and from the calculated time of interaction, t s, and the calculated vertex, propagate an imaginary wave backwards to hydrophone one using the speed of sound in water. Now repeat for the negative solution. We know what time the hydrophone was actually hit, therefore take the solution that most closely matches this time, ie the lowest chi 2.

9 Look-Up Table Define a grid. For each point in this grid calculate the times that the you expect the detectors to be hit. Perform a chi 2 test, with the minimum being the vertex location. Slow, and the more accurate you want the vertex, the slower the method. But this is a very model dependant method, and hence varying propagation methods can be used (refraction, reflection). Actual Path Reconstruct ed Path Minimum chi 2 point Old method reconstructed point, now gives a completely different path, and hit times on different hydrophones Refraction

10 Minimum Number of Hits With a plane of detectors, there are always two opposite, but equally valid solutions. Adding a detector out of the plane destroys this symmetry

11 Unknown Detector Location Strings attached to see bed, and supported by buoys. Going to move with moving bodies of water.

12 The Effect of a Meter Using an event, scatter every hydrophone randomly using a Gaussian with a sigma of 1. This gives an error on the position of ±10m. Can this error be improved?

13 Passive Detector Fitting How do we find the detector positions? Ideally have a fixed transmitter, which you know the position of, then you can work out the position of each hydrophone from time of arrival techniques. But what if there is no such transmitter. Take many noise sources, and perform a multi-dimensional fit on unknown detector and positions and unknown noise locations. See ‘First Results from Rona and Signal Processing Techniques - Sean Danaher’ The saviour or the enemy?

14 Pointing distanc e detecto r locatio n plane scalar In Matrix Form Re-arrange Define A quadratic in b

15 Finally a Telescope Solving for b yields two solutions – the unit vector in opposite directions. Pick one of these solutions (the positive one) and solve for C We now have a position and a direction, so we can point back to the source. With many telescopes, we can pinpoint the source.

16 The Future of ACoRNE Incorporate our refraction model, using the look-up table technique Test the model using calibration sources. Improve the hydrophone location algorithm. Shameless Promotion: - Simulating the Sensitivity of hypothetical km 3 hydrophone arrays to fluxes of UHE neutrinos – Jonathan Perkin Future Plans for the ACoRNE collaboration – Lee Thompson

17 End Now lets link arms and sing the Lumley song……

18