Synthesis Imaging. Claire Chandler, Sanjay Bhatnagar NRAO/Socorro

Similar documents
Imaging and Deconvolution

Imaging and non-imaging analysis

Imaging and Deconvolution

Lecture 17 Reprise: dirty beam, dirty image. Sensitivity Wide-band imaging Weighting

Radio Interferometry Bill Cotton, NRAO. Basic radio interferometry Emphasis on VLBI Imaging application

Imaging and Deconvolution

ERROR RECOGNITION and IMAGE ANALYSIS

Imaging and Deconvolution

Basic Imaging and Self- Calibration (T4 + T7)

ALMA Memo 386 ALMA+ACA Simulation Tool J. Pety, F. Gueth, S. Guilloteau IRAM, Institut de Radio Astronomie Millimétrique 300 rue de la Piscine, F-3840

Sky-domain algorithms to reconstruct spatial, spectral and time-variable structure of the sky-brightness distribution

The Techniques of Radio Interferometry III: Imaging

ADVANCED RADIO INTERFEROMETRIC IMAGING

Deconvolution and Imaging ASTR 240: In-class activity, April 1, 2013

How accurately do our imaging algorithms reconstruct intensities and spectral indices of weak sources?

OSKAR: Simulating data from the SKA

Synthesis imaging using CASA

A Modified Algorithm for CLEANing Wide-Field Maps with Extended Structures

Antenna Configurations for the MMA

High Dynamic Range Imaging

Wide-Field Imaging I: Non-Coplanar Visibilities

Fast Holographic Deconvolution

Note 158: The AIPS++ GridTool Class How to use the GridTool class - definitions and tutorial

Radio interferometric imaging of spatial structure that varies with time and frequency

COMMENTS ON ARRAY CONFIGURATIONS. M.C.H. Wright. Radio Astronomy laboratory, University of California, Berkeley, CA, ABSTRACT

Image Pixelization and Dynamic Range

Data Analysis. I have got some data, so what now? Naomi McClure-Griffiths CSIRO Australia Telescope National Facility 2 Oct 2008

Correlator Field-of-View Shaping

RADIO ASTRONOMICAL IMAGE FORMATION USING SPARSE RECONSTRUCTION TECHNIQUES

van Cittert-Zernike Theorem

Wideband Mosaic Imaging for VLASS

arxiv: v1 [astro-ph.im] 23 Jul 2014

Imaging Supermassive Black Holes with the Event Horizon Telescope

High dynamic range imaging, computing & I/O load

Thomas Abraham, PhD

Continuum error recognition and error analysis

Empirical Parameterization of the Antenna Aperture Illumination Pattern

IRAM Memo MAPPING for NOEMA: Concepts and Usage

ALMA Memo No An Imaging Study for ACA. Min S. Yun. University of Massachusetts. April 1, Abstract

( ) = First Bessel function, x = π Dθ

EVLA Memo #132 Report on the findings of the CASA Terabyte Initiative: Single-node tests

Mosaicing and Single-Dish Combination

Multi-Scale CLEAN deconvolution of radio synthesis images

Lessons learnt from implementing mosaicing and faceting in ASKAPsoft. Max Voronkov & Tim Cornwell ASKAP team 2nd April 2009

Contrast Optimization A new way to optimize performance Kenneth Moore, Technical Fellow

OSKAR-2: Simulating data from the SKA

SSW, Radio, X-ray, and data analysis

4 Image Reconstruction Studies

EVLA memo 77. EVLA and SKA computing costs for wide field imaging. (Revised) 1. T.J. Cornwell, NRAO 2

Controlling Field-of-View of Radio Arrays using Weighting Functions

Computer Vision I. Announcements. Fourier Tansform. Efficient Implementation. Edge and Corner Detection. CSE252A Lecture 13.

Outline. Sampling and Reconstruction. Sampling and Reconstruction. Foundations of Computer Graphics (Fall 2012)

Outline. Foundations of Computer Graphics (Spring 2012)

Adaptive selfcalibration for Allen Telescope Array imaging

Contrast Optimization: A faster and better technique for optimizing on MTF ABSTRACT Keywords: INTRODUCTION THEORY

Michael Moody School of Pharmacy University of London 29/39 Brunswick Square London WC1N 1AX, U.K.

Computational issues for HI

Sampling, Aliasing, & Mipmaps

Sampling, Aliasing, & Mipmaps

