Metraipolis › archive › dc_a045e4c91d45

Simultaneous PSF Matching via Dual Kernel Optimization — arXiv:2609.29860

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.29860
License (as archived)
CC0-1.0
Archived
2026-10-08T08:03:13.860Z
SHA-256 of the archived text
e0d71ebdbae54ad080a254f01cb6ed159021ac97093e5c5103d7455ccfff871e
Stable URL of this page
https://metraipolis.com/documento/dc_a045e4c91d45

How to cite

Simultaneous PSF Matching via Dual Kernel Optimization — arXiv:2609.29860 — arXiv (en), https://arxiv.org/abs/2609.29860 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a045e4c91d45 (Metraipolis archive dc_a045e4c91d45, sha256 e0d71ebdbae54ad080a254f01cb6ed159021ac97093e5c5103d7455ccfff871e)
BibTeX
@misc{dca045e4c91d45,
  title = {Simultaneous PSF Matching via Dual Kernel Optimization — arXiv:2609.29860},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.29860},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a045e4c91d45; sha256 e0d71ebdbae54ad080a254f01cb6ed159021ac97093e5c5103d7455ccfff871e},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.29860. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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 this http URL 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.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-25 in astro-ph.IM).
Categorie arXiv: Instrumentation and Methods for Astrophysics (astro-ph.IM).
Pagina del lavoro: https://arxiv.org/abs/2609.29860 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T07:19:40.469Z dalla pagina https://arxiv.org/catchup/astro-ph.IM/2026-09-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).