Alpha beta filter

Last updated June 01, 2024

An alpha beta filter (also called alpha-beta filter, f-g filter or g-h filter^[1]) is a simplified form of observer for estimation, data smoothing and control applications. It is closely related to Kalman filters and to linear state observers used in control theory. Its principal advantage is that it does not require a detailed system model.

Filter equations

An alpha beta filter presumes that a system is adequately approximated by a model having two internal states, where the first state is obtained by integrating the value of the second state over time. Measured system output values correspond to observations of the first model state, plus disturbances. This very low order approximation is adequate for many simple systems, for example, mechanical systems where position is obtained as the time integral of velocity. Based on a mechanical system analogy, the two states can be called position x and velocity v. Assuming that velocity remains approximately constant over the small time interval ΔT between measurements, the position state is projected forward to predict its value at the next sampling time using equation 1.

{\text{(1)}}\quad {\hat {\textbf {x}}}_{k}\leftarrow {\hat {\textbf {x}}}_{k-1}+\Delta {\textrm {T}}\ {\textbf {}}{\hat {\textbf {v}}}_{k-1}

Since velocity variable v is presumed constant, its projected value at the next sampling time equals the current value.

{\text{(2)}}\quad {\hat {\textbf {v}}}_{k}\leftarrow {\hat {\textbf {v}}}_{k-1}

If additional information is known about how a driving function will change the v state during each time interval, equation 2 can be modified to include it.

The output measurement is expected to deviate from the prediction because of noise and dynamic effects not included in the simplified dynamic model. This prediction error r is also called the residual or innovation, based on statistical or Kalman filtering interpretations

{\text{(3)}}\quad {\hat {\textbf {r}}}_{k}\leftarrow {\textbf {x}}_{k}-{\hat {\textbf {x}}}_{k}

Suppose that residual r is positive. This could result because the previous x estimate was low, the previous v was low, or some combination of the two. The alpha beta filter takes selected alpha and beta constants (from which the filter gets its name), uses alpha times the deviation r to correct the position estimate, and uses beta times the deviation r to correct the velocity estimate. An extra ΔT factor conventionally serves to normalize magnitudes of the multipliers.

{\text{(4)}}\quad {\hat {\textbf {x}}}_{k}\leftarrow {\hat {\textbf {x}}}_{k}+(\alpha )\ {\hat {\textbf {r}}}_{k}

{\text{(5)}}\quad {\hat {\textbf {v}}}_{k}\leftarrow {\hat {\textbf {v}}}_{k}+(\beta /[\Delta {\textrm {T}}])\ {\hat {\textbf {r}}}_{k}

The corrections can be considered small steps along an estimate of the gradient direction. As these adjustments accumulate, error in the state estimates is reduced. For convergence and stability, the values of the alpha and beta multipliers should be positive and small:^[2]

\quad 0<\alpha <1

\quad 0<\beta \leq 2

Noise is suppressed only if $0<\beta <1$ , otherwise the noise is amplified.

Values of alpha and beta typically are adjusted experimentally. In general, larger alpha and beta gains tend to produce faster response for tracking transient changes, while smaller alpha and beta gains reduce the level of noise in the state estimates. If a good balance between accurate tracking and noise reduction is found, and the algorithm is effective, filtered estimates are more accurate than the direct measurements. This motivates calling the alpha-beta process a filter.

Algorithm summary

Initialize.

Set the initial values of state estimates x and v, using prior information or additional measurements; otherwise, set the initial state values to zero.
Select values of the alpha and beta correction gains.

Update. Repeat for each time step ΔT:

Project state estimates x and v using equations 1 and 2
Obtain a current measurement of the output value
Compute the residual r using equation 3
Correct the state estimates using equations 4 and 5
Send updated x and optionally v as the filter outputs

Sample program

Alpha Beta filter can be implemented in C ^[3] as follows:

#include<stdio.h>#include<stdlib.h>intmain(){floatdt=0.5;floatxk_1=0,vk_1=0,a=0.85,b=0.005;floatxk,vk,rk;floatxm;while(1){xm=rand()%100;// input signalxk=xk_1+(vk_1*dt);vk=vk_1;rk=xm-xk;xk+=a*rk;vk+=(b*rk)/dt;xk_1=xk;vk_1=vk;printf("%f \t %f\n",xm,xk_1);sleep(1);}}

