Improved Tumor Detection via Quantitative Microwave Breast Imaging Using Eigenfunction-Based Prior
Bibliographic record
Abstract
A multistage algorithm for quantitative microwave breast imaging is presented which utilizes the eigenfunction-based reconstruction of the complex-valued permittivity as prior information. The eigenfunction-based reconstruction is obtained from a single-frequency non-iterative microwave inversion technique that uses the eigenfunctions of the Helmholtz operator, in a resonant conductive enclosure, as the expansion basis. The low-resolution eigenfunction-based reconstruction is incorporated into the Contrast Source Inversion technique as an inhomogeneous numerical background. The use of this prior information improves the stability of the inversion algorithm, and results in better detectability of tumors. The multistage algorithm's performance is demonstrated by applying it to synthetic data obtained from three 2D MRI-derived anthropomorphic breast models with various densities, and shapes. The algorithm's efficacy in tumor detection is assessed by investigating detection results using prior information obtained with the number of eigenfunction in the expansion basis truncated with three different values. Numerical experiments are performed using four different frequencies. The main advantage of obtaining prior information using this method, as opposed e.g. in using radar or ultrasound derived prior, is that it utilizes the same microwave set-up, and only microwave interrogating fields.
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.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 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".