Superresolution Full-polarimetric Imaging for Radio Interferometry with Sparse Modeling
Bibliographic record
Abstract
Abstract We propose a new technique for radio interferometry to obtain superresolution full-polarization images in all four Stokes parameters using sparse modeling. The proposed technique reconstructs the image in each Stokes parameter from the corresponding full-complex Stokes visibilities by utilizing two regularization functions: the ℓ 1 norm and the total variation (TV) of the brightness distribution. As an application of this technique, we present simulated linear polarization observations of two physically motivated models of M87 with the Event Horizon Telescope. We confirm that ℓ 1 +TV regularization can achieve an optimal resolution of ∼25%–30% of the diffraction limit , which is the nominal spatial resolution of a radio interferometer for both the total intensity (i.e., Stokes I ) and linear polarizations (i.e., Stokes Q and U ). This optimal resolution is better than that obtained from the widely used Cotton–Schwab CLEAN algorithm or from using ℓ 1 or TV regularizations alone. Furthermore, we find that ℓ 1 +TV regularization can achieve much better image fidelity in linear polarization than other techniques over a wide range of spatial scales, not only in the superresolution regime, but also on scales larger than the diffraction limit. Our results clearly demonstrate that sparse reconstruction is a useful choice for high-fidelity full-polarimetric interferometric imaging.
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| 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.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".