For the other image we simulate a variable PSF by taking the sum of 2 Gaussians with different widths and a relative weighting which is a function of the position in the image. We also introduce a normalization factor for conservation of the flux.
For the spatial variation we take:
Where w is the size of the simulated image.
The resulting images are presented in Fig. 1.
In our images the Poisson noise can be extremely well approximated
locally by a Gaussian distribution with
.
However this
is not true for the reference image, since it has been transformed by
convolution. The noise in the convolved image can nonetheless be
estimated in a straightforward way. The convolution will result in the
combination of different Gaussian distributions, with different
s and weights. Using the same notation where I is the image to
fit and R is the reference image, we now define the IC to be the
reference image convolved with the kernel solution,
The combination of the two
Gaussian distributions will result in a Gaussian distribution, and the
resulting
of the distribution can be estimated by calculating
the variance:
![]() |
Figure 5:
Histograms of the normalized deviations in the subtracted images presented in
Fig. 4. Left is the
histogram for constant kernel solution, and right is the histogram for
a fit of kernel variation to order 2. The dashed curve is Gaussian
with ![]() ![]() |
Image registration is performed by calculating a polynomial transform from the
positions of bright objects. However, there is no guarantee that this
procedure is optimal.
In case the image registration to the reference frame is not perfect,
a simple translation can be taken into account with a constant kernel solution.
However more complex features like differential rotation, or
differential distortion between the images cannot be corrected
with constant kernel solution. But they can be corrected with non-constant
kernel solution. We will illustrate this fact by simulating differential
rotation between 2 images. We keep the reference image we had already
generated for the previous simulations, and make another one by rotating the
frames with respect to its center with an amplitude of 0.7 pixel from one
corner to the other corner of the frame. The results of subtraction are
presented in Fig. 4. The systematic pattern due to rotation appears clearly
in the image with a constant kernel solution, while it is completely removed
in the fit of a solution with a spatial variation of order 2. This is well
confirmed by the
analysis which shows that an optimal result
has been reached with the non-constant kernel solution (see Fig. 5).
One last problem that can be encountered in astronomical images is
under-sampling. To test the sensitivity of the method to under-sampling,
we simulate a pair of very under-sampled images. We take
(FWHM = 1.17 pixels) for the reference and
(FWHM = 1.67 pixels) for the other image. Since our goal is just to test
the effect of under-sampling only, we perform image subtraction with
constant kernel solution. The resulting normalized
distribution is presented in Fig. 6. The result is as good as in the previous
simulations. One may wonder why under-sampling does not induce any problems,
since under-sampling should affect the convolution with the basis vectors.
It is true that individually the least-square vectors which are obtained with
under-sampled images will differ from the well sampled vectors. However one
should not forget that the best solution is constructed by taking linear
combinations of the least-square vectors. Even if the vectors are slightly
different from the well sample vectors, an optimal linear combination of
these vectors can still be made.
Copyright The European Southern Observatory (ESO)