Sparsity Averaging Reweighted Analysis (SARA): a novel algorithm for radio-interferometric imaging

We propose a novel algorithm for image reconstruction in radio interferometry. The ill-posed inverse problem associated with the incomplete Fourier sampling identified by the visibility measurements is regularized by the assumption of average signal sparsity over representations in multiple wavelet bases. The algorithm, defined in the versatile framework of convex optimization, is dubbed Sparsity Averaging Reweighted Analysis (SARA). We show through simulations that the proposed approach outperforms state-of-the-art imaging methods in the field, which are based on the assumption of signal sparsity in a single basis only.

Compressed sensing for radio interferometric imaging: review and future

Jason Douglas McEwen, Yves Wiaux

Radio interferometry is a powerful technique for astronomical imaging. The theory of compressed sensing (CS) has been applied recently to the ill-posed inverse problem of recovering images from the measurements taken by radio interferometric telescopes. We review novel CS radio interferometric imaging techniques, both at the level of acquisition and reconstruction, and discuss their superior performance relative to traditional approaches. In order to remain as close to the theory of CS as possible, these techniques necessarily consider idealised interferometric configurations. To realise the enhancement in quality provided by these novel techniques on real radio interferometric observations, their extension to realistic interferometric configurations is now of considerable importance. We also chart the future direction of research required to achieve this goal.

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

PURIFY: a new approach to radio-interferometric imaging

Rafael Eduardo Carrillo Rangel, Jason Douglas McEwen, Yves Wiaux

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 the current major-minor cycle structure of CLEAN and its evolutions, which in particular cannot handle the state-of-the-art minimization problems under consideration where neither the regularization term nor the data term are differentiable functions. We release a beta version of an SDMM-based imaging software written in C and dubbed PURIFY (http://basp-group.github.io/purify/) that handles various sparsity priors, including our recent average sparsity approach SARA. We evaluate the performance of different priors through simulations in the continuous visibility setting, confirming the superiority of SARA.

Wiley-Blackwell2014

A Fourier dimensionality reduction model for big data interferometric imaging

Rafael Eduardo Carrillo Rangel, Vijay Kartik, Jean-Philippe Thiran, Yves Wiaux

Data dimensionality reduction in radio interferometry can provide savings of computational resources for image reconstruction through reduced memory footprints and lighter computations per iteration, which is important for the scalability of imaging methods to the big data setting of the next-generation telescopes. This article sheds new light on dimensionality reduction from the perspective of compressed sensing theory and studies its interplay with imaging algorithms designed in the context of convex optimization. We propose a post-gridding linear data embedding to the space spanned by the left singular vectors of the measurement operator, providing a dimensionality reduction below image size. This embedding preserves the null space of the measurement operator and hence also its sampling properties as per compressed sensing theory. We show that this can be approximated by first computing the dirty image and then applying a weighted subsampled discrete Fourier transform to obtain the final reduced data vector. This Fourier dimensionality reduction model ensures a fast implementation of the full measurement operator, essential for any iterative image reconstruction method. The proposed reduction also preserves the i.i.d. Gaussian properties of the original measurement noise. For convex optimization-based imaging algorithms, this is key to justify the use of the standard L2-norm as the data fidelity term. Our simulations confirm that this dimensionality reduction approach can be leveraged by convex optimization algorithms with no loss in imaging quality relative to reconstructing the image from the complete visibility data set. Reconstruction results in simulation settings with no direction dependent effects or calibration errors show promising performance of the proposed dimensionality reduction. MATLAB code implementing the proposed reduction method is available on GitHub.

Oxford Univ Press2017

A Fourier dimensionality reduction model for big data interferometric imaging

Rafael Eduardo Carrillo Rangel, Vijay Kartik, Jean-Philippe Thiran, Yves Wiaux

Oxford Univ Press2017