Outline Formulation of Filtering Problem General Conditions for Filtering Equation Filtering Model for Reflecting Diffusions Wong-Zakai Approximation.

Slides:



Advertisements
Similar presentations
Chap 11. Introduction to Jump Process
Advertisements

CSCE643: Computer Vision Bayesian Tracking & Particle Filtering Jinxiang Chai Some slides from Stephen Roth.
Tracking Unknown Dynamics - Combined State and Parameter Estimation Tracking Unknown Dynamics - Combined State and Parameter Estimation Presenters: Hongwei.
Markov Chains 1.
CHAPTER 16 MARKOV CHAIN MONTE CARLO
Lecture 3: Markov processes, master equation
Workshop on Stochastic Differential Equations and Statistical Inference for Markov Processes Day 1: January 19 th, Day 2: January 28 th Lahore University.
Analysis of Network Diffusion and Distributed Network Algorithms Rajmohan Rajaraman Northeastern University, Boston May 2012 Chennai Network Optimization.
1 Quantum Monte Carlo Methods Jian-Sheng Wang Dept of Computational Science, National University of Singapore.
Bayesian Model Selection and Multi-target Tracking Presenters: Xingqiu Zhao and Nikki Hu Joint work with M. A. Kouritzin, H. Long, J. McCrosky, W. Sun.
Brief Introduction to the Alberta Group of MITACS-PINTS Center I. Groups: (Project Leader : Prof. Mike Kouritzin) University of Alberta (base), H.E.C.
PHD Approach for Multi-target Tracking
Artificial Learning Approaches for Multi-target Tracking Jesse McCrosky Nikki Hu.
Outline I.Stochastic Modeling for Pollution Tracking II.Simulations III.Filtering in a Random Environment IV.Overview of Center.
Manifold Filtering Problem Lockheed Martin Jarett Hailes Jonathan Wiersma Richard VanWeelden July 21, 2003.
What if time ran backwards? If X n, 0 ≤ n ≤ N is a Markov chain, what about Y n = X N-n ? If X n follows the stationary distribution, Y n has stationary.
. PGM: Tirgul 8 Markov Chains. Stochastic Sampling  In previous class, we examined methods that use independent samples to estimate P(X = x |e ) Problem:
Bruno Dupire Bloomberg LP CRFMS, UCSB Santa Barbara, April 26, 2007
Computational statistics 2009 Random walk. Computational statistics 2009 Random walk with absorbing barrier.
From PET to SPLIT Yuri Kifer. PET: Polynomial Ergodic Theorem (Bergelson) preserving and weakly mixing is bounded measurable functions polynomials,integer.
Sérgio Pequito Phd Student
If time is continuous we cannot write down the simultaneous distribution of X(t) for all t. Rather, we pick n, t 1,...,t n and write down probabilities.
Comparative survey on non linear filtering methods : the quantization and the particle filtering approaches Afef SELLAMI Chang Young Kim.
Asset Pricing Theory Option A right to buy (or sell) an underlying asset. Strike price: K Maturity date: T. Price of the underlying asset: S(t)
Probability theory 2008 Conditional probability mass function  Discrete case  Continuous case.
Probability theory 2010 Conditional distributions  Conditional probability:  Conditional probability mass function: Discrete case  Conditional probability.
The moment generating function of random variable X is given by Moment generating function.
Nonlinear Filtering of Stochastic Volatility Aleksandar Zatezalo, University of Rijeka, Faculty of Philosophy in Rijeka, Rijeka, Croatia
4.4 Itô-Doeblin Formula 報告人:劉彥君.
The Monte Carlo Method: an Introduction Detlev Reiter Research Centre Jülich (FZJ) D Jülich
Monte Carlo Methods in Partial Differential Equations.
MITACS-PINTS Prediction In Interacting Systems Project Leader : Michael Kouriztin.
6. Markov Chain. State Space The state space is the set of values a random variable X can take. E.g.: integer 1 to 6 in a dice experiment, or the locations.
第四章 Brown运动和Ito公式.
Mean Field Methods for Computer and Communication Systems Jean-Yves Le Boudec EPFL ACCESS Distinguished Lecture Series, Stockholm, May 28,
Stochastic Structural Dynamics and Some Recent Developments Y. K. Lin Center for Applied Stochastics Research Florida Atlantic University Boca Raton, FL.
SIS Sequential Importance Sampling Advanced Methods In Simulation Winter 2009 Presented by: Chen Bukay, Ella Pemov, Amit Dvash.
Simon Weber PhD student of Martin Hairer Warwick Mathematics Institute
Borgan and Henderson:. Event History Methodology
BROWNIAN MOTION A tutorial Krzysztof Burdzy University of Washington.
Forward-Scan Sonar Tomographic Reconstruction PHD Filter Multiple Target Tracking Bayesian Multiple Target Tracking in Forward Scan Sonar.
The Logistic Growth SDE. Motivation  In population biology the logistic growth model is one of the simplest models of population dynamics.  To begin.
TheoryApplication Discrete Continuous - - Stochastic differential equations - - Ito’s formula - - Derivation of the Black-Scholes equation - - Markov processes.
Security Markets VII Miloslav S. Vosvrda Teorie financnich trhu.
Chapter 61 Continuous Time Markov Chains Birth and Death Processes,Transition Probability Function, Kolmogorov Equations, Limiting Probabilities, Uniformization.
Robotics Research Laboratory 1 Chapter 7 Multivariable and Optimal Control.
EVOLUTIONARY HMMS BAYESIAN APPROACH TO MULTIPLE ALIGNMENT Siva Theja Maguluri CS 598 SS.
Ch. 14: Markov Chain Monte Carlo Methods based on Stephen Marsland, Machine Learning: An Algorithmic Perspective. CRC 2009.; C, Andrieu, N, de Freitas,
Numerical Methods for Stochastic Networks Peter W. Glynn Institute for Computational and Mathematical Engineering Management Science and Engineering Stanford.
Seminar on random walks on graphs Lecture No. 2 Mille Gandelsman,
7. Metropolis Algorithm. Markov Chain and Monte Carlo Markov chain theory describes a particularly simple type of stochastic processes. Given a transition.
The Markov Chain Monte Carlo Method Isabelle Stanton May 8, 2008 Theory Lunch.
Geometry of Stochastic Differential Equations John Armstrong (KCL), Damiano Brigo (Imperial) New perspectives in differential geometry, Rome, November.
1 EE571 PART 3 Random Processes Huseyin Bilgekul Eeng571 Probability and astochastic Processes Department of Electrical and Electronic Engineering Eastern.
Monte` Carlo Methods 1 MONTE` CARLO METHODS INTEGRATION and SAMPLING TECHNIQUES.
The Unscented Particle Filter 2000/09/29 이 시은. Introduction Filtering –estimate the states(parameters or hidden variable) as a set of observations becomes.
3.6 First Passage Time Distribution
S TOCHASTIC M ODELS L ECTURE 4 B ROWNIAN M OTIONS Nan Chen MSc Program in Financial Engineering The Chinese University of Hong Kong (Shenzhen) Nov 11,
A Probabilistic Appraoch to Nonlinear Diffusion: Feature-Driven Filtering Hamid Krim ECE Dept. NCSU, Raleigh, NC
Mean Field Methods for Computer and Communication Systems Jean-Yves Le Boudec EPFL Network Science Workshop Hong Kong July
Topic Overview and Study Checklist. From Chapter 7 in the white textbook: Modeling with Differential Equations basic models exponential logistic modified.
Diffusion over potential barriers with colored noise
Theory of Capital Markets
水分子不時受撞,跳格子(c.p. 車行) 投骰子 (最穩定) 股票 (價格是不穏定,但報酬過程略穩定) 地震的次數 (不穩定)
Outline Introduction Signal, random variable, random process and spectra Analog modulation Analog to digital conversion Digital transmission through baseband.
A particle representation for the heat equation solution
Brownian Motion for Financial Engineers
Random WALK, BROWNIAN MOTION and SDEs
Brownian Motion & Itô Formula
Convergence of Sequential Monte Carlo Methods
Presentation transcript:

