CS 4495 Computer Vision Tracking 1- Kalman,Gaussian

Size: px
Start display at page:

Download "CS 4495 Computer Vision Tracking 1- Kalman,Gaussian"

Transcription

1 CS 4495 Compuer Vision A. Bobick CS 4495 Compuer Vision - KalmanGaussian Aaron Bobick School of Ineracive Compuing

2 CS 4495 Compuer Vision A. Bobick Adminisrivia S5 will be ou his Thurs Due Sun Nov h :55pm Calendar (enaive) done for he ear S6: /4 due /4 S7: /6 due /5 EAM: Tues before Thanksgiving. Covers conceps and basics So no final on Dec.

3 CS 4495 Compuer Vision A. Bobick Slides adaped from Krisen Grauman Deva Ramanan bu mosl from Svelana Lazebnik

4 CS 4495 Compuer Vision A. Bobick Some examples Older examples: Sae of he ar: hp://

5 CS 4495 Compuer Vision A. Bobick Feaure racking So far we have onl considered opical flow esimaion in a pair of images If we have more han wo images we can compue he opical flow from each frame o he nex Given a poin in he firs image we can in principle reconsruc is pah b simpl following he arrows

6 CS 4495 Compuer Vision A. Bobick challenges Ambigui of opical flow Find good feaures o rack Large moions Discree search insead of Lucas-Kanade Changes in shape orienaion color Allow some maching flexibili Occlusions disocclusions Need mechanism for deleing adding new feaures Drif errors ma accumulae over ime Need o know when o erminae a rack

7 CS 4495 Compuer Vision A. Bobick Handling large displacemens Define a small area around a pixel as he emplae Mach he emplae agains each pixel wihin a search area in nex image jus like sereo maching! Use a mach measure such as SSD or correlaion Afer finding he bes discree locaion can use Lucas- Kanade o ge sub-pixel esimae (hink of he emplae as he coarse level of he pramid).

8 CS 4495 Compuer Vision A. Bobick over man frames Selec feaures in firs frame For each frame: Updae posiions of racked feaures Discree search or Lucas-Kanade Sar new racks if needed Terminae inconsisen racks Compue similari wih corresponding feaure in he previous frame or in he firs frame where i s visible This is done b man companies and ssems ofen ad hoc rules ailored o he conex.

9 CS 4495 Compuer Vision A. Bobick Shi-Tomasi feaure racker Find good feaures using eigenvalues of second-momen marix ou ve seen his now wice! Ke idea: good feaures o rack are he ones ha can be racked reliabl From frame o frame rack wih Lucas-Kanade and a pure ranslaion model More robus for small displacemens can be esimaed from smaller neighborhoods Check consisenc of racks b affine regisraion o he firs observed insance of he feaure Affine model is more accurae for larger displacemens Comparing o he firs frame helps o minimize drif J. Shi and C. Tomasi. Good Feaures o Track. CVR 994.

10 CS 4495 Compuer Vision A. Bobick example J. Shi and C. Tomasi. Good Feaures o Track. CVR 994.

11 CS 4495 Compuer Vision A. Bobick wih dnamics Ke idea: Given a model of expeced moion predic where objecs will occur in nex frame even before seeing he image Resric search for he objec Improved esimaes since measuremen noise is reduced b rajecor smoohness

12 CS 4495 Compuer Vision A. Bobick as inference The hidden sae consiss of he rue parameers we care abou denoed. The measuremen is our nois observaion ha resuls from he underling sae denoed Y. A each ime sep sae changes (from - o ) and we ge a new observaion Y. Our goal: recover mos likel sae given All observaions seen so far. Knowledge abou dnamics of sae ransiions.

13 CS 4495 Compuer Vision A. Bobick as inference: inuiion measuremen Belief: predicion Belief: predicion Correced predicion old belief Time Time

14 CS 4495 Compuer Vision A. Bobick Seps of racking redicion: Wha is he nex sae of he objec given pas measuremens? ( Y Y )

15 CS 4495 Compuer Vision A. Bobick Seps of racking redicion: Wha is he nex sae of he objec given pas measuremens? ( Y Y ) Correcion: Compue an updaed esimae of he sae from predicion and measuremens ( Y Y Y )

16 CS 4495 Compuer Vision A. Bobick Seps of racking redicion: Wha is he nex sae of he objec given pas measuremens? ( Y Y ) Correcion: Compue an updaed esimae of he sae from predicion and measuremens (poserior) ( Y Y Y ) can be seen as he process of propagaing he poserior disribuion of sae given measuremens across ime

17 CS 4495 Compuer Vision A. Bobick Simplifing assumpions Onl he immediae pas maers ( ) ( ) dnamics model

18 CS 4495 Compuer Vision A. Bobick Simplifing assumpions Onl he immediae pas maers dnamics model Measuremens depend onl on he curren sae ( Y Y Y ) ( Y ) ( ) ( ) observaion model

19 CS 4495 Compuer Vision A. Bobick Simplifing assumpions Onl he immediae pas maers dnamics model Measuremens depend onl on he curren sae ( Y Y Y ) ( Y ) ( ) ( ) Hmmm. observaion model Y Y Y

20 CS 4495 Compuer Vision A. Bobick as inducion Base case: Assume we have iniial prior ha predics sae in absence of an evidence: ( ) A he firs frame correc his given he value of Y Given correced esimae for frame : redic for frame Correc for frame predic correc