Scaled representations

Theoretically Perfect Sensor

Scanner Parameter Estimation Using Bilevel Scans of Star Charts

Image restoration. Lecture 14. Milan Gavrilovic Centre for Image Analysis Uppsala University

Theoretically Perfect Sensor

Computer Vision. Fourier Transform. 20 January Copyright by NHL Hogeschool and Van de Loosdrecht Machine Vision BV All rights reserved

Computational Aspects of MRI

Computer Vision and Graphics (ee2031) Digital Image Processing I

Sampling, Aliasing, & Mipmaps

Testbed experiment for SPIDER: A photonic integrated circuit-based interferometric imaging system

PHYSICS. Chapter 33 Lecture FOR SCIENTISTS AND ENGINEERS A STRATEGIC APPROACH 4/E RANDALL D. KNIGHT

Fourier analysis and sampling theory

Image Processing and Analysis

From multiple images to catalogs

Announcements. Image Matching! Source & Destination Images. Image Transformation 2/ 3/ 16. Compare a big image to a small image

Computer Graphics. Sampling Theory & Anti-Aliasing. Philipp Slusallek

Self-calibration: about the implementation in GILDAS. Vincent Piétu IRAM. IRAM millimeter interferometry summerschool

CASA. Algorithms R&D. S. Bhatnagar. NRAO, Socorro

Edge and local feature detection - 2. Importance of edge detection in computer vision

Segmentation and Grouping

Array Design. Introduction

Imaging Strategies and Postprocessing Computing Costs for Large-N SKA Designs

Super-resolution Polarimetric Imaging of Black Holes using the Event Horizon Telescope

Visualization & the CASA Viewer

A Wiener Filter Version of Blind Iterative Deconvolution

Peripheral drift illusion

How reliable is statistical wavelet estimation? Jonathan Edgar*, BG Group, and Mirko van der Baan, University of Alberta

Waves & Oscillations

Optical simulations within and beyond the paraxial limit

Image Processing. Filtering. Slide 1

MAPPING. March 29th, Version 2.0. Questions? Comments? Bug reports? Mail to:

Basics. Sampling and Reconstruction. Sampling and Reconstruction. Outline. (Spatial) Aliasing. Advanced Computer Graphics (Fall 2010)

Some Blind Deconvolution Techniques in Image Processing

ERROR RECOGNITION & IMAGE ANALYSIS. Gustaaf van Moorsel (NRAO) Ed Fomalont (NRAO) Twelfth Synthesis Imaging Workshop 2010 June 8-15

Sampling and Monte-Carlo Integration

Frequency analysis, pyramids, texture analysis, applications (face detection, category recognition)

Modeling Antenna Beams

Image Processing: Discrete Images

WORCESTER POLYTECHNIC INSTITUTE

Image Filtering, Warping and Sampling

Today. Anti-aliasing Surface Parametrization Soft Shadows Global Illumination. Exercise 2. Path Tracing Radiosity

Transcription:

Synthesis Imaging Claire Chandler, Sanjay Bhatnagar NRAO/Socorro Michelson Summer Workshop Caltech, July 24-28, 2006

Synthesis Imaging 2 Based on the van Cittert-Zernike theorem: The complex visibility of a source, V(u,v), is the Fourier Transform of its intensity distribution on the sky, I(l,m) V ( u, v) I( l, m) = = I( l, m) e V ( u, v) e 2πi( ul+ vm) 2πi( ul+ vm) dldm dudv u,v are spatial frequencies in the E-W and N-S directions, and are the projected baseline lengths measured in units of wavelength, B/λ l,m are direction cosines relative to a reference position in the E-W and N-S directions

Some 2D FT pairs 3 Image Visibility amp

Some 2D FT pairs 4 Image Visibility amp

Some 2D FT pairs 5 Image Visibility amp

Sampling in the uv plane 6 Observed sky distribution, I(l,m) obs, is the convolution of the true sky distribution, I(l,m) true, and the point spread function. This is equivalent to sampling the true visibility function, V(u,v), with some sampling function, S(u,v), in the uv plane: I obs ( l, m) = I true ( l, m) PSF = S( u, v) V ( u, v) e 2πi( ul+ vm) dudv For a single telescope, S(u,v) is continuous, and in the absence of seeing is the autocorrelation function of the aperture

