DocumentCode
435206
Title
Linear filtering with nonlinear observations
Author
Yau, Stephen S T ; Yan, Changlin ; Shing-Tung Yau
Author_Institution
Dept. of Math., Stat. & Comput. Sci., Univ. of Illinois, Chicago, IL, USA
Volume
2
fYear
2004
fDate
14-17 Dec. 2004
Firstpage
2112
Abstract
For all known finite dimensional filters, one always needs the condition that the observation terms are degree one polynomials. On the other hand, in many practical examples, e.g. tracking problems, the observation terms may be nonlinear. In this paper, we develop a new method to treat linear filtering problems with nonlinear observation terms. We first show that real time computation of Duncan-Mortensen-Zakai (DMZ) equation can be reduced to off time computation of Kolmogorov equation. An explicit algorithm of such a reduction is provided. We next show that if the drifts are linear and the observation terms are nonlinear with linear growths, then the Kolmogorov equation can be solved in real time via a system of ODEs. Consequently, the nonlinear filtering problem with linear drifts and nonlinear observations with linear growth can be solved in real time and memoryless manner.
Keywords
filtering theory; nonlinear filters; polynomial matrices; probability; Duncan-Mortensen-Zakai equation; Kolmogorov equation; ODEs; explicit algorithm; finite dimensional filters; linear drifts; linear filtering; linear growth; memoryless computing; nonlinear filtering; nonlinear observation terms; off time computation; real time computation; tracking problems; unnormalized density; Algebra; Computer science; Filtering; Mathematics; Maximum likelihood detection; Nonlinear equations; Nonlinear filters; Polynomials; Probability; Statistics;
fLanguage
English
Publisher
ieee
Conference_Titel
Decision and Control, 2004. CDC. 43rd IEEE Conference on
ISSN
0191-2216
Print_ISBN
0-7803-8682-5
Type
conf
DOI
10.1109/CDC.2004.1430360
Filename
1430360
Link To Document