Preliminary design of a SAR-GMTI processing system for RADARSAT-2 MODEX data
Bibliographic record
Abstract
The RADARSAT-2 satellite includes an experimental mode, called the moving object detection experiment (MODEX), which is to be used to perform ground moving target indication (GMTI) using a C-band synthetic aperture radar (SAR). During MODEX operation, the SAR antenna is partitioned into two subapertures along the satellite track to sequentially observe the same scene from the same spatial point. By appropriate processing of the returned signals from each channel, detection of temporal changes in the scene (i.e. moving targets) can be accomplished. The MODEX configuration will be used by the Canadian Department of National Defense RADARSAT-2 GMTI demonstration project, which aims to develop a SAR-GMTI processing system to investigate the military and commercial utility of space-based moving target measurements. This paper discusses a conceptual SAR-GMTI processor design in terms of selected algorithms and their performance, such as along track interferometry (ATI), displaced phase center antenna (DPCA) and iterative moving target (terrain) matched filtering (MTMF). Processing issues arising in space based radar (SBR) GMTI are also discussed. It is anticipated that the ultimate processor design will incorporate these algorithms as independent processing configurations, along with selection rules that will optimize their use to the contents of the image scene.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.004 | 0.002 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".