Result

The following images depict the outcome of the above program in graphical format. In each image, the blue trace is the input signal; the output is red in the first image, yellow in the second, and green in the third. For the first two images, the output signal is visibly smoother than the input signal and lacks extreme spikes seen in the input. Also, the output moves in an estimate of gradient direction of input.

The higher the alpha parameter, the higher is the effect of input x and the less damping is seen. A low value of beta is effective in controlling sudden surges in velocity. Also, as alpha increases beyond unity, the output becomes rougher and more uneven than the input.^[3]

Results for alpha = 0.85 and beta = 0.005	Results for alpha = 0.5 and beta = 0.1	Results for alpha = 1.5 and beta = 0.5

Relationship to general state observers

More general state observers, such as the Luenberger observer for linear control systems, use a rigorous system model. Linear observers use a gain matrix to determine state estimate corrections from multiple deviations between measured variables and predicted outputs that are linear combinations of state variables. In the case of alpha beta filters, this gain matrix reduces to two terms. There is no general theory for determining the best observer gain terms, and typically gains are adjusted experimentally for both.

The linear Luenberger observer equations reduce to the alpha beta filter by applying the following specializations and simplifications.

The discrete state transition matrix A is a square matrix of dimension 2, with all main diagonal terms equal to 1, and the first super-diagonal terms equal to ΔT.
The observation equation matrix C has one row that selects the value of the first state variable for output.
The filter correction gain matrix L has one column containing the alpha and beta gain values.
Any known driving signal for the second state term is represented as part of the input signal vector u, otherwise the u vector is set to zero.
Input coupling matrix B has a non-zero gain term as its last element if vector u is non-zero.

Relationship to Kalman filters

A Kalman filter estimates the values of state variables and corrects them in a manner similar to an alpha beta filter or a state observer. However, a Kalman filter does this in a much more formal and rigorous manner. The principal differences between Kalman filters and alpha beta filters are the following.

Like state observers, Kalman filters use a detailed dynamic system model that is not restricted to two state variables.
Like state observers, Kalman filters in general use multiple observed variables to correct state variable estimates, and these do not have to be direct measurements of individual system states.
A Kalman filter uses covariance noise models for states and observations. Using these, a time-dependent estimate of state covariance is updated automatically, and from this the Kalman gain matrix terms are calculated. Alpha beta filter gains are manually selected and static.
For certain classes of problems, a Kalman filter is Wiener optimal, while alpha beta filtering is in general suboptimal.

A Kalman filter designed to track a moving object using a constant-velocity target dynamics (process) model (i.e., constant velocity between measurement updates) with process noise covariance and measurement covariance held constant will converge to the same structure as an alpha-beta filter. However, a Kalman filter's gain is computed recursively at each time step using the assumed process and measurement error statistics, whereas the alpha-beta's gain is computed ad hoc.

Choice of parameters

The alpha-beta filter becomes a steady-state Kalman filter if filter parameters are calculated from the sampling interval $T$ , the process variance $\sigma _{w}^{2}$ and the noise variance $\sigma _{v}^{2}$ like this^[4]^[5]

\lambda ={\frac {\sigma _{w}T^{2}}{\sigma _{v}}}

r={\frac {4+\lambda -{\sqrt {8\lambda +\lambda ^{2}}}}{4}}

\alpha =1-r^{2}

\beta =2\left(2-\alpha \right)-4{\sqrt {1-\alpha }}

This choice of filter parameters minimizes the mean square error.

The steady state innovation variance $s$ can be expressed as:

s={\frac {\sigma _{v}^{2}}{1-\alpha ^{2}}}

Variations

Alpha filter

A simpler member of this family of filters is the alpha filter which observes only one state:

{\hat {\textbf {x}}}_{k}\leftarrow {\hat {\textbf {x}}}_{k}+(\alpha )\ {\hat {\textbf {r}}}_{k}

with the optimal parameter calculated like this:^[4]

{\begin{aligned}\lambda &={\frac {\sigma _{w}T^{2}}{\sigma _{v}}}\\\alpha &={\frac {-\lambda ^{2}+{\sqrt {\lambda ^{4}+16\lambda ^{2}}}}{8}}\end{aligned}}

