Zé Vinícius bio photo

Zé Vinícius

I convert maths into code :)

Email GitHub Twitter LinkedIn Instagram Speakerdeck Google Scholar Skype Stackoverflow

Week one of the community bonding period is over!

So far, I mostly read photutils source code and I would say I am getting very well acquainted with it, mainly with the PSF photometry code.

Of course, the most interesting thing last week was my very first meeting with mentors via Skype. They are amazing! I'm sure I'm going to have a very fun summer this year :)

So, in that meeting, we did discuss my first tasks for the project, and they are be the following:

  1. Write a consistent API proposal for an interface that performs point spread function photometry in crowded fields
  2. Provide uncertainties on fitted parameters (Astropy issue #1827)

For the first task, my goal should be to mimic DAOPHOT. DAOPHOT was chosen primarily because it is the standard software package to perform stellar photometry in crowded fields, and because it works :).

In the first versions of DAOPHOT one would basically iterate over FIND-GROUP-NSTAR-SUBSTAR-FIND-GROUP... until no more sources are found. FIND is a routine that basically searches for potential stars in a given frame. This routine is already implemented in photutils, namely, daofind. It returns, amongst other things, an estimate of the centroid coordinates and the brightness (which may be further passed to the psf photometry function). GROUP is used to group (:o) stars which are "close enough" from each other. For instance, assume that FIND has found N stars in a frame, then GROUP takes those initial estimates from FIND and computes the distances from each star to every other one, and whenever one star is "close enough" to another they are assigned to the same group. If, however, one star is not "close enough" to any other, then the star in question is fitted by a single model. After grouping, the NSTAR routine is used to simultaneously fit the stars in every group. Further, the SUBSTAR routine is applied to subtracted all fitted stars from the given frame and FIND is again applied to search for any remaining star. This process is then iterated until no more stars are found. Quite simple, but not simpler, isn't it? :)

The second task is crucial and I have some insigths. Although in a stellar field image the photon counts in each pixel follow basically a Poisson distribution, the photon counts in each pixel can be quite well approximated by a Gaussian distribution in the limit of a large number of photon counts (see Central Limit Theorem or here), so that one can obtain quite satisfactory results using least squares.

The least squares fitter is a particular result of the Maximum Likelihood estimator in case that the observations are Gaussian distributed. Hence, one way to compute the uncertainties on each of the fitted parameters is to analitically construct the Fisher Information Matrix (see, e.g., here), which depends only on the derivatives of PSF model with respect to each of the fitted parameters. While this is a good solution, it may be not the more convinient.

The other way is to take for free an estimate of the inverse of the Hessian matrix that is returned by some optimization routines like scipy.optimize.minimize and scipy.optimize.curve_fit.

It seems rather obvious that the latter approach is the easier to go, however I'm not sure how actually stable it is. See here, for instance.

For this second week of the community bonding period I'm going to sketch an implementation for the GROUP and NSTAR routines and play with them a bit to have some more insights.

Other thing to do is to compare the uncertainties obtained experimentally with those provided by scipy.optimize.minimize or scipy.optimize.curve_fit. This may be achieved by generating an image with, let's say, 1000 isolated stars, and comparing the mean of the uncertainties provided by scipy.optimize.minimize with the mean of the squared errors between the estimated centroids and the actual known values.

Now, to work! :)