Detection and Tracking of Moving Object-Using Kalman Filter Enhancement (KF) by Grasshopper Optimization Algorithm
Bibliographic record
Abstract
Today, the process of tracking moving objects in Video sequence has many real applications such as robots' systems, surveillance systems, and monitoring systems, visual information processing, and so more. The first stage in tracking moving object systems is detection the target in Video sequence and images and the second stage is to track the identified object. In this regard, Automatic detection and tracking of object is an attractive scope in now researches, so the proposed method based on the detection-tracking target moving objects by using the Kalman Improved Filter (KF) method. The Kalman filter, assuming initial state and noise covariance parameter for detection the object, which are critical parameters for estimating speed. For successful tracking by Kalman filter, the noise covariance matrix must be optimized. Therefore, in many studies, different methods based on optimization and metaheuristic algorithms have been proposed to increase the performance of Kalman filter method. In this research to adjust, the noise covariance is of the Kalman filter for object tracking and improve the initial parameters of it, using grasshopper optimization algorithm (GOA). Here considered not only the properties of the object, but also the estimation of the motion of the object to speed up the search process. To compare the new method's efficiency and accuracy, we used MATLAB R2019b software. The results show that the proposed method has improved at least 10% in accuracy compared to RMOT and CMOT and 20% in recovery compared to Recall. In addition, the proposed method has at least a 2% improvement in Recall parameters and accuracy compared to the evaluated article.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".