MétaCan
Menu
Back to cohort
Record W2142620920 · doi:10.1109/nrc.2002.999748

Application of fast projection techniques without eigenanalysis to STAP

2003· article· en· W2142620920 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

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicRadar Systems and Signal Processing
Canadian institutionsDefence Research and Development Canada
Fundersnot available
KeywordsClutterComputer scienceDetectorSpace-time adaptive processingRadarRadar trackerFilter (signal processing)AlgorithmRadar engineering detailsComputer visionRadar imagingTelecommunications

Abstract

fetched live from OpenAlex

In ground surveillance from an airborne or space-based radar it is desirable to be able to detect small and slowly moving targets, within severe ground clutter. For operational moving target indication (MTI) systems the clutter filter coefficients have to be updated frequently due to rapidly changing interference environment. This paper examines the small sample size performance of different fast fully adaptive space-time processors (STAP) and compares it to the optimum-detector performance. These previously proposed techniques, named matrix transformation based projection (MTP) and lean matrix inversion (LMI), were originally developed to provide fast jammer suppression in phased array radars with many elements. For this application they have been proven to operate with near-optimum performance, yet with a computational expense extremely reduced from that of the optimum detector in most practical cases. The investigation herein focuses on the performance achieved when only a very few data samples are available to adapt (update) the clutter filter coefficient.

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 categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: Bench or experimental
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.951
Threshold uncertainty score0.192

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.006
GPT teacher head0.226
Teacher spread0.220 · 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

Quick stats

Citations1
Published2003
Admission routes1
Has abstractyes

Explore more

Same topicRadar Systems and Signal ProcessingFrench-language works237,207