An Applied Frequency Scaling Algorithm Based on Local Stretch Factor for Near-Field Miniature Millimeter-Wave Radar Imaging
Bibliographic record
Abstract
The frequency scaling algorithm (FSA) is a popular imaging algorithm for dechirped SAR data. To obtain a large azimuth detection area, the miniature millimeter-wave (mmW) linear-frequency-modulated continuous-wave (LFMCW) surveillance radar requires a wider azimuth beamwidth, which leads to additional range frequency aliasing in FSA. Because of the adoption of the dechirp-on-receive technique, the sampling frequency is much smaller than the range bandwidth during near-field imaging, which further aggravates the aliasing effects. The target cannot be well focused, and it makes the weak targets submerged in the background. To acquire high-quality SAR images, an improved FSA using the local stretch operation is proposed. The aliasing bandwidth properties introduced by the FS operation and the desired objective range cell migration (RCM) factor are used in this proposed local-stretch FSA (LSFSA). The initial RCM factor is adjusted by the stretch operation to eliminate the frequency aliasing to a certain level without increasing the computing load. The LSFSA is suitable for solving the problem of range frequency aliasing in near-field side-looking SAR and high squint SAR with wide azimuth beamwidth. The proposed method is validated using reasonable simulations and convincing experiments.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".