Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Libraries
  3. MIT Theses
  4. Graduate Theses
  5. Construction of nonlinear filter algorithms using the saddlepoint approximation

Construction of nonlinear filter algorithms using the saddlepoint approximation

Thumbnail Image
Download
Name

230953882-MIT.pdf

Description
Full printable version
Size

6.43 MB

Format

Adobe PDF

Checksum (MD5)

906fa2c8c754cd72276be794edb441b7

Author(s)
Amayo, Esosa O
Advisor(s)
Emery N. Brown and John L. Wyatt.
Date Issued
2006
Publisher
Massachusetts Institute of Technology
Abstract
In this thesis we propose the use of the saddlepoint method to construct nonlinear filtering algorithms. To our knowledge, while the saddlepoint approximation has been used very successfully in the statistics literature (as an example the saddlepoint method provides a simple, highly accurate approximation to the density of the maximum likelihood estimator of a non-random parameter given a set of measurements), its potential for use in the dynamic setting of the nonlinear filtering problem has yet to be realized. This is probably because the assumptions on the form of the integrand that is typical in the asymptotic analysis literature do not necessarily hold in the filtering context. We show that the assumptions typical in asymptotic analysis (and which are directly applicable in statistical inference since the statistics applications usually involve estimating the density of a function of a sequence of random variables) can be modified in a way that is still relevant in the nonlinear filtering context while still preserving a property of the saddlepoint approximation that has made it very useful in statistical inference, namely, that the shape of the desired density is accurately approximated. As a result, the approximation can be used to calculate estimates of the mean and confidence intervals and also serves as an excellent choice of proposal density for particle filtering. We will show how to construct filtering algorithms based on the saddle point approximation.
Description
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2006.
Includes bibliographical references (leaves 75-76).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
M.I.T. theses are protected by
copyright. They may be viewed from this source for any purpose, but
reproduction or distribution in any format is prohibited without written
permission. See provided URL for inquiries about permission.
http://dspace.mit.edu/handle/1721.1/7582
Persistent DSpace Link
http://hdl.handle.net/1721.1/42222
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.