MétaCan
Menu
Back to cohort
Record W2981753322 · doi:10.1109/taes.2019.2948451

Expanding Window Dynamic-Programming-Based Track-Before-Detect With Order Statistics in Weibull Distributed Clutter

2019· article· en· W2981753322 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 Aerospace and Electronic Systems · 2019
Typearticle
Languageen
FieldEngineering
TopicRadar Systems and Signal Processing
Canadian institutionsUniversity of Victoria
Fundersnot available
KeywordsClutterTrack-before-detectWeibull distributionComputer scienceSliding window protocolRadarRadar trackerWindow (computing)Constant false alarm rateAlgorithmDynamic programmingTrack (disk drive)Artificial intelligenceMathematicsStatistics

Abstract

fetched live from OpenAlex

This article considers radar detection and tracking of weak fluctuating targets using dynamic programming (DP)-based track-before-detect (TBD). The clutter is modeled using a Weibull distribution, and the well-known Swerling type 0, 1, and 3 targets are considered. An efficient algorithm is proposed, which employs order statistics in DP-based TBD to detect weak fluctuating targets. In addition, a novel expanding window track-before-detect (EW-TBD) technique for multiframe processing is presented to improve the detection performance with reasonable computational complexity compared to batch processing. It is shown that EW-TBD has lower complexity than existing multiframe processing techniques. Simulation results are presented, which confirm the superiority of the proposed expanding window technique in detecting targets even when they are not present in every scan in the window. In addition, the throughput of the proposed technique is higher than that with batch processing.

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.000
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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.652
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.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.003
GPT teacher head0.198
Teacher spread0.195 · 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