AND FURTHER ADVENTURES WITH R

Slides:



Advertisements
Similar presentations
Estimation of TLD dose measurement uncertainties and thresholds at the Radiation Protection Service Du Toit Volschenk SABS.
Advertisements

Clustering.
DECISION TREES. Decision trees  One possible representation for hypotheses.
GN/MAE155B1 Orbital Mechanics Overview 2 MAE 155B G. Nacouzi.
ARO309 - Astronautics and Spacecraft Design Winter 2014 Try Lam CalPoly Pomona Aerospace Engineering.
Computational Biology, Part 23 Biological Imaging II Robert F. Murphy Copyright  1996, 1999, All rights reserved.
An Approach to Evaluate Data Trustworthiness Based on Data Provenance Department of Computer Science Purdue University.
SASH Spatial Approximation Sample Hierarchy
8. Statistical tests 8.1 Hypotheses K. Desch – Statistical methods of data analysis SS10 Frequent problem: Decision making based on statistical information.
Cluster Analysis.  What is Cluster Analysis?  Types of Data in Cluster Analysis  A Categorization of Major Clustering Methods  Partitioning Methods.
Bioinformatics Challenge  Learning in very high dimensions with very few samples  Acute leukemia dataset: 7129 # of gene vs. 72 samples  Colon cancer.
(hyperlink-induced topic search)
The true orbits of visual binaries can be determined from their observed orbits as projected in the plane of the sky. Once the true orbit has been computed,
Chpt. 5: Describing Orbits By: Antonio Batiste. If you’re flying an airplane and the ground controllers call you on the radio to ask where you are and.
Lecture 09 Clustering-based Learning
COMETS, KUIPER BELT AND SOLAR SYSTEM DYNAMICS Silvia Protopapa & Elias Roussos Lectures on “Origins of Solar Systems” February 13-15, 2006 Part I: Solar.
Facial Recognition CSE 391 Kris Lord.
Radial Basis Function Networks
Presented by Tienwei Tsai July, 2005
1 Machine Learning The Perceptron. 2 Heuristic Search Knowledge Based Systems (KBS) Genetic Algorithms (GAs)
Incident Threading for News Passages (CIKM 09) Speaker: Yi-lin,Hsu Advisor: Dr. Koh, Jia-ling. Date:2010/06/14.
The Solar SystemSection 3 Section 3: Formation of the Solar System Preview Key Ideas Bellringer Early Astronomy The Nebular Hypothesis Rocks in Space Comets.
A Brief Introduction to Astrodynamics
PRESENTED BY – GAURANGI TILAK SHASHANK AGARWAL Collision Detection.
November 13, 2014Computer Vision Lecture 17: Object Recognition I 1 Today we will move on to… Object Recognition.
Vehicle Segmentation and Tracking From a Low-Angle Off-Axis Camera Neeraj K. Kanhere Committee members Dr. Stanley Birchfield Dr. Robert Schalkoff Dr.
3D Event reconstruction in ArgoNeuT Maddalena Antonello and Ornella Palamara 11 gennaio 20161M.Antonello - INFN, LNGS.
A new clustering tool of Data Mining RAPID MINER.
V.M. Sliusar, V.I. Zhdanov Astronomical Observatory, Taras Shevchenko National University of Kyiv Observatorna str., 3, Kiev Ukraine
Introduction: Vectors and Integrals. Vectors Vectors are characterized by two parameters: length (magnitude) direction These vectors are the same Sum.
1 Giuseppe Romeo Voronoi based Source Detection. 2 Voronoi cell The Voronoi tessellation is constructed as follows: for each data point  i (also called.
Celestial Mechanics VI The N-body Problem: Equations of motion and general integrals The Virial Theorem Planetary motion: The perturbing function Numerical.
The Solar SystemSection 3 Section 3: Formation of the Solar System Preview Key Ideas Bellringer Early Astronomy The Nebular Hypothesis Rocks in Space How.
Preview Key Ideas Bellringer Early Astronomy The Nebular Hypothesis Rocks in Space Comets How the Moon Formed Do Other Stars Have Planets?
SPACE SCIENCE 8: NEAR-EARTH OBJECTS. NEAR-EARTH OBJECTS (NEOs) Near-Earth objects (NEOs) are asteroids or comets with sizes ranging from meters to tens.
3-4. The Tisserand Relation
Hierarchical Clustering: Time and Space requirements
SIMILARITY SEARCH The Metric Space Approach
Chapter 1 Introduction Ying Yi PhD PHYS HCC.
The different types and how they form.
Particle Swarm Optimization (2)
The Solar System and Planetary Motion.
Lunar Trajectories.
Forecasting Methods Dr. T. T. Kachwala.
Rule Induction for Classification Using
Distance Computation “Efficient Distance Computation Between Non-Convex Objects” Sean Quinlan Stanford, 1994 Presentation by Julie Letchner.
Annual occurrence of meteorite-dropping fireballs N. A. Konovalova1, T
The stability criterion for three-body system
Mean Shift Segmentation
Data Mining (and machine learning)
minor members of the solar system
Counter propagation network (CPN) (§ 5.3)
CSE 4705 Artificial Intelligence
Vehicle Segmentation and Tracking in the Presence of Occlusions
Zeta Cassiopeiids (ZCS-444)
Flight Dynamics Michael Mesarch Frank Vaughn Marco Concha 08/19/99
College Physics Chapter 1 Introduction.
meteor research processes Single Station Observation Measurement
Visualisation Tools 2018 Update
Object Recognition Today we will move on to… April 12, 2018
CSCI N317 Computation for Scientific Applications Unit Weka
Cluster Validity For supervised classification we have a variety of measures to evaluate how good our model is Accuracy, precision, recall For cluster.
Data Mining – Chapter 4 Cluster Analysis Part 2
Nearest Neighbors CSC 576: Data Mining.
Infrasonic detection of meteoroid entries
FEATURE WEIGHTING THROUGH A GENERALIZED LEAST SQUARES ESTIMATOR
Continuous Density Queries for Moving Objects
Physics-guided machine learning for milling stability:
as a means of recovering THE CASE OF COMET 1917/F1 (MELLISH)
An exosolar system N - body simulator :
Presentation transcript:

AND FURTHER ADVENTURES WITH R Orbital Similarity AND FURTHER ADVENTURES WITH R

Formation of Meteoroid streams Solid particles released from an active comets or NEAs Orbit remains similar to that of parent body: Ejected at very low velocity relative to the parent Resulting orbital dispersion is small Orbit dispersion will occur: Dynamic (chaotic) evolution of meteoroid stream Gravitational perturbations Radiation effects (Poynting—Robertson drag) Collisions Predominance of larger particles in older streams Dispersion increases over time until, eventually a stream will become dispersed into the background

ORBITAL SIMILARITY A fundamental question is whether a meteor belongs to a stream or is just part of the random background Establishing the degree of orbital similarity essential to: Associating meteors with known streams Associating meteors with parent bodies identification of new streams Knowing the origin of a stream gives us more clues to: Ejection process(es) Time of possible ejection(s) / age of stream Past and present orbits of parent bodies.

Orbital Similarity - Challenges Weak showers: identifying a ‘signal’ from the background Related objects may appear dissimilar due to Meteor stream evolution Uncertainties in measurements Unrelated meteors may appear to be similar by chance. Contamination from the background sporadic meteors

Stream Association Stream Identification

UFO software UFO uses coarse classification system using a radiant list: Date range Direction Velocity Accuracy improves with Unified observations We can play with the parameters / tolerances: Extension days Radiant diameter (%) Velocity (%)

HOW DO WE GET MORE SCIENTIFIC RIGOUR? Separating meteor showers from the sporadic meteor background is critical With UFO we have no means to understand / measure false positives

HOW STATISTICIANS WOULD APPROACH THIS ? Cluster analysis: sets of objects are grouped so that objects in the same group (called a cluster) are more similar to each other than to those in other groups (clusters). Grouping is usually based on a Distance function that gives a value to the distance between data points

Southworth and Hawkins (1963) First quantitative measure of orbital similarity First use of a computer to search for associations with parent body A form of cluster analysis

Southworth and Hawkins - DSH Uses analogy with a five-dimensional orthogonal coordinate system: Each orbital heliocentric element considered as a coordinate A meteoroid orbit is represented by a point in this co- ordinate space The distance between two points is a measure of the degree of similarity between two meteoroid orbits. Two orbits are associated if DSH is below a certain threshold

Calculating DSH I21 is the angle between the planes of each orbit Eccentricity (e) Inclination (i) Argument of periapsis (ω) Longitude of the ascending node (Ω) Perihelion distance (q) I21 is the angle between the planes of each orbit II21 is the angle between their respective perihelion points:

Modifications DD - DRUMMOND (1982) DD - DRUMMOND (1982) DH - JOPEK (1993) Use of chords as opposed to actual angles to represent I21 and II21 To address problems with large perihelion distances / eccentricities the first two terms of DSH are divided by the sum of the respective orbital elements in DD. Each term in DD is weighted to provide a dimensionless value in range 0 to 1. Takes features from both DSH and DD to create a further D- criterion (DH) VALSECCHI, JOPEK & FROESCHLE (1999). Based directly on comparison of the physical difference between the orbits

D-Criterion Calculations Using D-Criterion D-Criterion Calculations

Analysis Tools Excel UFORadiant UKMON R Suite

Excel

UFO Radiant (Sonotaco)

UKMON R-SUITE GITHUB REPOSOITORY ALGORITHMS Simple D-Analysis DSH (Southworth & Hawkins) DD (Drummond) DH (Jopek) Using SAS: Iterative analysis https://github.com/UKMeteorNetwork

Dd Calculated using J8_Per AS Reference UKMON data 2012 - 2017. Filters: EDMOND quality criteria J8_Per date range

Determining the D-Criterion Cut-off  

Determining the D-Criterion Cutoff Sporadic background begins to dominate Breakpoint at DD = 0.15 Outside / dispersed region of the stream Most Concentrated region of the stream. N changes considerably with D I Neslusan, J Svoren, V Porubcan (1995)

Dd Calculated using ALL UNIFIED OBS UKMON data 2012 - 2017. EDMOND quality criteria Full date range

Finding streams Hierarchical clustering (Southworth): Linking to nearest neighbour Accept Link if D below some criterion No knowledge of mean orbit is needed Iterative (Sekanina): Points inside a hypersphere of radius Dc centred on mean orbital elements Centre of sphere moves with each iteration Hypersphere: In geometry of higher dimensions, a hypersphere is the set of points at a constant distance from a given point called its centre.

ITERATIVE ANALYSIS No Yes Yes No Calculate Mean Orbit Calculate D-Criterion for all orbits against mean Any orbits with D > D0 Remove Orbit with highest D value Calculate Mean Orbit Calculate D-Criterion for all orbits against mean Any orbits with D > D0 Re-introduce Orbit with highest D value No Yes Yes No

Conclusions UFO Orbit does quite well. At DH = 0.15: False Positives < 7% Result is not impacted by date filter D-Criterion has its detractors Other approaches: Geocentric rather than Heliocentric view …?