CN112328959A - Multi-target tracking method based on adaptive extended Kalman probability hypothesis density filter - Google Patents
Multi-target tracking method based on adaptive extended Kalman probability hypothesis density filter Download PDFInfo
- Publication number
- CN112328959A CN112328959A CN202011097165.7A CN202011097165A CN112328959A CN 112328959 A CN112328959 A CN 112328959A CN 202011097165 A CN202011097165 A CN 202011097165A CN 112328959 A CN112328959 A CN 112328959A
- Authority
- CN
- China
- Prior art keywords
- target
- intensity function
- new
- updated
- function
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 21
- 230000003044 adaptive effect Effects 0.000 title claims abstract description 15
- 238000005259 measurement Methods 0.000 claims abstract description 47
- 230000004083 survival effect Effects 0.000 claims description 32
- 238000013138 pruning Methods 0.000 claims description 13
- 238000000605 extraction Methods 0.000 claims description 10
- 238000001514 detection method Methods 0.000 claims description 4
- 238000004422 calculation algorithm Methods 0.000 abstract description 49
- 238000007635 classification algorithm Methods 0.000 abstract 1
- 238000010586 diagram Methods 0.000 description 4
- 238000005070 sampling Methods 0.000 description 4
- 230000008859 change Effects 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 238000012804 iterative process Methods 0.000 description 2
- 239000000203 mixture Substances 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 1
- 230000008034 disappearance Effects 0.000 description 1
- 239000011159 matrix material Substances 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/15—Correlation function computation including computation of convolution operations
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01S—RADIO DIRECTION-FINDING; RADIO NAVIGATION; DETERMINING DISTANCE OR VELOCITY BY USE OF RADIO WAVES; LOCATING OR PRESENCE-DETECTING BY USE OF THE REFLECTION OR RERADIATION OF RADIO WAVES; ANALOGOUS ARRANGEMENTS USING OTHER WAVES
- G01S13/00—Systems using the reflection or reradiation of radio waves, e.g. radar systems; Analogous systems using reflection or reradiation of waves whose nature or wavelength is irrelevant or unspecified
- G01S13/66—Radar-tracking systems; Analogous systems
- G01S13/72—Radar-tracking systems; Analogous systems for two-dimensional tracking, e.g. combination of angle and range tracking, track-while-scan radar
- G01S13/723—Radar-tracking systems; Analogous systems for two-dimensional tracking, e.g. combination of angle and range tracking, track-while-scan radar by using numerical data
- G01S13/726—Multiple target tracking
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01S—RADIO DIRECTION-FINDING; RADIO NAVIGATION; DETERMINING DISTANCE OR VELOCITY BY USE OF RADIO WAVES; LOCATING OR PRESENCE-DETECTING BY USE OF THE REFLECTION OR RERADIATION OF RADIO WAVES; ANALOGOUS ARRANGEMENTS USING OTHER WAVES
- G01S13/00—Systems using the reflection or reradiation of radio waves, e.g. radar systems; Analogous systems using reflection or reradiation of waves whose nature or wavelength is irrelevant or unspecified
- G01S13/88—Radar or analogous systems specially adapted for specific applications
-
- G—PHYSICS
- G05—CONTROLLING; REGULATING
- G05D—SYSTEMS FOR CONTROLLING OR REGULATING NON-ELECTRIC VARIABLES
- G05D1/00—Control of position, course, altitude or attitude of land, water, air or space vehicles, e.g. using automatic pilots
- G05D1/12—Target-seeking control
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Optimization (AREA)
- Theoretical Computer Science (AREA)
- Computational Mathematics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Mathematical Analysis (AREA)
- Mathematical Physics (AREA)
- Pure & Applied Mathematics (AREA)
- Data Mining & Analysis (AREA)
- Algebra (AREA)
- Electromagnetism (AREA)
- Databases & Information Systems (AREA)
- Software Systems (AREA)
- General Engineering & Computer Science (AREA)
- Computing Systems (AREA)
- Aviation & Aerospace Engineering (AREA)
- Automation & Control Theory (AREA)
- Radar Systems Or Details Thereof (AREA)
Abstract
The invention discloses a multi-target tracking method based on an adaptive extended Kalman probability hypothesis density filter, and belongs to the technical field of multi-target tracking. Firstly, initializing the intensity of a new target by using a two-point difference algorithm, and then eliminating the wrong intensity of the new target by using a target maximum speed constraint algorithm. In addition, in order to eliminate the interference of the clutter measurement values, the live target measurement values and the new target measurement values are respectively extracted from the measurement value set by using an improved measurement value classification algorithm, and then the live target and the new target are respectively updated by using the live target measurement values and the new target measurement values, so that the accuracy of the algorithm is improved. The invention solves the problem that the EK-PHD filter cannot track the target under the condition that the strength of the newborn target is unknown.
Description
Technical Field
The invention relates to a multi-target tracking method based on an adaptive extended Kalman probability hypothesis density filter, and belongs to the technical field of multi-target tracking.
Background
With the development of modern information science and technology, the multi-target tracking technology has wide application and plays an important role in the fields of vision, radar and sonar tracking, vehicle tracking and the like. In a multi-target tracking scene, not only the state of targets can change along with the change of time, but also the number of the targets can change along with the appearance and disappearance of the targets, so that the multi-target tracking problem is always a hotspot and difficult problem for the research of experts and scholars at home and abroad. The traditional method for solving the multi-target Tracking problem is a Data Association technology, which includes a Multiple Hypothesis Tracking (MHT) algorithm and a Joint Probability Data Association (JPDA) algorithm. However, these algorithms not only face the uncertainty problem of data association, but the amount of computation also increases as the number of targets and measurements increases.
In order to solve the problem of computational complexity of the traditional multi-target tracking algorithm, Mahler proposes a Probability Hypothesis Density (PHD) filter based on a Random Finite Set (RFS) theory. The PHD filter transmits first-order statistical moments of the target state instead of posterior probability density of multiple targets, so that the combination problem caused by data association is avoided while the space computation complexity of a single target state is reduced. The iterative process of the PHD filter can be implemented by means of Gaussian Mixture, i.e. Gaussian Mixture probability hypothesis density filter (GM-PHD). Since the state model and the measurement model of the GM-PHD hypothesis target are both linear gaussian models, when the state model or the measurement model is nonlinear, the nonlinear state model or the measurement model may be approximated by an Extended Kalman Filter (EKF) to obtain an Extended Kalman probabilistic hypothesis density Filter (EK-PHD), and thus the EK-PHD Filter may be regarded as an extension of the GM-PHD Filter. Although the EK-PHD filter can avoid the problem of computational complexity caused by data association, the new target strength is usually used as a priori known information to participate in the iterative process of the EK-PHD filter, but in an actual tracking environment, the new target strength is usually unknown, which brings a certain limit to the application of the EK-PHD filter in actual engineering. Aiming at the problem that an EK-PHD filter cannot track a target under the condition that the intensity of a newborn target is unknown, an improved extended Kalman probability hypothesis density filter for adaptively estimating the intensity of the newborn target is provided.
Disclosure of Invention
The invention aims to provide a multi-target tracking method based on an adaptive extended Kalman probability hypothesis density filter, which aims to solve the problem that an EK-PHD filter cannot track a target under the condition that the strength of a newborn target is unknown.
A multi-target tracking method based on an adaptive extended Kalman probability hypothesis density filter comprises the following steps:
step one, initializing a newborn intensity function v0(x);
Step two, according to the new strength function v0(x) Predicted survival target intensity function vs,k|k-1(x) And a new target intensity function vγ,k|k-1(x);
Step three, dividing the measurement value set, and extracting a survival target measurement value and a new target measurement value from the measurement value set;
step four, updating the intensity function predicted in the step two by respectively utilizing the survival target measured value and the new target measured value to obtain an updated survival target intensity function vs,k(x) And a new target intensity function vγ,k(x) The final updated target intensity function is vk|k(x);
Step five, utilizing a pruning threshold TthAnd combining the updated intensity function v of the threshold U versus the step fourk|k(x) Pruning and merging to obtainTo the target intensity function vk(x);
Step six, setting a target state extraction threshold value wthAnd from the target intensity function v of step fivek(x) The weight value of the middle extraction is more than wthAs a final tracking result.
Further, in step one, specifically, the intensity function v is initialized0(x) Expressed as:
whereinRepresents a mean value ofCovariance ofA gaussian density function of, andweight of object, J0To initialize the target number.
Further, in the second step, specifically,
intensity function v for predicting survival targetss,k|k-1(x) The expression is as follows:
whereinRepresents a mean value ofCovariance ofA gaussian density function of, andas a predicted survival target weight, JS,k|k-1In order to predict the number of surviving objects,
predicting an intensity function v of a nascent objectγ,k|k-1(x) The expression is as follows:
whereinRepresents a mean value ofCovariance ofA gaussian density function of, andto predict the new target weight, Jγ,k|k-1Is the predicted number of new targets.
Further, in step three, specifically, for the measured value set ZkIs divided from the measured value set ZkExtracting a survival target measurement value set Zs,kAnd a new set of target measurements Zγ,k。
Further, in step four, specifically, the survival target measurement value set Z extracted in step three is useds,kFor predicted survival target intensity function vs,k|k-1(x) Updating, the updated surviving objective intensity function vs,k(x) Expressed as:
wherein p isD,kThe probability of detection is indicated and,represents the updated survival target weight value of the current system,represents the updated mean value of the surviving objects,represents the updated survival target covariance,
using the new target measurement value set Z extracted in step threeγ,kFor predicted new target intensity function vγ,k|k-1(x) Updating, the updated new target intensity function vγ,k(x) Can be expressed as:
wherein,representing the new updated target weight value of the new object,represents the updated new-born target mean value,representing the updated new target covariance,
finally, the updated target intensity function vk|k(x) Expressed as:
vk|k(x)=vs,k(x)+vγ,k(x) (6)。
further, in step five, specifically, a pruning threshold T is utilizedthAnd combining the threshold value U with the target intensity function v updated in the fourth stepk|k(x) Pruning and merging are carried out to obtain a target intensity function of
WhereinThe weight value of the object is represented,the mean value is represented by the average value,the covariance is indicated.
Further, in step six, specifically, a target state extraction threshold w is setthAnd extracting the target intensity function v in the step fivek(x):
Wherein Xk(x) A set of functions representing the intensity of the object,representing the target state vector, JkRepresenting the target number.
The main advantages of the invention are:
(1) the method can adaptively estimate the intensity of the new target, and overcome the problem that the traditional EK-PHD filter cannot track the target in the actual tracking environment.
(2) By dividing the measurement value set, the clutter measurement value can be prevented from participating in the updating process, and the accuracy of the algorithm can be improved while the calculation amount is reduced.
Drawings
FIG. 1 is a flow chart of a multi-target tracking method based on an adaptive extended Kalman probability hypothesis density filter according to the present invention;
FIG. 2 is a diagram of the true motion trajectory of an object;
FIG. 3 is a graph of azimuth and range measurements;
FIG. 4 is a diagram of the tracking result of One-Step Initialization Extended Kalman Probability Hypothesis Density filter (OSI-EKPHD);
FIG. 5 is a diagram of the tracking result of a Two-Step Initialization Extended Kalman Probability Hypothesis Density filter (TSI-EKPHD);
FIG. 6 is a graph of the Improved Extended Kalman probabilistic Hypothesis Density filter (IABI-EKPHD) tracking results for adaptively estimating the Intensity of a newborn target;
FIG. 7 is a graph of the Optimal Sub-pattern assignment (OSPA) distance error for different algorithms;
FIG. 8 is a Number of Target Estimation (NTE) error plot for different algorithms;
FIG. 9 is a graph of OSPA average distance error for different algorithms for different numbers of clutters;
FIG. 10 is a graph of the average estimation error of the number of targets in different algorithms for different numbers of clutters.
Detailed Description
The technical solutions in the embodiments of the present invention will be described clearly and completely with reference to the accompanying drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Referring to fig. 1, a multi-target tracking method based on an adaptive extended kalman probabilistic hypothesis density filter includes the following steps:
step one, initializing a newborn intensity function v0(x);
Step two, according to the new strength function v0(x) Predicted survival target intensity function vs,k|k-1(x) And a new target intensity function vγ,k|k-1(x);
Step three, dividing the measurement value set, and extracting a survival target measurement value and a new target measurement value from the measurement value set;
step four, updating the intensity function predicted in the step two by respectively utilizing the survival target measured value and the new target measured value to obtain an updated survival target intensity function vs,k(x) And a new target intensity function vγ,k(x) The final updated target intensity function is vk|k(x);
Step five, utilizing a pruning threshold TthAnd combining the updated intensity function v of the threshold U versus the step fourk|k(x) Pruning and merging are carried out to obtain a target intensity function vk(x);
Step six, setting a target state extraction threshold value wthAnd from the target intensity function v of step fivek(x) The weight value of the middle extraction is more than wthAs a final tracking result.
In step one, specifically, the intensity function v is initialized0(x) Expressed as:
whereinRepresents a mean value ofCovariance ofA gaussian density function of, andweight of object, J0To initialize the target number.
In step two, specifically, predictionIntensity function v of surviving objectss,k|k-1(x) The expression is as follows:
whereinRepresents a mean value ofCovariance ofA gaussian density function of, andas a predicted survival target weight, Js,k|k-1In order to predict the number of surviving objects,
predicting an intensity function v of a nascent objectγ,k|k-1(x) The expression is as follows:
whereinRepresents a mean value ofCovariance ofA gaussian density function of, andto predict the new target weight, Jγ,k|k-1Is the predicted number of new targets.
In step three, specifically, the measurementSet of magnitudes ZkIs divided from the measured value set ZkExtracting a survival target measurement value set Zs,kAnd a new set of target measurements Zγ,k。
In step four, the survival target measurement value set Z extracted in step three is useds,kFor predicted survival target intensity function vs,k|k-1(x) Updating, the updated surviving objective intensity function vs,k(x) Expressed as:
wherein p isD,kThe probability of detection is indicated and,represents the updated survival target weight value of the current system,represents the updated mean value of the surviving objects,represents the updated survival target covariance,
using the new target measurement value set Z extracted in step threeγ,kFor predicted new target intensity function vγ,k|k-1(x) Updating, the updated new target intensity function vγ,k(x) Can be expressed as:
wherein,representing the new updated target weight value of the new object,represents the updated new-born target mean value,representing the updated new target covariance,
finally, the updated target intensity function vk|k(x) Expressed as:
vk|k(x)=vs,k(x)+vγ,k(x) (6)。
in the fifth step, specifically, a pruning threshold T is utilizedthAnd combining the threshold value U with the target intensity function v updated in the fourth stepk|k(x) Pruning and merging are carried out to obtain a target intensity function of
WhereinThe weight value of the object is represented,the mean value is represented by the average value,the covariance is indicated.
In step six, specifically, a target state extraction threshold value w is setthAnd extracting the target intensity function v in the step fivek(x):
Wherein Xk(x) A set of functions representing the intensity of the object,representing the target state vector, JkRepresenting the target number.
The above detailed description of the improved extended kalman probabilistic hypothesis density filter for adaptively estimating the new target strength of the present invention is provided, and the principle and the implementation of the present invention are explained in detail herein by applying specific examples, and the description of the above examples is only used to help understanding the method of the present invention and the core idea thereof; meanwhile, for a person skilled in the art, according to the idea of the present invention, there may be variations in the specific embodiments and the application scope, and in summary, the content of the present specification should not be construed as a limitation to the present invention.
The following is a simulation result of the extended kalman probabilistic hypothesis density filter for adaptively estimating the new target strength of the present invention:
the target being in a two-dimensional region [ -2000,2000](m)×[0,2000](m) moving in the space, fixing the sensor at the origin of coordinates, and taking the observed quantity as the azimuth angle and the distance between the sensor and the target. At a sampling time k, the state vector of the target isWherein (p)x,k,py,k) The position of the object is indicated and,representing the velocity, w, of the targetkIndicating the turning rate of the target. The dynamic model and the measured value model of the object motion are respectively
Wherein wkIs process noise, vkTo measure noise. Probability of detection pD,k0.98, pruning threshold Tth0.00001, merging threshold U is 4, target state extraction threshold wth0.5. As shown in fig. 2 and 3, the measured values at each sampling time include the measured values from the targetAlso contains a measurement from clutter and the intensity function of the clutter isWhere u (z) is the uniform density of the target active area, V2000 pi (radm) is the area of the target active area, and λc=6.37×10-3(radm)-1Represents the average clutter return per unit volume, so there are 40 measurements from clutter interference at each sample time within the range of motion of the target.
The initialized target intensities are respectivelyThe weight isThe covariance matrix isFig. 4-6 show the tracking results of the OSI-EKPHD algorithm, the TSI-EKPHD algorithm, and the IABI-EKPHD algorithm, respectively. It can be seen from the tracking result diagram that the number of error tracks in the tracking results of the OSI-EKPHD algorithm and the TSI-EKPHD algorithm is relatively large, and the number of error tracks in the tracking results of the IABI-EKPHD algorithm is relatively small, mainly because the IABI-EKPHD algorithm can accurately estimate the intensity of a new target, and an accurate new target measurement value set and a survival target measurement value set can be obtained when the measurement value sets are divided, thereby eliminating the interference of clutter measurement values and improving the tracking accuracy.
FIG. 7 shows an OSPA distance error map of the OSI-EKPHD algorithm, the TSI-EKPHD algorithm, and the IABI-EKPHD algorithm. As can be seen from fig. 7, the OSPA distance error of the TSI-EKPHD algorithm is smaller than that of the OSI-EKPHD algorithm at most sampling moments, which is mainly because the TSI-EKPHD algorithm can estimate the intensity of a new target relatively accurately, and avoid tracking a track erroneously. The IABI-EKPHD algorithm can not only accurately estimate the intensity of the newborn target, but also avoid the interference of clutter measurement values, so the OSPA distance error of the IABI-GMPHD algorithm is smaller than that of the OSI-EKPHD algorithm and the TSI-EKPHD algorithm in the whole experimental process.
FIG. 8 is a graph showing target number estimation errors of OSI-EKPHD algorithm, TSI-EKPHD algorithm, and IABI-EKPHD algorithm. As can be seen from FIG. 8, the target number estimation error of the TSI-EKPHD algorithm is smaller than that of the OSI-EKPHD algorithm at most sampling moments, so the precision of the TSI-EKPHD algorithm is higher than that of the OSI-EKPHD algorithm. Except the moment when the new target appears, the target number estimation error of the IABI-EKPHD algorithm is smaller than that of the other two algorithms, so the performance of the IABI-EKPHD algorithm is better than that of the OSI-GMPHD algorithm and the TSI-EKPHD algorithm.
FIG. 9 is a graph showing OSPA average distance error of different algorithms for different numbers of clutters. It can be seen from fig. 9 that the OSPA average distance errors of the three algorithms increase with the increase of the number of the clutter, but the OSPA average error of the IABI-EKPHD algorithm is the smallest under the condition that the number of the clutter is the same, so the robustness and the stability of the IABI-EKPHD algorithm are relatively good.
Fig. 10 is a graph showing the average estimation error of the target numbers of different algorithms for different clutter numbers. It can be seen from fig. 10 that as the number of clutter increases, the average estimation error growth speed of the number of targets estimated by the IABI-EKPHD algorithm is relatively slow compared with the other two algorithms, and therefore, the IABI-EKPHD algorithm can adapt to different clutter environments and has stronger robustness.
Claims (7)
1. A multi-target tracking method based on an adaptive extended Kalman probability hypothesis density filter is characterized by comprising the following steps:
step one, initializing a newborn intensity function v0(x);
Step two, according to the new strength function v0(x) Predicted survival target intensity function vs,k|k-1(x) And a new target intensity function vγ,k|k-1(x);
Step three, dividing the measurement value set, and extracting a survival target measurement value and a new target measurement value from the measurement value set;
step four, respectively utilizing the survival target measurement value and the newborn targetUpdating the intensity function predicted in the step two by the measured value to obtain an updated survival target intensity function vs,k(x) And a new target intensity function vγ,k(x) The final updated target intensity function is vk|k(x);
Step five, utilizing a pruning threshold TthAnd combining the updated intensity function v of the threshold U versus the step fourk|k(x) Pruning and merging are carried out to obtain a target intensity function vk(x);
Step six, setting a target state extraction threshold value wthAnd from the target intensity function v of step fivek(x) The weight value of the middle extraction is more than wthAs a final tracking result.
2. The multi-target tracking method based on the adaptive extended Kalman probability hypothesis density filter as claimed in claim 1, wherein in the first step, specifically, an intensity function v is initialized0(x) Expressed as:
3. The multi-target tracking method based on the adaptive extended Kalman probability hypothesis density filter as claimed in claim 1, wherein in step two, specifically,
intensity function v for predicting survival targetss,k|k-1(x) The expression is as follows:
whereinRepresents a mean value ofCovariance ofA gaussian density function of, andas a predicted survival target weight, Js,k|k-1In order to predict the number of surviving objects,
predicting an intensity function v of a nascent objectγ,k|k-1(x) The expression is as follows:
4. The multi-target tracking method based on the adaptive extended Kalman probability hypothesis density filter as claimed in claim 1, wherein in the third step, specifically, for the measurement value set ZkIs divided from the measured value set ZkExtracting a survival target measurement value set Zs,kAnd a new set of target measurements Zγ,k。
5. The multi-target tracking method based on the adaptive extended Kalman probability hypothesis density filter as claimed in claim 1, wherein in step four, specifically, the surviving target measurement value set Z extracted in step three is utilizeds,kFor predicted survival target intensity function vs,k|k-1(x) Updating, the updated surviving objective intensity function vs,k(x) Expressed as:
wherein p isD,kThe probability of detection is indicated and,represents the updated survival target weight value of the current system,represents the updated mean value of the surviving objects,represents the updated survival target covariance,
using the new target measurement value set Z extracted in step threeγ,kFor predicted neogenesisTarget intensity function vγ,k|k-1(x) Updating, the updated new target intensity function vγ,k(x) Can be expressed as:
wherein,representing the new updated target weight value of the new object,represents the updated new-born target mean value,representing the updated new target covariance,
finally, the updated target intensity function vk|k(x) Expressed as:
vk|k(x)=vs,k(x)+vγ,k(x) (6)。
6. the multi-target tracking method based on the adaptive extended Kalman probability hypothesis density filter as claimed in claim 1, wherein in the fifth step, specifically, a pruning threshold T is utilizedthAnd combining the threshold value U with the target intensity function v updated in the fourth stepk|k(x) Pruning and merging are carried out to obtain a target intensity function of
7. The multi-target tracking method based on the adaptive extended Kalman probability hypothesis density filter as claimed in claim 1, wherein in step six, specifically, a target state extraction threshold w is setthAnd extracting the target intensity function v in the step fivek(x):
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202011097165.7A CN112328959B (en) | 2020-10-14 | 2020-10-14 | Multi-target tracking method based on adaptive extended Kalman probability hypothesis density filter |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202011097165.7A CN112328959B (en) | 2020-10-14 | 2020-10-14 | Multi-target tracking method based on adaptive extended Kalman probability hypothesis density filter |
Publications (2)
Publication Number | Publication Date |
---|---|
CN112328959A true CN112328959A (en) | 2021-02-05 |
CN112328959B CN112328959B (en) | 2023-04-11 |
Family
ID=74314255
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202011097165.7A Active CN112328959B (en) | 2020-10-14 | 2020-10-14 | Multi-target tracking method based on adaptive extended Kalman probability hypothesis density filter |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN112328959B (en) |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN113238218A (en) * | 2021-04-22 | 2021-08-10 | 中山大学 | Near space hypersonic target tracking method based on PHD filtering |
CN113959428A (en) * | 2021-09-27 | 2022-01-21 | 桂林电子科技大学 | PHD filtering method for tracking non-rigid multi-extension target |
CN115097437A (en) * | 2022-06-06 | 2022-09-23 | 哈尔滨工程大学 | Underwater target tracking track approaching and crossing solution method based on label multi-Bernoulli pre-detection tracking algorithm |
Citations (13)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP0675374A1 (en) * | 1994-03-30 | 1995-10-04 | Office National D'etudes Et De Recherches Aerospatiales | Method for tracking moving bodies |
CN101770024A (en) * | 2010-01-25 | 2010-07-07 | 上海交通大学 | Multi-target tracking method |
CN106054167A (en) * | 2016-05-27 | 2016-10-26 | 西安电子科技大学 | Intensity filter-based multi-extended target tracking method |
CN106372646A (en) * | 2016-08-30 | 2017-02-01 | 上海交通大学 | Multi-target tracking method based on SRCK-GMCPHD filtering |
CN107831490A (en) * | 2017-12-01 | 2018-03-23 | 南京理工大学 | A kind of improved more extension method for tracking target |
US20180098330A1 (en) * | 2016-09-30 | 2018-04-05 | Drexel University | Adaptive Pursuit Learning Method To Mitigate Small-Cell Interference Through Directionality |
CN108427112A (en) * | 2018-01-22 | 2018-08-21 | 南京理工大学 | A kind of improved more extension method for tracking target |
CN109031229A (en) * | 2017-11-27 | 2018-12-18 | 电子科技大学 | A kind of probability hypothesis density method of target following under clutter environment |
CN110320512A (en) * | 2019-07-09 | 2019-10-11 | 大连海事大学 | A kind of GM-PHD smothing filtering multi-object tracking method based on tape label |
CN110780269A (en) * | 2019-10-08 | 2020-02-11 | 河海大学 | Explicit multi-target tracking method based on GM-PHD filter under self-adaptive new growth intensity |
CN110992396A (en) * | 2019-10-18 | 2020-04-10 | 河南科技大学 | K-means + + clustering algorithm-based multi-extension target tracking method |
CN111220946A (en) * | 2020-01-20 | 2020-06-02 | 南京烽火星空通信发展有限公司 | Multi-moving-target positioning error elimination method based on improved extended Kalman filtering |
CN111736145A (en) * | 2020-06-28 | 2020-10-02 | 电子科技大学 | Multi-maneuvering-target Doppler radar tracking method based on Gaussian mixed probability hypothesis density filtering |
-
2020
- 2020-10-14 CN CN202011097165.7A patent/CN112328959B/en active Active
Patent Citations (13)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP0675374A1 (en) * | 1994-03-30 | 1995-10-04 | Office National D'etudes Et De Recherches Aerospatiales | Method for tracking moving bodies |
CN101770024A (en) * | 2010-01-25 | 2010-07-07 | 上海交通大学 | Multi-target tracking method |
CN106054167A (en) * | 2016-05-27 | 2016-10-26 | 西安电子科技大学 | Intensity filter-based multi-extended target tracking method |
CN106372646A (en) * | 2016-08-30 | 2017-02-01 | 上海交通大学 | Multi-target tracking method based on SRCK-GMCPHD filtering |
US20180098330A1 (en) * | 2016-09-30 | 2018-04-05 | Drexel University | Adaptive Pursuit Learning Method To Mitigate Small-Cell Interference Through Directionality |
CN109031229A (en) * | 2017-11-27 | 2018-12-18 | 电子科技大学 | A kind of probability hypothesis density method of target following under clutter environment |
CN107831490A (en) * | 2017-12-01 | 2018-03-23 | 南京理工大学 | A kind of improved more extension method for tracking target |
CN108427112A (en) * | 2018-01-22 | 2018-08-21 | 南京理工大学 | A kind of improved more extension method for tracking target |
CN110320512A (en) * | 2019-07-09 | 2019-10-11 | 大连海事大学 | A kind of GM-PHD smothing filtering multi-object tracking method based on tape label |
CN110780269A (en) * | 2019-10-08 | 2020-02-11 | 河海大学 | Explicit multi-target tracking method based on GM-PHD filter under self-adaptive new growth intensity |
CN110992396A (en) * | 2019-10-18 | 2020-04-10 | 河南科技大学 | K-means + + clustering algorithm-based multi-extension target tracking method |
CN111220946A (en) * | 2020-01-20 | 2020-06-02 | 南京烽火星空通信发展有限公司 | Multi-moving-target positioning error elimination method based on improved extended Kalman filtering |
CN111736145A (en) * | 2020-06-28 | 2020-10-02 | 电子科技大学 | Multi-maneuvering-target Doppler radar tracking method based on Gaussian mixed probability hypothesis density filtering |
Non-Patent Citations (6)
Title |
---|
ROY ANIRBAN 等: "Multi‐target trackers using cubature Kalman filter for Doppler radar tracking in clutter" * |
ZHANG QIAN 等: "Improved bearings-only multi-target tracking with GM-PHD filtering" * |
张欢庆: "基于随机有限集的多目标跟踪及航迹维持算法研究", 《中国优秀博硕士学位论文全文数据库(博士)信息科技辑》 * |
李鹏: "基于随机有限集的多扩展目标跟踪和航迹维持算法研究", 《中国优秀博硕士学位论文全文数据库(博士)信息科技辑》 * |
生雪莉 等: "标记关联的多声呐多目标航迹融合方法" * |
董青 等: "基于EK-GMPHD的分布式聚类融合算法" * |
Cited By (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN113238218A (en) * | 2021-04-22 | 2021-08-10 | 中山大学 | Near space hypersonic target tracking method based on PHD filtering |
CN113238218B (en) * | 2021-04-22 | 2023-10-20 | 中山大学 | Near space hypersonic speed target tracking method based on PHD filtering |
CN113959428A (en) * | 2021-09-27 | 2022-01-21 | 桂林电子科技大学 | PHD filtering method for tracking non-rigid multi-extension target |
CN113959428B (en) * | 2021-09-27 | 2024-05-28 | 桂林电子科技大学 | PHD filtering method for tracking non-rigid multi-expansion target |
CN115097437A (en) * | 2022-06-06 | 2022-09-23 | 哈尔滨工程大学 | Underwater target tracking track approaching and crossing solution method based on label multi-Bernoulli pre-detection tracking algorithm |
Also Published As
Publication number | Publication date |
---|---|
CN112328959B (en) | 2023-04-11 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN112328959B (en) | Multi-target tracking method based on adaptive extended Kalman probability hypothesis density filter | |
CN107045125B (en) | Interactive multi-model radar target tracking method based on predicted value measurement conversion | |
CN106443661B (en) | Motor-driven extension method for tracking target based on Unscented kalman filtering | |
CN110503071B (en) | Multi-target tracking method based on variational Bayesian label multi-Bernoulli superposition model | |
CN109633589A (en) | The Multi-target Data Associations assumed are optimized based on multi-model more in target following | |
CN107688179A (en) | Combined chance data interconnection method based on doppler information auxiliary | |
CN106199580B (en) | A kind of Singer model refinement algorithms based on fuzzy inference system | |
CN111257865B (en) | Maneuvering target multi-frame detection tracking method based on linear pseudo-measurement model | |
CN110231620B (en) | Noise-related system tracking filtering method | |
CN107797106A (en) | A kind of PHD multiple target tracking smooth filtering methods of the unknown clutter estimations of acceleration EM | |
CN112146648A (en) | Multi-target tracking method based on multi-sensor data fusion | |
CN108519595A (en) | Joint multisensor is registrated and multi-object tracking method | |
CN111693984A (en) | Improved EKF-UKF moving target tracking method | |
CN116734860A (en) | Multi-AUV self-adaptive cooperative positioning method and system based on factor graph | |
CN115204212A (en) | Multi-target tracking method based on STM-PMBM filtering algorithm | |
CN104777465B (en) | Random extended object shape and state estimation method based on B spline function | |
CN111736144B (en) | Maneuvering turning target state estimation method only by distance observation | |
CN111722213B (en) | Pure distance extraction method for maneuvering target motion parameters | |
CN109671096B (en) | Multi-expansion target tracking method under space-time neighbor target detection and grid cluster measurement division | |
CN112666516A (en) | Passive tracking method based on track information field | |
CN116224320B (en) | Radar target tracking method for processing Doppler measurement under polar coordinate system | |
CN109375160B (en) | Angle measurement error estimation method in pure-azimuth passive positioning | |
CN114488104B (en) | Sky wave beyond-view range radar target tracking method based on interaction consistency | |
CN110426689A (en) | A kind of airborne multi-platform Multi-sensor systematic error registration Algorithm based on EM-CKS | |
CN112198504B (en) | Fusion filtering method for interleaving of active and passive observation features |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant |