A PERIMETRIC RE-TEST ALGORITHM THAT IS SIGNIFICANTLY MORE ACCURATE THAN CURRENT PROCEDURES Andrew Turpin School of Computer Science and Information Technology.

Slides:



Advertisements
Similar presentations
Adaptive Methods Research Methods Fall 2008 Tamás Bőhm.
Advertisements

Localization for Mobile Sensor Networks ACM MobiCom 2004 Lingxuan HuDavid Evans Department of Computer Science University of Virginia.
Probabilistic Inverse Dynamics for Nonlinear Blood Pattern Reconstruction Benjamin Cecchetto, Wolfgang Heidrich University of British Columbia.
Adaptive Methods Research Methods Fall 2010 Tamás Bőhm.
DEPARTMENT OF ENGINEERING SCIENCE Information, Control, and Vision Engineering Bayesian Nonparametrics via Probabilistic Programming Frank Wood
Data Mining Methodology 1. Why have a Methodology  Don’t want to learn things that aren’t true May not represent any underlying reality ○ Spurious correlation.
Markov-Chain Monte Carlo
Optom. Rawaa A. El Dous Lecture Overview  Perimetry Definition  Visual Field Definition  Perimetric Techniques  Important Issues in Humphrey Visual.
Computing the Posterior Probability The posterior probability distribution contains the complete information concerning the parameters, but need often.
Assuming normally distributed data! Naïve Bayes Classifier.
Approximations and Errors
The AutoSimOA Project Katy Hoad, Stewart Robinson, Ruth Davies Warwick Business School WSC 07 A 3 year, EPSRC funded project in collaboration with SIMUL8.
The Islamic University of Gaza Faculty of Engineering Civil Engineering Department Numerical Analysis ECIV 3306 Chapter 3 Approximations and Errors.
Automating estimation of warm-up length Katy Hoad, Stewart Robinson, Ruth Davies Warwick Business School Simulation Workshop - April 2008 The AutoSimOA.
End of Chapter 8 Neil Weisenfeld March 28, 2005.
Marius Nicolae Computer Science and Engineering Department University of Connecticut Joint work with Serghei Mangul, Ion Mandoiu and Alex Zelikovsky.
Kernel Density Estimation - concept and applications
Automation of the 805MHz cavity conditioning procedure Ajit Kurup MuCool Test Area RF Workshop, Fermilab 22 nd August 2007.
Noise and Delay Uncertainty Studies for Coupled RC Interconnects Andrew B. Kahng, Sudhakar Muddu † and Devendra Vidhani ‡ UCLA Computer Science Department,
Noise Estimation from a Single Image Ce Liu William T. FreemanRichard Szeliski Sing Bing Kang.
On the Accuracy of Modal Parameters Identified from Exponentially Windowed, Noise Contaminated Impulse Responses for a System with a Large Range of Decay.
Multiantenna-Assisted Spectrum Sensing for Cognitive Radio
Helsinki University of Technology Adaptive Informatics Research Centre Finland Variational Bayesian Approach for Nonlinear Identification and Control Matti.
Marshall University School of Medicine Department of Biochemistry and Microbiology BMS 617 Lecture 6 – Multiple comparisons, non-normality, outliers Marshall.
FastDTW: Toward Accurate Dynamic Time Warping in Linear Time and Space
WSEAS AIKED, Cambridge, Feature Importance in Bayesian Assessment of Newborn Brain Maturity from EEG Livia Jakaite, Vitaly Schetinin and Carsten.
Mean Field Inference in Dependency Networks: An Empirical Study Daniel Lowd and Arash Shamaei University of Oregon.
Multiple Regression Selecting the Best Equation. Techniques for Selecting the "Best" Regression Equation The best Regression equation is not necessarily.
CHANGE DETECTION BASED ON AN INDIVIDUAL PATIENT’S VARIABILITY Andrew Turpin School of Computer Science and Information Technology RMIT University, Melbourne.
The GEO Line detection Monitor Thomas Cokelaer Cardiff University 22 nd August 2003 LIGO-G Z LSC meeting – Hannover – 18,21 August 2003.
Center for Sustainable Transportation Infrastructure Harmonization of Friction Measuring Devices Using Robust Regression Methods Samer Katicha 09/09/2013.
Computational Intelligence: Methods and Applications Lecture 12 Bayesian decisions: foundation of learning Włodzisław Duch Dept. of Informatics, UMK Google:
Lab 3b: Distribution of the mean
Lecture notes for Stat 231: Pattern Recognition and Machine Learning 3. Bayes Decision Theory: Part II. Prof. A.L. Yuille Stat 231. Fall 2004.
Estimating Component Availability by Dempster-Shafer Belief Networks Estimating Component Availability by Dempster-Shafer Belief Networks Lan Guo Lane.
Significant Figures Always record data as accurately as you can (as many sig. figs. as method allows) The last digit of the value that you record should.
Real-Time Simultaneous Localization and Mapping with a Single Camera (Mono SLAM) Young Ki Baik Computer Vision Lab. Seoul National University.
INTRODUCTION TO Machine Learning 3rd Edition
BCS547 Neural Decoding.
Fast motion estimation and mode decision for H.264 video coding in packet loss environment Li Liu, Xinhua Zhuang Computer Science Department, University.
October Andrew C. Gallagher, Jiebo Luo, Wei Hao Improved Blue Sky Detection Using Polynomial Model Fit Andrew C. Gallagher, Jiebo Luo, Wei Hao Presented.
Simulation Study for Longitudinal Data with Nonignorable Missing Data Rong Liu, PhD Candidate Dr. Ramakrishnan, Advisor Department of Biostatistics Virginia.
Isolating Objects From Image Stack Presented By: Md. Amjad Hossain and Raja Naresh.
Chapter 20 Classification and Estimation Classification – Feature selection Good feature have four characteristics: –Discrimination. Features.
ETHEM ALPAYDIN © The MIT Press, Lecture Slides for.
IPSN 2012 Yu Wang, Rui Tan, Guoliang Xing, Jianxun Wang, and Xiaobo Tan NSLab study group 2012/07/02 Reporter: Yuting 1.
AUTOMATED PERIMETRY DR.JYOTI SHETTY MEDICAL DIRECTOR BANGALORE WEST LIONS EYE HOSPITAL, BANGALORE.
Pairwise Sequence Alignment (cont.) (Lecture for CS397-CXZ Algorithms in Bioinformatics) Feb. 4, 2004 ChengXiang Zhai Department of Computer Science University.
Objective Evaluation of Intelligent Medical Systems using a Bayesian Approach to Analysis of ROC Curves Julian Tilbury Peter Van Eetvelt John Curnow Emmanuel.
1 Chapter 8: Model Inference and Averaging Presented by Hui Fang.
A latent Gaussian model for compositional data with structural zeroes Adam Butler & Chris Glasbey Biomathematics & Statistics Scotland.
Towards parameterization of cloud drop size distribution for large scale models Wei-Chun Hsieh Athanasios Nenes Image source: NCAR.
Full modeling versus summarizing gene- tree uncertainty: Method choice and species-tree accuracy L.L. Knowles et al., Molecular Phylogenetics and Evolution.
This represents the most probable value of the measured variable. The more readings you take, the more accurate result you will get.
11/25/03 3D Model Acquisition by Tracking 2D Wireframes Presenter: Jing Han Shiau M. Brown, T. Drummond and R. Cipolla Department of Engineering University.
ETHEM ALPAYDIN © The MIT Press, Lecture Slides for.
School of Computer Science & Engineering
Micro Array Error Analysis Protein Interaction Map Integration & Visualization Dr. Werner Van Belle Department.
David B Henson Medical School University of Manchester
Infer: A Bayesian Inference Approach towards Energy Efficient Data Collection in Dense Sensor Networks. G. Hartl and B.Li In Proc. of ICDCS Natalia.
Bayesian Inference for Small Population Longevity Risk Modelling
PSY 626: Bayesian Statistics for Psychological Science
An Introduction to Visual Fields
An Introduction to Visual Fields
Estimation of Skin Color Range Using Achromatic Features
Robust Full Bayesian Learning for Neural Networks
#22 Uncertainty of Derived Parameters
EE Audio Signals and Systems
Fig. 1 Examples of experimental stimuli and behavioral performance.
Presentation transcript:

