Thomas Kitching Bayesian Shape Measurement and Galaxy Model Fitting Thomas Kitching Lance Miller, Catherine Heymans, Alan Heavens, Ludo Van Waerbeke Miller.

Slides:



Advertisements
Similar presentations
Pattern Recognition and Machine Learning
Advertisements

Antony Lewis Institute of Astronomy, Cambridge
Introduction to Monte Carlo Markov chain (MCMC) methods
Pattern Recognition and Machine Learning
Use of Kalman filters in time and frequency analysis John Davis 1st May 2011.
NASSP Masters 5003F - Computational Astronomy Lecture 5: source detection. Test the null hypothesis (NH). –The NH says: let’s suppose there is no.
Clouds and the Earth’s Radiant Energy System NASA Langley Research Center / Atmospheric Sciences Methodology to compare GERB- CERES filtered radiances.
Markov-Chain Monte Carlo
FastICA as a LOFAR-EoR Foreground Cleaning Technique Filipe Abdalla and Emma Woodfield University College London with Saleem Zaroubi, Vibor Jelic, Panos.
The REGLENS method Rachel Mandelbaum STEP Workshop 2007 Collaborators: Christopher Hirata, Uros Seljak.
Galaxy and Mass Power Spectra Shaun Cole ICC, University of Durham Main Contributors: Ariel Sanchez (Cordoba) Steve Wilkins (Cambridge) Imperial College.
Visual Recognition Tutorial
Computing the Posterior Probability The posterior probability distribution contains the complete information concerning the parameters, but need often.
July 7, 2008SLAC Annual Program ReviewPage 1 Weak Lensing of The Faint Source Correlation Function Eric Morganson KIPAC.
Edge detection. Edge Detection in Images Finding the contour of objects in a scene.
Bayesian Analysis of X-ray Luminosity Functions A. Ptak (JHU) Abstract Often only a relatively small number of sources of a given class are detected in.
Image processing. Image operations Operations on an image –Linear filtering –Non-linear filtering –Transformations –Noise removal –Segmentation.
Motion Analysis (contd.) Slides are from RPI Registration Class.
SYSTEMS Identification
A Two Level Monte Carlo Approach To Calculating
1/49 EF 507 QUANTITATIVE METHODS FOR ECONOMICS AND FINANCE FALL 2008 Chapter 9 Estimation: Additional Topics.
Radial Basis Function Networks
TOPLHCWG. Introduction The ATLAS+CMS combination of single-top production cross-section measurements in the t channel was performed using the BLUE (Best.
Two and a half problems in homogenization of climate series concluding remarks to Daily Stew Ralf Lindau.
PATTERN RECOGNITION AND MACHINE LEARNING
Model-fitting E. BertinDES Munich meeting 05/ Automated model fitting in DESDM E.Bertin (IAP)
Weak Lensing 3 Tom Kitching. Introduction Scope of the lecture Power Spectra of weak lensing Statistics.
Science Impact of Sensor Effects or How well do we need to understand our CCDs? Tony Tyson.
Cosmic shear results from CFHTLS Henk Hoekstra Ludo van Waerbeke Catherine Heymans Mike Hudson Laura Parker Yannick Mellier Liping Fu Elisabetta Semboloni.
Model Inference and Averaging
PROBABILITY (6MTCOAE205) Chapter 6 Estimation. Confidence Intervals Contents of this chapter: Confidence Intervals for the Population Mean, μ when Population.
Lecture 12 Statistical Inference (Estimation) Point and Interval estimation By Aziza Munir.
Methods in Gravitational Shear Measurements Michael Stefferson Mentor: Elliott Cheu Arizona Space Grant Consortium Statewide Symposium Tucson, Arizona.
Module 1: Statistical Issues in Micro simulation Paul Sousa.
Cosmological studies with Weak Lensing Peak statistics Zuhui Fan Dept. of Astronomy, Peking University.
CSC321: 2011 Introduction to Neural Networks and Machine Learning Lecture 11: Bayesian learning continued Geoffrey Hinton.
Black hole binaries are standard sirens
Brian Macpherson Ph.D, Professor of Statistics, University of Manitoba Tom Bingham Statistician, The Boeing Company.
Weak Lensing 2 Tom Kitching. Recap Lensing useful for Dark energy Dark Matter Lots of surveys covering 100’s or 1000’s of square degrees coming online.
DES Cluster Simulations and the ClusterSTEP Project M.S.S. Gill (OSU / CBPF / SLAC) In collaboration with: J. Young, T.Eifler, M.Jarvis, P.Melchior and.
Refining Photometric Redshift Distributions with Cross-Correlations Alexia Schulz Institute for Advanced Study Collaborators: Martin White.
INTRODUCTION TO Machine Learning 3rd Edition
EBEx foregrounds and band optimization Carlo Baccigalupi, Radek Stompor.
STEP4 Konrad Kuijken Leiden. Back to basics? STEP1,2,3 –‘end-to-end’ tests for constant-shear images –What causes discrepancies? Selection bias PSF modelling.
1  The Problem: Consider a two class task with ω 1, ω 2   LINEAR CLASSIFIERS.
Additional Topics in Prediction Methodology. Introduction Predictive distribution for random variable Y 0 is meant to capture all the information about.
SYSTEMS Identification Ali Karimpour Assistant Professor Ferdowsi University of Mashhad Reference: “System Identification Theory For The User” Lennart.
- 1 - Overall procedure of validation Calibration Validation Figure 12.4 Validation, calibration, and prediction (Oberkampf and Barone, 2004 ). Model accuracy.
3rd International Workshop on Dark Matter, Dark Energy and Matter-Antimatter Asymmetry NTHU & NTU, Dec 27—31, 2012 Likelihood of the Matter Power Spectrum.
ETHEM ALPAYDIN © The MIT Press, Lecture Slides for.
ECE 8443 – Pattern Recognition ECE 8527 – Introduction to Machine Learning and Pattern Recognition Objectives: Occam’s Razor No Free Lunch Theorem Minimum.
Lecture 8 Source detection NASSP Masters 5003S - Computational Astronomy
Machine Learning 5. Parametric Methods.
6. Population Codes Presented by Rhee, Je-Keun © 2008, SNU Biointelligence Lab,
1 Chapter 8: Model Inference and Averaging Presented by Hui Fang.
The Unscented Particle Filter 2000/09/29 이 시은. Introduction Filtering –estimate the states(parameters or hidden variable) as a set of observations becomes.
August 23, 2007JPL WL from space meeting1 Shear measurements in simulated SNAP images with realistic PSFs Håkon Dahle, Stephanie Jouvel, Jean-Paul Kneib,
Measuring shear using… Kaiser, Squires & Broadhurst (1995) Luppino & Kaiser (1997)
Combining Lensing with SNIa and CMB Sampling the Posterior Martin Kilbinger IAP Paris Martin Kilbinger IAP Paris Toronto, 13 June 2008 Upcoming lensing.
Computacion Inteligente Least-Square Methods for System Identification.
Dave Goldberg GLCW8 The Ohio State University June 2, 2007 Students: Sanghamitra Deb Vede Ramdass Where is the Information in Cluster Lenses?
Density Estimation in R Ha Le and Nikolaos Sarafianos COSC 7362 – Advanced Machine Learning Professor: Dr. Christoph F. Eick 1.
Introduction We consider the data of ~1800 phenotype measurements Each mouse has a given probability distribution of descending from one of 8 possible.
ETHEM ALPAYDIN © The MIT Press, Lecture Slides for.
Markov Chain Monte Carlo in R
Chapter 7. Classification and Prediction
Ch3: Model Building through Regression
Jean Ballet, CEA Saclay GSFC, 31 May 2006 All-sky source search
Probabilistic Robotics
Intrinsic Alignment of Galaxies and Weak Lensing Cluster Surveys Zuhui Fan Dept. of Astronomy, Peking University.
Presentation transcript:

Thomas Kitching Bayesian Shape Measurement and Galaxy Model Fitting Thomas Kitching Lance Miller, Catherine Heymans, Alan Heavens, Ludo Van Waerbeke Miller et al. (2007) accepted, MNRAS (background and algorithm) arXiv: Kitching et al. (2007) in prep. (further development and STEP analysis) Thomas Kitching Lance Miller, Catherine Heymans, Alan Heavens, Ludo Van Waerbeke Miller et al. (2007) accepted, MNRAS (background and algorithm) arXiv: Kitching et al. (2007) in prep. (further development and STEP analysis)

Thomas Kitching Introduction  Want to calculate the full (posterior) probability for each galaxy and use this to calculate the shear  Bayesian shape measurement in general  Bayesian vs. Frequentist  Shear Sensitivity  Model Fitting  Why model fitting?  The lensfit algorithm/implementation  Results for individual galaxy shapes  Results for shear measurement (STEP-1) ,  c,  Want to calculate the full (posterior) probability for each galaxy and use this to calculate the shear  Bayesian shape measurement in general  Bayesian vs. Frequentist  Shear Sensitivity  Model Fitting  Why model fitting?  The lensfit algorithm/implementation  Results for individual galaxy shapes  Results for shear measurement (STEP-1) ,  c,

Thomas Kitching Bayesian Shape Measurement  Applies to any shape measurement method if p(e) can be determined  For a sample of galaxy with intrinsic distribution f(e) probability distribution of the data is  For each galaxy, i (from data y i ) generate a Bayesian posterior probability distribution:  Applies to any shape measurement method if p(e) can be determined  For a sample of galaxy with intrinsic distribution f(e) probability distribution of the data is  For each galaxy, i (from data y i ) generate a Bayesian posterior probability distribution:

Thomas Kitching  Want the true distribution of intrinsic ellipticities to be obtained from the data by considering the summation over the data:  Insrinsic p(e) recovered if  (y|e) = L (e|y), P (e)=f(e)  Want the true distribution of intrinsic ellipticities to be obtained from the data by considering the summation over the data:  Insrinsic p(e) recovered if  (y|e) = L (e|y), P (e)=f(e)

Thomas Kitching  Using we have  The other definition can e used but extra non-linear terms in have to be included  Calculating  We know p(e), and hence for each galaxy  For N galaxies we have  Using we have  The other definition can e used but extra non-linear terms in have to be included  Calculating  We know p(e), and hence for each galaxy  For N galaxies we have

Thomas Kitching  Frequentist : can shapes be measured using Likelihoods alone?  Bayesian and Likelihoods measure different things  Suppose x has an intrinsic normal distribution of variance a=0.3  For each input we measure a normal distribution with variance b=0.4  Frequentist : can shapes be measured using Likelihoods alone?  Bayesian and Likelihoods measure different things  Suppose x has an intrinsic normal distribution of variance a=0.3  For each input we measure a normal distribution with variance b=0.4 Bayesian or Frequentist?

Thomas Kitching  Likelihood unbiased in input to output regression  No way to account for the bias from the likelihood alone  Also with no prior the hard bound |e|<1 can affect likelihood estimators  Bayesian unbiased in output to input regression  Best estimate of input values  Distribution narrower but each point has an uncertainty  If if there are effects due to the hard |e|<1 boundary the prior should contain this information  Likelihood unbiased in input to output regression  No way to account for the bias from the likelihood alone  Also with no prior the hard bound |e|<1 can affect likelihood estimators  Bayesian unbiased in output to input regression  Best estimate of input values  Distribution narrower but each point has an uncertainty  If if there are effects due to the hard |e|<1 boundary the prior should contain this information

Thomas Kitching  Even Bayesian methods will have bias especially in the case that a zero-shear prior is used  However this bias can be calculated from the posterior probability  Even Bayesian methods will have bias especially in the case that a zero-shear prior is used  However this bias can be calculated from the posterior probability e PriorPosterior e true

Thomas Kitching Shear Sensitivity & Prior  Since we do not know the Prior distribution we are forced to adopt a zero-shear prior  For low S/N galaxies the prior could dominate resulting in no recoverable shear, as in all methods  However the magnitude of this effect can be determined  Can define a weighted estimate of the shear as  Where we call the shear sensitivity  In Bayesian case this can be approximated by  Since we do not know the Prior distribution we are forced to adopt a zero-shear prior  For low S/N galaxies the prior could dominate resulting in no recoverable shear, as in all methods  However the magnitude of this effect can be determined  Can define a weighted estimate of the shear as  Where we call the shear sensitivity  In Bayesian case this can be approximated by

Thomas Kitching

 If the model is a good fit to the data then maximum S/N of parameters should be obtained  If model is a good fit then all information about image is contained in the model  Use realistic models based on real galaxy image profiles  Long history of model fitting for non-lensing and lensing applications  Galfit  Kuijken, Im2shape  Problem is that we need a computationally fast model fitting algorithm for lensing surveys that uses realistic galaxy image profiles  If the model is a good fit to the data then maximum S/N of parameters should be obtained  If model is a good fit then all information about image is contained in the model  Use realistic models based on real galaxy image profiles  Long history of model fitting for non-lensing and lensing applications  Galfit  Kuijken, Im2shape  Problem is that we need a computationally fast model fitting algorithm for lensing surveys that uses realistic galaxy image profiles Model Fitting

Thomas Kitching lensfit  Measure PSF  create a model  convolve with PSF  determine the likelihood of the fit  Simplest galaxy model (if form is fixed) has 6 free parameters  Brightness, size, ellipticity (x2), position (x2)  It is straightforward to marginalise over position and brightness if the model fitting is done in Fourier space  Key advances and differences  FAST model fitting technique  Bias is taken into account in a Bayesian way  Measure PSF  create a model  convolve with PSF  determine the likelihood of the fit  Simplest galaxy model (if form is fixed) has 6 free parameters  Brightness, size, ellipticity (x2), position (x2)  It is straightforward to marginalise over position and brightness if the model fitting is done in Fourier space  Key advances and differences  FAST model fitting technique  Bias is taken into account in a Bayesian way

Thomas Kitching  Choice of model is not key, we assume a de Vaucouleurs profile  Free parameters are then length scale (r), e 1, e 2  We use a grid in (e 1,e 2 )  Could use MCMC approach  Found convergence for  e=0.1  <100 points  We adopt a uniform prior for the distribution of galaxy scale-length.  This could be replaced by a prior close to the actual distribution of galaxy sizes, although such a prior would need to be magnitude- dependent  Tested the algorithm  Convergence in e and r resolutions  Robust to galaxy position error up to a + 10 pixel random offset  Choice of model is not key, we assume a de Vaucouleurs profile  Free parameters are then length scale (r), e 1, e 2  We use a grid in (e 1,e 2 )  Could use MCMC approach  Found convergence for  e=0.1  <100 points  We adopt a uniform prior for the distribution of galaxy scale-length.  This could be replaced by a prior close to the actual distribution of galaxy sizes, although such a prior would need to be magnitude- dependent  Tested the algorithm  Convergence in e and r resolutions  Robust to galaxy position error up to a + 10 pixel random offset

Isolate a sub-image around a galaxy and FT Take each possible model in turn, multiply by the transposed PSF and model transforms and carry out the cross correlation Measure the amplitude, width and position of the maximum of the resulting cross- correlation, and hence evaluate the likelihood for this model and galaxy Sum the posterior probabilities Numerically marginalise over the length scale Repeat for each galaxy Estimate rms noise in each pixel from entire image Estimate PSF on same pixel scale as models and FT Generate set of models in 3D grid of e 1, e 2, r and FT Measure nominal galaxy positions

Thomas Kitching Tests on STEP1  Use a grid sampling of  e=0.1  Found numerical convergence  Use 32x32 sub images sizes  Optimal for close pairs rejection and fitting every galaxy with the sub image  Close pairs rejection if two galaxies lie in a sub image  Working on a S/N based rejection criterion  We assume the pixel noise is uncorrelated, which is appropriate for shot noise in CCD detectors  The PSF was created by stacking stars from the simulation allowing sub-pixel registration using sinc- function interpolation  Method of PSF characterisation not crucial as long as the PSF is a good match to the actual PSF  Sub pixel variation in PSF not taken into account may lead to high spatial frequencies which are not included  Use a grid sampling of  e=0.1  Found numerical convergence  Use 32x32 sub images sizes  Optimal for close pairs rejection and fitting every galaxy with the sub image  Close pairs rejection if two galaxies lie in a sub image  Working on a S/N based rejection criterion  We assume the pixel noise is uncorrelated, which is appropriate for shot noise in CCD detectors  The PSF was created by stacking stars from the simulation allowing sub-pixel registration using sinc- function interpolation  Method of PSF characterisation not crucial as long as the PSF is a good match to the actual PSF  Sub pixel variation in PSF not taken into account may lead to high spatial frequencies which are not included

Thomas Kitching Prior  Use the lens0 STEP1 input catalogue (zero- sheared) to generate the input prior for each STEP1 image and psf  In reality could iterate the method especially since in reality the intrinsic p(e) will be approximately zero-centered  The method should return the intrinsic p(e)  Calculate p(e)  Substitute p(e) for the prior and iterate until convergence is reached  Use the lens0 STEP1 input catalogue (zero- sheared) to generate the input prior for each STEP1 image and psf  In reality could iterate the method especially since in reality the intrinsic p(e) will be approximately zero-centered  The method should return the intrinsic p(e)  Calculate p(e)  Substitute p(e) for the prior and iterate until convergence is reached

Thomas Kitching  Use lens1, psf0 as an example  Some individual galaxy probability surfaces  Use lens1, psf0 as an example  Some individual galaxy probability surfaces Individual galaxy ellipticities Mag<22Mag>22

Thomas Kitching  psf 0 lens 1 Mag>22 Mag<22

Thomas Kitching  The prior is recovered  In this zero-shear case where the prior is the actual input distribution  The prior is recovered  In this zero-shear case where the prior is the actual input distribution  Speed  Approximately 1 second per galaxy on 1 2GHz CPU  Trivially Parallelisable (e.g. 1 galaxy per CPU)  Scales with square of number of e 1,e 2 points sampled  Speed  Approximately 1 second per galaxy on 1 2GHz CPU  Trivially Parallelisable (e.g. 1 galaxy per CPU)  Scales with square of number of e 1,e 2 points sampled Mag<22Mag>22

Thomas Kitching Shear Results for STEP-1  Full STEP-1 64 images, 6 PSF, 5 shear values  Present, and  c values  Importance of knowing the shear sensitivity  Example psf1  Average bias of 0.88 much larger effect for faint galaxies  Full STEP-1 64 images, 6 PSF, 5 shear values  Present, and  c values  Importance of knowing the shear sensitivity  Example psf1  Average bias of 0.88 much larger effect for faint galaxies

Thomas Kitching  Results for psf1  1 m = c =  2 m = c =

Thomas Kitching  =   c =  Best performing linear method  We have performed iterations BUT  This was used to correct coding errors only  NOT to tune the method or fix ad hoc parameters  =   c =  Best performing linear method  We have performed iterations BUT  This was used to correct coding errors only  NOT to tune the method or fix ad hoc parameters

Thomas Kitching  =   c =  = 0.46  Results are limited by PSF characterisation  Results expected to improve if PSF is known more accurately  Sub pixel variation?  =   c =  = 0.46  Results are limited by PSF characterisation  Results expected to improve if PSF is known more accurately  Sub pixel variation?

Thomas Kitching Conclusions  Given a shape measurement method that can produce p(e) Bayesian shape measurement has the potential to yield an unbiased shear estimator  Even in reality, assuming a zero-sheared prior, the shear sensitivity can be calculated to correct for any bias  We presented a fast model fitting method lensfit  lensfit can accurately find individual galaxy ellipticities  Performance is good in the STEP1 simulations with small values of m, c and q  Better PSF characterisation could improve results  Given a shape measurement method that can produce p(e) Bayesian shape measurement has the potential to yield an unbiased shear estimator  Even in reality, assuming a zero-sheared prior, the shear sensitivity can be calculated to correct for any bias  We presented a fast model fitting method lensfit  lensfit can accurately find individual galaxy ellipticities  Performance is good in the STEP1 simulations with small values of m, c and q  Better PSF characterisation could improve results

Thomas Kitching

Radio STEP  SKA could produce a very competitive weak lensing survey  50 km baseline implies angular resolution ≈ 1 arcsec at 1.4 GHz  The shear map constructed from continuum shape measurements of star-forming disk galaxies  A subset of spectroscopic redshifts from HI detections  22 per arcmin 2 at 0.3 μJy, 20,000 sqdeg survey  No photometric redshift uncertainties  Have software ‘MEQtrees’  Can simulate realistic Radio images  With realistic Radio PSF’s  Note that the PSF is complicated but deterministic (apart from atmospherics)  Radio STEP  Can measure shapes directly in the (u,v) Fourier plane  Using the simulated Radio images  Progressively complicated PSF’s  SKA could produce a very competitive weak lensing survey  50 km baseline implies angular resolution ≈ 1 arcsec at 1.4 GHz  The shear map constructed from continuum shape measurements of star-forming disk galaxies  A subset of spectroscopic redshifts from HI detections  22 per arcmin 2 at 0.3 μJy, 20,000 sqdeg survey  No photometric redshift uncertainties  Have software ‘MEQtrees’  Can simulate realistic Radio images  With realistic Radio PSF’s  Note that the PSF is complicated but deterministic (apart from atmospherics)  Radio STEP  Can measure shapes directly in the (u,v) Fourier plane  Using the simulated Radio images  Progressively complicated PSF’s