Plot clustering method based on fuzzy-C means
An averaging and clustering technology, which can be used in the reflection/re-radiation of radio waves, the use of re-radiation, measurement devices, etc., and can solve problems such as poor tracking effect.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0083] When the targets are relatively dense, the measured values of multiple targets will be relatively close to each other, and may be divided into one cluster during clustering, which will cause large errors in estimating the number of targets and estimating the target parameters. Coupled with the false alarm measurements generated by nearby electromagnetic interference, it is difficult to meet the requirements. Such as figure 1 As shown, the fuzzy C-means-based clustering method provided by the embodiment of the present invention specifically includes the following steps:
[0084] (1) Measurement value grouping
[0085] Some elliptic gates are defined in the detection area according to the predicted value of the target, and each target corresponds to an elliptic wave gate. The measured value in the elliptic wave gate indicates that the measured value may be generated by the target at that moment. Suppose there are N k tracks exist in the kth frame, resulting in possib...
Embodiment 2
[0120] The method for clustering based on fuzzy C-mean point traces provided by the embodiments of the present invention is the same as in embodiment 1, and the specific steps of the estimated number of targets in the group described in step (3) are as follows:
[0121] Assume that the possible value of the target number c in a group is c 1 , c 2 ,...,c m and c 1 ≤c 2 ≤...≤c m . The number of predicted positions of objects in these elliptic gates is c 0 . The target measurement rates are γ 1 , gamma 2 ,...,γ c0 , the number of measurements produced by the target can be viewed as a Poisson distribution. Therefore, the number of targets is equal to c i The probability estimate for is:
[0122]
[0123] If P(c i ) is not greater than the constant threshold, discard c i . For the efficiency of the algorithm, the selection partition with a small probability will be discarded. Then, calculate the remaining selection partitions step by step.
Embodiment 3
[0125] The fuzzy C-mean point trace clustering method provided by the embodiment of the present invention is the same as embodiment 1-2, and the specific steps of selecting the initial center described in step (4) are as follows:
[0126] Assume that after clutter removal, there are m measured values p k 1 ,p k 2 ,...,p k m exists in the group. c 0 The predicted position of each target is p′ k 1 , p′ k 2 ,...,p′ k c0 , gamma min , γ max is the target measurement rate γ 1 , gamma 2 ,...,γ c0 minimum and maximum values. When the predicted location agrees well with the measured values, the predicted location is used as the initial center. The kernel density estimate for the predicted location is:
[0127]
[0128] Density threshold τ for the i-th target i 'for:
[0129]
[0130] σ' is a normalization constant.
[0131] when greater than τ i ’, the predicted position agrees with the measured value. if c 0 equal to c i , then c 0 The predicted p...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com