Kalman Filter and Data Streaming Presented By :- Ankur Jain Department of Computer Science 7/21/03.

Slides:



Advertisements
Similar presentations
Mobile Robot Localization and Mapping using the Kalman Filter
Advertisements

Active Appearance Models
Probabilistic Reasoning over Time
State Estimation and Kalman Filtering CS B659 Spring 2013 Kris Hauser.
Use of Kalman filters in time and frequency analysis John Davis 1st May 2011.
Modeling Uncertainty over time Time series of snapshot of the world “state” we are interested represented as a set of random variables (RVs) – Observable.
Observers and Kalman Filters
Introduction to Mobile Robotics Bayes Filter Implementations Gaussian filters.
Formation et Analyse d’Images Session 8
Modeling Pixel Process with Scale Invariant Local Patterns for Background Subtraction in Complex Scenes (CVPR’10) Shengcai Liao, Guoying Zhao, Vili Kellokumpu,
Motion Tracking. Image Processing and Computer Vision: 82 Introduction Finding how objects have moved in an image sequence Movement in space Movement.
Adam Rachmielowski 615 Project: Real-time monocular vision-based SLAM.
Efficient Moving Object Segmentation Algorithm Using Background Registration Technique Shao-Yi Chien, Shyh-Yih Ma, and Liang-Gee Chen, Fellow, IEEE Hsin-Hua.
Adaptive Sampling for Sensor Networks Ankur Jain ٭ and Edward Y. Chang University of California, Santa Barbara DMSN 2004.
Introduction to Kalman Filter and SLAM Ting-Wei Hsu 08/10/30.
Adaptive Sampling in Distributed Streaming Environment Ankur Jain 2/4/03.
Tracking using the Kalman Filter. Point Tracking Estimate the location of a given point along a sequence of images. (x 0,y 0 ) (x n,y n )
Chess Review May 11, 2005 Berkeley, CA Closing the loop around Sensor Networks Bruno Sinopoli Shankar Sastry Dept of Electrical Engineering, UC Berkeley.
Prepared By: Kevin Meier Alok Desai
Speech Recognition in Noise
1 Integration of Background Modeling and Object Tracking Yu-Ting Chen, Chu-Song Chen, Yi-Ping Hung IEEE ICME, 2006.
1 Adaptive Kalman Filter Based Freeway Travel time Estimation Lianyu Chu CCIT, University of California Berkeley Jun-Seok Oh Western Michigan University.
Estimation and the Kalman Filter David Johnson. The Mean of a Discrete Distribution “I have more legs than average”
Simultaneous Localization and Map Building System for Prototype Mars Rover CECS 398 Capstone Design I October 24, 2001.
Tracking with Linear Dynamic Models. Introduction Tracking is the problem of generating an inference about the motion of an object given a sequence of.
Adaptive Stream Resource Management Using Kalman Filters Aug UCLA DB seminar.
Kalman Filtering Pieter Abbeel UC Berkeley EECS Many slides adapted from Thrun, Burgard and Fox, Probabilistic Robotics TexPoint fonts used in EMF. Read.
Models and Issues in Data Streaming Presented By :- Ankur Jain Department of Computer Science 6/23/03 A list of relevant papers is available at
Energy-efficient Self-adapting Online Linear Forecasting for Wireless Sensor Network Applications Jai-Jin Lim and Kang G. Shin Real-Time Computing Laboratory,
Computer Vision Linear Tracking Jan-Michael Frahm COMP 256 Some slides from Welch & Bishop.
Overview and Mathematics Bjoern Griesbach
EE392J Final Project, March 20, Multiple Camera Object Tracking Helmy Eltoukhy and Khaled Salama.
ROBOT MAPPING AND EKF SLAM
1 Formation et Analyse d’Images Session 7 Daniela Hall 7 November 2005.
Kalman filter and SLAM problem
Particle Filter & Search
TP15 - Tracking Computer Vision, FCUP, 2013 Miguel Coimbra Slides by Prof. Kristen Grauman.
Kalman Filter (Thu) Joon Shik Kim Computational Models of Intelligence.
Computer Vision - A Modern Approach Set: Tracking Slides by D.A. Forsyth The three main issues in tracking.
CHAPTER TEN AUTHORING.
Probabilistic Robotics Bayes Filter Implementations Gaussian filters.
Karman filter and attitude estimation Lin Zhong ELEC424, Fall 2010.
Human-Computer Interaction Kalman Filter Hanyang University Jong-Il Park.
HQ U.S. Air Force Academy I n t e g r i t y - S e r v i c e - E x c e l l e n c e Improving the Performance of Out-of-Order Sigma-Point Kalman Filters.
Processing Sequential Sensor Data The “John Krumm perspective” Thomas Plötz November 29 th, 2011.
Real-Time Simultaneous Localization and Mapping with a Single Camera (Mono SLAM) Young Ki Baik Computer Vision Lab. Seoul National University.
Dr. Sudharman K. Jayaweera and Amila Kariyapperuma ECE Department University of New Mexico Ankur Sharma Department of ECE Indian Institute of Technology,
An Introduction to Kalman Filtering by Arthur Pece
Boosted Particle Filter: Multitarget Detection and Tracking Fayin Li.
Sequential Monte-Carlo Method -Introduction, implementation and application Fan, Xin
An Introduction To The Kalman Filter By, Santhosh Kumar.
Object Tracking - Slide 1 Object Tracking Computer Vision Course Presentation by Wei-Chao Chen April 05, 2000.
Using Kalman Filter to Track Particles Saša Fratina advisor: Samo Korpar
Tracking with dynamics
By: Aaron Dyreson Supervising Professor: Dr. Ioannis Schizas
IEEE International Conference on Multimedia and Expo.
Week Aug-24 – Aug-29 Introduction to Spatial Computing CSE 5ISC Some slides adapted from the book Computing with Spatial Trajectories, Yu Zheng and Xiaofang.
Cameron Rowe.  Introduction  Purpose  Implementation  Simple Example Problem  Extended Kalman Filters  Conclusion  Real World Examples.
VANET – Stochastic Path Prediction Motivations Route Discovery Safety Warning Accident Notifications Strong Deceleration of Tra ffi c Flow Road Hazards.
Probabilistic Robotics Bayes Filter Implementations Gaussian filters.
Thomas F. Edgar (UT-Austin) RLS – Linear Models Virtual Control Book 12/06 Recursive Least Squares Parameter Estimation for Linear Steady State and Dynamic.
C. Canton1, J.R. Casas1, A.M.Tekalp2, M.Pardàs1
PSG College of Technology
Presented by: Yang Yu Spatiotemporal GMM for Background Subtraction with Superpixel Hierarchy Mingliang Chen, Xing Wei, Qingxiong.
Kalman Filter فيلتر كالمن در سال 1960 توسط R.E.Kalman در مقاله اي تحت عنوان زير معرفي شد. “A new approach to liner filtering & prediction problem” Transactions.
Online Graph-Based Tracking
Bayes and Kalman Filter
Kalman Filtering COS 323.
The Discrete Kalman Filter
Nome Sobrenome. Time time time time time time..
Presentation transcript:

