Cart (Loading....) | Create Account
Close category search window
 

Robust filter for multiscale stochastic process

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Xian-Bin Wen ; Sch. of Comput. Sci., Northwestern Polytech Univ., Xi''an, China ; Zheng Tian

The problems of making the Kalman filter robust for multiscale stochastic process are considered in This work. An efficient optimal robust estimation algorithm is investigated for the multiscale autoregressive model on the dyadic tree under the condition: a state is Gaussian and the observation error is non-Gaussian. This algorithm consists of a fine-to-coarse robust filtering sweep, followed by a coarse-to-fine smoothing step. The robust Kalman filtering sweep consists of the recursive application of three steps: a measurement update step, a fine-to coarse prediction step, and a fusion step. The feasibility of the approach is demonstrated by simulation.

Published in:

Machine Learning and Cybernetics, 2004. Proceedings of 2004 International Conference on  (Volume:2 )

Date of Conference:

26-29 Aug. 2004

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.