Modular learning strategy for signal detection in a nonstationary environment
Bibliographic record
Abstract
We describe a novel modular learning strategy for the detection of a target signal of interest in a nonstationary environment, which is motivated by the information preservation rule. The strategy makes no assumptions on the environment. It incorporates three functional blocks: (1) time-frequency analysis, (2) feature extraction, (3) pattern classification, the delineations of which are guided by the information preservation rule. The time-frequency analysis, implemented using the Wigner-Ville distribution, transforms the incoming received signal into a time-frequency image that accounts for the time-varying nature of the received signal's spectral content. This image provides a common input to a pair of channels, one of which is adaptively matched to the interference acting alone, and the other is adaptively matched to the target signal plus interference. Each channel of the receiver consists of a principal components analyser (for feature extraction) followed by a multilayer perceptron (for feature classification), which are implemented using self-organized and supervised forms of learning in feedforward neural networks, respectively. Experimental results, based on real-life radar data, are preserved to demonstrate the superior performance of the new detection strategy over a conventional detector using constant false-alarm rate (CFAR) processing. The data used in the experiment pertain to an ocean environment, representing radar returns from small ice targets buried in sea clutter; they were collected with an instrument-quality coherent radar and properly ground-truthed.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.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.
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".