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

Similar documents
Synthesis Imaging. Claire Chandler, Sanjay Bhatnagar NRAO/Socorro

Imaging and Deconvolution

ERROR RECOGNITION and IMAGE ANALYSIS

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

Imaging and non-imaging analysis

Basic Imaging and Self- Calibration (T4 + T7)

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

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

Synthesis imaging using CASA

ADVANCED RADIO INTERFEROMETRIC IMAGING

Imaging and Deconvolution

Imaging and Deconvolution

OSKAR: Simulating data from the SKA

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

Imaging and Deconvolution

The Techniques of Radio Interferometry III: Imaging

Continuum error recognition and error analysis

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

Correlator Field-of-View Shaping

OSKAR-2: Simulating data from the SKA

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

High Dynamic Range Imaging

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

Image Analysis. Jim Lovell

Wide-Field Imaging I: Non-Coplanar Visibilities

Primary Beams & Radio Interferometric Imaging Performance. O. Smirnov (Rhodes University & SKA South Africa)

van Cittert-Zernike Theorem

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

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

RADIO ASTRONOMICAL IMAGE FORMATION USING SPARSE RECONSTRUCTION TECHNIQUES

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

Advanced Radio Imaging Techniques

Digital Image Processing. Prof. P. K. Biswas. Department of Electronic & Electrical Communication Engineering

Antenna Configurations for the MMA

Fast Holographic Deconvolution

The Virtual Observatory in Australia Connecting to International Initiatives. Peter Lamb. CSIRO Mathematical & Information Sciences

A Correlation Test: What were the interferometric observation conditions?

PSI Precision, accuracy and validation aspects

IRAM mm-interferometry School UV Plane Analysis. IRAM Grenoble

Computer Vision 2. SS 18 Dr. Benjamin Guthier Professur für Bildverarbeitung. Computer Vision 2 Dr. Benjamin Guthier

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

S.A. Torchinsky, A. van Ardenne, T. van den Brink-Havinga, A.J.J. van Es, A.J. Faulkner (eds.) 4-6 November 2009, Château de Limelette, Belgium

Computational issues for HI

Central Slice Theorem

GEOG 4110/5100 Advanced Remote Sensing Lecture 2

From multiple images to catalogs

Image Pixelization and Dynamic Range

Feature Detectors and Descriptors: Corners, Lines, etc.

PACS Spectrometer Simulation and the Extended to Point Correction

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

Digital Image Processing

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

Wideband Mosaic Imaging for VLASS

No Brain Too Small PHYSICS

Minimizing Noise and Bias in 3D DIC. Correlated Solutions, Inc.

NRAO VLA Archive Survey

Wave Phenomena Physics 15c. Lecture 19 Diffraction

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

WSDC Subsystem Peer Review

Action TU1208 Civil Engineering Applications of Ground Penetrating Radar. SPOT-GPR: a freeware tool for target detection and localization in GPR data

Mosaicing and Single-Dish Combination

FIFI-LS: Basic Cube Analysis using SOSPEX

LECTURE 14 PHASORS & GRATINGS. Instructor: Kazumi Tolich

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

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

Computer Vision and Graphics (ee2031) Digital Image Processing I

GBT Memo #300: Correcting ALMA 12-m Array Data for Missing Short Spacings Using the Green Bank Telescope

3. Image formation, Fourier analysis and CTF theory. Paula da Fonseca

Fourier Transforms and Signal Analysis

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

Announcements. Binary Image Processing. Binary System Summary. Histogram-based Segmentation. How do we select a Threshold?

Mu lt i s p e c t r a l

Empirical Parameterization of the Antenna Aperture Illumination Pattern

No Brain Too Small PHYSICS

Wide field polarization calibration in the image plane using the Allen Telescope Array

Sampling, Aliasing, & Mipmaps

arxiv: v1 [astro-ph.im] 7 Jul 2018

Challenges in Detecting & Tracking Moving Objects with Synthetic Aperture Radar (SAR)

TEAMS National Competition Middle School Version Photometry Solution Manual 25 Questions

Formulas of possible interest

Workhorse ADCP Multi- Directional Wave Gauge Primer

CS334: Digital Imaging and Multimedia Edges and Contours. Ahmed Elgammal Dept. of Computer Science Rutgers University

ALMA simulations Rosita Paladino. & the Italian ARC

Image Processing. Filtering. Slide 1

Diffraction. Single-slit diffraction. Diffraction by a circular aperture. Chapter 38. In the forward direction, the intensity is maximal.

Limited view X-ray CT for dimensional analysis

Chapter 36. Diffraction. Dr. Armen Kocharian

XRDUG Seminar III Edward Laitila 3/1/2009

Adaptive selfcalibration for Allen Telescope Array imaging

SSW, Radio, X-ray, and data analysis

Do It Yourself 8. Polarization Coherence Tomography (P.C.T) Training Course

INTERFERENCE. where, m = 0, 1, 2,... (1.2) otherwise, if it is half integral multiple of wavelength, the interference would be destructive.

Filtering, scale, orientation, localization, and texture. Nuno Vasconcelos ECE Department, UCSD (with thanks to David Forsyth)

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

Calibration of a portable interferometer for fiber optic connector endface measurements

Visualization & the CASA Viewer

Computer Vision I - Basics of Image Processing Part 1

Imaging Supermassive Black Holes with the Event Horizon Telescope

Introduction to Digital Image Processing

PHY132 Introduction to Physics II Class 5 Outline:

Transcription:

Lecture 17 Reprise: dirty beam, dirty image. Sensitivity Wide-band imaging Weighting Uniform vs Natural Tapering De Villiers weighting Briggs-like schemes

Reprise: dirty beam, dirty image. Fourier inversion of V times the sampling function S gives the dirty image I D : I D ( ) ( ) ( ) 2πi( ul+ vm) l, m dudvv u, v Su, v e This is related to the true sky image I by: ( l, m) = I ( l, m) Bl ( m) I, D The dirty beam B is the FT of the sampling function: ( ) ( ) 2πi( ul+ vm), m dudvsu, v e Bl (Can get B by setting all the V to 1, then FT.)

Reprise: l and m Remember that l = sin θ. θ is the angle from the phase centre. Direction of phase centre. l Direction of source. θ For small l, l ~ θ (in radians of course). m is similar but for the orthogonal direction.

Sensitivity Image noise standard deviation (for the weaksource case) is (for natural weighting) σ I = I rms k A ( N 1) t ν N here is the number of antennas. e Note that A e is further decreased by correlator effects for example by 2/π if 1-bit digitization is used. N T 2 total Actual sensitivity (minimum detectable source flux) is different for different sizes of source. Due to the absence of baselines < the minimum antenna separation, an interferometer is generally poor at imaging large-scale structure.

Wide-band imaging. How can we increase UV coverage? we could get more baselines if we moved the antennas!

but it is simpler to change the observing wavelength. λ eg λ/2

With many wavelengths we have many baselines, and, effectively, many antennas.

A simulated example. The full visibility function V(u,v) (real part only shown). A familiar pattern of sources Red positive; blue negative. (I ve taken some liberties here obviously the stars of the Southern Cross are not strong radio sources I ve also rescaled their angular separations.) 21/43 Talk at Nagoya University IMS Oct 2009

Snapshot sampling of V is poor. Antenna spacings from KAT-7. 22/43 Talk at Nagoya University IMS Oct 2009

Aperture synthesis via the Earth s rotation. For this technique to work perfectly, all sources must be constant over time. Antenna spacings from KAT-7. Dirty image D is the true sky brightness map I, convolved with the dirty beam B. 23/43 Talk at Nagoya University IMS Oct 2009

Frequency synthesis. For this technique to work perfectly, all sources must not only be constant over time, but must also have the same spectra. Antenna spacings from KAT-7. Bandwidth 5 to 6 GHz. The final image is still not as clean as we would like 24/43 Talk at Nagoya University IMS Oct 2009

Narrow vs broad-band: UV coverage 16 x 1 MHz 2000 x 1 MHz Merlin, δ=+35 emerlin, δ=+35

Narrow vs broad-band - without noise: 16 x 1 MHz 2000 x 1 MHz

Narrow vs broad-band - with noise: 16 x 1 MHz 2000 x 1 MHz SNR of each visibility = 15%.

Weighting: or how to shape the dirty beam. Why should we weight the visibilities before transforming to the sky plane? Because the uneven distribution of samples of V means that the dirty beam has lots of ripples or sidelobes, which can extend a long way out. These can hide fainter sources. Even if we can subtract the brighter sources, there are always errors in our knowledge of the dirty beam shape. If there must be some residual, the smoother and lower it is, the better.

Weighting There are usually far more short than long baselines. The distribution of baselines also nearly always has a hole in the middle. Baseline length

Weighting A crude example: This bin has 1 sample. This bin has 84 samples.

Weighting What do we get if we leave the visibilities alone? The resulting dirty beam will be broad ( low resolution), because there are so many more visibility samples at small (u,v) than large (u,v). BUT, if the uncertainties are the same for every visibility, leaving them unweighted (ie, all weights W j,k =1) gives the lowest noise in the image. This is called natural weighting. The easiest other thing to do is set W j,k =1/(the number of visibilities in the j,kth grid cell). This is called uniform weighting. Then optionally multiply everything by a Gaussian: Called tapering.

Natural vs uniform: Natural weighting Uniform weighting

The resulting dirty images: Natural weighting Uniform weighting

But if we add in some noise... Natural weighting Uniform weighting SNR of each visibility = 0.7%.

Tradeoff This sort of tradeoff, between increasing resolution on the one hand and sensitivity on the other, is unfortunately typical in interferometry.

Some other recent ideas: 1. Scheme by Mattieu de Villiers (new, not yet published SA work): Weight by inverse of density of samples. 2. My own contribution: Iterative optimization. Has the effect of rounding the weight distribution to feather out sharp edges in the field of weights. Haven t got the bugs out of it yet. Densely packed samples are down-weighted. Ideal smooth weight function (Fourier inverse of desired PSF) Isolated samples get weighted higher so that the average approaches the ideal.

Weighting schemes: Simulated e-merlin data. 400 x 5 MHz channels; ν av = 6 GHz; t int = 10 s; δ = +30 Iterative best fit outside 20-pixel radius Uniform Tapered uniform

Dirty beam images (absolute values). Iterative best fit outside 20-pixel radius 20 Uniform Tapered uniform

Comparison slices through the DIs: Natural (narrow-band) Natural Uniform Uniform Optimized for r>10 Optimized

More on iterated weights: r = 10

But real data is noisy SNR of each visibility = 5.

One could think of other feathering schemes. 1. Multiply visibilities with a vignetting function of time and frequency, eg 2. Aips task IMAGR parameter UVBOX: effectively smooths the weight function. See also D Briggs PhD thesis.

MeerKAT tapering schemes NASSP Masters 5003F - Computational