MétaCan
Menu
Back to cohort
Record W2006910765 · doi:10.1109/tsp.2014.2360142

Syntactic Models for Trajectory Constrained Track-Before-Detect

2014· article· en· W2006910765 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueIEEE Transactions on Signal Processing · 2014
Typearticle
Languageen
FieldComputer Science
TopicTarget Tracking and Data Fusion in Sensor Networks
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsComputer scienceTrajectoryTrack-before-detectArtificial intelligenceMarkov chainSynchronous context-free grammarContext (archaeology)Hidden Markov modelStochastic context-free grammarMarkov modelMarkov processGeneralizationRange (aeronautics)AlgorithmRule-based machine translationParticle filterContext-free grammarMachine learningKalman filterMathematics

Abstract

fetched live from OpenAlex

In this paper, a track before detect approach utilizing trajectory shape constraints is proposed to track dimly lit targets. The shape of the target trajectory is modeled syntactically using stochastic context-free grammar models (SCFG) that arise in natural language processing. The directional vector of the target acceleration modes are used as geometric primitives called tracklets. The tracklets are syntactic sub-units of complex spatial trajectory shapes. Stochastic context-free grammars are a generalization of Markov chains (regular grammars) and can model such complex spatial patterns with long range dependencies. Knowledge about the evolution of the trajectory is used in enhancing the track before detect algorithm. A novel multiple model SCFG particle filter is proposed and numerical results are presented to show significant improvement over conventional jump Markov models in track before detect.

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.

Full frame distilled prediction

Teacher imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.914
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0010.000
Scholarly communication0.0000.001
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.023
GPT teacher head0.249
Teacher spread0.226 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it