Scalable splitting algorithms for big-data interferometric imaging in the SKA era
Alexandru Onose, Rafael E. Carrillo, Audrey Repetti, Jason D. McEwen,, Jean-Philippe Thiran, Jean-Christophe Pesquet, Yves Wiaux

TL;DR
This paper introduces two scalable convex optimisation algorithms using proximal splitting and forward-backward iterations for big-data radio interferometric imaging, enabling efficient processing of large datasets in the SKA era.
Contribution
The paper proposes two novel parallel and distributed convex optimisation algorithms tailored for large-scale radio interferometric imaging, supporting flexible regularisation and randomisation techniques.
Findings
Algorithms demonstrate scalability with big data.
Simulation results show advantages over existing methods.
Code is available online for reproducibility.
Abstract
In the context of next generation radio telescopes, like the Square Kilometre Array, the efficient processing of large-scale datasets is extremely important. Convex optimisation tasks under the compressive sensing framework have recently emerged and provide both enhanced image reconstruction quality and scalability to increasingly larger data sets. We focus herein mainly on scalability and propose two new convex optimisation algorithmic structures able to solve the convex optimisation tasks arising in radio-interferometric imaging. They rely on proximal splitting and forward-backward iterations and can be seen, by analogy with the CLEAN major-minor cycle, as running sophisticated CLEAN-like iterations in parallel in multiple data, prior, and image spaces. Both methods support any convex regularisation function, in particular the well studied l1 priors promoting image sparsity in an…
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.