Sampling in the uv plane 7 For an interferometer, S(u,v) is discrete S ( u, v) = δ ( u, v ) k k k The measured visibility is the true visibility multiplied by the sampling function V ( u, v) S( u, v) V ( u, v) meas = true =

Sampling in the uv plane 8 Aperture synthesis: Ideally want to make sampling as complete as possible, to synthesize an aperture of diameter B max Telescope locations instantaneous uv coverage PSF

The resulting PSF 9 How nice the resulting PSF looks depends on how well the uv plane is sampled: VLA snapshots 3 antennas on each arm 8 antennas on each arm

Earth rotation synthesis 10 Earth rotation synthesis: We can help to fill in the uv plane by making use of the rotation of the Earth. A fixed baseline between telescope 1 and telescope 2, B 12, tracking a source from rise to set, will have a changing projected baseline, B proj, in the direction of the source, and will trace out two arcs in the uv plane: one for baseline 1-2, and one for 2-1 There are two arcs because the visibility is Hermitian: V ( u, v) = V * ( u, v)

Convolution with the PSF; terminology 11 The image obtained from the FT of the sampled visibility is the dirty image I ( l, m) FT[ S( u, v) V ( u, v)] dirty = The dirty image, I dirty, is the convolution of the true image, I true, and the dirty beam (PSF), B = FT(S) I = B dirty I true [In practice, I dirty = B*(I true +I N ), where I N = FT(Vis. Noise)] To recover I true, we must deconvolve B from I dirty Note: we can do this because S, and therefore B, is well-defined true

The dirty image 12 B FT S * I true I dirty

The missing information 13 Not all parts of the uv plane are sampled Central hole for u < u min and v < v min : Total integrated flux is not measured V ( u = 0, v = 0) = I ( l, m) dldm = 0 Upper limit on the largest scale in the image plane No measurements for u>u max and v>v max : Size of the main lobe of the PSF (the resolution) is finite Holes in the uv plane: dirty Contribute to the sidelobes of the PSF

The missing information 14 Although the total flux is not measured, the flux for scales corresponding to the Fourier components between u min and u max can be measured In the presence of extended emission, the observations must be designed keeping in mind: Required resolution maximum baseline Largest scale to be reliably reconstructed minimum baseline

Recovering the missing information 15 To recover information beyond the maximum baseline requires extrapolation (unconstrained) Recovering information corresponding to the central hole is possible, but need extra information (e.g., measure total flux using a large single telescope) Information corresponding to the uv holes requires interpolation Deconvolution of the PSF in the image plane = interpolation in the visibility plane Non-linear methods required

Recovering the missing information 16 Note: there is an infinite number of sky distributions consistent with the measurements, need to provide some constraints to the interpolation We can assume: The sky brightness is positive (but there are exceptions) The sky is a collection of point sources (weak assertion) The sky could be smooth The sky is mostly blank Non-linear deconvolution algorithms search for a model image, I model, such that the residual visibilities V resid = V model V meas are minimized subject to the constraints given by the assumptions

Practical aspects: overview 17 The rest of this lecture addresses some practical aspects of synthesis imaging: choices you will probably be asked to make by any piece of synthesis imaging software FFTs and the need to grid the uv data Forming the dirty beam: weighting An example of a deconvolution algorithm: Clean Finite support: the role of boxes Choosing the image and pixel sizes

Making the dirty image 18 The Fast Fourier Transform (FFT) is used for efficient Fourier transformations. However, it requires a regularly-spaced grid of data Measured visibilities are irregularly sampled (along tracks in the uv plane) Visibilities must be interpolated onto a regular grid using a suitable function

Dirty beam: properties 19 The PSF is a weighted sum of cosines corresponding to the measured Fourier components: B( l, m) = w + k k cos( ukl w k k v k m) The visibility weights, w, are also gridded onto a regular grid, FFTed, and used to compute the dirty beam The peak of the dirty beam is normalized to unity The main lobe has a size of order dx ~ 1/u max by dy ~ 1/v max this is the resolution of the instrument, or clean beam

Dirty beam: properties 20 Sidelobes extend indefinitely Close-in sidelobes are controlled by the envelope of the uv coverage: e.g., if the envelope is a circle, the sidelobes near the main lobe must be similar to the FT of a circular disk

