The approximate correction of the additive white noise model in quantized Kalman filter is investigated under certain conditions. The probability density function of the error of quantized measurements is analyzed theoretically and experimentally. The analysis is based on the probability theory and nonparametric density estimation technique, respectively. The approximator of probability density function of quantized measurement noise is given. The numerical results of nonparametric density estimation algorithm demonstrate that the theoretical conclusion is reasonable. Based on the analysis of quantization noise, a novel algorithm for state estimation with quantized measurements also is proposed. The algorithm is based on the least-squares estimator and unscented transform. By least-squares estimator, the effective information is extracted from the quantized measurements. Also, using the information to update the estimated state can give a better estimation under the influence of quantization. The root mean square error (RMSE) of the proposed algorithm is compared with the RMSE of the existing methods for a typical tracking scenario in wireless sensor networks systems. Simulations provide a strong evidence that this tracking algorithm could indeed give us a more precise estimated result.
The stability of quantized innovations Kalman filtering (QIKF) is analyzed. In the analysis, the correlation between quantization errors and measurement noises is considered. By taking the quantization errors as a random perturbation in the observation system, the QIKF for the original system is equivalent to a Kalman-like filtering for the equivalent state-observation system. Thus, the estimate error covariance matrix of QIKF can be more exactly analyzed. The boundedness of the estimate error covariance matrix of QIKF is obtained under some weak conditions. The design of the number of quantized levels is discussed to guarantee the stability of QIKF. To overcome the instability and divergence of QIKF when the number of quantization levels is small, we propose a Kalman filter using scaling quantized innovations. Numerical simulations show the validity of the theorems and algorithms.
Harris corner detector is a classic tool to extract feature.It is stable to illumination change and rotation but unstable to more complicated transform.In order to register images with different viewpoints,we extend Harris corner detector to scale-space to gain invariance to scale change,then we apply affine shape adaptation to the scale invariant point until convergence is reached,giving it invariance to affine transform.With these local features,we use general feature descriptor and matching algorithm to generate matches and then use the matches to calculate the geometric transform matrix,which enables the final registration.Result shows that our algorithm can get more accurate matches than scale invariant feature transform SIFT,and less difference exists between registered images.