Kalman Filter and Data Streaming Presented By :- Ankur Jain Department of Computer Science 7/21/03

Outline Kalman Filters Introduction to Kalman Filter (KF) Introduction to Kalman Filter (KF) Common Applications Common Applications The Discrete Kalman Filter The Discrete Kalman Filter Example and Common Results Example and Common Results Pros and Cons Pros and Cons Application of KF in Data Streaming Issues in Data Streaming Issues in Data Streaming Recap – Adaptive filters for Data Streaming Recap – Adaptive filters for Data Streaming Can KF be a solution ? Can KF be a solution ? A possible approach A possible approach Challenges and Issues Challenges and Issues

Introduction to Kalman Filter KF was developed in 1960 by R.E. Kalman A prediction/correction algorithm typically used over linear systems KF finds applications in :- Prediction of time varying variable based on a linear state model (based on previous measurements) Prediction of time varying variable based on a linear state model (based on previous measurements) Estimation of a value where measurements are made in noisy environments (noisy input is converted to less noisy data) Estimation of a value where measurements are made in noisy environments (noisy input is converted to less noisy data) Data fusion (Used for obtaining an estimate of a value whose measurement is obtained from different sources) Data fusion (Used for obtaining an estimate of a value whose measurement is obtained from different sources)

Common applications of the KF Tracking Missiles Tracking moving objects Tracking moving objects Computor Vision Extracting lip motion from video Extracting lip motion from video Data Smoothing and Curve fitting Fitting bezier patches to point data Fitting bezier patches to point data Data Fusion/Integration Integration of spatio-temporal video segments Integration of spatio-temporal video segmentsRobotics Robust estimation and sensor data noise reduction Robust estimation and sensor data noise reduction Many Others