Forming the dirty beam: weighting 21 The weighting function, w k, can be chosen to modify the sidelobe structure of the beam B( l, m) = w + k k cos( ukl w k k v k m) Natural weighting : w k = 1/σ k2 where σ k2 is the rms noise of the k th gridded visibility Gives the best rms noise across the image Smaller baselines (large spatial scales) have higher weights The effective resolution is worse than the inverse of the longest baseline

Forming the dirty beam: weighting 22 Uniform weighting: w k = 1/ρ(u k,v k ) where ρ(u k,v k ) is the density of uv points in the k th cell Short baselines (large scale features in the image) are weighted down Relatively better resolution Increased rms noise

Forming the dirty beam: weighting 23 Robust or Briggs weighting: w k = 1/[S 2 ρ(u k,v k ) + σ k2 ] S 2 = (5 10 R ) 2 /ρ(u k,v k ) is a parameterized filter that allows continuous variation between optimal resolution (uniform weighting) and optimal noise properties (natural weighting) by varying the robust parameter, R

Examples of weighting: VLA 24 (uv coverage) Natural Robust Uniform Clean beam: 0.56 0.29 0.48 0.26 0.41 0.22 Rms noise: 1.0 1.1 2.0 tune resolution and sensitivity to suit your science

Examples of weighting: sparse uv coverage 25 (uv coverage) Natural Robust Uniform Clean beam: 0.049 0.048 0.046 0.045 0.045 0.044 Rms noise: 1.0 1.03 1.08 natural and uniform weighting similar for sparse uv coverage

Forming the dirty beam: tapering 26 The PSF can also be further controlled by applying a tapering function to the weights (e.g., such that the weights smoothly go to zero toward longer baselines) w k = T ( uk, vk ) wk ( uk, vk ) Bottom line on weighting/tapering: They help a bit, but imaging quality is limited by finite sampling of the uv plane

The Clean deconvolution algorithm (Högbom 1974) 27 Various deconvolution algorithms are available; Clean is an example of a scale-less algorithm Assume the sky is composed of point sources, and is mostly blank; then: 1. Search for the peak in the dirty image 2. Subtract a fraction g (the loop gain) of the PSF from the position of the peak (typically g ~ 0.05 0.1) 3. Add g times the peak to a single pixel in the model image 4. If residuals are not noise-like, go to 1 5. Smooth the model image by an estimate of the main lobe of the PSF (the clean beam) and add the residuals to make the restored image

The Clean deconvolution algorithm 28 Stopping criteria: either specify a maximum number of iterations or the maximum in the residual image (some multiple of the expected noise is typical) Search space can be constrained by user-defined windows Ignores the coupling between pixels (extended emission)

Clean example: model image 29 Model source as the sum of many point sources

Clean example: residual image 30 Subtract (point sources PSF) from dirty image to give residual image

Clean example: restored image 31 Smooth the model image by the clean beam and add the residuals to form the restored image

Comparison with I true 32 Convolve I true with clean beam for comparison: I restored I true * (clean beam) F peak = 7.22 7.65 F int = 120 147

V model V meas V true V model Clean can do a good job Clean example: visibilities 33 V true V meas V model of reproducing V true between u min and u max, but generally underestimates the total flux if there is unsampled extended emission

Finite support: the role of boxes 34 Limit the search for components to only parts of an image A way to regularize the deconvolution process Useful for small numbers of visibilities (VLBI / optical / snapshots using large-n arrays) Stop when Cleaning within the boxes has no global effect With boxes: No boxes:

Image and cell sizes 35 The size of the cells in the image needs to be chosen so that the main lobe of the dirty beam is at least Nyquist sampled: Δl 1/2u max, Δm 1/2v max The extent of the dirty image, l m, is related to the size of the grid cells in the uv plane, through the FT relationship l = 1/Δu, m = 1/Δv; if you make the image smaller than 1/Δu 1/Δv there may be aliasing The size of the image should be big enough to include the largest spatial scale on which there is measured flux (shortest uv spacing) If the image is not big enough, sidelobes from sources outside the image may be included and will not be deconvolved properly But also: if you have N independent visibilities you can only sensibly image of order ~N independent beam areas

Final remarks 36 Everything I have told you about synthesis imaging assumes that you have visibilities with calibrated amplitudes and phases What if you don t? Self-calibration See Chris Haniff s lecture There are many other subtleties not covered here; for further reading please see Synthesis Imaging in Radio Astronomy II, ASP Vol. 180 (1998) Interferometry and synthesis imaging requires you to think in FT space! This takes practice