MétaCan
Menu
Back to cohort
Record W2134223162 · doi:10.1049/ip-rsn:20020553

Minimal sample support space–time adaptive processing with fast subspace techniques

2002· article· en· W2134223162 on OpenAlex
Christoph H. Gierull, Bhashyam Balaji

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

VenueIEE Proceedings - Radar Sonar and Navigation · 2002
Typearticle
Languageen
FieldComputer Science
TopicDirection-of-Arrival Estimation Techniques
Canadian institutionsDefence Research and Development Canada
Fundersnot available
KeywordsSubspace topologyClutterProjection (relational algebra)Dimension (graph theory)EstimatorComputer scienceSpace-time adaptive processingAlgorithmRank (graph theory)Eigenvalues and eigenvectorsLinear subspaceMathematical optimizationMathematicsRadarArtificial intelligenceStatistics

Abstract

fetched live from OpenAlex

The authors investigate finite data support for subspace or projection methods for STAP which are robust against strong clutter returns. A theoretical analysis of the eigenvector projection technique is presented that provides insight into the problem of determining the optimum choice of the projected clutter subspace and matched filter adjustments (with respect to target Doppler frequency). An estimator of the optimum subspace dimension, which is significantly smaller than clutter rank, as a function of the number of samples is presented. This result, combined with recently proposed near-optimal eigenvector-free projection techniques with minimal sample support, reduce the computational burden so drastically that even fully adaptive optimum STAP with large degrees of freedom may become practical for real-time applications.

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: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.883
Threshold uncertainty score0.810

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.002
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.013
GPT teacher head0.226
Teacher spread0.213 · 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