The Discrete Kalman Filter (DKF) State Model F : State Transition x: State Vector v: Gaussian Noise (0, Q) Measurement Model Measurement Model H: Observation Relation w: Gaussian Noise (0,R) z: Observation

DKF cont… Prediction Predicted state at the next observation: State prediction covariance: Observation prediction

Kalman Gain Innovation Innovation covariance Kalman Gain DKF cont…

Correction Corrected state estimate Corrected state covariance DKF cont…

Performance of the filter Results obtained on prediction of ordinate value of motion of track ball (Siggraph 2001)

Performance of the filter The latency observed in the above result can be avoided by incorporating a better state model

Performance of the filter Tracking a table tennis ball video sequence (Workshop on Image Analysis for Multimedia Interactive Services 1997)

Interesting Properties of KF from the perspective of data streams The filter exhibits robustness in presence of occlusions (when the measurements are not available) DKF along with extended Kalman filter (for non linear systems) can be used to model wide range of state transition functions Errors in measuring devices, clock incoherencies, network behaviors etc can be modeled in a single error matrix The errors in the estimations can used to adaptively change the sampling rate of a stream to allow for sensitivity in the final result

Data Sources V 1 updates V 2 updates V n updates.. Filters Bound Shrinking [L 1, H 1 ].. Bound Shrinking [L n, H n ] CQ Evaluator Stream Processor [L 1, H 1 ] [L i, H i ] … [L n, H n ] Bound Cache Precision Manager Bound shrinking Selective growing Intercepts update streams, and forwards those that fall outside its bound Bounded Answers Registers Queries Queries + precision constraints Generates streams of updates Recap …(adaptive filters to save communication resource ) Maintains copy of bound for each object updates Periodically shrinking bound Reallocates bound width and sends growth messages updates User

Drawbacks of this approach Not sensitive to the input stream Need for adaptive sampling rate Need for adaptive sampling rate Network characteristics are assumed be constant and clock incoherence is not handled efficiently Network dynamics should be incorporated Network dynamics should be incorporated Seems unsuitable for sensor data Most of the stream data will show some trend which can be estimated and only critical values be updated Most of the stream data will show some trend which can be estimated and only critical values be updated The model does not allow for sensor measurement error The model does not allow for sensor measurement error

The Kalman Filter Approach Two Kalman Filters can be installed at each source KF 1 (Sensitivity) Every time the prediction is larger than a specified threshold δ the sampling rate is increased KF 1 (Sensitivity) Every time the prediction is larger than a specified threshold δ the sampling rate is increased KF 2 (estimation) This filter works in the same way as the filter at main processor and updates only critical values when the prediction error at the main processor is larger that a threshold  KF 2 (estimation) This filter works in the same way as the filter at main processor and updates only critical values when the prediction error at the main processor is larger that a threshold  The Kalman Filter at the main processor estimates based on the critical update values Network characteristics and clock mismatches can be modeled in one single matrix which can be updated at the remote source each time significant changes are observed (too many updates will degrade performance !)

Advantages of Using KF Increased sensitivity in the results Adaptive sampling rate If the source values do not show frequent variations in values significant network bandwidth can saved (growth messages are avoided !) Linear as well as non linear systems can be modeled Dynamic Network behavior can be incorporated at some cost of network bandwidth

v2v2 v1v1 V n-1 VnVn CQ Evaluator User Update of critical values when estimation error is large Data Sources User registers queries Results are updated to the user continuously values from estimation Main Stream Proc. changes sampling rate if prediction error is large Periodic update of network condition and clock skews (rare updates)

Issues and challenges Construction of matrices for modeling the network behavior Selecting sampling rates and thresholds We intend to start conducting with static thresholds We intend to start conducting with static thresholds However we lose adaptivity for precision but still hope to gain on usage of resources within a specified precision However we lose adaptivity for precision but still hope to gain on usage of resources within a specified precision Avoiding too much computation at the remote source location as typically sensors have limited computational and power resources Once the above issues are resolved we would like to extend it to answer aggregate queries such has MAX, AVG, VAR etc. and integration of data from multiple sources Sensitivity vs Precision vs Adaptation !