Object tracking with adaptive motion modeling of particle filter and support vector machines
Bibliographic record
Abstract
In this paper, we propose an approach for tracking arbitrary objects based on dynamic motion model and support vector machines (SVMs). When the motion of target is large or abrupt, modeling target motion is crucial for robust object tracking, however, recent advanced trackers ignore this component. In our proposed approach, we represent target motion as a random stochastic process. We use Kernelized Harmonic Means to predict the next state of target motion using few prior state vectors, and then utilize Particle filter to further optimize the predicted state. Because SVMs possess good generalization ability, while being robust against noise, we adopt online ker-nelized SVMs to the tracking problem. Our approach learns the appearance of the target during tracking, and thus the proposed method is able to adapt online to target appearance changes and its surrounding background. In addition, we incorporate our motion model within the online kernelized SVMs framework as an energy map to assign higher energy for the support vectors that are closer to the location predicted by the proposed motion model. This allows reliably maintaining smooth trajectories without unnatural jittering artifacts, which is important for long-term object tracking in the presence of occlusion and noise. Taking the dynamic model into account also improves the computational efficiency as it reduces the dense search space required for localizing the target candidate. Experimentally, we demonstrate that the proposed method outperforms state-of-the-art trackers on particularly challenging standard datasets.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".