About this Journal Submit a Manuscript Table of Contents
Mathematical Problems in Engineering
Volume 2012 (2012), Article ID 170391, 5 pages
Letter to the Editor

Comment on “Highly Efficient Sigma Point Filter for Spacecraft Attitude and Rate Estimation”

Department of Navigation Engineering, Naval University of Engineering, Wuhan 430033, China

Received 13 September 2011; Accepted 3 January 2012

Copyright © 2012 Baiqing Hu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


In light of the intuition that a better symmetrical structure can further increase the numerical accuracy, the paper by Fan and Zeng (2009) developed a new sigma point construction strategy for the unscented Kalman filter (UKF), namely, geometric simplex sigma points (GSSP). This comment presents a different perspective from the standpoint of the numerical integration. In this respect, the GSSP constitutes an integration formula of degree 2 with equal weights. Then, we demonstrate that the GSSP can be derived through the orthogonal transformation from the basic points set of degree 2. Moreover, the method presented in this comment can be used to construct more accurate sigma points set for certain dynamic problems.

With the intuition that a better symmetry property provides a better numerical behavior [1], addressed the construction strategies to make the best symmetric structure in simplex sigma point set and derived the so-called geometric simplex sigma points (GSSP) for Euclidean geometric space. As compared with the previously exiting simplex sigma points set, the GSSP has a symmetric structure and a lower computational expense, is numerically more accurate, and can be used in a variety of 3-dimensional modeled dynamic problems.

In this comment we will show that the GSSP can also be derived from the integration rule of degree 2. Embedding the Gaussian assumption in the Bayesian filter we can reach the idea that the functional recursion of the Bayesian filter reduces to an algebraic recursion operating only on conditional means and covariances which share the same structure of Gaussian weighted integrals whose integrands are all of the form nonlinear function Gaussian density. The multidimensional integrals are usually intractable for systems involving nonlinearity, so the recursive estimation problem boils down to how to compute the integrals using approximate methods. There are many well-known numerical integration methods such as Gauss-Hermite quadrature, cubature rules, fully symmetric integration rule, and central-difference-based methods that can be used to handle such integrals [24]. The unscented transformation (UT) used in the traditional unscented Kalman filter (UKF) can be interpreted as either fully symmetric integration rule or cubature rule of degree 3. The simplex UT can also be interpreted as a numerical integration formula of degree 2 [3]. Next we will focus on the numerical integration formula of degree 2 in order to derive the GSSP.

Before getting involved in further details, we first introduce some definitions when constructing the exact monomials rule as follows [3, 4].

Definition 1. Consider the monomials of the formwhere the powersare nonnegative integers and, a rule said to have precisionif it can integrate such monomials accurately and it is not exact for monomials of degree.
The numerical integration formulas are conducted by approximating the integrals with the weighted sum of an elaborately chosen set of points as follows [57]: where is a region in an -dimensional, real, Euclidean space, is the state variable, are constants, and are points in the space. The integral weight is a Gaussian distribution as discussed above. Since an arbitrary Gaussian distribution with meanand covariancecan always be transformed into the unit Gaussian distribution as (see prove in [4]) where andis the identity matrix, we can start by considering the multidimensional unit Gaussian integral. Based on Definition 1, we can construct a rule, which is exact up to degree 2 by determining the weighted points set such that it is exact for selectionsand. The true values of the integrals are In [5] Stroud had proved thatis the minimum number of points for equally weighted degree 2 formulas. Let us defineequally weighted points where. In order to calculate (4) accurately using these points through (1), we can get the following equations: whereis the -dimensional identity matrix. Any equally weighted points set that fulfills (6) can approximate the unit Gaussian integral accurately up to degree 2. References [6, 7] have presented a basic points set that fulfills such conditions with the form asand ifis odd. is the greatest integer not exceeding. When, the basic points set is Next we will give a theorem through which we can get the GSSP from the basic points set of degree 2.

Theorem 1. Assume thatequally weighted points set as that in (5) constitutes an integration formula of degree 2. is an orthogonal matrix. Thenalso constitutes an integration formula of degree 2.

