Iterative unfolding with the Richardson-Lucy algorithm

Abstract

The Richardson-Lucy unfolding approach is simple and excellently performing. It efficiently suppresses artificial high frequency contributions and permits to introduce known features of the true distribution. An algorithm to fix the number of iterations to an optimal value has been developed and tested with five different types of distributions, with different event numbers and with different binnings. The influence of the starting distribution has been studied. A simple way to document the unfolding result such that it can be compared to theoretical predictions is proposed.

revised, Table 1 extended, references improved + minor modifications

References in corpus (2)

• Improved iterative Bayesian unfolding
• Solving inverse problems with the unfolding program TRUEE: Examples in astroparticle physics

Cited by in corpus (8)

• Invertible Networks or Partons to Detector and Back Again
• Returning CP-Observables to The Frames They Belong
• Modelling the Spatial Distribution and Origin of CO Gas in Debris Disks
• Measurement of the ${}^{18}$Ne($\alpha ,p$)${}^{21}$Na reaction with ANASEN at $E_{c.m.}=$ 2.5-4 MeV
• Unfolding with Gaussian Processes
• Convergence and error propagation results on a linear iterative unfolding method
• A data-driven convergence criterion for iterative unfolding of smeared spectra
• TeV-PeV neutrino-nucleon cross section measurement with 5 years of IceCube data