Bibliographic record
Abstract
The multilook beat frequency (MLBF) algorithm is the Doppler centroid estimator most commonly used in practice to solve the Doppler ambiguity. However, it still makes errors, notably in medium- or low-contrast scenes. In this paper, we present two ways in which the estimation sensitivity of the MLBF algorithm can be improved. First, we give a more thorough frequency-domain explanation of how the MLBF algorithm works and explain how cross beating and range migration cause estimation difficulties. The first improvement to the algorithm replaces the fast Fourier transform (FFT)-based beat frequency estimator with a more accurate one that uses phase increments. It avoids the FFT limitations of resolution and quantization, especially when the signal is discontinuous in one range cell due to range cell migration or burst mode operation (ScanSAR). A second improvement uses range cell migration correction to straighten the target trajectories before the beat frequency estimator is applied. This has the effect of narrowing the bandwidth of the beat signal and reducing the effect of cross beating. Finally, experiments with RADARSAT-1 data are used to illustrate the improved estimation accuracy of the modified algorithm
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.003 | 0.045 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 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".