This calculation is identical for a moving average and a low-pass filter. Exponential smoothing is mathematically identical to the purposed Alpha filter.

Alpha beta gamma filter

When the second state variable varies quickly, i.e. when the acceleration of the first state is large, it can be useful to extend the states of the alpha beta filter by one level. In this extension, the second state variable v is obtained from integrating a third acceleration state, analogous to the way that the first state is obtained by integrating the second. An equation for the a state is added to the equation system. A third multiplier, gamma, is selected for applying corrections to the new a state estimates. This yields the alpha beta gamma update equations.^[1]

{\hat {\textbf {x}}}_{k}\leftarrow {\hat {\textbf {x}}}_{k}+(\alpha )\ {\textbf {r}}_{k}

{\hat {\textbf {v}}}_{k}\leftarrow {\hat {\textbf {v}}}_{k}+(\beta /[\Delta {\textrm {T}}])\ {\textbf {r}}_{k}

{\hat {\textbf {a}}}_{k}\leftarrow {\hat {\textbf {a}}}_{k}+(2\gamma /[\Delta {\textrm {T}}]^{\textrm {2}})\ {\textbf {r}}_{k}

Similar extensions to additional higher orders are possible, but most systems of higher order tend to have significant interactions among the multiple states, ^{[ citation needed ]} so approximating the system dynamics as a simple integrator chain is less likely to prove useful.

Calculating optimal parameters for the alpha-beta-gamma filter is a bit more involved than for the alpha-beta filter:^[5]

{\begin{aligned}\lambda &={\frac {\sigma _{w}T^{2}}{\sigma _{v}}}\\[2ex]b&={\frac {\lambda }{2}}-3\\c&={\frac {\lambda }{2}}+3\\d&=-1\\p&=c-{\frac {b^{2}}{3}}\\q&={\frac {2b^{3}}{27}}-{\frac {bc}{3}}+d\\v&={\sqrt {q^{2}+{\frac {4p^{3}}{27}}}}\\z&=-{\sqrt[{3}]{q+{\frac {v}{2}}}}\\s&=z-{\frac {p}{3z}}-{\frac {b}{3}}\\[2ex]\alpha &=1-s^{2}\\\beta &=2(1-s)^{2}\\\gamma &={\frac {\beta ^{2}}{2\alpha }}\end{aligned}}

Related Research Articles

For statistics and control theory, Kalman filtering, also known as linear quadratic estimation (LQE), is an algorithm that uses a series of measurements observed over time, including statistical noise and other inaccuracies, and produces estimates of unknown variables that tend to be more accurate than those based on a single measurement alone, by estimating a joint probability distribution over the variables for each timeframe. The filter is named after Rudolf E. Kálmán, who was one of the primary developers of its theory.

Linear elasticity is a mathematical model of how solid objects deform and become internally stressed due to prescribed loading conditions. It is a simplification of the more general nonlinear theory of elasticity and a branch of continuum mechanics.

Ridge regression is a method of estimating the coefficients of multiple-regression models in scenarios where the independent variables are highly correlated. It has been used in many fields including econometrics, chemistry, and engineering. Also known as Tikhonov regularization, named for Andrey Tikhonov, it is a method of regularization of ill-posed problems. It is particularly useful to mitigate the problem of multicollinearity in linear regression, which commonly occurs in models with large numbers of parameters. In general, the method provides improved efficiency in parameter estimation problems in exchange for a tolerable amount of bias.

The Gauss–Newton algorithm is used to solve non-linear least squares problems, which is equivalent to minimizing a sum of squared function values. It is an extension of Newton's method for finding a minimum of a non-linear function. Since a sum of squares must be nonnegative, the algorithm can be viewed as using Newton's method to iteratively approximate zeroes of the components of the sum, and thus minimizing the sum. In this sense, the algorithm is also an effective method for solving overdetermined systems of equations. It has the advantage that second derivatives, which can be challenging to compute, are not required.

In numerical analysis, the Crank–Nicolson method is a finite difference method used for numerically solving the heat equation and similar partial differential equations. It is a second-order method in time. It is implicit in time, can be written as an implicit Runge–Kutta method, and it is numerically stable. The method was developed by John Crank and Phyllis Nicolson in the mid 20th century.

