An Optimization-Based Approach to Radar Image Reconstruction in Breast Microwave Sensing
Bibliographic record
Abstract
Breast microwave sensing (BMS) has been studied as a potential technique for cancer detection due to the observed microwave properties of malignant and healthy breast tissues. This work presents a novel radar-based image reconstruction algorithm for use in BMS that reframes the radar image reconstruction process as an optimization problem. A gradient descent optimizer was used to create an optimization-based radar reconstruction (ORR) algorithm. Two hundred scans of MRI-derived breast phantoms were performed with a preclinical BMS system. These scans were reconstructed using the ORR, delay-and-sum (DAS), and delay-multiply-and-sum (DMAS) beamformers. The ORR was observed to improve both sensitivity and specificity compared to DAS and DMAS. The estimated sensitivity and specificity of the DAS beamformer were 19% and 44%, respectively, while for ORR, they were 27% and 56%, representing a relative increase of 42% and 27%. The DAS reconstructions also exhibited a hot-spot image artifact, where a localized region of high intensity that did not correspond to any physical phantom feature would be present in an image. This artifact appeared like a tumour response within the image and contributed to the lower specificity of the DAS beamformer. This artifact was not observed in the ORR reconstructions. This work demonstrates the potential of an optimization-based conceptualization of the radar image reconstruction problem in BMS. The ORR algorithm implemented in this work showed improved diagnostic performance and fewer image artifacts compared to the widely employed DAS 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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| 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".