Efficient implementation of the adaptive scale pixel decomposition algorithm
L. Zhang, S. Bhatnagar, U. Rau, and M. Zhang

TL;DR
This paper presents an efficient implementation of the adaptive scale pixel decomposition (Asp-Clean) algorithm, significantly reducing computational costs while maintaining high imaging performance for radio astronomy data.
Contribution
The paper introduces an optimized Asp-Clean algorithm with analytical modeling and improved initial scale estimation, enabling faster processing of large radio astronomical images.
Findings
Reduced computational cost compared to original Asp-Clean
Maintains comparable imaging performance on simulated data
Effective in recovering multi-scale features
Abstract
Context. Most popular algorithms in use to remove the effects of a telescope's point spread function (PSF) in radio astronomy are variants of the CLEAN algorithm. Most of these algorithms model the sky brightness using the delta-function basis, which results in undesired artefacts when used on image extended emission. The adaptive scale pixel decomposition (Asp-Clean) algorithm models the sky brightness on a scale-sensitive basis and thus gives a significantly better imaging performance when imaging fields that contain both resolved and unresolved emission. Aims. However, the runtime cost of Asp-Clean is higher than that of scale-insensitive algorithms. In this paper, we identify the most expensive step in the original Asp-Clean algorithm and present an efficient implementation of it, which significantly reduces the computational cost while keeping the imaging performance comparable…
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.