In physics, Maxwell's equations in curved spacetime govern the dynamics of the electromagnetic field in curved spacetime or where one uses an arbitrary coordinate system. These equations can be viewed as a generalization of the vacuum Maxwell's equations which are normally formulated in the local coordinates of flat spacetime. But because general relativity dictates that the presence of electromagnetic fields induce curvature in spacetime, Maxwell's equations in flat spacetime should be viewed as a convenient approximation.

In the theory of general relativity, a stress–energy–momentum pseudotensor, such as the Landau–Lifshitz pseudotensor, is an extension of the non-gravitational stress–energy tensor that incorporates the energy–momentum of gravity. It allows the energy–momentum of a system of gravitating matter to be defined. In particular it allows the total of matter plus the gravitating energy–momentum to form a conserved current within the framework of general relativity, so that the total energy–momentum crossing the hypersurface of any compact space–time hypervolume vanishes.

The Newman–Penrose (NP) formalism is a set of notation developed by Ezra T. Newman and Roger Penrose for general relativity (GR). Their notation is an effort to treat general relativity in terms of spinor notation, which introduces complex forms of the usual variables used in GR. The NP formalism is itself a special case of the tetrad formalism, where the tensors of the theory are projected onto a complete vector basis at each point in spacetime. Usually this vector basis is chosen to reflect some symmetry of the spacetime, leading to simplified expressions for physical observables. In the case of the NP formalism, the vector basis chosen is a null tetrad: a set of four null vectors—two real, and a complex-conjugate pair. The two real members often asymptotically point radially inward and radially outward, and the formalism is well adapted to treatment of the propagation of radiation in curved spacetime. The Weyl scalars, derived from the Weyl tensor, are often used. In particular, it can be shown that one of these scalars— $in the appropriate frame—encodes the outgoing gravitational radiation of an asymptotically flat system.$

Bayesian linear regression is a type of conditional modeling in which the mean of one variable is described by a linear combination of other variables, with the goal of obtaining the posterior probability of the regression coefficients and ultimately allowing the out-of-sample prediction of the regressandconditional on observed values of the regressors. The simplest and most widely used version of this model is the normal linear model, in which $given is distributed Gaussian. In this model, and under a particular choice of prior probabilities for the parameters—so-called conjugate priors—the posterior can be found analytically. With more arbitrarily chosen priors, the posteriors generally have to be approximated.$

In computational chemistry, a constraint algorithm is a method for satisfying the Newtonian motion of a rigid body which consists of mass points. A restraint algorithm is used to ensure that the distance between mass points is maintained. The general steps involved are: (i) choose novel unconstrained coordinates, (ii) introduce explicit constraint forces, (iii) minimize constraint forces implicitly by the technique of Lagrange multipliers or projection methods.

A ratio distribution is a probability distribution constructed as the distribution of the ratio of random variables having two other known distributions. Given two random variables X and Y, the distribution of the random variable Z that is formed as the ratio Z = X/Y is a ratio distribution.

Non-linear least squares is the form of least squares analysis used to fit a set of m observations with a model that is non-linear in n unknown parameters (m ≥ n). It is used in some forms of nonlinear regression. The basis of the method is to approximate the model by a linear one and to refine the parameters by successive iterations. There are many similarities to linear least squares, but also some significant differences. In economic theory, the non-linear least squares method is applied in (i) the probit regression, (ii) threshold regression, (iii) smooth regression, (iv) logistic link regression, (v) Box–Cox transformed regressors ( $).$

A kernel smoother is a statistical technique to estimate a real valued function $as the weighted average of neighboring observed data. The weight is defined by the kernel, such that closer points are given higher weights. The estimated function is smooth, and the level of smoothness is set by a single parameter. Kernel smoothing is a type of weighted moving average.$

<span class="mw-page-title-main">Normal-inverse-gamma distribution</span>

In probability theory and statistics, the normal-inverse-gamma distribution is a four-parameter family of multivariate continuous probability distributions. It is the conjugate prior of a normal distribution with unknown mean and variance.