A PERIMETRIC RE-TEST ALGORITHM THAT IS SIGNIFICANTLY MORE ACCURATE THAN CURRENT PROCEDURES Andrew Turpin School of Computer Science and Information Technology RMIT University, Melbourne Darko Jankovic Department of Optometry and Vision Science University of Melbourne Allison McKendrick Department of Optometry and Vision Science University of Melbourne

Possible re-test algorithms 1. Use individual presentation information… 2. Use test Hill of Vision to bias re-test 3. Continue the previous test with “next” termination criteria –More reversals (staircase, MOBS) –Tighter PDF standard deviation (Bayesian) –Fixed number of presentaitons 4. Use test thresholds to seed re-test –Starting point for staircase (FT From Prior) –Initialisation of MOBS stacks –Centre a PDF around threshold (ZEST, SITA)

Prior distribution (before first presentation)

After 1 presentation

After 2 presentations

After 3 presentations

After 4 presentations

After 5 presentations Gaussian with standard deviation 3dB

1.Continued ZEST Termination Criteria -Fixed # presentations 4,5,6 -Standard deviation 0.7, 0.8, 0.9, 1.0 LF -Steep, steeper, steepest 2.Seeded ZEST PDFs -Gaussian standard deviation 2,3,4 dB -Step function, width 4,6,8,10 dB LF -Steep, steeper, steepest Termination criteria -Fixed # presentations 4,5,6 -Standard deviation 0.7, 0.8, 0.9, MOBS 1.Stack initialisation 2, 3, 4 dB 2.Termination criteria: 2, 3 reversals 2, 3, 4 width 486 procedure s Patient setFalse + False - Normal-10% Normal-23%15% Normal-315%3% Normal-420% Glaucoma-10% Glaucoma-23%15% Glaucoma-315%3% Glaucoma-420% 8 Patient models Computer Simulations 350 real patients

