Direct deconvolution of radio synthesis images using L1 minimisation

  title={Direct deconvolution of radio synthesis images using L1 minimisation},
  author={Stephen J. Hardy},
  journal={arXiv: Instrumentation and Methods for Astrophysics},
  • S. J. Hardy
  • Published 1 September 2013
  • Computer Science
  • arXiv: Instrumentation and Methods for Astrophysics
We introduce an algorithm for the deconvolution of radio synthesis images that accounts for the non-coplanar-baseline effect, allows multiscale reconstruction onto arbitrarily positioned pixel grids, and allows the antenna elements to have direcitonal dependent gains. Using numerical L1-minimisation techniques established in the application of compressive sensing to radio astronomy, we directly solve the deconvolution equation using GPU (graphics processing unit) hardware. This approach relies… 

Figures and Tables from this paper

LOFAR sparse image reconstruction

This sparse reconstruction method is compatible with modern interferometric imagers that handle DDE corrections (A- and W-projections) required for current and future instruments such as LOFAR and SKA.

Facet-Based Regularization for Scalable Radio-Interferometric Imaging

Leveraging a stochastic primal dual algorithm, the potential merits of applying facet-based regularization on the radio-interferometric images are shown which results in both computation time and memory requirement savings.

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

Two new convex optimisation algorithmic structures able to solve the conveX optimisation tasks arising in radio-interferometric imaging are proposed and employed in parallel and distributed computations to achieve scalability, in terms of memory and computational requirements.

Purify: A new algorithmic framework for next-generation radio-interferometric imaging

The latest contributions, which leverage the versatility of convex optimization 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 are reviewed.

Low-dimensional data embedding for scalable astronomical imaging in the SKA telescope era

Fast and robust dimensionality reduction methods that embed data to very low sizes while preserving information present in the original data are proposed in the context of compressed sensing theory and related signal recovery techniques and are shown to have quality comparable to those obtained from full data without any reduction.

Image formation for future radio telescopes

The central objective of the current dissertation is to introduce advanced algebraic techniques together with custom-made regularization schemes to speed up the image formation pipeline of the next generation radio telescopes.

Regularized Optimization Methods for Reconstruction and Modeling in Computer Graphics

In dieser Arbeit wird gezeigt, dass verschiedene Rekonstruktionsprobleme der Computergraphik Instanzen einer gemeinsamen Klasse von Optimierungsproblemen sind, die mit einem einheitlichen algorithmischen Framework gelost werden konnen.



Multiscale CLEAN Deconvolution of Radio Synthesis Images

  • T. Cornwell
  • Computer Science
    IEEE Journal of Selected Topics in Signal Processing
  • 2008
This work describes and demonstrates a conceptually simple and algorithmically straightforward extension to CLEAN that models the sky brightness by the summation of components of emission having different size scales and works simultaneously on a range of specified scales.

SparseRI: A Compressed Sensing Framework for Aperture Synthesis Imaging in Radio Astronomy

This work presents a versatile CS-based image reconstruction framework called SparseRI, an interesting alternative to the CLEAN algorithm, which permits a wide choice of different regularizers for interferometric image reconstruction.

Maximum Entropy Image Restoration in Astronomy

Imaging the two-dimensional intensity distribution of the sky has always been an important part of astronomy. This is particularly true at present, a time when aperture synthesis mapping is firmly

The application of compressive sampling to radio astronomy I: Deconvolution

A CS-based deconvolution method for extended sources that can reconstruct both point sources and extended sources and shows the best performance in deconvolving extended sources for both uniform and natural weighting of the sampled visibilities.

Compressed sensing for wide-field radio interferometric imaging

This work extends compressed sensing techniques for interferometric imaging to a WFOV and recovers images in the spherical coordinate space in which they naturally live, eliminating any distorting projection.

Compressed sensing imaging techniques for radio interferometry

Radio interferometry probes astrophysical signals through incomplete and noisy Fourier measurements. The theory of compressed sensing demonstrates that such measurements may actually suffice for

Spread spectrum for imaging techniques in radio interferometry

The probe of astrophysical signals through radio interferometers with a small field of view and baselines with a non-negligible and constant component in the pointing direction is considered and the related spread spectrum phenomenon is analysed and its universality relative to the sparsity dictionary is suggested.

NESTA: A Fast and Accurate First-Order Method for Sparse Recovery

A smoothing technique and an accelerated first-order algorithm are applied and it is demonstrated that this approach is ideally suited for solving large-scale compressed sensing reconstruction problems and is robust in the sense that its excellent performance across a wide range of problems does not depend on the fine tuning of several parameters.


We introduce the Fast Holographic Deconvolution method for analyzing interferometric radio data. Our new method is an extension of A-projection/software-holography/forward modeling analysis

Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems

A fast algorithm is derived for the constrained TV-based image deblurring problem with box constraints by combining an acceleration of the well known dual approach to the denoising problem with a novel monotone version of a fast iterative shrinkage/thresholding algorithm (FISTA).