1 / 3

Understanding the Kalman Filter: Applications and Mathematical Foundations

This lecture delves into the Kalman Filter (KF), a powerful tool for modeling noisy linear dynamics and hidden states that are continuous and Gaussian. Real-world applications such as control systems and tracking are explored, using examples like Columbus's voyage to demonstrate how measurements can reduce uncertainty in estimates. We cover the fundamental tasks of filtering, prediction, and smoothing, as well as the derivation of the general equations and their multidimensional interpretations. Additionally, we discuss the connection to the EM learning algorithm and provide engaging demos and visuals.

Télécharger la présentation

Understanding the Kalman Filter: Applications and Mathematical Foundations

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Lecture 17 Kalman Filter

  2. KF • KF is a ``factor analyzer through time’’: hidden states are continuous and gaussian. • KF are used to model noisy linear dynamics. Real world examples include control (``the eagle has landed’’), tracking (vision) etc. • Example Columbus discovers the Americas. Wind and waves make his estimate of his position increasingly uncertain. Measurements decrease uncertainty. • This can be written in terms of the kalman gain factor.

  3. KF • In multidimensional setting the equation have the same form and interpretation: • There is evolution which increases uncertainty and measurement which decreases it. • 3 tasks: filtering, prediction, smoothing. • Derivation of general equations. • Smoothing harder. Its also the E-step in the EM learning algorithm. Very similar as in HMMs: forward-backward recursions. • M step: analytical updates for A,B,R,Q,mu,Sigma. • demos, movies.

More Related