2002 January 28 AURA Software Workshop 2002 1 The MATPHOT Algorithm for Digital Point Spread Function CCD Stellar Photometry Kenneth J. Mighell National.

Slides:



Advertisements
Similar presentations
The Maximum Likelihood Method
Advertisements

Instabilities of SVD Small eigenvalues -> m+ sensitive to small amounts of noise Small eigenvalues maybe indistinguishable from 0 Possible to remove small.
Statistical Techniques I EXST7005 Simple Linear Regression.
Chapter 7 Statistical Data Treatment and Evaluation
CmpE 104 SOFTWARE STATISTICAL TOOLS & METHODS MEASURING & ESTIMATING SOFTWARE SIZE AND RESOURCE & SCHEDULE ESTIMATING.
Nonlinear Regression Ecole Nationale Vétérinaire de Toulouse Didier Concordet ECVPT Workshop April 2011 Can be downloaded at
Aspects of Conditional Simulation and estimation of hydraulic conductivity in coastal aquifers" Luit Jan Slooten.
Visual Recognition Tutorial
Experimental Uncertainties: A Practical Guide What you should already know well What you need to know, and use, in this lab More details available in handout.
The Simple Linear Regression Model: Specification and Estimation
Motion Analysis (contd.) Slides are from RPI Registration Class.
Least Square Regression
Curve-Fitting Regression
Mobile Intelligent Systems 2004 Course Responsibility: Ola Bengtsson.
Least Square Regression
Course AE4-T40 Lecture 5: Control Apllication
Chi Square Distribution (c2) and Least Squares Fitting
Algorithm Evaluation and Error Analysis class 7 Multiple View Geometry Comp Marc Pollefeys.
FIN357 Li1 The Simple Regression Model y =  0 +  1 x + u.
Linear and generalised linear models Purpose of linear models Least-squares solution for linear models Analysis of diagnostics Exponential family and generalised.
CISE-301: Numerical Methods Topic 1: Introduction to Numerical Methods and Taylor Series Lectures 1-4: KFUPM.
Modern Navigation Thomas Herring
Regression Eric Feigelson. Classical regression model ``The expectation (mean) of the dependent (response) variable Y for a given value of the independent.
Principles of the Global Positioning System Lecture 10 Prof. Thomas Herring Room A;
Principles of Least Squares
Least-Squares Regression
Physics 114: Lecture 15 Probability Tests & Linear Fitting Dale E. Gary NJIT Physics Department.
Machine Learning CUNY Graduate Center Lecture 3: Linear Regression.
Chapter 15 Modeling of Data. Statistics of Data Mean (or average): Variance: Median: a value x j such that half of the data are bigger than it, and half.
CISE-301: Numerical Methods Topic 1: Introduction to Numerical Methods and Taylor Series Lectures 1-4: KFUPM CISE301_Topic1.
Non-Linear Models. Non-Linear Growth models many models cannot be transformed into a linear model The Mechanistic Growth Model Equation: or (ignoring.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Part 4 Curve Fitting.
Non-Linear Models. Non-Linear Growth models many models cannot be transformed into a linear model The Mechanistic Growth Model Equation: or (ignoring.
Modern Navigation Thomas Herring
Chapter 21 R(x) Algorithm a) Anomaly Detection b) Matched Filter.
Geographic Information Science
Model Construction: interpolation techniques 1392.
Curve-Fitting Regression
2004 January 27Mathematical Challenges of Using Point Spread Function Analysis Algorithms in Astronomical ImagingMighell 1 Mathematical Challenges of Using.
SUPA Advanced Data Analysis Course, Jan 6th – 7th 2009 Advanced Data Analysis for the Physical Sciences Dr Martin Hendry Dept of Physics and Astronomy.
ECE 8443 – Pattern Recognition LECTURE 10: HETEROSCEDASTIC LINEAR DISCRIMINANT ANALYSIS AND INDEPENDENT COMPONENT ANALYSIS Objectives: Generalization of.
1 Leonardo Pinheiro da Silva Corot-Brazil Workshop – October 31, 2004 Corot Instrument Characterization based on in-flight collected data Leonardo Pinheiro.
Colorado Center for Astrodynamics Research The University of Colorado 1 STATISTICAL ORBIT DETERMINATION ASEN 5070 LECTURE 11 9/16,18/09.
April 2001 OPTICON workshop in Nice 1 PSF-fitting with SExtractor Emmanuel BERTIN (TERAPIX)
April 2001 OPTICON workshop in Nice 1 The PSF homogenization problem in large imaging surveys Emmanuel BERTIN (TERAPIX)
Data Modeling Patrice Koehl Department of Biological Sciences National University of Singapore
Non-Linear Models. Non-Linear Growth models many models cannot be transformed into a linear model The Mechanistic Growth Model Equation: or (ignoring.
Principal Component Analysis (PCA)
R. Kass/W03 P416 Lecture 5 l Suppose we are trying to measure the true value of some quantity (x T ). u We make repeated measurements of this quantity.
Numerical Analysis – Data Fitting Hanyang University Jong-Il Park.
Richard Kass/F02P416 Lecture 6 1 Lecture 6 Chi Square Distribution (  2 ) and Least Squares Fitting Chi Square Distribution (  2 ) (See Taylor Ch 8,
Computacion Inteligente Least-Square Methods for System Identification.
In conclusion the intensity level of the CCD is linear up to the saturation limit, but there is a spilling of charges well before the saturation if.
Environmental Data Analysis with MatLab 2 nd Edition Lecture 22: Linear Approximations and Non Linear Least Squares.
Probabilistic Robotics Bayes Filter Implementations Gaussian filters.
CWR 6536 Stochastic Subsurface Hydrology Optimal Estimation of Hydrologic Parameters.
The simple linear regression model and parameter estimation
Part 5 - Chapter
LECTURE 11: Advanced Discriminant Analysis
ASEN 5070: Statistical Orbit Determination I Fall 2015
PSG College of Technology
Statistical Methods For Engineers
Chi Square Distribution (c2) and Least Squares Fitting
Basics of Photometry.
Where did we stop? The Bayes decision rule guarantees an optimal classification… … But it requires the knowledge of P(ci|x) (or p(x|ci) and P(ci)) We.
6.5 Taylor Series Linearization
5.2 Least-Squares Fit to a Straight Line
Propagation of Error Berlin Chen
Propagation of Error Berlin Chen
CISE-301: Numerical Methods Topic 1: Introduction to Numerical Methods and Taylor Series Lectures 1-4: KFUPM CISE301_Topic1.
Presentation transcript:

2002 January 28 AURA Software Workshop The MATPHOT Algorithm for Digital Point Spread Function CCD Stellar Photometry Kenneth J. Mighell National Optical Astronomy Observatory

2002 January 28 AURA Software Workshop This work is supported by a grant from the National Aeronautics and Space Administration (NASA), Order No. S F, which was awarded by the Long-Term Space Astrophysics (LTSA) program of NASA’s Office of Space Science.

2002 January 28AURA Software Workshop Analytical Point Spread Functions A simple model of a CCD observation of a single star on a non-flat background may be created with a tilted plane and some analytical function representing the sampled PSF (  ), where the sampled (pixelized ) PSF is defined as which is the volume integral over the i th pixel of the unsampled PSF (  ).

2002 January 28AURA Software Workshop Analytical Gaussian PSFs A Gaussian distribution is a good model for the PSF of a ground-based CCD observation since the central core of a ground-based stellar profile is approximately Gaussian (King 1971). The following is thus a good model of the unsampled PSF of a ground-based CCD observation of a single isolated star on a non-flat background:

2002 January 28AURA Software Workshop Levenberg-Marquardt Method Let us assume that we have a calibrated charge- coupled device (CCD) observation with N pixels and that z i is the intensity in electrons of the i th pixel at the location of (x i,y i ) with an error of  i. Let m(x,y;p 1,…,p M ) be a model of the intensity values that has two coordinates (x,y) and and M parameters. The measure of the goodness of fit between the data and the model, called chi-square, is defined as

2002 January 28AURA Software Workshop where  is a variable damping factor which is used to modify the principle diagonal of the Hessian matrix, The key idea of the Levenberg-Marquardt method of non- linear least-squares estimation consists of minimizing   (p) by (repeatedly) solving (and minimizing) the following equation for  the correction vector  and  ij is the Kronecker delta function (Levenberg 1944, practical algorithm for  Marquardt 1963).

2002 January 28AURA Software Workshop By defining  as a new matrix of order M x M,

2002 January 28AURA Software Workshop and  as a new vector of order M, one then has the computationally useful form of a set of M equations with M unknowns: The Levenberg-Marquardt method of non-linear least squares minimization performs an optimum interpolation between the Taylor series method and the gradient method (Marquardt 1963).

2002 January 28AURA Software Workshop The Levenberg-Marquardt method requires the computation of the partial derivatives of the observational model with respect to all free parameters. The partial derivatives of the simple Gaussian model are as follows:

2002 January 28AURA Software Workshop

2002 January 28AURA Software Workshop

2002 January 28AURA Software Workshop and finally,

2002 January 28AURA Software Workshop After the optimal parameter vector ( p 0 ) has been determined (with set to zero), the covariance matrix, may then be calculated. If the off-diagonal elements of the covariance matrix are negligibly small, then the standard (rms) errors can be estimated to be where  j is the standard error associated with the j th parameter.

2002 January 28AURA Software Workshop matphot1  =21.38

2002 January 28AURA Software Workshop matphot1  =21.38

2002 January 28AURA Software Workshop PSF-Fitting Performance Model where is “effective background area” defined as the reciprocal of the volume integral of the square of the PSF. By definition, the effective background area for a critically- sampled Gaussian PSF is  = 4  (1) 2 (  12.57) px 2. The WFPC2 sharpness parameter is the reciprocal of . Photometry: ^ important yet frequently ignored!

2002 January 28AURA Software Workshop King (1983) identifies  as the “equivalent-noise area” and notes that the numerical integration of a realistic ground- based stellar profile gives an equivalent area that is 2.45 times greater than that of a Gaussian stellar profile. Position Errors (Relative Astrometry): This astrometric performance model is more general than Irwin’s (1985) astrometric analysis of Gaussian PSFs.

2002 January 28AURA Software Workshop matphot1  =21.38

2002 January 28AURA Software Workshop matphot1  =21.38

2002 January 28AURA Software Workshop What do the partial derivatives look like? A constant of one … A tilted plane in x … A tilted plane in y … … the sampled PSF … difference of 2 Gaussians in x … difference of 2 Gaussians in y

2002 January 28AURA Software Workshop Position Partial Derivatives The mathematics of determining the position partial derivatives of the observational model with respect to the x and y direction vectors is exactly the same with analytical or digital PSFs. The implementation methodology, however, is significantly different. The position partial derivatives of digital PSFs can be determined using numerical differentiation techniques on the digital PSF. Numerical experiments have shown that the following five- point differentiation formula works well with digital PSFs: MATPHOT currently uses the above formula to compute position partial derivatives.

2002 January 28AURA Software Workshop matphot1  =21.38

2002 January 28AURA Software Workshop matphot1  =21.38

2002 January 28AURA Software Workshop matphot1  =21.38 The differentiation method error is < 1/16 th that due to photon noise!

2002 January 28AURA Software Workshop A Critique of Traditional PSF-Fitting… Most CCD stellar photometric reduction packages use analytical functions to represent the stellar PSF. These PSF-fitting programs generally compute all the major partial derivatives of the observational model by differentiating the volume integral of the analytical function representing the unsampled PSF over a CCD pixel. Deviations of the real-world PSF from the analytical PSF are typically stored in a residual matrix.

2002 January 28AURA Software Workshop Diffraction rings and spikes can provide a lot of valuable information about the position of a star, yet data about such common observational effects generally resides only in the residual matrix. The information in the residual matrix is typically ignored during in the PSF-fitting process except at the final step involving the determination of the chi-square goodness-of-fit between the data (the CCD observation) and the observational model (when the intensity–scaled residual matrix is added to the analytical PSF just before the goodness-of-fit is computed). What if we throw out the analytical PSF and only use the residual matrix to describe the Point Spread Function?

2002 January 28AURA Software Workshop Digital Point Spread Functions A digital Point Spread Function is a digital representation of the sampled PSF consisting of a numerical table (e.g., a matrix or a FITS image) instead of an analytical function. The MATPHOT algorithm for digital PSF-fitting CCD stellar photometry uses digital PSFs instead of analytical PSFs.

2002 January 28AURA Software Workshop How does one move a PSF? Analytical PSFs: Just compute the PSF at the desired location in the observational model. Digital PSFs: Take the reference digital PSF and shift it to the desired location using a perfect 2-d interpolation function. OK… but how is that done in practice? MATPHOT currently uses the following 21-pixel-wide damped sinc function to interpolate sampled PSFs: Note: The 2-d sinc function is separable in x and y.

2002 January 28AURA Software Workshop matphot2  =21.38

2002 January 28AURA Software Workshop Critically-sampled PSFs?

2002 January 28AURA Software Workshop matphot2  =13.58

2002 January 28AURA Software Workshop matphot2  =13.58 Yikes!

2002 January 28AURA Software Workshop TANSTAFL * * There Ain’t No Such Thing As (a) Free Lunch

2002 January 28AURA Software Workshop Over-sampled PSFs Accurate CCD stellar photometry may be obtained with under-sampled or critically-sampled data if over- sampled PSFs are used. For example, a 2x2 over-sampled PSF uses 4 subpixels to describe every true pixel of the CCD observation. Every subpixel of a 2x2 over-sampled PSF has twice the spatial resolution of the true pixels. MATPHOT uses over-sampled PSFs to do accurate CCD stellar photometry with under-sampled observations.

2002 January 28AURA Software Workshop matphot2  =13.58

2002 January 28AURA Software Workshop matphot2  =13.58 OK!

2002 January 28AURA Software Workshop Under-sampled PSFs?

2002 January 28AURA Software Workshop matphot2  =6.23 Yuk!

2002 January 28AURA Software Workshop matphot2  =6.23 OK!

2002 January 28AURA Software Workshop

2002 January 28AURA Software Workshop Ugly (real-world) PSFs?

2002 January 28AURA Software Workshop Next Generation Space Telescope 8-m TRW-concept arcsec/pixel  =31.05 PSF by John Krist

2002 January 28AURA Software Workshop matphot2  =31.05

2002 January 28AURA Software Workshop matphot2  =31.05

2002 January 28AURA Software Workshop How can I get MATPHOT? Get the 2001DEC27 release of my MXTOOLS package for IRAF at