在线链接_网络设计项目_长沙seo优化价格_小时seo

1 原理

卡尔曼滤波是根据观测数据对系统状态进行最优估计的算法。
状态预测公式：

其中，x[dx,1]是状态值，来自上一轮的最优估计。F[dx,dx]是状态转移矩阵，表示我们如何从上一状态推测出当前状态。B表示控制矩阵，表示控制量u对当前状态的影响；u表示控制量，可以理解为噪声。在目标跟踪中u为0。

x 的协方差：

其中，P是x的方差，Q是噪声，表示不确定干扰项，通常是对角线矩阵，数值越大，表示x新变化越大。
观测值：

其中，z[dz,1]为观测值，R[dz,dz]为z的方差，一般是对角线矩阵。H[dz,dx]是映射矩阵，描述x与z的关系。

状态值通过H对观测值进行预测：

把观测结果z和x预测的观测值结合就得到最优估计值，也是卡尔曼滤波的目标。

最优估计的推导，已知两个正态分布，求两个正态分布相乘的分布。

卡尔曼滤波的预测方程

卡尔曼滤波的更新方程

2 代码

import numpy as np
import scipy.linalgclass KalmanFilterXYAH:"""A KalmanFilterXYAH class for tracking bounding boxes in image space using a Kalman filter.Implements a simple Kalman filter for tracking bounding boxes in image space. The 8-dimensional state space(x, y, a, h, vx, vy, va, vh) contains the bounding box center position (x, y), aspect ratio a, height h, and theirrespective velocities. Object motion follows a constant velocity model, and bounding box location (x, y, a, h) istaken as a direct observation of the state space (linear observation model).Attributes:_motion_mat (np.ndarray): The motion matrix for the Kalman filter._update_mat (np.ndarray): The update matrix for the Kalman filter._std_weight_position (float): Standard deviation weight for position._std_weight_velocity (float): Standard deviation weight for velocity.Methods:initiate: Creates a track from an unassociated measurement.predict: Runs the Kalman filter prediction step.project: Projects the state distribution to measurement space.multi_predict: Runs the Kalman filter prediction step (vectorized version).update: Runs the Kalman filter correction step.gating_distance: Computes the gating distance between state distribution and measurements.Examples:Initialize the Kalman filter and create a track from a measurement>>> kf = KalmanFilterXYAH()>>> measurement = np.array([100, 200, 1.5, 50])>>> mean, covariance = kf.initiate(measurement)>>> print(mean)>>> print(covariance)"""def __init__(self):"""Initialize Kalman filter model matrices with motion and observation uncertainty weights.The Kalman filter is initialized with an 8-dimensional state space (x, y, a, h, vx, vy, va, vh), where (x, y)represents the bounding box center position, 'a' is the aspect ratio, 'h' is the height, and their respectivevelocities are (vx, vy, va, vh). The filter uses a constant velocity model for object motion and a linearobservation model for bounding box location.Examples:Initialize a Kalman filter for tracking:>>> kf = KalmanFilterXYAH()"""ndim, dt = 4, 1.0# Create Kalman filter model matricesself._motion_mat = np.eye(2 * ndim, 2 * ndim)for i in range(ndim):self._motion_mat[i, ndim + i] = dtself._update_mat = np.eye(ndim, 2 * ndim)# Motion and observation uncertainty are chosen relative to the current state estimate. These weights control# the amount of uncertainty in the model.self._std_weight_position = 1.0 / 20self._std_weight_velocity = 1.0 / 160def initiate(self, measurement: np.ndarray) -> tuple:"""Create a track from an unassociated measurement.Args:measurement (ndarray): Bounding box coordinates (x, y, a, h) with center position (x, y), aspect ratio a,and height h.Returns:(tuple[ndarray, ndarray]): Returns the mean vector (8-dimensional) and covariance matrix (8x8 dimensional)of the new track. Unobserved velocities are initialized to 0 mean.Examples:>>> kf = KalmanFilterXYAH()>>> measurement = np.array([100, 50, 1.5, 200])>>> mean, covariance = kf.initiate(measurement)"""mean_pos = measurementmean_vel = np.zeros_like(mean_pos)mean = np.r_[mean_pos, mean_vel]std = [2 * self._std_weight_position * measurement[3],2 * self._std_weight_position * measurement[3],1e-2,2 * self._std_weight_position * measurement[3],10 * self._std_weight_velocity * measurement[3],10 * self._std_weight_velocity * measurement[3],1e-5,10 * self._std_weight_velocity * measurement[3],]covariance = np.diag(np.square(std))return mean, covariancedef predict(self, mean: np.ndarray, covariance: np.ndarray) -> tuple:"""Run Kalman filter prediction step.Args:mean (ndarray): The 8-dimensional mean vector of the object state at the previous time step.covariance (ndarray): The 8x8-dimensional covariance matrix of the object state at the previous time step.Returns:(tuple[ndarray, ndarray]): Returns the mean vector and covariance matrix of the predicted state. Unobservedvelocities are initialized to 0 mean.Examples:>>> kf = KalmanFilterXYAH()>>> mean = np.array([0, 0, 1, 1, 0, 0, 0, 0])>>> covariance = np.eye(8)>>> predicted_mean, predicted_covariance = kf.predict(mean, covariance)"""std_pos = [self._std_weight_position * mean[3],self._std_weight_position * mean[3],1e-2,self._std_weight_position * mean[3],]std_vel = [self._std_weight_velocity * mean[3],self._std_weight_velocity * mean[3],1e-5,self._std_weight_velocity * mean[3],]motion_cov = np.diag(np.square(np.r_[std_pos, std_vel]))mean = np.dot(mean, self._motion_mat.T)covariance = np.linalg.multi_dot((self._motion_mat, covariance, self._motion_mat.T)) + motion_covreturn mean, covariancedef project(self, mean: np.ndarray, covariance: np.ndarray) -> tuple:"""Project state distribution to measurement space.Args:mean (ndarray): The state's mean vector (8 dimensional array).covariance (ndarray): The state's covariance matrix (8x8 dimensional).Returns:(tuple[ndarray, ndarray]): Returns the projected mean and covariance matrix of the given state estimate.Examples:>>> kf = KalmanFilterXYAH()>>> mean = np.array([0, 0, 1, 1, 0, 0, 0, 0])>>> covariance = np.eye(8)>>> projected_mean, projected_covariance = kf.project(mean, covariance)"""std = [self._std_weight_position * mean[3],self._std_weight_position * mean[3],1e-1,self._std_weight_position * mean[3],]innovation_cov = np.diag(np.square(std))mean = np.dot(self._update_mat, mean)covariance = np.linalg.multi_dot((self._update_mat, covariance, self._update_mat.T))return mean, covariance + innovation_covdef multi_predict(self, mean: np.ndarray, covariance: np.ndarray) -> tuple:"""Run Kalman filter prediction step for multiple object states (Vectorized version).Args:mean (ndarray): The Nx8 dimensional mean matrix of the object states at the previous time step.covariance (ndarray): The Nx8x8 covariance matrix of the object states at the previous time step.Returns:(tuple[ndarray, ndarray]): Returns the mean matrix and covariance matrix of the predicted states.The mean matrix has shape (N, 8) and the covariance matrix has shape (N, 8, 8). Unobserved velocitiesare initialized to 0 mean.Examples:>>> mean = np.random.rand(10, 8)  # 10 object states>>> covariance = np.random.rand(10, 8, 8)  # Covariance matrices for 10 object states>>> predicted_mean, predicted_covariance = kalman_filter.multi_predict(mean, covariance)"""std_pos = [self._std_weight_position * mean[:, 3],self._std_weight_position * mean[:, 3],1e-2 * np.ones_like(mean[:, 3]),self._std_weight_position * mean[:, 3],]std_vel = [self._std_weight_velocity * mean[:, 3],self._std_weight_velocity * mean[:, 3],1e-5 * np.ones_like(mean[:, 3]),self._std_weight_velocity * mean[:, 3],]sqr = np.square(np.r_[std_pos, std_vel]).Tmotion_cov = [np.diag(sqr[i]) for i in range(len(mean))]motion_cov = np.asarray(motion_cov)mean = np.dot(mean, self._motion_mat.T)left = np.dot(self._motion_mat, covariance).transpose((1, 0, 2))covariance = np.dot(left, self._motion_mat.T) + motion_covreturn mean, covariancedef update(self, mean: np.ndarray, covariance: np.ndarray, measurement: np.ndarray) -> tuple:"""Run Kalman filter correction step.Args:mean (ndarray): The predicted state's mean vector (8 dimensional).covariance (ndarray): The state's covariance matrix (8x8 dimensional).measurement (ndarray): The 4 dimensional measurement vector (x, y, a, h), where (x, y) is the centerposition, a the aspect ratio, and h the height of the bounding box.Returns:(tuple[ndarray, ndarray]): Returns the measurement-corrected state distribution.Examples:>>> kf = KalmanFilterXYAH()>>> mean = np.array([0, 0, 1, 1, 0, 0, 0, 0])>>> covariance = np.eye(8)>>> measurement = np.array([1, 1, 1, 1])>>> new_mean, new_covariance = kf.update(mean, covariance, measurement)"""projected_mean, projected_cov = self.project(mean, covariance)chol_factor, lower = scipy.linalg.cho_factor(projected_cov, lower=True, check_finite=False)kalman_gain = scipy.linalg.cho_solve((chol_factor, lower), np.dot(covariance, self._update_mat.T).T, check_finite=False).Tinnovation = measurement - projected_meannew_mean = mean + np.dot(innovation, kalman_gain.T)new_covariance = covariance - np.linalg.multi_dot((kalman_gain, projected_cov, kalman_gain.T))return new_mean, new_covariancedef gating_distance(self,mean: np.ndarray,covariance: np.ndarray,measurements: np.ndarray,only_position: bool = False,metric: str = "maha",) -> np.ndarray:"""Compute gating distance between state distribution and measurements.A suitable distance threshold can be obtained from `chi2inv95`. If `only_position` is False, the chi-squaredistribution has 4 degrees of freedom, otherwise 2.Args:mean (ndarray): Mean vector over the state distribution (8 dimensional).covariance (ndarray): Covariance of the state distribution (8x8 dimensional).measurements (ndarray): An (N, 4) matrix of N measurements, each in format (x, y, a, h) where (x, y) is thebounding box center position, a the aspect ratio, and h the height.only_position (bool): If True, distance computation is done with respect to box center position only.metric (str): The metric to use for calculating the distance. Options are 'gaussian' for the squaredEuclidean distance and 'maha' for the squared Mahalanobis distance.Returns:(np.ndarray): Returns an array of length N, where the i-th element contains the squared distance between(mean, covariance) and `measurements[i]`.Examples:Compute gating distance using Mahalanobis metric:>>> kf = KalmanFilterXYAH()>>> mean = np.array([0, 0, 1, 1, 0, 0, 0, 0])>>> covariance = np.eye(8)>>> measurements = np.array([[1, 1, 1, 1], [2, 2, 1, 1]])>>> distances = kf.gating_distance(mean, covariance, measurements, only_position=False, metric="maha")"""mean, covariance = self.project(mean, covariance)if only_position:mean, covariance = mean[:2], covariance[:2, :2]measurements = measurements[:, :2]d = measurements - meanif metric == "gaussian":return np.sum(d * d, axis=1)elif metric == "maha":cholesky_factor = np.linalg.cholesky(covariance)z = scipy.linalg.solve_triangular(cholesky_factor, d.T, lower=True, check_finite=False, overwrite_b=True)return np.sum(z * z, axis=0)  # square mahaelse:raise ValueError("Invalid distance metric")