<title>Improved observable operator model for joint target tracking and classification</title>
Bibliographic record
Abstract
The Observable Operator Model (OOM) approach have been proposed as a better alternative to the Hidden Markov Model (HMM). However the basic modeling of OOMs assume that the data is generated by some discrete state variable which can take on one of several values which is unreasonable for most classification problems. Main limitation of existing OOM classification is that they require substantial training data, assumed to be similar to the data on which the algorithm is tested. In many applications the target is observed from multiple target-sensor orientations (or aspects), and the underlying feature information is highly aspect dependant and continuous variable. The multi-aspect target classification method presented based on continuous-valued Observable Operator Model (OOM), from which a full posterior distribution of a target class is inferred. It is possible to extend a discrete OOM as a continuous-valued OOM using a membership function. Further, predefined set of classes were used in training based joint target tracking and classification methods. These methods perform poorly, when new target present in the surveillance region which is not in the available class-set. In order to overcome this shortage, we propose an online training algorithm for OOM, which identifies new incoming target classes and add them into the available class-set. As the number of target class increases with the online learning procedure, there is a need for an adaptive class-set selection in order to reduce computational cost. An adaptive class-set approach for joint target tracking and classification is formulated via hypotheses testing, which reduces computation cost compared to calculating OOM likelihood for each target class. Simulation results are given to demonstrates the merits of continuous-valued Observable Operator Method (OOM) for target classification over discrete OOM, advantages of online training OOM and the efficiency of class-set adaptation algorithm.
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.001 | 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".