You have requested a machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Neither SPIE nor the owners and publishers of the content make, and they explicitly disclaim, any express or implied representations or warranties of any kind, including, without limitation, representations and warranties as to the functionality of the translation feature or the accuracy or completeness of the translations.
Translations are not retained in our system. Your use of this feature and the translations is subject to all use restrictions contained in the Terms and Conditions of Use of the SPIE website.
25 August 2004Physics-based computational complexity of nonlinear filters
Our theory is based on the mapping between two Fokker-Planck equations and two Schroedinger equations (see [1] & [2]), which is well known in physics, but which has not been exploited in filtering theory. This theory expands Brockett's Lie algebra homomorphism conjecture for characterizing finite dimensional filters. In particular, the Schroedinger equation generates a group, whereas the Zakai equation (as well as the Fokker-Planck equation) does not, owing to the lack of a smooth inverse. Simple non-pathological low-dimensional linear-Gaussian timeinvariant counterexamples show that Brockett's conjecture does not reliably predict when a nonlinear filtering problem will have an exact finite dimensional solution. That is, there are manifestly finite dimensional filters for estimation problems with infinite dimensional Lie algebras. There are three reasons that the Lie algebraic approach as originally formulated by Brockett is incomplete: (1) the Zakai equation does not generate a group; (2) Lie algebras are coordinate free, whereas separation of variables in PDEs is not coordinate free, and (3)
Brockett's theory aims to characterize finite dimensional filters for any initial condition of the Zakai equation, whereas SOV for PDEs generally depends on the initial condition. We will attempt to make this paper accessible to normal engineers who do not have Lie algebras for breakfast.
The alert did not successfully save. Please try again later.
Frederick E. Daum, Jim Huang, "Physics-based computational complexity of nonlinear filters," Proc. SPIE 5428, Signal and Data Processing of Small Targets 2004, (25 August 2004); https://doi.org/10.1117/12.532611