Scalable splitting algorithms for big-data interferometric imaging in the SKA era


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 `1 priors promoting image sparsity in an adequate domain. Tailored for big-data, they employ parallel and distributed computations to achieve scalability, in terms of memory and computational requirements. One of them also exploits randomisation, over data blocks at each iteration, offering further flexibility. We present simulation results showing the feasibility of the proposed methods as well as their advantages compared to state-of-the-art algorithmic solvers. Our Matlab code is available online on GitHub.

Extracted Key Phrases

Cite this paper

@inproceedings{Onose2016ScalableSA, title={Scalable splitting algorithms for big-data interferometric imaging in the SKA era}, author={Alexandru Onose and Rafael E. Carrillo and Audrey Repetti and Jason D. McEwen and Jean-Philippe Thiran and Jean-Christophe Pesquet and Yves Wiaux}, year={2016} }