Performance: No Error, No Change 4567 Mean number of presentations Mean absolute error (dB) 2 1 Z F ull Threshold est S eeded Zest C ontinued Zest S ITA Bengtsson et al, ACTA ‘97

Performance: General Height -3dB 4567 Mean absolute error (dB) 2 1 C S Z F ull Threshold est eeded Zest ontinued Zest S ITA Mean number of presentations

Problems Continue General Height change ignored, need many presentations to get right answer if GH changes, and there is still a bias towards original test value Seed Could adjust seed if GH change known –Estimate with “primary points” algorithm –Would be slower than Full Threshold (and SITA) Katz et al, IOVS 1632

Speeding up GH-corrected Seed Spend 2 or 3 presentations per location checking if threshold not less than last time (multi-sample supra-threshold) If so, then do no more for that location Otherwise, assume threshold decreased, and seed a ZEST accordingly McKendrick & Turpin, OVS 2005

… … Automated Static Perimetry, 1999, Anderson & Patella

General Height decrease of 2dB Supra-threshold decrement of 2dB So multi-sample all locations at previous less 4dB If see this 2 of 3 times, then just use previous threshold - 2dB else do a full ZEST on the location TestRe-Test

General Height decrease of 2dB Supra-threshold decrement of 2dB So test all locations at previous less 4dB If see this 2 of 3 times, then just use previous threshold - 2dB else do a full ZEST on the location

Performance with no error 4567 Mean absolute error (dB) 2 1 C SZ F ull Threshold esteeded Zest ontinued Zest N ew S ITA Mean number of presentations

General height -3dB 4567 Mean absolute error (dB) 2 1 C S Z F ull Threshold est eeded Zest ontinued Zest N ew S ITA Mean number of presentations

Conclusions Continuing previous procedure doesn’t work Seeding a ZEST with a Gaussian pdf about previous threshold works, but is slow Adding multi-sampling supra-threshold step gives speed and accuracy gains The resulting re-test procedure is as fast, but more accurate, than existing test algorithms BUT does not detect an isolated increase in threshold

Hill of Vision Approach Alter eccentricity adjustments in growth pattern based on individual’s HoV Takes into account General Height change Very small gains, but not really worth the effort

CCCC BBBBBB CBABBABC CBBBBBCD CBBBBBCD CBABBABC BBBBBB CCCCC

CCCC BBBBBB CB31BB BC CBBBBBCD CBBBBBCD CB33BB29BC BBBBBB CCCCC

CCCC BBB C 3132B31BC C3233BBBCD CBBBBBCD CB BB29BC BBBBBB CCCCC

CCCC BBB C 3132B31BC C3233BBBCD CBBBBBCD CB BB29BC BBBBBB CCCCC

2526CC 2730BBB B31BC BBBCD CBBBBBCD CB BB29BC BBBBBB CCCCC

2526CC 2730BBB B31BC BBBCD CBBBBBCD CB BB29BC BBBBBB CCCCC

After 6 presentations

After 7 presentations

After 8 presentations

After 9 presentations