Simultaneous PSF Matching via Dual Kernel Optimization
Standard point spread function (PSF) matching algorithms consider one image as the reference and aim to find a convolution kernel such that, when applied to the reference image, the PSFs of the reference and non-reference images are matched. This method works well if one image is a degraded version of the other. However, this is not always the case: if the PSFs of the two images have different orientations or shapes, a simple convolution of one of the images does not lead to a satisfactory match. While this can be trivially solved by convolving the first PSF with the second and vice-versa, this results in unnecessarily large PSFs. In this paper, we present a new algorithm, Dual Kernel Optimization (DKO), that simultaneously solves for two convolution kernels, one for each image, such that the PSFs match and the sizes of the kernels are minimized. This results in a minimally-degraded final set of PSFs. Since this problem is highly degenerate, we use Stochastic Gradient Langevin Dynamics (SGLD) which rigorously explores the parameter space and converges on the globally-optimal solution.We discuss the algorithmic challenges for this problem and the modifications to standard SGLD used to constrain it. Finally, we include a discussion on the application of this methodology to real-world images, including cases where the PSF varies over the field of view.