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 OpenAlexaff
Mustafa Fanaswala, Vikram Krishnamurthy

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

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

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.005
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.009
Threshold uncertainty score0.017

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.005
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0010.003
Open science0.0020.002
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0040.001

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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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

Quick stats

Citations14
Published2014
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on Signal ProcessingSame topicTarget Tracking and Data Fusion in Sensor NetworksFrench-language works237,207