1997
DOI: 10.1117/12.267860
|View full text |Cite
|
Sign up to set email alerts
|

Unfolding of particle spectra

Abstract: A review of methods currently used to unfold particle spectra from measured pulse height distributions or other detector readings is given. Algorithms based on the least-squares principle and the principle of maximum entropy are reviewed. By the examples presented, it is shown that most of the detection systems reveal ill-conditioned problems.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
20
0

Year Published

1999
1999
2024
2024

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 35 publications
(20 citation statements)
references
References 5 publications
(8 reference statements)
0
20
0
Order By: Relevance
“…Each optimi- The small peaks can be caused by noise in the measurement, approximations in the shape of the peaks, or by the optimization procedure. 8 These small peaks are not relevant for our investigation. Figure 2 shows the progress of an optimization routine.…”
Section: ͑1͒mentioning
confidence: 95%
“…Each optimi- The small peaks can be caused by noise in the measurement, approximations in the shape of the peaks, or by the optimization procedure. 8 These small peaks are not relevant for our investigation. Figure 2 shows the progress of an optimization routine.…”
Section: ͑1͒mentioning
confidence: 95%
“…We assess the performance of proposed algorithm (referred to as MCMC in the remainder of the paper) with GRAVEL [9], [41], [47], Tik (Tikhonov regularization with L-curve method) [39] and PIDAL [36] applied to simulated neutron sources. We consider three sources: 2.5 MeV monoenergetic neutron source, 252 Cf and 241 AmBe.…”
Section: Unfolding Results and Discussionmentioning
confidence: 99%
“…The uncertainty associated with the simulated bins was calculated as the square root of the counts. GRAVEL stopping criterion is either the user-defined chi-squared per degree of freedom (PDF) or the input maximum number of iterations (to stop the algorithm after a given number of iterations if the first criterion is not satisfied yet) [41]. In our case, the number of degrees of freedom is M and the chi-squared-PDF was set to one, while the maximum number of iterations was 6000.…”
Section: Existing Unfolding Approachesmentioning
confidence: 99%
“…It is clear that one cannot cover all the methods that have been proposed, but it is hoped that many of the methods of interest are discussed here. There are a number of articles that give an overview of unfolding in the context of neutron spectrometry (Cross and Ing, 1987;Matzke, 1997;Matzke, 2003;Routti and Sandberg 1985;Sekimoto and Nobuhiro, 1982). Chapter 18 of Ref.…”
Section: Unfolding Methodsmentioning
confidence: 99%