2011
DOI: 10.1086/662075
|View full text |Cite
|
Sign up to set email alerts
|

Image Co-Addition with Temporally Varying Kernels

Abstract: Large, multi-frequency imaging surveys, such as the Large Synaptic Survey Telescope (LSST), need to do near-real time analysis of very large datasets. This raises a host of statistical and computational problems where standard methods do not work. In this paper, we study a proposed method for combining stacks of images into a single summary image, sometimes referred to as a template. This task is commonly referred to as image coaddition. In part, we focus on a method proposed in Kaiser (2004), which outlines a… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
10
0

Year Published

2017
2017
2020
2020

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(10 citation statements)
references
References 10 publications
0
10
0
Order By: Relevance
“…There are several methods of tackling the image coaddition problem. Apart from such approaches as Lucky Imaging or Fourier-based methods for combining stacks of images (Homrighausen et al 2011), the pixelwise statistics techniques stand out among the commonly found approach of PSF homogenization (see Zackay & Ofek 2017 for a recent review of these techniques). To a first approximation, we disregard image convolution to the worst seeing before coadding because it alters the information contained in the image, degrades the PSF of almost the whole input image set, amplifies the background noise at high frequencies, creates correlated artefacts.…”
Section: Image Coadditionmentioning
confidence: 99%
“…There are several methods of tackling the image coaddition problem. Apart from such approaches as Lucky Imaging or Fourier-based methods for combining stacks of images (Homrighausen et al 2011), the pixelwise statistics techniques stand out among the commonly found approach of PSF homogenization (see Zackay & Ofek 2017 for a recent review of these techniques). To a first approximation, we disregard image convolution to the worst seeing before coadding because it alters the information contained in the image, degrades the PSF of almost the whole input image set, amplifies the background noise at high frequencies, creates correlated artefacts.…”
Section: Image Coadditionmentioning
confidence: 99%
“…There are several methods of tackling the image coaddition problem. Apart from such approaches as Lucky Imaging or Fourier-based methods for combining stacks of images (Homrighausen et al 2011), the pixelwise statistics techniques stand out among the commonly found approach of PSF homogenization (see Zackay & Ofek 2017 for a recent review of these techniques). To a first approximation, we disregard image convolution to the worst seeing before coadding because it alters the information contained in the image, degrades the PSF of almost the whole input image set, amplifies the background noise at high frequencies, and creates correlated noise artefacts.…”
Section: Image Coadditionmentioning
confidence: 99%
“…There are multiple ways to solve for the PSF, Harmeling et al [10] proposes using the LBFGS-B Algorithm [6], Homrighausen proposes a "Fourier deconvolution" method [12] and Fish et al [9] proposes simply using the same update formula for the estimation of the PSF as for updating the model image. The latter is possible since the convolution, f * x, is commutative, meaning that if we can use an update formula to solve for the model, we must also be able to rewrite it for the PSF.…”
Section: Deconvolution As Likelihood Optimizationmentioning
confidence: 99%
“…Most of these techniques rely on a variation of an iterative deconvolution using a known point spread function (PSF). The main difficulty with such methods is preventing numerical degeneracies caused by the presence of noise and poorly constrained parameters [12]. Even more challenging is when the PSF is unknown.…”
Section: Introductionmentioning
confidence: 99%