Details: Gridding, Weight Functions, the W-term

Slides:



Advertisements
Similar presentations
A Crash Course in Radio Astronomy and Interferometry: 4
Advertisements

A Crash Course in Radio Astronomy and Interferometry: 2
3-D Computational Vision CSc Image Processing II - Fourier Transform.
Adaptive Hough transform for the search of periodic sources P. Astone, S. Frasca, C. Palomba Universita` di Roma “La Sapienza” and INFN Roma Talk outline.
Image Processing Lecture 4
Digital Signal Processing
NASSP Masters 5003F - Computational Astronomy Lecture 13 Further with interferometry – Resolution and the field of view; Binning in frequency and.
EE4H, M.Sc Computer Vision Dr. Mike Spann
Interferometric Spectral Line Imaging Martin Zwaan (Chapters of synthesis imaging book)
DFT Filter Banks Steven Liddell Prof. Justin Jonas.
Radio `source’ Goals of telescope: maximize collection of energy (sensitivity or gain) isolate source emission from other sources… (directional gain… dynamic.
Sampling, Aliasing, & Mipmaps
Project Overview Reconstruction in Diffracted Ultrasound Tomography Tali Meiri & Tali Saul Supervised by: Dr. Michael Zibulevsky Dr. Haim Azhari Alexander.
Image Enhancement in the Frequency Domain Part I Image Enhancement in the Frequency Domain Part I Dr. Samir H. Abdul-Jauwad Electrical Engineering Department.
Chapter 12 Fourier Transforms of Discrete Signals.
Copyright, 1996 © Dale Carnegie & Associates, Inc. Tim Cornwell Kumar Golap Sanjay Bhatnagar W projection A new algorithm for wide field imaging with radio.
1 Images and Transformations Images by Pawan SinhaPawan Sinha.
1 Image filtering Hybrid Images, Oliva et al.,
1 Synthesis Imaging Workshop Error recognition R. D. Ekers Narrabri, 14 May 2003.
Ninth Synthesis Imaging Summer School Socorro, June 15-22, 2004 Cross Correlators Walter Brisken.
Introduction To Signal Processing & Data Analysis
Image Representation Gaussian pyramids Laplacian Pyramids
Goals For This Class Quickly review of the main results from last class Convolution and Cross-correlation Discrete Fourier Analysis: Important Considerations.
Topic 7 - Fourier Transforms DIGITAL IMAGE PROCESSING Course 3624 Department of Physics and Astronomy Professor Bob Warwick.
14 Sep 1998R D Ekers - Synth Image Workshop: INTRODUCTION 1 Synthesis Imaging Workshop Introduction R. D. Ekers 14 Sep 1998.
Copyright, 1996 © Dale Carnegie & Associates, Inc. Tim Cornwell Kumar Golap Sanjay Bhatnagar Wide field imaging - computational challenges.
1 BIEN425 – Lecture 8 By the end of the lecture, you should be able to: –Compute cross- /auto-correlation using matrix multiplication –Compute cross- /auto-correlation.
Tutorial on Computational Optical Imaging University of Minnesota September David J. Brady Duke University
1 ATNF Synthesis Workshop 2001 Basic Interferometry - II David McConnell.
NASSP Masters 5003F - Computational Astronomy Lecture 12: The beautiful theory of interferometry. First, some movies to illustrate the problem.
NASSP Masters 5003F - Computational Astronomy Lecture 14 Reprise: dirty beam, dirty image. Sensitivity Wide-band imaging Weighting –Uniform vs Natural.
2D Sampling Goal: Represent a 2D function by a finite set of points.
NASSP Masters 5003F - Computational Astronomy Lecture 16 Further with interferometry – Digital correlation Earth-rotation synthesis and non-planar.
Fourier Transform.
Lecture 14. Radio Interferometry Talk at Nagoya University IMS Oct /43.
1 ATNF Synthesis Workshop 2003 Basics of Interferometry David McConnell.
Non-Linear Transformations Michael J. Watts
Imaging The EoR MWA Project Meeting EoR Session 5 June 2011 N. Udaya Shankar Raman Research Institute.
The Chinese University of Hong Kong
WIDE-FIELD IMAGING IN CLASSIC AIPS Eric W. Greisen National Radio Astronomy Observatory Socorro, NM, USA.
Mathematical groundwork I: Fourier theory
Miguel Tavares Coimbra
Jean Baptiste Joseph Fourier
Limitations of Single Dish Astronomy
FOURIER THEORY: KEY CONCEPTS IN 2D & 3D
CS 591 S1 – Computational Audio
CS 591 S1 – Computational Audio
DIGITAL SIGNAL PROCESSING ELECTRONICS
CLEAN: Iterative Deconvolution
T. Chernyakova, A. Aberdam, E. Bar-Ilan, Y. C. Eldar
van Cittert-Zernike Theorem
Wide-field imaging Max Voronkov (filling up for Tim Cornwell)
General Functions A non-periodic function can be represented as a sum of sin’s and cos’s of (possibly) all frequencies: F() is the spectrum of the function.
Image filtering Hybrid Images, Oliva et al.,
Wide field imaging Non-copalanar arrays
Removing motion blur from a single image
Lecture 35 Wave spectrum Fourier series Fourier analysis
Image filtering Images by Pawan Sinha.
Deconvolution and Multi frequency synthesis
Some Curious Results of Array Investigation
Image filtering Images by Pawan Sinha.
Image filtering Images by Pawan Sinha.
Lecture 17 DFT: Discrete Fourier Transform
Most slides from Steve Seitz
Image filtering Images by Pawan Sinha.
Image filtering
Image filtering
Goals of telescope: Radio `source’
Most slides from Steve Seitz
Fourier Transforms of Discrete Signals By Dr. Varsha Shah
Presentation transcript:

Details: Gridding, Weight Functions, the W-term Fundamentals of Radio Interferometry (Sections 5.3, 5.4, 5.5) Griffin Foster SKA SA/Rhodes University NASSP 2016

Array Visibility Sampling Visibilities are regularly sampled in time, but not in the UVW-space (irregular sampling). The Fourier transform of irregularly sampled data requires use of the generic Discrete Fourier Transform (DFT). For an N x N image from M (M ~ N2) visibility samples this requires N2 x M computational operations. NASSP 2016

Array Visibility Sampling The Fourier transform of regularly sampled data can be done with a Fast Fourier Transform (FFT). In order to transform an irregularly sampled signal to regularly sampling a gridding operation must be performed. For an N x N image from N x N visibility samples this requires 2N log (N) computational operations. NASSP 2016

VLA Antenna Layout NASSP 2016

VLA UV Coverage NASSP 2016

VLA UV Coverage NASSP 2016

VLA UV Coverage NASSP 2016

VLA UV Coverage NASSP 2016

VLA UV Coverage NASSP 2016

Mapping Irregular Sampling to a Regular Grid NASSP 2016

Mapping Irregular Sampling to a Regular Grid Continuous Visibility Function Array Sampling Function Gridding Convolution Kernel Gridding Operator (Shah) NASSP 2016

De-gridding De-gridding Convolution Kernel Array Sampling Function Gridded Visibilities De-gridding Convolution Kernel NASSP 2016

Mapping Irregular Sampling to a Regular Grid NASSP 2016

Image Size and Resolution Given the the resolution and the desired field of view the number of pixels in the image (the image size) is For a given image resolution and image size the uv domain resolution/grid size is: And the number of pixels is unchanged Nu = Nl, Nv = Nm. NASSP 2016

Anti-Aliasing Filter Effects NASSP 2016

Anti-Aliasing Filter Effects NASSP 2016

Window Functions NASSP 2016

The Dirty Image NASSP 2016

The Dirty Image For simplicity, let us assume the gridding operation is perfect, the regularly sampled visibilities VS are then the product of the observed visibility function Vobs and the array sampling function S. Using the van Cittert-Zernike approximate relation, the dirty image ID is the Fourier transform of the observed visibilities By the convolution theorem The Fourier transform of the sampling function is the point spread function (PSF) and the Fourier transform of the visibility function is the true sky image. NASSP 2016

KAT-7 Sampling Function NASSP 2016

KAT-7 Sampling Function What happens when a position in the visibility space is sampled multiple times during an observation? NASSP 2016

Weighting Function: Generalization of the Sampling Function R (reliability): reliability of a given sample T (taper): matched filter function D (density): normalization of redundant sampling S (array sampling): uv-coverage sampling NASSP 2016

1-D Weight Functions NASSP 2016

Natural Weighting: maximizes sensitivity at the cost of resolution. Density Functions Natural Weighting: maximizes sensitivity at the cost of resolution. Uniform Weighting: maximizes resolution at the cost of sensitivity. NASSP 2016

Weight Example: True Sky NASSP 2016

Weight Example: Natural and Uniform Weighting NASSP 2016

Weight Example: Natural and Uniform Weighting NASSP 2016

Robust (Briggs') Weighting NASSP 2016

Taper Functions NASSP 2016

Matched Filtering Given a known signal in noise, in order to maximize the signal to noise of the signal a matched filter is used. The matched filter is the time-reverse of the input signal (in 1-D), this amounts to a cross-correlation in all dimensions. SNR Maximized Signal Noisy signal Matched Filter NASSP 2016

Matched Filters True Signal NASSP 2016

True Signal in a Noisy System Matched Filters True Signal in a Noisy System Matched Filter Cross-Correlation Filtered Signal NASSP 2016

True Signal in a Noisy System Un-Matched Filters True Signal in a Noisy System Un-Matched Filter Cross-Correlation Filtered Signal NASSP 2016

Matched Filters True Signal Noisy Signal NASSP 2016

Matched Filters Filter Filter Filter Filtered Signal Filtered Signal NASSP 2016

NASSP 2016

The more complete van Cittert-Zernike Theorem Our 2-D Fourier relation between the visibility function and the sky is an approximate form of the van Cittert-Zernike theorem: A more complete version of van Cittert-Zernike is: Unfortunately, this is not a 2-D Fourier relation. NASSP 2016

Approximations to reduce to a 2D Fourier transform Small Angle/Narrow Field of View Approximation: From positional astronomy, the sky instensity is distributed on the celestial (unit) sphere such that for any position (l,m,n): If we are only interested in a small area on the sky then the extant of (l,m) is small: Then the van Cittert-Zernike theorem can be approximated as: NASSP 2016

Approximations to reduce to a 2D Fourier transform Delay term/w-term Approximation: If our visibility sampling is approximately on a plane, or again we are only interested in a narrow field of view then the so-called w-term can be seen as a constant delay term, with a simple correction w=0. NASSP 2016

W-term Approximation NASSP 2016

Simple Array Layouts NASSP 2016

Simple Array Layouts An array is coplanar if there exists (approximately) a 2-D plane all visibility measurement lie on in the 3-D visibility space. NASSP 2016

Coplanar W-term For a coplanar array there exists a w-plane in which (l, m) coordinates can be linearly transformed to (l', m') NASSP 2016

Projection Effects NASSP 2016

In the small angle approximation we can Taylor expand the w-term: Non-coplanar Sampling Unfortunately, few modern arrays are coplanar...so approximation become the name of the game. In the small angle approximation we can Taylor expand the w-term: Change in Phase → Change in Position Phase factors NASSP 2016

W-Term Effects: Uncorrected NASSP 2016

W-Term Effects: Corrected NASSP 2016

Correcting Non-coplanar Wide-field Effects Full 3D Fourier Transform: the 2D Fourier transform is used for computational efficiency, but a 3D transform is a 'more correct' transform. Snapshot Imaging: when imaging for short time periods a non-coplanar array can be well approximated as coplanar. Facet Imaging: form many small, narrow field images and stitch them together to form a single wide field image. W-Projection: apply convolutional filters to the visibilities to project down to a single w-plane. W-Stacking: form multiple images at different w-planes and stack the resulting images in the image domain. See Section 5.5 NASSP 2016