51,260 research outputs found
A fast and exact -stacking and -projection hybrid algorithm for wide-field interferometric imaging
The standard wide-field imaging technique, the -projection, allows
correction for wide-fields of view for non-coplanar radio interferometric
arrays. However, calculating exact corrections for each measurement has not
been possible due to the amount of computation required at high resolution and
with the large number of visibilities from current interferometers. The
required accuracy and computational cost of these corrections is one of the
largest unsolved challenges facing next generation radio interferometers such
as the Square Kilometre Array. We show that the same calculation can be
performed with a radially symmetric -projection kernel, where we use one
dimensional adaptive quadrature to calculate the resulting Hankel transform,
decreasing the computation required for kernel generation by several orders of
magnitude, whilst preserving the accuracy. We confirm that the radial
-projection kernel is accurate to approximately 1% by imaging the
zero-spacing with an added -term. We demonstrate the potential of our
radially symmetric -projection kernel via sparse image reconstruction, using
the software package PURIFY. We develop a distributed -stacking and
-projection hybrid algorithm. We apply this algorithm to individually
correct for non-coplanar effects in 17.5 million visibilities over a by
degree field of view MWA observation for image reconstruction. Such a
level of accuracy and scalability is not possible with standard -projection
kernel generation methods. This demonstrates that we can scale to a large
number of measurements with large image sizes whilst still maintaining both
speed and accuracy.Comment: 9 Figures, 19 Pages. Accepted to Ap
Four-dimensional tomographic reconstruction by time domain decomposition
Since the beginnings of tomography, the requirement that the sample does not
change during the acquisition of one tomographic rotation is unchanged. We
derived and successfully implemented a tomographic reconstruction method which
relaxes this decades-old requirement of static samples. In the presented
method, dynamic tomographic data sets are decomposed in the temporal domain
using basis functions and deploying an L1 regularization technique where the
penalty factor is taken for spatial and temporal derivatives. We implemented
the iterative algorithm for solving the regularization problem on modern GPU
systems to demonstrate its practical use
- …