TL;DR
This paper introduces PURIFY, an SDMM-based convex optimization algorithm for radio-interferometric imaging that effectively handles realistic continuous visibilities and high-dimensional data, outperforming traditional methods like CLEAN.
Contribution
The paper presents a novel SDMM-based algorithmic framework for radio imaging, enabling high-dimensional, continuous visibility data processing and incorporating advanced sparsity priors.
Findings
PURIFY outperforms CLEAN in simulations.
SARA sparsity prior yields superior results.
Algorithm is highly parallelizable and scalable.
Abstract
In a recent article series, the authors have promoted convex optimization algorithms for radio-interferometric imaging in the framework of compressed sensing, which leverages sparsity regularization priors for the associated inverse problem and defines a minimization problem for image reconstruction. This approach was shown, in theory and through simulations in a simple discrete visibility setting, to have the potential to outperform significantly CLEAN and its evolutions. In this work, we leverage the versatility of convex optimization in solving minimization problems to both handle realistic continuous visibilities and offer a highly parallelizable structure paving the way to significant acceleration of the reconstruction and high-dimensional data scalability. The new algorithmic structure promoted relies on the simultaneous-direction method of multipliers (SDMM), and contrasts with…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
