Accurate Range Migration for Fast Quantitative Fourier-Based Image Reconstruction With Monostatic Radar
Bibliographic record
Abstract
Range migration (or range focusing) techniques are widely used in optical, acoustic, and microwave real-time image reconstruction methods. They have been successfully applied to far-field 3-D imaging where they rely on plane-wave assumptions, which ignore the data amplitude variation over the acquisition aperture. The accuracy of the plane-wave assumption, however, quickly degrades in close-range imaging, where amplitude variations are significant and where the range to the target is on the order of the range sampling step. Here, we present a range-focusing method of improved accuracy, which is applicable to both far-zone and close-range monostatic radar. It refocuses the system point-spread function (PSF) to any range location, taking into account both magnitude and phase changes. The approach can be applied with any Fourier-based imaging algorithm utilizing the Lippmann–Schwinger equation as the underlying scattering model. Here, it is validated through examples based on simulated and measured data where the images are reconstructed with quantitative microwave holography (QMH). QMH employs measured PSFs to achieve quantitative imaging in real-time. The proposed range-migration method is applicable with measured PSFs, too, leading to reduced system-calibration effort and the ability to focus an image at any desired range.
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.001 | 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.000 | 0.001 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".