Towards an improved PEPT triangulation routine J Newling 1, AJ Morrison 1, N Fowkes 2, I Govender 1 and L Bbosa 1 1 University of Cape Town, Cape Town,

Slides:



Advertisements
Similar presentations
4.6 Medians of a Triangle.
Advertisements

Chapter 8 Planar Scintigaraphy
Clustering Clustering of data is a method by which large sets of data is grouped into clusters of smaller sets of similar data. The example below demonstrates.
Histogram Analysis to Choose the Number of Clusters for K Means By: Matthew Fawcett Dept. of Computer Science and Engineering University of South Carolina.
Statistics & Econometrics Statistics & Econometrics Statistics & Econometrics Statistics & Econometrics Statistics & Econometrics Statistics & Econometrics.
Kiyoshi Irie, Tomoaki Yoshida, and Masahiro Tomono 2011 IEEE International Conference on Robotics and Automation Shanghai International Conference Center.
The Cat and The Mouse -- The Case of Mobile Sensors and Targets David K. Y. Yau Lab for Advanced Network Systems Dept of Computer Science Purdue University.
CS CS 175 – Week 2 Processing Point Clouds Registration.
Kevin and Kyra Moon EE 670 December 1,  Background ◦ Motivation ◦ Problem  Theoretical model for backscatter  Simulations  Estimators ◦ ML ◦
1 Integration of Background Modeling and Object Tracking Yu-Ting Chen, Chu-Song Chen, Yi-Ping Hung IEEE ICME, 2006.
MULTIPLE MOVING OBJECTS TRACKING FOR VIDEO SURVEILLANCE SYSTEMS.
K-means Clustering. What is clustering? Why would we want to cluster? How would you determine clusters? How can you do this efficiently?
Dynamic Clustering for Acoustic Target Tracking in Wireless Sensor Network Wei-Peng Chen, Jennifer C. Hou, Lui Sha Presented by Ray Lam Oct 23, 2004.
Introduction to Longitudinal Phase Space Tomography Duncan Scott.
Maurizio Conti, Siemens Molecular Imaging, Knoxville, Tennessee, USA
In general, H 1 (f) and H 2 (f) can be chosen to best suit the application. For example, to accentuate the signals at the frequencies in which the signal-to-noise.
Lifetime and Coverage Guarantees Through Distributed Coordinate- Free Sensor Activation ACM MOBICOM 2009.
Statistics Chapter 9. Statistics Statistics, the collection, tabulation, analysis, interpretation, and presentation of numerical data, provide a viable.
University of Maryland Department of Civil & Environmental Engineering By G.L. Chang, M.L. Franz, Y. Liu, Y. Lu & R. Tao BACKGROUND SYSTEM DESIGN DATA.
DelayRatio: A Gravitational Wave Event Physical Likelihood Estimator Based on Detection Delays and SNR Ratios Amber L. Stuver LIGO Livingston ObservatoryCalifornia.
Computational Study of Liquid-Liquid Dispersion in a Rotating Disc Contactor A. Vikhansky and M. Kraft Department of Chemical Engineering, University of.
Probe-Level Data Normalisation: RMA and GC-RMA Sam Robson Images courtesy of Neil Ward, European Application Engineer, Agilent Technologies.
Stochastic Linear Programming by Series of Monte-Carlo Estimators Leonidas SAKALAUSKAS Institute of Mathematics&Informatics Vilnius, Lithuania
A Hybrid Method for achieving High Accuracy and Efficiency in Object Tracking using Passive RFID Lei Yang 1, Jiannong Cao 1, Weiping Zhu 1, and Shaojie.
Particle Filters for Shape Correspondence Presenter: Jingting Zeng.
Module 1: Statistical Issues in Micro simulation Paul Sousa.
Intelligent Database Systems Lab 1 Advisor : Dr. Hsu Graduate : Jian-Lin Kuo Author : Silvia Nittel Kelvin T.Leung Amy Braverman 國立雲林科技大學 National Yunlin.
Innovative Method to Measure Solids Circulation in Spouted Fluidized Beds 2009 AIChE National Meeting Nashville, TN November 9, 2009.
Flock Inspired Area Coverage Using Wireless Boid-like Sensor Agents Colin Chibaya Rhodes University Computer Science Department Grahamstown,
3.3 Working with Grouped Data Objectives: By the end of this section, I will be able to… 1) Calculate the weighted mean. 2) Estimate the mean for grouped.
How DO they actually locate earthquakes? Alternatives to S-P Triangulation Hubenthal, M. Taber, M.
Selecting Input Probability Distribution. Simulation Machine Simulation can be considered as an Engine with input and output as follows: Simulation Engine.
CZECH STATISTICAL OFFICE | Na padesátém 81, Prague 10 | czso.cz1/X Ing. Jaroslav Kraus, Ph.D. Mgr. Štěpán Moravec DISAGGREGATION METHODS FOR GEOREFERENCING.
Lecture 12: Linkage Analysis V Date: 10/03/02  Least squares  An EM algorithm  Simulated distribution  Marker coverage and density.
Stage 1 Statistics students from Auckland university Using a sample to make a point estimate.
What’s the Point? Working with 0-D Spatial Data in ArcGIS
Comparing k Populations Means – One way Analysis of Variance (ANOVA)
Data Mining Practical Machine Learning Tools and Techniques Chapter 4: Algorithms: The Basic Methods Section 4.8: Clustering Rodney Nielsen Many of these.
Boosted Particle Filter: Multitarget Detection and Tracking Fayin Li.
Radiation Detection and Measurement, JU, 1st Semester, (Saed Dababneh). 1 Radioactive decay is a random process. Fluctuations. Characterization.
South Dakota School of Mines & Technology Introduction to Probability & Statistics Industrial Engineering.
Machine Learning Queens College Lecture 7: Clustering.
1 Motion Fuzzy Controller Structure(1/7) In this part, we start design the fuzzy logic controller aimed at producing the velocities of the robot right.
Discrete and Continuous Random Variables. Yesterday we calculated the mean number of goals for a randomly selected team in a randomly selected game.
Presented by: Idan Aharoni
1 Molecular Simulations Macroscopic EOS (vdW, PR) Little molecular detail Empirical parameters (  ) Seeking understanding of complex systems Surfactants.
1/7 Positron Emission Particle Tracking (PEPT) To Study Flow and Mixing in Twin Screw Extrusion.
Backpacks on chairs if they don’t fit on hangers.
Given a set of data points as input Randomly assign each point to one of the k clusters Repeat until convergence – Calculate model of each of the k clusters.
ZEPLIN III Position Sensitivity PSD7, 12 th to 17 th September 2005, Liverpool, UK Alexandre Lindote LIP - Coimbra, Portugal On behalf of the ZEPLIN/UKDM.
Outline Historical note about Bayes’ rule Bayesian updating for probability density functions –Salary offer estimate Coin trials example Reading material:
What are Angle Bisectors and Medians? “Angle bisectors and medians are the same thing!” True or False.
Medians, and Altitudes.
SECTION 1.4 Exploring Geometry by using Paper Folding
2.2.4 Use slope criteria for parallel and perpendicular lines to solve problems on the coordinate plane.
Medians and Altitudes of a Triangle
Vocabulary and Examples
Introduction Goal: Can we reconstruct the energy depositions of the proton in the brain if we are able to reconstruct the photons produced during this.
Adjustment of Temperature Trends In Landstations After Homogenization ATTILAH Uriah Heat Unavoidably Remaining Inaccuracies After Homogenization Heedfully.
Medians and Altitudes Median – A segment whose endpoints are a vertex of a triangle and the midpoint of the side opposite the vertex. Centroid – The point.
Numerical Model Atmospheres (Hubeny & Mihalas 16, 17)
Hypothesis testing. Chi-square test
Distributed Forces: Centroids and Centers of Gravity
POINT ESTIMATOR OF PARAMETERS
Day 33 Range Sensor Models 12/10/2018.
Topic Quadrats and random sampling techniques Level
Physics-guided machine learning for milling stability:
Data Mining CSCI 307, Spring 2019 Lecture 24
Uniform Probability Distribution
Srinivas Neginhal Anantharaman Kalyanaraman CprE 585: Survey Project
Presentation transcript:

Towards an improved PEPT triangulation routine J Newling 1, AJ Morrison 1, N Fowkes 2, I Govender 1 and L Bbosa 1 1 University of Cape Town, Cape Town, South Africa 2 University of Western Australia, Perth, Australia

Tumbling Mills Minerals industry (gold, platinum, copper, etc …) Main aim is size reduction of extracted ore Very energy-intensive, however inefficient Aggressive environment, in situ measurement not feasible Models are empirical – Mill specific – Ore specific Mill diameter 0.3 – 5m Rotational speed 15 – 40 rpm

Positron Emission Particle Tracking

γ γ

Sources of false events True Pairing Scattered Pairing Random Pairing

Triangulation 75% - 90% of recorded events are discarded

Proposal 1: Minimum perpendicular distance method Method Find the midpoint of the perpendicular between successive lines of response Use the median of these midpoints to estimate the particle location in that time interval Motivation Avoid iteration by using the median to weight true pairs Shortcoming No guarantee that the closest approach is in the area of the tracer particle

Proposal 1: Minimum perpendicular distance method

Proposal 2: Density of lines Method Discretise the field of the view into a 3D grid. Use the number of intersections of the LoRs with each grid element to isolate the particle position Motivation Discriminate against random and scattered events Shortcoming Computationally expensive

Proposal 2: Density of lines Dino Giovannoni & Matthew Bickell (Physics Honours) From detected lines to line density… … to probability distributions… … to particle position.

Proposal 3: 2D triangulation Method Divide LoR into coplanar sets and use these to reduce the problem to a 2D one Motivation Simplify the 3D case into a 2D problem Shortcoming Drastically reduces the statistics Does not discriminate between true and false lines.

Proposal 4: Distance distribution Method Use the current iterative method to calculate the centroid Use the distribution of LoR distances from the centroid to dynamically determine the fraction to discard Recalculate the centroid and repeat until some convergence criteria is met. Motivation Avoid having to calibrate the routine for each experiment Shortcoming Does not reduce the computational expense

Proposal 4: Distance distribution Frequency of events Distance from centroid /mm

Conclusion