Object tracking algorithm based on combination between sparse expression and prior probability
A priori probability, sparse representation technology, applied in the field of computer vision, can solve problems such as target tracking that cannot be completely solved
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0077] 1. Target tracking algorithm based on L1 regularization
[0078] The target tracking method based on L1 regularization was first developed by Mei et al. [7] Proposed, the following is a brief introduction based on particle filtering, and then gives the framework of the L1 tracking algorithm.
[0079] 1.1 Particle Filter Framework
[0080] Particle filter essentially implements Bayesian filtering through non-parametric Monte Carlo simulation, that is, using a set of random samples with weights to approximate the posterior probability density of the state of the system. Given the set of observations z up to time t-1 1:t-1 ={z 1 ,z 2 ,...,z t-1}, the best state of the target at time t can be obtained by the maximum approximate posterior probability z t *=argminp(x t i |z 1:t ). where x t i Indicates the system state of the i-th sampled particle at time t, the posterior probability p(x t i |z 1:t ) can be obtained recursively by Bayesian theory,
[0081] p(x...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


