Share Email Print
cover

Proceedings Paper

Adaptive noise variance identification for data fusion using subspace-based technique
Author(s): Zhen Li; C. C. Chang
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

The Kalman filter is commonly employed to fuse the measured information from displacement and acceleration responses. This fusion technique can mitigate the noise effect and produce more accurate response estimates. The fusion performance however significantly depends on the accuracy of noise estimation. The noise variances are generally estimated empirically a priori and assumed to be fixed throughout the calculation. Hence some estimation error might occur when the noise characteristics are time-varying. In this study, an adaptive subspace-based technique is developed to identify the noise variances. The approach is based on the principal component analysis which decomposes noisecontaminated signals into the signal subspace and the noise subspace. The variances of the noise and signals can then be estimated independently. To track the time variations of the noise and signal variances in an on-line fashion, a projection approximation subspace tracking technique is employed. The proposed technique can be incorporated into an adaptive Kalman filter and provide a more accurate estimation for data fusion.

Paper Details

Date Published: 31 March 2010
PDF: 11 pages
Proc. SPIE 7647, Sensors and Smart Structures Technologies for Civil, Mechanical, and Aerospace Systems 2010, 76471U (31 March 2010); doi: 10.1117/12.847353
Show Author Affiliations
Zhen Li, Hong Kong Univ. of Science and Technology (Hong Kong, China)
C. C. Chang, Hong Kong Univ. of Science and Technology (Hong Kong, China)


Published in SPIE Proceedings Vol. 7647:
Sensors and Smart Structures Technologies for Civil, Mechanical, and Aerospace Systems 2010
Masayoshi Tomizuka, Editor(s)

© SPIE. Terms of Use
Back to Top