21 CS 4495 Compuer Vision A. Bobick as inducion Base case: Assume we have iniial prior ha predics sae in absence of an evidence: ( ) A he firs frame correc his given he value of Y ) ( ) ( ) ( ) ( ) ( ) ( Y

22 CS 4495 Compuer Vision A. Bobick redicion redicion involves guessing given ( ) ( )

23 CS 4495 Compuer Vision A. Bobick redicion redicion involves guessing given d d d Law of oal probabili - Marginalizaion

24 CS 4495 Compuer Vision A. Bobick redicion redicion involves guessing given d d d Condiioning on

25 CS 4495 Compuer Vision A. Bobick redicion redicion involves guessing given d d d Independence assumpion

26 CS 4495 Compuer Vision A. Bobick Correcion ( ) Correcion involves compuing given prediced value ( ) and

27 CS 4495 Compuer Vision A. Bobick Correcion Correcion involves compuing given prediced value and d Baes rule

28 CS 4495 Compuer Vision A. Bobick Correcion Correcion involves compuing given prediced value and d Independence assumpion (observaion depends onl on sae )

29 CS 4495 Compuer Vision A. Bobick Correcion Correcion involves compuing given prediced value and d Condiioning on Reall a normalizaion

30 CS 4495 Compuer Vision A. Bobick Summar: redicion and correcion redicion: ( ) d dnamics model correced esimae from previous sep

31 CS 4495 Compuer Vision A. Bobick Summar: redicion and correcion redicion: ( ) d Correcion: dnamics model observaion model correced esimae from previous sep prediced esimae ( ) ( ) ( ) ( ) ( ) d

32 CS 4495 Compuer Vision A. Bobick Linear Dnamic Models Dnamics model: sae undergoes linear ransformaion plus Gaussian noise x ( x ) ~ N D Σ d Observaion model: measuremen is linearl ransformed sae plus Gaussian noise ( x Σ ) ~ N M m

33 CS 4495 Compuer Vision A. Bobick Example: Consan veloci (D) Sae vecor is posiion and veloci x p v Measuremen is posiion onl p v v p ( ) v ξ ε p x D x noise v noise (greek leers denoe noise erms) p Mx noise v [ ] noise

34 CS 4495 Compuer Vision A. Bobick Example: Consan acceleraion (D) Sae vecor is posiion veloci and acceleraion Measuremen is posiion onl [ ] noise a v p noise Mx ζ ξ ε ) ( ) ( a a a v v v p p a v p x noise a v p noise D x x (greek leers denoe noise erms)

35 CS 4495 Compuer Vision A. Bobick The Kalman filer Mehod for racking linear dnamical models in Gaussian noise The prediced/correced sae disribuions are Gaussian You onl need o mainain he mean and covariance The calculaions are eas (all he inegrals can be done in closed form)

36 CS 4495 Compuer Vision A. Bobick ropagaion of Gaussian densiies

37 CS 4495 Compuer Vision A. Bobick The Kalman Filer: D sae Make measuremen Given correced sae from previous ime sep and all he measuremens up o he curren one predic he disribuion over he curren sep ( ) Mean and sd. dev. of prediced sae: µ redic Time advances (from o ) Correc Given predicion of sae and curren measuremen updae predicion of sae ( ) Mean and sd. dev. of correced sae: µ

38 CS 4495 Compuer Vision A. Bobick D Kalman filer: redicion Linear dnamic model defines prediced sae evoluion wih noise ( ) ~ N dx d Wan o esimae disribuion for nex prediced sae ( ) ( ) ( ) d

39 CS 4495 Compuer Vision A. Bobick D Kalman filer: redicion Linear dnamic model defines prediced sae evoluion wih noise Wan o esimae disribuion for nex prediced sae ( ) N µ ( ( ) ~ N dx d ) Updae he mean: Updae he variance: ( µ dµ ) ( d d )

40 CS 4495 Compuer Vision A. Bobick D Kalman filer: Correcion Mapping of sae o measuremens: rediced sae: Wan o esimae correced disribuion ~ m mx N Y ) ( N µ d

41 CS 4495 Compuer Vision A. Bobick D Kalman filer: Correcion Mapping of sae o measuremens: Y ( ) ~ N mx m rediced sae: ( N µ ( ) ) We define he correced disribuion o be: ( ) ( ( ) ) N µ

42 CS 4495 Compuer Vision A. Bobick D Kalman filer: Correcion Mapping of sae o measuremens: rediced sae: Wan o esimae correced disribuion Updae he mean: Updae he variance: ~ m mx N Y ) ( N µ ) ( N µ ) ( ) ( m m m m µ µ ) ( ) ( ) ( m m m

43 CS 4495 Compuer Vision A. Bobick D Kalman filer: Correcion From: µ µ m m m m ( ( ) ) redicion of x µ Wha is his? m µ m m m m The weighed average of predicion and measuremen based on variances! Measuremen guess of x Variance of predicion Variance of x compued from he measuremen

44 CS 4495 Compuer Vision A. Bobick redicion vs. correcion µ m ( ) m m µ ( ) m m ( ) m m ( ) ( ) Wha if here is no predicion uncerain µ µ ( ) The measuremen is ignored! Wha if here is no measuremen uncerain µ ( ) m The predicion is ignored! ( )? ( m )?

45 CS 4495 Compuer Vision A. Bobick Recall: consan veloci example posiion measuremen s sae ime Sae is d: posiion veloci Measuremen is d: posiion

46 CS 4495 Compuer Vision A. Bobick Consan veloci model posiion Kalman filer processing ime o sae x measuremen * prediced mean esimae correced mean esimae bars: variance esimaes before and afer measuremens

47 CS 4495 Compuer Vision A. Bobick Consan veloci model posiion Kalman filer processing ime o sae x measuremen * prediced mean esimae correced mean esimae bars: variance esimaes before and afer measuremens

48 CS 4495 Compuer Vision A. Bobick Consan veloci model posiion Kalman filer processing ime o sae x measuremen * prediced mean esimae correced mean esimae bars: variance esimaes before and afer measuremens

49 CS 4495 Compuer Vision A. Bobick Consan veloci model posiion Kalman filer processing ime o sae x measuremen * prediced mean esimae correced mean esimae bars: variance esimaes before and afer measuremens

50 CS 4495 Compuer Vision A. Bobick Kalman filer: General case (> dim) Wha if sae vecors have more han one dimension? REDICT CORRECT Σ x D x D Σ ( ) D Σ x x K M x T d K Σ M ( I K M ) Σ ( T M Σ M Σ ) T Σ m More weigh on residual when measuremen error covariance approaches.

51 CS 4495 Compuer Vision A. Bobick Kalman filer pros and cons ros Simple updaes compac and efficien Cons Unimodal disribuion onl single hpohesis Resriced class of moions defined b linear model Exensions call Exended Kalman Filering So wha migh we do if no Gaussian? Or even unimodal?

52 CS 4495 Compuer Vision A. Bobick Find ou nex ime! (Acuall nex Thurs)

מקורות לחומר בשיעור ספר הלימוד: Forsyth & Ponce מאמרים שונים חומר באינטרנט! פרק פרק 18

מקורות לחומר בשיעור ספר הלימוד: Forsyth & Ponce מאמרים שונים חומר באינטרנט! פרק פרק 18 עקיבה מקורות לחומר בשיעור ספר הלימוד: פרק 5..2 Forsh & once פרק 8 מאמרים שונים חומר באינטרנט! Toda Tracking wih Dnamics Deecion vs. Tracking Tracking as probabilisic inference redicion and Correcion Linear

More information

Tracking. Announcements

Tracking. Announcements Tracking Tuesday, Nov 24 Krisen Grauman UT Ausin Announcemens Pse 5 ou onigh, due 12/4 Shorer assignmen Auo exension il 12/8 I will no hold office hours omorrow 5 6 pm due o Thanksgiving 1 Las ime: Moion

More information

Object Tracking. Computer Vision Jia-Bin Huang, Virginia Tech. Many slides from D. Hoiem

Object Tracking. Computer Vision Jia-Bin Huang, Virginia Tech. Many slides from D. Hoiem Objec Tracking Compuer Vision Jia-Bin Huang Virginia Tech Man slides from D. Hoiem Adminisraive suffs HW 5 (Scene caegorizaion) Due :59pm on Wed November 6 oll on iazza When should we have he final exam?

More information

Tracking. Many slides adapted from Kristen Grauman, Deva Ramanan

Tracking. Many slides adapted from Kristen Grauman, Deva Ramanan Tracking Man slides adaped from Krisen Grauman Deva Ramanan Coures G. Hager Coures G. Hager J. Kosecka cs3b Adapive Human-Moion Tracking Acquisiion Decimaion b facor 5 Moion deecor Grascale convers. Image

More information

Tracking. Many slides adapted from Kristen Grauman, Deva Ramanan

Tracking. Many slides adapted from Kristen Grauman, Deva Ramanan Tracking Man slides adaped from Krisen Grauman Deva Ramanan Coures G. Hager Coures G. Hager J. Kosecka cs3b Adapive Human-Moion Tracking Acquisiion Decimaion b facor 5 Moion deecor Grascale convers. Image

More information

Computer Vision 2 Lecture 6

Computer Vision 2 Lecture 6 Compuer Vision 2 Lecure 6 Beond Kalman Filers (09.05.206) leibe@vision.rwh-aachen.de, sueckler@vision.rwh-aachen.de RWTH Aachen Universi, Compuer Vision Group hp://www.vision.rwh-aachen.de Conen of he

More information

Motion: Tracking, Pose and Actions

Motion: Tracking, Pose and Actions CS 277: Compuer Vision Moion: Tracking ose and Acions rof. Adriana Kovashka Universi of isburgh April 4 27 In his lecure Tracking how an objec moves Esimaing human pose Recognizing human acions Moion:

More information

Two Popular Bayesian Estimators: Particle and Kalman Filters. McGill COMP 765 Sept 14 th, 2017

Two Popular Bayesian Estimators: Particle and Kalman Filters. McGill COMP 765 Sept 14 th, 2017 Two Popular Bayesian Esimaors: Paricle and Kalman Filers McGill COMP 765 Sep 14 h, 2017 1 1 1, dx x Bel x u x P x z P Recall: Bayes Filers,,,,,,, 1 1 1 1 u z u x P u z u x z P Bayes z = observaion u =

More information

L07. KALMAN FILTERING FOR NON-LINEAR SYSTEMS. NA568 Mobile Robotics: Methods & Algorithms

L07. KALMAN FILTERING FOR NON-LINEAR SYSTEMS. NA568 Mobile Robotics: Methods & Algorithms L07. KALMAN FILTERING FOR NON-LINEAR SYSTEMS NA568 Mobile Roboics: Mehods & Algorihms Today s Topic Quick review on (Linear) Kalman Filer Kalman Filering for Non-Linear Sysems Exended Kalman Filer (EKF)

More information

Data Fusion using Kalman Filter. Ioannis Rekleitis

Data Fusion using Kalman Filter. Ioannis Rekleitis Daa Fusion using Kalman Filer Ioannis Rekleiis Eample of a arameerized Baesian Filer: Kalman Filer Kalman filers (KF represen poserior belief b a Gaussian (normal disribuion A -d Gaussian disribuion is

More information

Using the Kalman filter Extended Kalman filter

Using the Kalman filter Extended Kalman filter Using he Kalman filer Eended Kalman filer Doz. G. Bleser Prof. Sricker Compuer Vision: Objec and People Tracking SA- Ouline Recap: Kalman filer algorihm Using Kalman filers Eended Kalman filer algorihm

More information

Estimation of Poses with Particle Filters

Estimation of Poses with Particle Filters Esimaion of Poses wih Paricle Filers Dr.-Ing. Bernd Ludwig Chair for Arificial Inelligence Deparmen of Compuer Science Friedrich-Alexander-Universiä Erlangen-Nürnberg 12/05/2008 Dr.-Ing. Bernd Ludwig (FAU

More information

Introduction to Mobile Robotics

Introduction to Mobile Robotics Inroducion o Mobile Roboics Bayes Filer Kalman Filer Wolfram Burgard Cyrill Sachniss Giorgio Grisei Maren Bennewiz Chrisian Plagemann Bayes Filer Reminder Predicion bel p u bel d Correcion bel η p z bel

More information

Probabilistic Robotics

Probabilistic Robotics Probabilisic Roboics Bayes Filer Implemenaions Gaussian filers Bayes Filer Reminder Predicion bel p u bel d Correcion bel η p z bel Gaussians : ~ π e p N p - Univariae / / : ~ μ μ μ e p Ν p d π Mulivariae

More information

Zürich. ETH Master Course: L Autonomous Mobile Robots Localization II

Zürich. ETH Master Course: L Autonomous Mobile Robots Localization II Roland Siegwar Margaria Chli Paul Furgale Marco Huer Marin Rufli Davide Scaramuzza ETH Maser Course: 151-0854-00L Auonomous Mobile Robos Localizaion II ACT and SEE For all do, (predicion updae / ACT),

More information

State-Space Models. Initialization, Estimation and Smoothing of the Kalman Filter

State-Space Models. Initialization, Estimation and Smoothing of the Kalman Filter Sae-Space Models Iniializaion, Esimaion and Smoohing of he Kalman Filer Iniializaion of he Kalman Filer The Kalman filer shows how o updae pas predicors and he corresponding predicion error variances when

More information

SEIF, EnKF, EKF SLAM. Pieter Abbeel UC Berkeley EECS

SEIF, EnKF, EKF SLAM. Pieter Abbeel UC Berkeley EECS SEIF, EnKF, EKF SLAM Pieer Abbeel UC Berkeley EECS Informaion Filer From an analyical poin of view == Kalman filer Difference: keep rack of he inverse covariance raher han he covariance marix [maer of

More information

Hidden Markov Models

Hidden Markov Models Hidden Markov Models Probabilisic reasoning over ime So far, we ve mosly deal wih episodic environmens Excepions: games wih muliple moves, planning In paricular, he Bayesian neworks we ve seen so far describe

More information

Sequential Importance Resampling (SIR) Particle Filter

Sequential Importance Resampling (SIR) Particle Filter Paricle Filers++ Pieer Abbeel UC Berkeley EECS Many slides adaped from Thrun, Burgard and Fox, Probabilisic Roboics 1. Algorihm paricle_filer( S -1, u, z ): 2. Sequenial Imporance Resampling (SIR) Paricle

More information

Announcements. Recap: Filtering. Recap: Reasoning Over Time. Example: State Representations for Robot Localization. Particle Filtering

Announcements. Recap: Filtering. Recap: Reasoning Over Time. Example: State Representations for Robot Localization. Particle Filtering Inroducion o Arificial Inelligence V22.0472-001 Fall 2009 Lecure 18: aricle & Kalman Filering Announcemens Final exam will be a 7pm on Wednesday December 14 h Dae of las class 1.5 hrs long I won ask anyhing

More information

Augmented Reality II - Kalman Filters - Gudrun Klinker May 25, 2004

Augmented Reality II - Kalman Filters - Gudrun Klinker May 25, 2004 Augmened Realiy II Kalman Filers Gudrun Klinker May 25, 2004 Ouline Moivaion Discree Kalman Filer Modeled Process Compuing Model Parameers Algorihm Exended Kalman Filer Kalman Filer for Sensor Fusion Lieraure

More information

Uncertainty & Localization I

Uncertainty & Localization I Advanced Roboics Uncerain & Localiaion I Moivaion Inrodcion basics represening ncerain Gassian Filers Kalman Filer eended Kalman Filer nscened Kalman Filer Agenda Localiaion Eample For Legged Leage Non-arameric

More information

CS376 Computer Vision Lecture 6: Optical Flow

CS376 Computer Vision Lecture 6: Optical Flow CS376 Compuer Vision Lecure 6: Opical Flow Qiing Huang Feb. 11 h 2019 Slides Credi: Krisen Grauman and Sebasian Thrun, Michael Black, Marc Pollefeys Opical Flow mage racking 3D compuaion mage sequence

More information

Notes on Kalman Filtering

Notes on Kalman Filtering Noes on Kalman Filering Brian Borchers and Rick Aser November 7, Inroducion Daa Assimilaion is he problem of merging model predicions wih acual measuremens of a sysem o produce an opimal esimae of he curren

More information

Computer Vision. Motion Extraction

Computer Vision. Motion Extraction Comuer Moion Eracion Comuer Alicaions of moion eracion Change / sho cu deecion Surveillance / raffic monioring Moion caure / gesure analsis HC image sabilisaion Moion comensaion e.g. medical roboics Feaure

More information

Physics 235 Chapter 2. Chapter 2 Newtonian Mechanics Single Particle

Physics 235 Chapter 2. Chapter 2 Newtonian Mechanics Single Particle Chaper 2 Newonian Mechanics Single Paricle In his Chaper we will review wha Newon s laws of mechanics ell us abou he moion of a single paricle. Newon s laws are only valid in suiable reference frames,

More information

Probabilistic Robotics SLAM

Probabilistic Robotics SLAM Probabilisic Roboics SLAM The SLAM Problem SLAM is he process by which a robo builds a map of he environmen and, a he same ime, uses his map o compue is locaion Localizaion: inferring locaion given a map

More information

Robot Motion Model EKF based Localization EKF SLAM Graph SLAM

Robot Motion Model EKF based Localization EKF SLAM Graph SLAM Robo Moion Model EKF based Localizaion EKF SLAM Graph SLAM General Robo Moion Model Robo sae v r Conrol a ime Sae updae model Noise model of robo conrol Noise model of conrol Robo moion model

More information

Written HW 9 Sol. CS 188 Fall Introduction to Artificial Intelligence

Written HW 9 Sol. CS 188 Fall Introduction to Artificial Intelligence CS 188 Fall 2018 Inroducion o Arificial Inelligence Wrien HW 9 Sol. Self-assessmen due: Tuesday 11/13/2018 a 11:59pm (submi via Gradescope) For he self assessmen, fill in he self assessmen boxes in your

More information

Smoothing. Backward smoother: At any give T, replace the observation yt by a combination of observations at & before T

Smoothing. Backward smoother: At any give T, replace the observation yt by a combination of observations at & before T Smoohing Consan process Separae signal & noise Smooh he daa: Backward smooher: A an give, replace he observaion b a combinaion of observaions a & before Simple smooher : replace he curren observaion wih

More information

Linear Gaussian State Space Models

Linear Gaussian State Space Models Linear Gaussian Sae Space Models Srucural Time Series Models Level and Trend Models Basic Srucural Model (BSM Dynamic Linear Models Sae Space Model Represenaion Level, Trend, and Seasonal Models Time Varying

More information

EKF SLAM vs. FastSLAM A Comparison

EKF SLAM vs. FastSLAM A Comparison vs. A Comparison Michael Calonder, Compuer Vision Lab Swiss Federal Insiue of Technology, Lausanne EPFL) michael.calonder@epfl.ch The wo algorihms are described wih a planar robo applicaion in mind. Generalizaion

More information

Anno accademico 2006/2007. Davide Migliore

Anno accademico 2006/2007. Davide Migliore Roboica Anno accademico 2006/2007 Davide Migliore migliore@ele.polimi.i Today Eercise session: An Off-side roblem Robo Vision Task Measuring NBA layers erformance robabilisic Roboics Inroducion The Bayesian

More information

OBJECTIVES OF TIME SERIES ANALYSIS

OBJECTIVES OF TIME SERIES ANALYSIS OBJECTIVES OF TIME SERIES ANALYSIS Undersanding he dynamic or imedependen srucure of he observaions of a single series (univariae analysis) Forecasing of fuure observaions Asceraining he leading, lagging

More information

Linear Response Theory: The connection between QFT and experiments

Linear Response Theory: The connection between QFT and experiments Phys540.nb 39 3 Linear Response Theory: The connecion beween QFT and experimens 3.1. Basic conceps and ideas Q: How do we measure he conduciviy of a meal? A: we firs inroduce a weak elecric field E, and

More information

Self assessment due: Monday 4/29/2019 at 11:59pm (submit via Gradescope)

Self assessment due: Monday 4/29/2019 at 11:59pm (submit via Gradescope) CS 188 Spring 2019 Inroducion o Arificial Inelligence Wrien HW 10 Due: Monday 4/22/2019 a 11:59pm (submi via Gradescope). Leave self assessmen boxes blank for his due dae. Self assessmen due: Monday 4/29/2019

More information

Temporal probability models

Temporal probability models Temporal probabiliy models CS194-10 Fall 2011 Lecure 25 CS194-10 Fall 2011 Lecure 25 1 Ouline Hidden variables Inerence: ilering, predicion, smoohing Hidden Markov models Kalman ilers (a brie menion) Dynamic

More information

Applications in Industry (Extended) Kalman Filter. Week Date Lecture Title

Applications in Industry (Extended) Kalman Filter. Week Date Lecture Title hp://elec34.com Applicaions in Indusry (Eended) Kalman Filer 26 School of Informaion echnology and Elecrical Engineering a he Universiy of Queensland Lecure Schedule: Week Dae Lecure ile 29-Feb Inroducion

More information

Probabilistic Robotics SLAM

Probabilistic Robotics SLAM Probabilisic Roboics SLAM The SLAM Problem SLAM is he process by which a robo builds a map of he environmen and, a he same ime, uses his map o compue is locaion Localizaion: inferring locaion given a map

More information

Book Corrections for Optimal Estimation of Dynamic Systems, 2 nd Edition

Book Corrections for Optimal Estimation of Dynamic Systems, 2 nd Edition Boo Correcions for Opimal Esimaion of Dynamic Sysems, nd Ediion John L. Crassidis and John L. Junins November 17, 017 Chaper 1 This documen provides correcions for he boo: Crassidis, J.L., and Junins,

More information

GMM - Generalized Method of Moments

GMM - Generalized Method of Moments GMM - Generalized Mehod of Momens Conens GMM esimaion, shor inroducion 2 GMM inuiion: Maching momens 2 3 General overview of GMM esimaion. 3 3. Weighing marix...........................................

More information

From Particles to Rigid Bodies

From Particles to Rigid Bodies Rigid Body Dynamics From Paricles o Rigid Bodies Paricles No roaions Linear velociy v only Rigid bodies Body roaions Linear velociy v Angular velociy ω Rigid Bodies Rigid bodies have boh a posiion and

More information

7630 Autonomous Robotics Probabilistic Localisation

7630 Autonomous Robotics Probabilistic Localisation 7630 Auonomous Roboics Probabilisic Localisaion Principles of Probabilisic Localisaion Paricle Filers for Localisaion Kalman Filer for Localisaion Based on maerial from R. Triebel, R. Käsner, R. Siegwar,

More information

m = 41 members n = 27 (nonfounders), f = 14 (founders) 8 markers from chromosome 19

m = 41 members n = 27 (nonfounders), f = 14 (founders) 8 markers from chromosome 19 Sequenial Imporance Sampling (SIS) AKA Paricle Filering, Sequenial Impuaion (Kong, Liu, Wong, 994) For many problems, sampling direcly from he arge disribuion is difficul or impossible. One reason possible

More information

CSE-473. A Gentle Introduction to Particle Filters

CSE-473. A Gentle Introduction to Particle Filters CSE-473 A Genle Inroducion o Paricle Filers Bayes Filers for Robo Localizaion Dieer Fo 2 Bayes Filers: Framework Given: Sream of observaions z and acion daa u: d Sensor model Pz. = { u, z2, u 1, z 1 Dynamics

More information

References are appeared in the last slide. Last update: (1393/08/19)

References are appeared in the last slide. Last update: (1393/08/19) SYSEM IDEIFICAIO Ali Karimpour Associae Professor Ferdowsi Universi of Mashhad References are appeared in he las slide. Las updae: 0..204 393/08/9 Lecure 5 lecure 5 Parameer Esimaion Mehods opics o be

More information

An EM algorithm for maximum likelihood estimation given corrupted observations. E. E. Holmes, National Marine Fisheries Service

An EM algorithm for maximum likelihood estimation given corrupted observations. E. E. Holmes, National Marine Fisheries Service An M algorihm maimum likelihood esimaion given corruped observaions... Holmes Naional Marine Fisheries Service Inroducion M algorihms e likelihood esimaion o cases wih hidden saes such as when observaions

More information

Temporal probability models. Chapter 15, Sections 1 5 1

Temporal probability models. Chapter 15, Sections 1 5 1 Temporal probabiliy models Chaper 15, Secions 1 5 Chaper 15, Secions 1 5 1 Ouline Time and uncerainy Inerence: ilering, predicion, smoohing Hidden Markov models Kalman ilers (a brie menion) Dynamic Bayesian

More information

Financial Econometrics Kalman Filter: some applications to Finance University of Evry - Master 2

Financial Econometrics Kalman Filter: some applications to Finance University of Evry - Master 2 Financial Economerics Kalman Filer: some applicaions o Finance Universiy of Evry - Maser 2 Eric Bouyé January 27, 2009 Conens 1 Sae-space models 2 2 The Scalar Kalman Filer 2 21 Presenaion 2 22 Summary

More information

An recursive analytical technique to estimate time dependent physical parameters in the presence of noise processes

An recursive analytical technique to estimate time dependent physical parameters in the presence of noise processes WHAT IS A KALMAN FILTER An recursive analyical echnique o esimae ime dependen physical parameers in he presence of noise processes Example of a ime and frequency applicaion: Offse beween wo clocks PREDICTORS,

More information

Final Spring 2007

Final Spring 2007 .615 Final Spring 7 Overview The purpose of he final exam is o calculae he MHD β limi in a high-bea oroidal okamak agains he dangerous n = 1 exernal ballooning-kink mode. Effecively, his corresponds o

More information

Online Convex Optimization Example And Follow-The-Leader

Online Convex Optimization Example And Follow-The-Leader CSE599s, Spring 2014, Online Learning Lecure 2-04/03/2014 Online Convex Opimizaion Example And Follow-The-Leader Lecurer: Brendan McMahan Scribe: Sephen Joe Jonany 1 Review of Online Convex Opimizaion

More information

Lecture 2-1 Kinematics in One Dimension Displacement, Velocity and Acceleration Everything in the world is moving. Nothing stays still.

Lecture 2-1 Kinematics in One Dimension Displacement, Velocity and Acceleration Everything in the world is moving. Nothing stays still. Lecure - Kinemaics in One Dimension Displacemen, Velociy and Acceleraion Everyhing in he world is moving. Nohing says sill. Moion occurs a all scales of he universe, saring from he moion of elecrons in

More information

Diebold, Chapter 7. Francis X. Diebold, Elements of Forecasting, 4th Edition (Mason, Ohio: Cengage Learning, 2006). Chapter 7. Characterizing Cycles

Diebold, Chapter 7. Francis X. Diebold, Elements of Forecasting, 4th Edition (Mason, Ohio: Cengage Learning, 2006). Chapter 7. Characterizing Cycles Diebold, Chaper 7 Francis X. Diebold, Elemens of Forecasing, 4h Ediion (Mason, Ohio: Cengage Learning, 006). Chaper 7. Characerizing Cycles Afer compleing his reading you should be able o: Define covariance

More information

Lecture 3: Exponential Smoothing

Lecture 3: Exponential Smoothing NATCOR: Forecasing & Predicive Analyics Lecure 3: Exponenial Smoohing John Boylan Lancaser Cenre for Forecasing Deparmen of Managemen Science Mehods and Models Forecasing Mehod A (numerical) procedure

More information

Kriging Models Predicting Atrazine Concentrations in Surface Water Draining Agricultural Watersheds

Kriging Models Predicting Atrazine Concentrations in Surface Water Draining Agricultural Watersheds 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 Kriging Models Predicing Arazine Concenraions in Surface Waer Draining Agriculural Waersheds Paul L. Mosquin, Jeremy Aldworh, Wenlin Chen Supplemenal Maerial Number

More information

2.160 System Identification, Estimation, and Learning. Lecture Notes No. 8. March 6, 2006

2.160 System Identification, Estimation, and Learning. Lecture Notes No. 8. March 6, 2006 2.160 Sysem Idenificaion, Esimaion, and Learning Lecure Noes No. 8 March 6, 2006 4.9 Eended Kalman Filer In many pracical problems, he process dynamics are nonlinear. w Process Dynamics v y u Model (Linearized)

More information

R t. C t P t. + u t. C t = αp t + βr t + v t. + β + w t

R t. C t P t. + u t. C t = αp t + βr t + v t. + β + w t Exercise 7 C P = α + β R P + u C = αp + βr + v (a) (b) C R = α P R + β + w (c) Assumpions abou he disurbances u, v, w : Classical assumions on he disurbance of one of he equaions, eg. on (b): E(v v s P,

More information

Modeling Economic Time Series with Stochastic Linear Difference Equations

Modeling Economic Time Series with Stochastic Linear Difference Equations A. Thiemer, SLDG.mcd, 6..6 FH-Kiel Universiy of Applied Sciences Prof. Dr. Andreas Thiemer e-mail: andreas.hiemer@fh-kiel.de Modeling Economic Time Series wih Sochasic Linear Difference Equaions Summary:

More information

Object tracking: Using HMMs to estimate the geographical location of fish

Object tracking: Using HMMs to estimate the geographical location of fish Objec racking: Using HMMs o esimae he geographical locaion of fish 02433 - Hidden Markov Models Marin Wæver Pedersen, Henrik Madsen Course week 13 MWP, compiled June 8, 2011 Objecive: Locae fish from agging

More information

ESTIMATION OF DYNAMIC PANEL DATA MODELS WHEN REGRESSION COEFFICIENTS AND INDIVIDUAL EFFECTS ARE TIME-VARYING

ESTIMATION OF DYNAMIC PANEL DATA MODELS WHEN REGRESSION COEFFICIENTS AND INDIVIDUAL EFFECTS ARE TIME-VARYING Inernaional Journal of Social Science and Economic Research Volume:02 Issue:0 ESTIMATION OF DYNAMIC PANEL DATA MODELS WHEN REGRESSION COEFFICIENTS AND INDIVIDUAL EFFECTS ARE TIME-VARYING Chung-ki Min Professor

More information

) were both constant and we brought them from under the integral.

) were both constant and we brought them from under the integral. YIELD-PER-RECRUIT (coninued The yield-per-recrui model applies o a cohor, bu we saw in he Age Disribuions lecure ha he properies of a cohor do no apply in general o a collecion of cohors, which is wha

More information

Math 527 Lecture 6: Hamilton-Jacobi Equation: Explicit Formulas

Math 527 Lecture 6: Hamilton-Jacobi Equation: Explicit Formulas Mah 527 Lecure 6: Hamilon-Jacobi Equaion: Explici Formulas Sep. 23, 2 Mehod of characerisics. We r o appl he mehod of characerisics o he Hamilon-Jacobi equaion: u +Hx, Du = in R n, u = g on R n =. 2 To

More information

Affine term structure models

Affine term structure models Affine erm srucure models A. Inro o Gaussian affine erm srucure models B. Esimaion by minimum chi square (Hamilon and Wu) C. Esimaion by OLS (Adrian, Moench, and Crump) D. Dynamic Nelson-Siegel model (Chrisensen,

More information

Lecture 2 October ε-approximation of 2-player zero-sum games

Lecture 2 October ε-approximation of 2-player zero-sum games Opimizaion II Winer 009/10 Lecurer: Khaled Elbassioni Lecure Ocober 19 1 ε-approximaion of -player zero-sum games In his lecure we give a randomized ficiious play algorihm for obaining an approximae soluion

More information

Some Basic Information about M-S-D Systems

Some Basic Information about M-S-D Systems Some Basic Informaion abou M-S-D Sysems 1 Inroducion We wan o give some summary of he facs concerning unforced (homogeneous) and forced (non-homogeneous) models for linear oscillaors governed by second-order,

More information

Introduction to Mobile Robotics SLAM: Simultaneous Localization and Mapping

Introduction to Mobile Robotics SLAM: Simultaneous Localization and Mapping Inroducion o Mobile Roboics SLAM: Simulaneous Localizaion and Mapping Wolfram Burgard, Maren Bennewiz, Diego Tipaldi, Luciano Spinello Wha is SLAM? Esimae he pose of a robo and he map of he environmen

More information

IB Physics Kinematics Worksheet

IB Physics Kinematics Worksheet IB Physics Kinemaics Workshee Wrie full soluions and noes for muliple choice answers. Do no use a calculaor for muliple choice answers. 1. Which of he following is a correc definiion of average acceleraion?

More information

Lecture 10 Estimating Nonlinear Regression Models

Lecture 10 Estimating Nonlinear Regression Models Lecure 0 Esimaing Nonlinear Regression Models References: Greene, Economeric Analysis, Chaper 0 Consider he following regression model: y = f(x, β) + ε =,, x is kx for each, β is an rxconsan vecor, ε is

More information

PHYSICS 149: Lecture 9

PHYSICS 149: Lecture 9 PHYSICS 149: Lecure 9 Chaper 3 3.2 Velociy and Acceleraion 3.3 Newon s Second Law of Moion 3.4 Applying Newon s Second Law 3.5 Relaive Velociy Lecure 9 Purdue Universiy, Physics 149 1 Velociy (m/s) The

More information

Recursive Least-Squares Fixed-Interval Smoother Using Covariance Information based on Innovation Approach in Linear Continuous Stochastic Systems

Recursive Least-Squares Fixed-Interval Smoother Using Covariance Information based on Innovation Approach in Linear Continuous Stochastic Systems 8 Froniers in Signal Processing, Vol. 1, No. 1, July 217 hps://dx.doi.org/1.2266/fsp.217.112 Recursive Leas-Squares Fixed-Inerval Smooher Using Covariance Informaion based on Innovaion Approach in Linear

More information

Introduction to Bayesian Estimation. McGill COMP 765 Sept 12 th, 2017

Introduction to Bayesian Estimation. McGill COMP 765 Sept 12 th, 2017 Inrodcion o Baesian Esimaion McGill COM 765 Sep 2 h 207 Where am I? or firs core problem Las class: We can model a robo s moions and he world as spaial qaniies These are no perfec and herefore i is p o

More information

HW6: MRI Imaging Pulse Sequences (7 Problems for 100 pts)

HW6: MRI Imaging Pulse Sequences (7 Problems for 100 pts) HW6: MRI Imaging Pulse Sequences (7 Problems for 100 ps) GOAL The overall goal of HW6 is o beer undersand pulse sequences for MRI image reconsrucion. OBJECTIVES 1) Design a spin echo pulse sequence o image

More information

Q2.1 This is the x t graph of the motion of a particle. Of the four points P, Q, R, and S, the velocity v x is greatest (most positive) at

Q2.1 This is the x t graph of the motion of a particle. Of the four points P, Q, R, and S, the velocity v x is greatest (most positive) at Q2.1 This is he x graph of he moion of a paricle. Of he four poins P, Q, R, and S, he velociy is greaes (mos posiive) a A. poin P. B. poin Q. C. poin R. D. poin S. E. no enough informaion in he graph o

More information

In this chapter the model of free motion under gravity is extended to objects projected at an angle. When you have completed it, you should

In this chapter the model of free motion under gravity is extended to objects projected at an angle. When you have completed it, you should Cambridge Universiy Press 978--36-60033-7 Cambridge Inernaional AS and A Level Mahemaics: Mechanics Coursebook Excerp More Informaion Chaper The moion of projeciles In his chaper he model of free moion

More information

Lab #2: Kinematics in 1-Dimension

Lab #2: Kinematics in 1-Dimension Reading Assignmen: Chaper 2, Secions 2-1 hrough 2-8 Lab #2: Kinemaics in 1-Dimension Inroducion: The sudy of moion is broken ino wo main areas of sudy kinemaics and dynamics. Kinemaics is he descripion

More information

Kalman filtering for maximum likelihood estimation given corrupted observations.

Kalman filtering for maximum likelihood estimation given corrupted observations. alman filering maimum likelihood esimaion given corruped observaions... Holmes Naional Marine isheries Service Inroducion he alman filer is used o eend likelihood esimaion o cases wih hidden saes such

More information

Chapter 14. (Supplementary) Bayesian Filtering for State Estimation of Dynamic Systems

Chapter 14. (Supplementary) Bayesian Filtering for State Estimation of Dynamic Systems Chaper 4. Supplemenary Bayesian Filering for Sae Esimaion of Dynamic Sysems Neural Neworks and Learning Machines Haykin Lecure Noes on Selflearning Neural Algorihms ByoungTak Zhang School of Compuer Science

More information

Robust estimation based on the first- and third-moment restrictions of the power transformation model

Robust estimation based on the first- and third-moment restrictions of the power transformation model h Inernaional Congress on Modelling and Simulaion, Adelaide, Ausralia, 6 December 3 www.mssanz.org.au/modsim3 Robus esimaion based on he firs- and hird-momen resricions of he power ransformaion Nawaa,

More information

Handout: Power Laws and Preferential Attachment

Handout: Power Laws and Preferential Attachment CS224W: Analysis of Neworks Fall 2017 Handou: Power Laws and Preferenial Aachmen 1 Preferenial Aachmen Empirical sudies of real world neworks revealed ha degree disribuion ofen follows a heavyailed disribuion,

More information

Position, Velocity, and Acceleration

Position, Velocity, and Acceleration rev 06/2017 Posiion, Velociy, and Acceleraion Equipmen Qy Equipmen Par Number 1 Dynamic Track ME-9493 1 Car ME-9454 1 Fan Accessory ME-9491 1 Moion Sensor II CI-6742A 1 Track Barrier Purpose The purpose

More information

Filtering Turbulent Signals Using Gaussian and non-gaussian Filters with Model Error

Filtering Turbulent Signals Using Gaussian and non-gaussian Filters with Model Error Filering Turbulen Signals Using Gaussian and non-gaussian Filers wih Model Error June 3, 3 Nan Chen Cener for Amosphere Ocean Science (CAOS) Couran Insiue of Sciences New York Universiy / I. Ouline Use

More information

Math Wednesday March 3, , 4.3: First order systems of Differential Equations Why you should expect existence and uniqueness for the IVP

Math Wednesday March 3, , 4.3: First order systems of Differential Equations Why you should expect existence and uniqueness for the IVP Mah 2280 Wednesda March 3, 200 4., 4.3: Firs order ssems of Differenial Equaions Wh ou should epec eisence and uniqueness for he IVP Eample: Consider he iniial value problem relaed o page 4 of his eserda

More information

15. Vector Valued Functions

15. Vector Valued Functions 1. Vecor Valued Funcions Up o his poin, we have presened vecors wih consan componens, for example, 1, and,,4. However, we can allow he componens of a vecor o be funcions of a common variable. For example,

More information

1 Review of Zero-Sum Games

1 Review of Zero-Sum Games COS 5: heoreical Machine Learning Lecurer: Rob Schapire Lecure #23 Scribe: Eugene Brevdo April 30, 2008 Review of Zero-Sum Games Las ime we inroduced a mahemaical model for wo player zero-sum games. Any

More information

Article from. Predictive Analytics and Futurism. July 2016 Issue 13

Article from. Predictive Analytics and Futurism. July 2016 Issue 13 Aricle from Predicive Analyics and Fuurism July 6 Issue An Inroducion o Incremenal Learning By Qiang Wu and Dave Snell Machine learning provides useful ools for predicive analyics The ypical machine learning

More information

Comparing Means: t-tests for One Sample & Two Related Samples

Comparing Means: t-tests for One Sample & Two Related Samples Comparing Means: -Tess for One Sample & Two Relaed Samples Using he z-tes: Assumpions -Tess for One Sample & Two Relaed Samples The z-es (of a sample mean agains a populaion mean) is based on he assumpion

More information

Fundamental Problems In Robotics

Fundamental Problems In Robotics Fundamenal Problems In Roboics Wha does he world looks like? (mapping sense from various posiions inegrae measuremens o produce map assumes perfec knowledge of posiion Where am I in he world? (localizaion

More information

Optical Flow I. Guido Gerig CS 6320, Spring 2015

Optical Flow I. Guido Gerig CS 6320, Spring 2015 Opical Flow Guido Gerig CS 6320, Spring 2015 (credis: Marc Pollefeys UNC Chapel Hill, Comp 256 / K.H. Shafique, UCSF, CAP5415 / S. Narasimhan, CMU / Bahadir K. Gunurk, EE 7730 / Bradski&Thrun, Sanford

More information

Viterbi Algorithm: Background

Viterbi Algorithm: Background Vierbi Algorihm: Background Jean Mark Gawron March 24, 2014 1 The Key propery of an HMM Wha is an HMM. Formally, i has he following ingrediens: 1. a se of saes: S 2. a se of final saes: F 3. an iniial

More information

Simultaneous Localisation and Mapping. IAR Lecture 10 Barbara Webb

Simultaneous Localisation and Mapping. IAR Lecture 10 Barbara Webb Simuaneous Locaisaion and Mapping IAR Lecure 0 Barbara Webb Wha is SLAM? Sar in an unknown ocaion and unknown environmen and incremenay buid a map of he environmen whie simuaneousy using his map o compue

More information

Lecture 1 Overview. course mechanics. outline & topics. what is a linear dynamical system? why study linear systems? some examples

Lecture 1 Overview. course mechanics. outline & topics. what is a linear dynamical system? why study linear systems? some examples EE263 Auumn 27-8 Sephen Boyd Lecure 1 Overview course mechanics ouline & opics wha is a linear dynamical sysem? why sudy linear sysems? some examples 1 1 Course mechanics all class info, lecures, homeworks,

More information

Moving Object Tracking

Moving Object Tracking Moving Objec Tracing Princeon Universiy COS 49 Lecure Dec. 6 007 Harpree S. Sawhney hsawhney@sarnoff.com Recapiulaion : Las Lecure Moving objec deecion as robus regression wih oulier deecion Simulaneous

More information

Speech and Language Processing

Speech and Language Processing Speech and Language rocessing Lecure 4 Variaional inference and sampling Informaion and Communicaions Engineering Course Takahiro Shinozaki 08//5 Lecure lan (Shinozaki s par) I gives he firs 6 lecures

More information

Exponential Smoothing

Exponential Smoothing Exponenial moohing Inroducion A simple mehod for forecasing. Does no require long series. Enables o decompose he series ino a rend and seasonal effecs. Paricularly useful mehod when here is a need o forecas

More information

Adaptive Compressive Tracking Based on Perceptual Hash Algorithm Lei ZHANG, Zheng-guang XIE * and Hong-jun LI

Adaptive Compressive Tracking Based on Perceptual Hash Algorithm Lei ZHANG, Zheng-guang XIE * and Hong-jun LI 2017 2nd Inernaional Conference on Informaion Technology and Managemen Engineering (ITME 2017) ISBN: 978-1-60595-415-8 Adapive Compressive Tracking Based on Percepual Hash Algorihm Lei ZHANG, Zheng-guang

More information

Style Adaptive Bayesian Tracking Using Explicit Manifold Learning

Style Adaptive Bayesian Tracking Using Explicit Manifold Learning Syle Adapive Bayesian Tracking Using Explici Manifold Learning Chan-Su Lee and Ahmed Elgammal Compuer Science Deparmen Rugers, The Sae Universiy of New Jersey Piscaaway, NJ 8854, USA Email:{chansu, elgammal}@cs.rugers.edu

More information

d = ½(v o + v f) t distance = ½ (initial velocity + final velocity) time

d = ½(v o + v f) t distance = ½ (initial velocity + final velocity) time BULLSEYE Lab Name: ANSWER KEY Dae: Pre-AP Physics Lab Projecile Moion Weigh = 1 DIRECTIONS: Follow he insrucions below, build he ramp, ake your measuremens, and use your measuremens o make he calculaions

More information

Physics 3A: Basic Physics I Shoup Sample Midterm. Useful Equations. x f. x i v x. a x. x i. v xi v xf. 2a x f x i. y f. a r.

Physics 3A: Basic Physics I Shoup Sample Midterm. Useful Equations. x f. x i v x. a x. x i. v xi v xf. 2a x f x i. y f. a r. Physics 3A: Basic Physics I Shoup Sample Miderm Useful Equaions A y Asin A A x A y an A y A x A = A x i + A y j + A z k A * B = A B cos(θ) A x B = A B sin(θ) A * B = A x B x + A y B y + A z B z A x B =

More information

Machine Learning 4771

Machine Learning 4771 ony Jebara, Columbia Universiy achine Learning 4771 Insrucor: ony Jebara ony Jebara, Columbia Universiy opic 20 Hs wih Evidence H Collec H Evaluae H Disribue H Decode H Parameer Learning via JA & E ony

More information