Fast algorithms to approximate the position-dependent point spread function responses in radio interferometric wide-field imaging
M. Atemkeng, O. Smirnov, C. Tasse, G. Foster, S. Makhathini

TL;DR
This paper introduces two efficient algorithms for approximating position-dependent point spread functions in wide-field radio interferometric imaging, significantly reducing computational costs while maintaining image fidelity.
Contribution
The paper presents novel algorithms that approximate position-dependent PSFs in both the uv-plane and image-plane, enabling faster processing in wide-field radio imaging.
Findings
Algorithms validated with MeerKAT simulated data
Significant reduction in PSF computation time
Maintained high image fidelity despite approximations
Abstract
The desire for wide-field of view, large fractional bandwidth, high sensitivity, high spectral and temporal resolution has driven radio interferometry to the point of big data revolution where the data is represented in at least three dimensions with an axis for spectral windows, baselines, sources, etc; where each axis has its own set of sub-dimensions. The cost associated with storing and handling these data is very large, and therefore several techniques to compress interferometric data and/or speed up processing have been investigated. Unfortunately, averaging-based methods for visibility data compression are detrimental to the data fidelity, since the point spread function (PSF) is position-dependent, i.e. distorted and attenuated as a function of distance from the phase centre. The position dependence of the PSF becomes more severe, requiring more PSF computations for wide-field…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
