A new algorithm for difference image analysis

218Citations
Citations of this article
43Readers
Mendeley users who have this article in their library.

Abstract

In the context of difference image analysis (DIA), we present a new method for determining the convolution kernel matching a pair of images of the same field. Unlike the standard DIA technique which involves modelling the kernel as a linear combination of basis functions, we consider the kernel as a discrete pixel array and solve for the kernel pixel values directly using linear least squares. The removal of basis functions from the kernel model is advantageous for a number of compelling reasons. First, it removes the need for the user to specify such functions, which makes for a much simpler user application and avoids the risk of an inappropriate choice. Secondly, basis functions are constructed around the origin of the kernel coordinate system, which requires that the two images are perfectly aligned for an optimal result. The pixel kernel model is sufficiently flexible to correct for image misalignments, and in the case of a simple translation between images, image resampling becomes unnecessary. Our new algorithm can be extended to spatially varying kernels by solving for individual pixel kernels in a grid of image subregions and interpolating the solutions to obtain the kernel at any one pixel. © 2008 The Author. Journal compilation © 2008 RAS.

Cite

CITATION STYLE

APA

Bramich, D. M. (2008, May). A new algorithm for difference image analysis. Monthly Notices of the Royal Astronomical Society: Letters. https://doi.org/10.1111/j.1745-3933.2008.00464.x

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free