2019MNRAS.489.1230A

We propose a new approach within the versatile framework of convex optimization to solve the radio-interferometric wideband imaging problem. Our approach, dubbed HyperSARA, leverages low rankness, and joint average sparsity priors to enable formation of high-resolution and high-dynamic range image cubes from visibility data. The resulting minimization problem is solved using a primal-dual algorithm. The algorithmic structure is shipped with highly interesting functionalities such as preconditioning for accelerated convergence, and parallelization enabling to spread the computational cost and memory requirements across a multitude of processing nodes with limited resources. In this work, we provide a proof of concept for wideband image reconstruction of megabyte-size images. The better performance of HyperSARA, in terms of resolution and dynamic range of the formed images, compared to single channel imaging and the CLEAN-based wideband imaging algorithm in the WSCLEAN software, is showcased on simulations and Very Large Array observations. Our MATLAB code is available online on GITHUB.