Outline Formulation of Filtering Problem General Conditions for Filtering Equation Filtering Model for Reflecting Diffusions Wong-Zakai Approximation to DMZ Equation Construction of Markov Chains Laws of Large Numbers Simulation for Fish Problem Concluding Remarks

I. Formulation of Filtering Problem We require a predictive model for (signal observations). Signal is a valued measurable Markov process with weak generator where is a complete separable metric space is the transition semigroup (on ) Define Let

Let : weak generator of with domain is measure-determining if is bp-dense in (Kallianpur & Karandikar, 1984) The observation are : where is a measurable function and is a Brownian motion independent of.

Optimal filter=random measure with Kushner (1967) got a stochastic evolution equation for Fujisaki, Kallianpur, and Kunita (1972) established it rigorously under (old) Kurtz and Ocone (1988) wondered if this condition could be weakened.

II. General Conditions for Filtering Equation K & L prove that if (new) then FKK equation where is the innovation process The new condition is more general, allowing and with - stable distributions with No right continuity of or filtration

Reference probability measure: Under : and are independent, is a standard Brownian motion. Kallianpur-Striebel formula (Bayes formula):

Under the new condition, satisfies the Duncan-Mortensen-Zakai (DMZ) equation Ocone (1984) gave a direct derivation of DMZ equation under finite energy condition just measurable, not right continuous; no stochastic calculus. How would you establish DMZ equation?