Proof. By defining a matrix we can rewrite (6) as whereis the -dimensional identity matrix. is an orthogonal matrix, so Hence, also fulfills (6) which completes the proof.

For the 3-dimensional Euclidean space, there are many orthogonal matrixes. Here, we use the direction cosine matrix (DCM) which is widely used in the practical systems such as guidance and navigation [8]. The DCM that rotates an angleaboutis By a simple computation, it is obvious that Since all the points share equal weight, is virtually just the GSSP derived in [1].

Up to this point we have derived the GSSP through the numerical integration formulas method. Compared with the intuitionistic method in [1], our method is more principled in mathematical terms. Although Theorem 1 is proposed for integration formula of degree 2, it can be generalized for different degrees, that is, the orthogonal transformation on the numerical integration formula will not change its accurate degree. Reference [7] also presented the points set of degree 3, that is, wherewithand ifis odd, . is the greatest integer not exceeding. It can be proven that the points set (14) can be derived through orthogonal transformation on the cubature points set with the form [4] wheredenotes a unit vector to the direction of coordinate axis.

As can be seen from (16) the distance of the cubature point from the mean is proportional to . So, for high-dimensional problems, the cubature points set bears the nonlocal sampling problem [911]. For many kinds of nonlinearities (such as exponents or trigonometric functions), this can lead to significant difficulties. In contrast, the points set (14) does not bear such nonlocal sampling problem. Under this condition, the points set (14) is more accurate than the cubature points set (16). Therefore, to this respect, we can derive different sigma points set which may be more accurate for certain dynamic problems by the presented method.


  1. C.-S. Fan and Y. Zheng, “Highly efficient sigma point filter for spacecraft attitude and rate estimation,” Mathematical Problems in Engineering, vol. 2009, Article ID 507370, 23 pages, 2009. View at Google Scholar
  2. K. Ito and K. Xiong, “Gaussian filters for nonlinear filtering problems,” IEEE Transactions on Automatic Control, vol. 45, no. 5, pp. 910–927, 2000. View at Publisher · View at Google Scholar · View at MathSciNet
  3. Y.-X. Wu, D.-W. Hu, M.-P. Wu, and X.-P. Hu, “A numerical-integration perspective on Gaussian filters,” IEEE Transactions on Signal Processing, vol. 56, no. 8, pp. 2910–2921, 2006. View at Google Scholar
  4. I. Arasaratnam and S. Haykin, “Cubature Kalman filters,” IEEE Transactions on Automatic Control, vol. 54, no. 6, pp. 1254–1269, 2009. View at Publisher · View at Google Scholar · View at MathSciNet
  5. A. H. Stroud, “Numerical integration formulas of degree two,” Mathematics and Computers in Simulation, vol. 14, pp. 21–26, 1960. View at Google Scholar · View at Zentralblatt MATH
  6. A. H. Stroud, “Remarks on the disposition of points in numerical integration formulas,” Mathematical Tables and Other Aids to Computation, vol. 11, pp. 257–261, 1957. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  7. D. Xiu, “Numerical integration formulas of degree two,” Applied Numerical Mathematics, vol. 58, no. 10, pp. 1515–1520, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  8. D. H. Titterton and J. L. Weston, Strapdown Inertial Navigation Technology, The Institution of Electrical Engineers, 2nd edition, 2004.
  9. S. J. Julier, “The scaled unscented transformation,” in Proceedings of the American Control Conference, vol. 6, pp. 4555–4559, Anchorage, Alaska, USA, May 2002.
  10. S. Chen, H. Tong, Z. Wang, S. Liu, M. Li, and B. Zhang, “Improved generalized belief propagation for vision processing,” Mathematical Problems in Engineering, vol. 2011, Article ID 416963, 12 pages, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  11. S. Y. Chen, “Kalman filter for robot vision: a survey,” IEEE Transactions on Industrial Electronics, vol. 59, 2012. View at Publisher · View at Google Scholar