In mathematics, and more precisely, in functional Analysis and PDEs, the Schauder estimates are a collection of results due to Juliusz Schauder concerning the regularity of solutions to linear, uniformly elliptic partial differential equations. The estimates say that when the equation has appropriately smooth terms and appropriately smooth solutions, then the Hölder norm of the solution can be controlled in terms of the Hölder norms for the coefficient and source terms. Since these estimates assume by hypothesis the existence of a solution, they are called a priori estimates.

In mathematics, Ricci calculus constitutes the rules of index notation and manipulation for tensors and tensor fields on a differentiable manifold, with or without a metric tensor or connection. It is also the modern name for what used to be called the absolute differential calculus, developed by Gregorio Ricci-Curbastro in 1887–1896, and subsequently popularized in a paper written with his pupil Tullio Levi-Civita in 1900. Jan Arnoldus Schouten developed the modern notation and formalism for this mathematical framework, and made contributions to the theory, during its applications to general relativity and differential geometry in the early twentieth century.

In theoretical physics, relativistic Lagrangian mechanics is Lagrangian mechanics applied in the context of special relativity and general relativity.

Affine gauge theory is classical gauge theory where gauge fields are affine connections on the tangent bundle over a smooth manifold $. For instance, these are gauge theory of dislocations in continuous media when, the generalization of metric-affine gravitation theory when is a world manifold and, in particular, gauge theory of the fifth force.$

In theoretical physics, the dual graviton is a hypothetical elementary particle that is a dual of the graviton under electric-magnetic duality, as an S-duality, predicted by some formulations of supergravity in eleven dimensions.

The quaternion estimator algorithm (QUEST) is an algorithm designed to solve Wahba's problem, that consists of finding a rotation matrix between two coordinate systems from two sets of observations sampled in each system respectively. The key idea behind the algorithm is to find an expression of the loss function for the Wahba's problem as a quadratic form, using the Cayley–Hamilton theorem and the Newton–Raphson method to efficiently solve the eigenvalue problem and construct a numerically stable representation of the solution.

References

1 2 Eli Brookner: Tracking and Kalman Filtering Made Easy. Wiley-Interscience, 1st edition, 4 1998.
↑ C. Frank Asquith: Weight selection in first-order linear filters. Technical report, Army Intertial Guidance and Control Laboratory Center, Redstone Arsenal, Alabama, 1969. https://doi.org/10.21236/ad0859332
1 2 Tremor Cancellation in Handheld Microsurgical Devices, TC83 by Gaurav Mittal, Deepansh Sehgal and Harsimran Jit Singh, Punjab Engineering College
1 2 Paul R. Kalata: The tracking index: A generalized parameter for α-β and α-β-γ target trackers. IEEE Transactions on Aerospace and Electronic Systems, AES-20(2):174–181, March 1984.
1 2 J. E. Gray and W. J. Murray: A derivation of an analytic expression for the tracking index for the alpha-beta-gamma filter. IEEE Trans. on Aerospace and Electronic Systems, 29:1064–1065, 1993.

Sources

External links

Alpha-Beta C# source code sample
Alpha-Beta C source code sample
Tracking performance of the alpha-beta tracker versus the Kalman filter
The alpha-beta-gamma Filter, A online Tutorial with many numerical examples and intuitive explanations by Alex Becker.

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[Brookner-1] 1 2 Eli Brookner: Tracking and Kalman Filtering Made Easy. Wiley-Interscience, 1st edition, 4 1998.

[2] C. Frank Asquith: Weight selection in first-order linear filters. Technical report, Army Intertial Guidance and Control Laboratory Center, Redstone Arsenal, Alabama, 1969. https://doi.org/10.21236/ad0859332

[ReferenceA-3] 1 2 Tremor Cancellation in Handheld Microsurgical Devices, TC83 by Gaurav Mittal, Deepansh Sehgal and Harsimran Jit Singh, Punjab Engineering College

[Kalata-4] 1 2 Paul R. Kalata: The tracking index: A generalized parameter for α-β and α-β-γ target trackers. IEEE Transactions on Aerospace and Electronic Systems, AES-20(2):174–181, March 1984.

[GrayMurray-5] 1 2 J. E. Gray and W. J. Murray: A derivation of an analytic expression for the tracking index for the alpha-beta-gamma filter. IEEE Trans. on Aerospace and Electronic Systems, 29:1064–1065, 1993.

[1]

[2]

[3]

[4]

[5]