source: trunk/MagicSoft/TDAS-Extractor/Criteria.tex@ 6709

Last change on this file since 6709 was 6666, checked in by hbartko, 20 years ago
*** empty log message ***
File size: 9.1 KB
Line 
1\section{Criteria for the Optimal Signal Extraction}
2
3The goal for the optimal signal reconstruction algorithm is to compute an unbiased estimate of the strength and arrival time of the
4Cherenkov signal with the highest possible resolution for all signal intensities. The MAGIC telescope has been optimized to
5lower the energy treshold of observation in any respect. Particularly the choice for an FADC system has been made with an eye on the
6possibility to extract the smallest possible signals from air showers. It would be inconsequent not to continue the optimization procedure
7in the signal extraction algorithms and the subsequent image cleaning.
8\par
9In the traditional image analysis, one takes the decision whether the extracted signal of a certain pixel is considered as signal or background.
10Those considered as signal are further used to compute the image parameters while the background ones are simply rejected. The calculation
11of the second moments of the image ``ellipse'' usually fails when applied to un-cleaned images, therefore the decision is yes or
12no\footnote{This restriction is not necessary any more in all advanced analyses using likelihood fits to the images or fourier transforms. Thereby any bias of the reconstructed signal leads to potentially wrong results.}.
13Moreover,
14already low contributions of mis-estimated background can degrade the resolution of the image parameters considerably. If one wants to
15lower the threshold for signal recognition, it is therefore mandatory to increase the efficiency with which the background is recognized as
16such. If the background resolution is bad, the signal threshold goes up and vice versa.
17
18Also an accurate determination of the signal arrival time may help to distinguish between signal and background. The signal arrival times vary smoothly from pixel to pixel while the background noise is randomly distributed in time. Therefore it must be insured that the reconstructed arrival time corresponds to the same reconstructed pulse as the reconstructed charge.
19
20\par
21One cuts on the probability that the reconstructed charge is due to background. This yields a lower reconstructed signal limit for an event
22being considered as signal at all. The lower the limit (keeping constant the background probability), the lower the analyzed energy
23threshold.
24\par
25Furthermore, the algorithm must be stable with respect to changes
26in observation conditions and background levels and between signals obtained from gamma or hadronic showers or from muons.
27
28Also the needed computing time is of concern.
29
30\subsection{Bias and Mean-squared Error}
31
32Consider a large number of identical signals $S$, corresponding to a fixed number of photo-electrons. By applying a signal extractor
33we obtain a distribution of estimated signals $\widehat{S}$ (for fixed $S$ and
34fixed background fluctuations $BG$). The distribution of the quantity
35
36\begin{equation}
37X = \widehat{S}-S
38\end{equation}
39
40has the mean $B$ and the resolution $R$ defined as:
41
42\begin{eqnarray}
43 B \ \ \ \ = \ \ \ \ \ \ <X> \ \ \ \ \ &=& \ \ <\widehat{S}> \ -\ S\\
44 R^2 \ \ \ \ = \ <(X-B)^2> &=& \ Var[\widehat{S}] \label{eq:def:r}\\
45 MSE \ = \ \ \ \ \ <X^2> \ \ \ \ &=& \ Var[\widehat{S}] +\ B^2
46\end{eqnarray}
47
48The parameter $B$ is also called the {\textit{\bf BIAS}} of the estimator and $MSE$
49the {\textit{\bf MEAN-SQUARED ERROR}} which combines the variance of $\widehat{S}$ and
50the bias. Both depend generally on the size of $S$ and the background fluctuations $BG$,
51thus: $B = B(S,BG)$ and $MSE = MSE(S,BG)$.
52
53\par
54Usually, one measures easily the parameter $R$, but needs the $MSE$ for statistical analysis (e.g.
55in the image cleaning).
56However, only in case of a vanishing bias $B$, the two numbers are equal. Otherwise,
57the bias $B$ has to be known beforehand.
58
59In the case of MAGIC the background fluctuations are due to electronics noise and the PMT response to LONS. The signals from the latter background are not distinguishable from the Cherenkov signals. Thus each algorithm which searches for the signals inside the recorded FADC time slices will have a bias. In case of no Cherenkov signal it will reconstruct the largest noise pulse.
60
61Note that every sliding window extractor, the digital filter and the spline extractor have a bias,
62especially at low or vanishing signals $S$, but usually a much smaller $R$ and in many cases a smaller $MSE$ than the fixed window
63extractors.
64
65\subsection{Linearity}
66
67The reconstructed signal should be proportional to the total integrated charge in the FADCs
68due to the PMT pulse from the Cherenkov signal. A deviation from linearity is usually obtained in the following cases:
69
70\begin{itemize}
71\item At very low signals, the bias causes as too high reconstructed signal (positive $X$).
72\item At very high signals, the FADC system goes into saturation and the reconstructed signal becomes too low (negative $X$).
73\item Any error in the inter-calibration between the high- and low-gain acquisition channels yield an effective deviation from
74linearity.
75\end{itemize}
76
77The linearity is very important for the reconstruction of the shower energy and further the obtained energy spectra from the
78observed sources.
79
80
81\subsection{Low Gain Extraction}
82
83Because of the peculiarities of the MAGIC data acquisition system, the extraction of the low-gain pulse is somewhat critical:
84The low-gain pulse shape differs significantly from the high-gain shape. Due to the analogue delay line, the low-gain pulse is
85wider and the integral charge is distributed over a longer time window.
86
87The time delay between high-gain
88and low-gain pulse is small, thus for large pulses,
89mis-interpretations between the tails of the high-gain pulse and the low-gain pulse might occur. Moreover, the total recorded time window
90is relatively small and for late high-gain pulses, parts of the low-gain pulse might already reach out of the recorded FADC window.
91A good extractor must be
92stably extracting the low-gain pulse without being confused by the above points. This is especially important since the low-gain
93pulses are due to the large signals with a big impact on the image parameters, especially the size parameter.
94
95
96\subsection{Stability}
97
98The signal extraction algorithms has to reconstruct stably the charge for different types of pulses
99with different intrinsic pulse shapes and backgrounds:
100
101\begin{itemize}
102\item{cosmics signals from gammas, hadrons and muons}
103\item{calibration pulses from different LED color pulsers}
104\item{pulse generator pulses in the pulpo setup}
105\end{itemize}
106
107An important point is the difference between the pulse shapes of the calibration and Cherenkov signals. It has to be ensured that the
108computed calibration factor between the reconstructed charge in FADC counts and photo electrons for calibration events
109is valid for signals from Cherenkov photons.
110
111
112
113\subsection{Intrinsic Differences between Calibration and Cosmics Pulses}
114
115The calibration pulse reconstruction sets two important constraints to the signal extractor:
116
117\begin{enumerate}
118\item As the standard calibration uses the F-Factor method in order to reconstruct the number of impinging photo-electrons,
119the resolution of the extractor must be constant for different signal heights, especially between the case: $S=0$ and
120$S = 40\pm 7$~photo-electrons which is the default intensity of the current calibration pulses. This constraint is especially
121non-trivial for extractors searching the signal in a sliding window.
122\item As the calibration pulses are slightly wider than the cosmics pulses, the obtained conversion factors must not be affected by
123the difference in pulse shape. This puts severe contraints on all extractors which do not integrate the whole pulse or take the pulse
124shape into account.
125\end{enumerate}
126
127\subsection{Reconstruction Speed}
128
129Depending on the reconstruction algorithm the signal reconstruction can take a significant amount of CPU time.
130Especially the more sophisticated signal extractors can be time consuming which search for the position of the Cherenkov signals
131in the recorded FADC time slices and perform a fit to these samples. At any case, the extractor should not be significantly slower than
132the reading and writing routines of the MARS software.
133
134Thus, for an online-analysis a different extraction algorithm might be chosen than for the final most accurate
135reconstruction of the signals offline.
136
137\subsection{Applicability for Different Sampling Speeds / No Pulse Shaping.}
138
139The current read-out system of the MAGIC telescope~\cite{Magic-DAQ} with 300~MSamples/s is relatively slow compared to the fast pulses of
140about 2\,ns FWHM of Cherenkov pulses.
141To acquire the pulse shape an artificial pulse shaping to about 6.5\,ns FWHM is used. Thereby also more night sky background light
142is integrated which acts as noise.
143
144For 2 ns FWHM fast pulses a 2 GSamples/s FADC provides at least 4 sampling points. This permits a reasonable reconstruction of the pulse shape. First prototype tests with fast digitization systems for MAGIC have been successfully conducted \cite{GSamlesFADC}. The signals have been reconstructed within the common MAGIC Mars software framework.
145
146%%% Local Variables:
147%%% mode: latex
148%%% TeX-master: "MAGIC_signal_reco"
149%%% End:
Note: See TracBrowser for help on using the repository browser.