Define is a martingale under is a martingale under (also ) is a martingale under

Let be a refining partition of [0,T] Equi-continuity via uniform integrability is sum of a and a martingale under, i.e

Then is a zero mean martingale Using martingale representation, stopping arguments, Doob’s optional sampling theorem to identify FKK equation can be derived by Ito’s formula, integration by parts and the DMZ equation

III.Filtering Model for Reflecting Diffusions Signal: reflecting diffusions in rectangular region D

The associated diffusion generator is symmetric on The observation : is defined on

IV. Wong-Zakai Approximation to DMZ Equation has a density which solves where

Let (unitary transformation) then satisfies the following SPDE: where defined on

Kushner-Huang’s wide-band observation noise approximation where is stationary, bounded, and -mixing, converges to in distribution

Find numerical solutions to the random PDE by replacing with and adding correction term, Kushner or Bhatt-Kallianpur-Karandikar’s robustness result can handle this part: the approximate filter converges to optimal filter.

V. Construction of Markov Chains Use stochastic particle method developed by Kurtz (1971), Arnold and Theodosopulu (1980), Kotelenez (1986, 1988), Blount (1991, 1994, 1996), Kouritzin and Long (2001). Step 1: divide the region D into cells Step 2: construct discretized operator via (discretized) Dirichlet form. where is the potential term in

: number of particles in cell k at time t Step 3: particles evolve in cells according to (i) births and deaths from reaction: at rate (ii) random walks from diffusion-drift at rate where is the positive (or negative) part of

Step 4: Particle balance equation where are independent Poisson processes defined on another probability space

Construction of Markov Chains (cont.) is an inhomogeneous Markov chain via random time changes Step 5: the approximate Markov process is given by where denotes mass of each particle

Then satisfies Compare with our previous equation for To get mild formulation for and via semigroups

Define a product probability space (for annealed result) From we can construct a unique probability measure defined on for each

VI. Laws of Large Numbers The quenched (under ) and annealed (under ) laws of large numbers ( ): Quenched approach: fixing the sample path of observation process Annealed approach: considering the observation process as a random medium for Markov chains

Proof Ideas Quadratic variation for mart. in Martingale technique, semigroup theory, basic inequalities to get uniform estimate Ito’s formula, Trotter-Kato, dominated convergence and Gronwall inequality

VII. Simulation for Fish Problem

Fish Model 2-dimensional fish motion model (in a tank ) Observation: To estimate: In our simulation: Panel size : pixel, fish size : pixel,

SIMULATION

VIII. Concluding Remarks Find implementable approximate solutions to filtering equations. Our method differs from previous ones such as Monte Carlo method (using Markov chains to approximate signals, Kushner 1977), interacting particle method (Del Moral, 1997), weighted particle method (Kurtz and Xiong, 1999, analyze), and branching particle method (Kouritzin, 2000) Future work: i)weakly interacting multi-target ii) infinite dimensional signal

SIMULATION

Pollution Tracking