| 1 | /* ======================================================================== *\
|
|---|
| 2 | !
|
|---|
| 3 | ! *
|
|---|
| 4 | ! * This file is part of MARS, the MAGIC Analysis and Reconstruction
|
|---|
| 5 | ! * Software. It is distributed to you in the hope that it can be a useful
|
|---|
| 6 | ! * and timesaving tool in analysing Data of imaging Cerenkov telescopes.
|
|---|
| 7 | ! * It is distributed WITHOUT ANY WARRANTY.
|
|---|
| 8 | ! *
|
|---|
| 9 | ! * Permission to use, copy, modify and distribute this software and its
|
|---|
| 10 | ! * documentation for any purpose is hereby granted without fee,
|
|---|
| 11 | ! * provided that the above copyright notice appear in all copies and
|
|---|
| 12 | ! * that both that copyright notice and this permission notice appear
|
|---|
| 13 | ! * in supporting documentation. It is provided "as is" without express
|
|---|
| 14 | ! * or implied warranty.
|
|---|
| 15 | ! *
|
|---|
| 16 | !
|
|---|
| 17 | !
|
|---|
| 18 | ! Author(s): Thomas Bretz, 12/2000 <mailto:tbretz@astro.uni-wuerzburg.de>
|
|---|
| 19 | ! Author(s): Harald Kornmayer, 1/2001
|
|---|
| 20 | ! Author(s): Nadia Tonello, 4/2003 <mailto:tonello@mppmu.mpg.de>
|
|---|
| 21 | !
|
|---|
| 22 | ! Copyright: MAGIC Software Development, 2000-2003
|
|---|
| 23 | !
|
|---|
| 24 | !
|
|---|
| 25 | \* ======================================================================== */
|
|---|
| 26 |
|
|---|
| 27 | /////////////////////////////////////////////////////////////////////////////
|
|---|
| 28 | //
|
|---|
| 29 | // MImgCleanStd
|
|---|
| 30 | //
|
|---|
| 31 | // The Image Cleaning task selects the pixels you use for the Hillas
|
|---|
| 32 | // parameters calculation.
|
|---|
| 33 | //
|
|---|
| 34 | // There are two methods to make the selection: the standard one, as done
|
|---|
| 35 | // in the analysis of CT1 data, and the democratic one, as suggested by
|
|---|
| 36 | // W.Wittek. The number of photo-electrons of a pixel is compared with the
|
|---|
| 37 | // pedestal RMS of the pixel itself (standard method) or with the average
|
|---|
| 38 | // RMS of the inner pixels (democratic method).
|
|---|
| 39 | // In both cases, the possibility to have a camera with pixels of
|
|---|
| 40 | // different area is taken into account.
|
|---|
| 41 | // The too noisy pixels can be recognized and eventally switched off
|
|---|
| 42 | // (Unmap: set blind pixels to UNUSED) separately, using the
|
|---|
| 43 | // MBlindPixelCalc Class. In the MBlindPixelCalc class there is also the
|
|---|
| 44 | // function to replace the value of the noisy pixels with the interpolation
|
|---|
| 45 | // of the content of the neighbors (SetUseInterpolation).
|
|---|
| 46 | //
|
|---|
| 47 | // Example:
|
|---|
| 48 | // ...
|
|---|
| 49 | // MBlindPixelCalc blind;
|
|---|
| 50 | // blind.SetUseInterpolation();
|
|---|
| 51 | // blind.SetUseBlindPixels();
|
|---|
| 52 | //
|
|---|
| 53 | // MImgCleanStd clean;
|
|---|
| 54 | // ...
|
|---|
| 55 | // tlist.AddToList(&blind);
|
|---|
| 56 | // tlist.AddToList(&clean);
|
|---|
| 57 | //
|
|---|
| 58 | // Look at the MBlindPixelCalc Class for more details.
|
|---|
| 59 | //
|
|---|
| 60 | // Starting point: default values ----------------------------------------
|
|---|
| 61 | //
|
|---|
| 62 | // When an event is read, before the image cleaning, all the pixels that
|
|---|
| 63 | // are in MCerPhotEvt are set as USED and NOT CORE. All the pixels belong
|
|---|
| 64 | // to RING number 1 (like USED pixels).
|
|---|
| 65 | // Look at MCerPhotPix.h to see how these informations of the pixel are
|
|---|
| 66 | // stored.
|
|---|
| 67 | // The default cleaning METHOD is the STANDARD one and the number of the
|
|---|
| 68 | // rings around the CORE pixel it analyzes is 1. Look at the Constructor
|
|---|
| 69 | // of the class in MImgCleanStd.cc to see (or change) the default values.
|
|---|
| 70 | //
|
|---|
| 71 | // Example: To modify this setting, use the member functions
|
|---|
| 72 | // SetMethod(MImgCleanStd::kDemocratic) and SetCleanRings(UShort_t n).
|
|---|
| 73 | //
|
|---|
| 74 | // MImgCleanStd:CleanStep1 -----------------------------------------------
|
|---|
| 75 | //
|
|---|
| 76 | // The first step of cleaning defines the CORE pixels. The CORE pixels are
|
|---|
| 77 | // the ones which contain the informations about the core of the electro-
|
|---|
| 78 | // magnetic shower.
|
|---|
| 79 | // The ratio (A_0/A_i) is calculated from fCam->GetPixRatio(i). A_0 is
|
|---|
| 80 | // the area of the central pixel of the camera, A_i is the area of the
|
|---|
| 81 | // examined pixel. In this way, if we have a MAGIC-like camera, with the
|
|---|
| 82 | // outer pixels bigger than the inner ones, the level of cleaning in the
|
|---|
| 83 | // two different regions is weighted.
|
|---|
| 84 | // This avoids problems of deformations of the shower images.
|
|---|
| 85 | // The signal S_i and the pedestal RMS Prms_i of the pixel are called from
|
|---|
| 86 | // the object MCerPhotPix.
|
|---|
| 87 | // If (default method = kStandard)
|
|---|
| 88 | //Begin_Html
|
|---|
| 89 | // <img src="images/MImgCleanStd-f1.png">
|
|---|
| 90 | //End_Html
|
|---|
| 91 | // the pixel is set as CORE pixel. L_1 (n=1) is called "first level of
|
|---|
| 92 | // cleaning" (default: fCleanLvl1 = 3).
|
|---|
| 93 | // All the other pixels are set as UNUSED and belong to RING 0.
|
|---|
| 94 | // After this point, only the CORE pixels are set as USED, with RING
|
|---|
| 95 | // number 1.
|
|---|
| 96 | //
|
|---|
| 97 | // MImgCleanStd:CleanStep2 ----------------------------------------------
|
|---|
| 98 | //
|
|---|
| 99 | // The second step of cleaning looks at the isolated CORE pixels and sets
|
|---|
| 100 | // them to UNUSED. An isolated pixel is a pixel without CORE neighbors.
|
|---|
| 101 | // At the end of this point, we have set as USED only CORE pixels with at
|
|---|
| 102 | // least one CORE neighbor.
|
|---|
| 103 | //
|
|---|
| 104 | // MImgCleanStd:CleanStep3 ----------------------------------------------
|
|---|
| 105 | //
|
|---|
| 106 | // The third step of cleaning looks at all the pixels (USED or UNUSED) that
|
|---|
| 107 | // surround the USED pixels.
|
|---|
| 108 | // If the content of the analyzed pixel survives at the second level of
|
|---|
| 109 | // cleaning, i.e. if
|
|---|
| 110 | //Begin_Html
|
|---|
| 111 | // <img src="images/MImgCleanStd-f1.png">
|
|---|
| 112 | //End_Html
|
|---|
| 113 | // the pixel is set as USED. L_2 (n=2) is called "second level of cleaning"
|
|---|
| 114 | // (default:fCleanLvl2 = 2.5).
|
|---|
| 115 | //
|
|---|
| 116 | // When the number of RINGS to analyze is 1 (default value), only the
|
|---|
| 117 | // pixels that have a neighbor CORE pixel are analyzed.
|
|---|
| 118 | //
|
|---|
| 119 | // There is the option to decide the number of times you want to repeat
|
|---|
| 120 | // this procedure (number of RINGS analyzed around the core pixels = n).
|
|---|
| 121 | // Every time the level of cleaning is the same (fCleanLvl2) and the pixel
|
|---|
| 122 | // will belong to ring r+1, 1 < r < n+1. This is described in
|
|---|
| 123 | // MImgCleanStd:CleanStep4 .
|
|---|
| 124 | //
|
|---|
| 125 | // Dictionary and member functions ---------------------------------------
|
|---|
| 126 | //
|
|---|
| 127 | // Here there is the detailed description of the member functions and of
|
|---|
| 128 | // the terms commonly used in the class.
|
|---|
| 129 | //
|
|---|
| 130 | //
|
|---|
| 131 | // STANDARD CLEANING:
|
|---|
| 132 | // =================
|
|---|
| 133 | // This is the method used for the CT1 data analysis. It is the default
|
|---|
| 134 | // method of the class.
|
|---|
| 135 | // The number of photo-electrons of a pixel (S_i) is compared to the
|
|---|
| 136 | // pedestal RMS of the pixel itself (Prms_i). To have the comparison to
|
|---|
| 137 | // the same photon density for all the pixels, taking into account they
|
|---|
| 138 | // can have different areas, we have to keep in mind that the number of
|
|---|
| 139 | // photons that hit each pixel, goes linearly with the area of the pixel.
|
|---|
| 140 | // The fluctuations of the LONS are proportional to sqrt(A_i), so when we
|
|---|
| 141 | // compare S_i with Prms_i, only a factor sqrt(A_0/A_i) is missing to
|
|---|
| 142 | // have the same (N.photons/Area) threshold for all the pixels.
|
|---|
| 143 | //
|
|---|
| 144 | // !!WARNING: if noise independent from the
|
|---|
| 145 | // pixel size (example: electronic noise) is introduced,
|
|---|
| 146 | // then the noise fluctuations are no longer proportional
|
|---|
| 147 | // to sqrt(A_i), and then the cut value (for a camera with
|
|---|
| 148 | // pixels of different sizes) resulting from the above
|
|---|
| 149 | // procedure would not be proportional to pixel size as we
|
|---|
| 150 | // intend. In that case, democratic cleaning is preferred.
|
|---|
| 151 | //
|
|---|
| 152 | // If
|
|---|
| 153 | //Begin_Html
|
|---|
| 154 | // <img src="images/MImgCleanStd-f1.png">
|
|---|
| 155 | //End_Html
|
|---|
| 156 | // the pixel survives the cleaning and it is set as CORE (when L_n is the
|
|---|
| 157 | // first level of cleaning, fCleanLvl1) or USED (when L_n is the second
|
|---|
| 158 | // level of cleaning, fCleanLvl2).
|
|---|
| 159 | //
|
|---|
| 160 | // Example:
|
|---|
| 161 | //
|
|---|
| 162 | // MImgCleanStd clean;
|
|---|
| 163 | // //creates a default Cleaning object, with default setting
|
|---|
| 164 | // ...
|
|---|
| 165 | // tlist.AddToList(&clean);
|
|---|
| 166 | // // add the image cleaning to the main task list
|
|---|
| 167 | //
|
|---|
| 168 | //
|
|---|
| 169 | // DEMOCRATIC CLEANING:
|
|---|
| 170 | // ===================
|
|---|
| 171 | // You use this cleaning method when you want to compare the number of
|
|---|
| 172 | // photo-electons of each pixel with the average pedestal RMS of the
|
|---|
| 173 | // inner pixels (for the MAGIC camera they are the smaller ones):
|
|---|
| 174 | //Begin_Html
|
|---|
| 175 | // <img src="images/MImgCleanStd-f2.png">
|
|---|
| 176 | //End_Html
|
|---|
| 177 | // In this case, the simple ratio (A_0/A_i) is used to weight the level of
|
|---|
| 178 | // cleaning, because both the inner and the outer pixels (that in MAGIC
|
|---|
| 179 | // have a different area) are compared to the same pedestal RMS, coming
|
|---|
| 180 | // from the inner pixels.
|
|---|
| 181 | //
|
|---|
| 182 | // Make sure that you used a class calculating the MPedPhotCam which also
|
|---|
| 183 | // updated the contents of the mean values (Recalc) correctly.
|
|---|
| 184 | //
|
|---|
| 185 | //
|
|---|
| 186 | // PROBABILITY CLEANING
|
|---|
| 187 | // ====================
|
|---|
| 188 | // This method takes signal height (over signal noise) and arrival time
|
|---|
| 189 | // into account. Instead of comparing signal/Noise with cleaning level
|
|---|
| 190 | // one and two, we calculate
|
|---|
| 191 | // - P_ped: The probability that a signal is a pedestal (using
|
|---|
| 192 | // the signal height and the pedestal) For this probability the
|
|---|
| 193 | // same algorithm like in kScaled is used (which is a standard
|
|---|
| 194 | // cleaning which scales the noise with the mean noise of pixels
|
|---|
| 195 | // with the same size)
|
|---|
| 196 | // - P_sig: The probability that the signal corresponds to the pixel
|
|---|
| 197 | // with the highest signal. For this probability we use the
|
|---|
| 198 | // arrival time only.
|
|---|
| 199 | //
|
|---|
| 200 | // The cleaning now is done in levels of Probability (eg. 0.2, 0.05)
|
|---|
| 201 | // The meaning of the cleaning levels is essentially the same (the same cleaning
|
|---|
| 202 | // algorithm is used) but the cleaning is not done in levels of signal/noise
|
|---|
| 203 | // but in level of this probability.
|
|---|
| 204 | //
|
|---|
| 205 | // This probability is calculated as (1-P_ped)*P_sig
|
|---|
| 206 | //
|
|---|
| 207 | // Example:
|
|---|
| 208 | //
|
|---|
| 209 | // MImgCleanStd clean(0.2, 0.05);
|
|---|
| 210 | // clean.SetMethod(MImgCleanStd::kProbability);
|
|---|
| 211 | //
|
|---|
| 212 | //
|
|---|
| 213 | // ABSOLUTE CLEANING
|
|---|
| 214 | // =================
|
|---|
| 215 | // This method takes signal height (photons) times area ratio
|
|---|
| 216 | // ad the cleaning levels.
|
|---|
| 217 | //
|
|---|
| 218 | // The cleaning now is done in these levels (eg. 16, 20)
|
|---|
| 219 | // The meaning of the cleaning levels is essentially the same (the same cleaning
|
|---|
| 220 | // algorithm is used) but the cleaning is not done in different 'units'
|
|---|
| 221 | //
|
|---|
| 222 | // Example:
|
|---|
| 223 | //
|
|---|
| 224 | // MImgCleanStd clean(20, 16);
|
|---|
| 225 | // clean.SetMethod(MImgCleanStd::kAbsolulte);
|
|---|
| 226 | //
|
|---|
| 227 | //
|
|---|
| 228 | // Member Function: SetMethod()
|
|---|
| 229 | // ============================
|
|---|
| 230 | // When you call the MImgCleanStd task, the default method is kStandard.
|
|---|
| 231 | //
|
|---|
| 232 | // If you want to switch to the kDemocratic method you have to
|
|---|
| 233 | // call this member function.
|
|---|
| 234 | //
|
|---|
| 235 | // Example:
|
|---|
| 236 | //
|
|---|
| 237 | // MImgCleanStd clean;
|
|---|
| 238 | // //creates a default Cleaning object, with default setting
|
|---|
| 239 | //
|
|---|
| 240 | // clean.SetMethod(MImgCleanStd::kDemocratic);
|
|---|
| 241 | // //now the method of cleaning is changed to Democratic
|
|---|
| 242 | //
|
|---|
| 243 | //
|
|---|
| 244 | // FIRST AND SECOND CLEANING LEVEL
|
|---|
| 245 | // ===============================
|
|---|
| 246 | // When you call the MImgCleanStd task, the default cleaning levels are
|
|---|
| 247 | // fCleanLvl1 = 3, fCleanLvl2 = 2.5. You can change them easily when you
|
|---|
| 248 | // create the MImgCleanStd object.
|
|---|
| 249 | //
|
|---|
| 250 | // Example:
|
|---|
| 251 | //
|
|---|
| 252 | // MImgCleanStd clean(Float_t lvl1,Float_t lvl2);
|
|---|
| 253 | // //creates a default cleaning object, but the cleaning levels are now
|
|---|
| 254 | // //lvl1 and lvl2.
|
|---|
| 255 | //
|
|---|
| 256 | // RING NUMBER
|
|---|
| 257 | // ===========
|
|---|
| 258 | // The standard cleaning procedure is such that it looks for the
|
|---|
| 259 | // informations of the boundary part of the shower only on the first
|
|---|
| 260 | // neighbors of the CORE pixels.
|
|---|
| 261 | // There is the possibility now to look not only at the firs neighbors
|
|---|
| 262 | // (first ring),but also further away, around the CORE pixels. All the new
|
|---|
| 263 | // pixels you can find with this method, are tested with the second level
|
|---|
| 264 | // of cleaning and have to have at least an USED neighbor.
|
|---|
| 265 | //
|
|---|
| 266 | // They will be also set as USED and will be taken into account during the
|
|---|
| 267 | // calculation of the image parameters.
|
|---|
| 268 | // The only way to distinguish them from the other USED pixels, is the
|
|---|
| 269 | // Ring number, that is bigger than 1.
|
|---|
| 270 | //
|
|---|
| 271 | // Example: You can decide how many rings you want to analyze using:
|
|---|
| 272 | //
|
|---|
| 273 | // MImgCleanStd clean;
|
|---|
| 274 | // //creates a default cleaning object (default number of rings =1)
|
|---|
| 275 | // clean.SetCleanRings(UShort_t r);
|
|---|
| 276 | // //now it looks r times around the CORE pixels to find new pixels with
|
|---|
| 277 | // //signal.
|
|---|
| 278 | //
|
|---|
| 279 | //
|
|---|
| 280 | // Input Containers:
|
|---|
| 281 | // MGeomCam
|
|---|
| 282 | // MPedPhotCam
|
|---|
| 283 | // MCerPhotEvt
|
|---|
| 284 | //
|
|---|
| 285 | // Output Containers:
|
|---|
| 286 | // MCerPhotEvt
|
|---|
| 287 | //
|
|---|
| 288 | /////////////////////////////////////////////////////////////////////////////
|
|---|
| 289 | #include "MImgCleanStd.h"
|
|---|
| 290 |
|
|---|
| 291 | #include <stdlib.h> // atof
|
|---|
| 292 | #include <fstream> // ofstream, SavePrimitive
|
|---|
| 293 |
|
|---|
| 294 | #include <TEnv.h>
|
|---|
| 295 |
|
|---|
| 296 | #include <TGFrame.h> // TGFrame
|
|---|
| 297 | #include <TGLabel.h> // TGLabel
|
|---|
| 298 | #include <TGTextEntry.h> // TGTextEntry
|
|---|
| 299 |
|
|---|
| 300 | #include "MLog.h"
|
|---|
| 301 | #include "MLogManip.h"
|
|---|
| 302 |
|
|---|
| 303 | #include "MParList.h"
|
|---|
| 304 | #include "MCameraData.h"
|
|---|
| 305 |
|
|---|
| 306 | #include "MGeomPix.h"
|
|---|
| 307 | #include "MGeomCam.h"
|
|---|
| 308 |
|
|---|
| 309 | #include "MCerPhotPix.h"
|
|---|
| 310 | #include "MCerPhotEvt.h"
|
|---|
| 311 |
|
|---|
| 312 | #include "MGGroupFrame.h" // MGGroupFrame
|
|---|
| 313 |
|
|---|
| 314 | ClassImp(MImgCleanStd);
|
|---|
| 315 |
|
|---|
| 316 | using namespace std;
|
|---|
| 317 |
|
|---|
| 318 | enum {
|
|---|
| 319 | kImgCleanLvl1,
|
|---|
| 320 | kImgCleanLvl2
|
|---|
| 321 | };
|
|---|
| 322 |
|
|---|
| 323 | static const TString gsDefName = "MImgCleanStd";
|
|---|
| 324 | static const TString gsDefTitle = "Task to perform image cleaning";
|
|---|
| 325 |
|
|---|
| 326 | const TString MImgCleanStd::gsNamePedPhotCam="MPedPhotCam"; // default name of the 'MPedPhotCam' container
|
|---|
| 327 |
|
|---|
| 328 | // --------------------------------------------------------------------------
|
|---|
| 329 | //
|
|---|
| 330 | // Default constructor. Here you can specify the cleaning method and levels.
|
|---|
| 331 | // If you don't specify them the 'common standard' values 3.0 and 2.5 (sigma
|
|---|
| 332 | // above mean) are used.
|
|---|
| 333 | // Here you can also specify how many rings around the core pixels you want
|
|---|
| 334 | // to analyze (with the fixed lvl2). The default value for "rings" is 1.
|
|---|
| 335 | //
|
|---|
| 336 | MImgCleanStd::MImgCleanStd(const Float_t lvl1, const Float_t lvl2,
|
|---|
| 337 | const char *name, const char *title)
|
|---|
| 338 | : fCleaningMethod(kStandard), fCleanLvl1(lvl1),
|
|---|
| 339 | fCleanLvl2(lvl2), fCleanRings(1), fNamePedPhotCam(gsNamePedPhotCam)
|
|---|
| 340 |
|
|---|
| 341 | {
|
|---|
| 342 | fName = name ? name : gsDefName.Data();
|
|---|
| 343 | fTitle = title ? title : gsDefTitle.Data();
|
|---|
| 344 | }
|
|---|
| 345 |
|
|---|
| 346 | // --------------------------------------------------------------------------
|
|---|
| 347 | //
|
|---|
| 348 | // The first step of cleaning defines the CORE pixels. All the other pixels
|
|---|
| 349 | // are set as UNUSED and belong to RING 0.
|
|---|
| 350 | // After this point, only the CORE pixels are set as USED, with RING
|
|---|
| 351 | // number 1.
|
|---|
| 352 | //
|
|---|
| 353 | // NT 28/04/2003: now the option to use the standard method or the
|
|---|
| 354 | // democratic method is implemented:
|
|---|
| 355 | //
|
|---|
| 356 | // kStandard: This method looks for all pixels with an entry (photons)
|
|---|
| 357 | // that is three times bigger than the noise of the pixel
|
|---|
| 358 | // (default: 3 sigma, clean level 1)
|
|---|
| 359 | //
|
|---|
| 360 | // kDemocratic: this method looks for all pixels with an entry (photons)
|
|---|
| 361 | // that is n times bigger than the noise of the mean of the
|
|---|
| 362 | // inner pixels (default: 3 sigmabar, clean level 1)
|
|---|
| 363 | //
|
|---|
| 364 | //
|
|---|
| 365 | void MImgCleanStd::CleanStep1()
|
|---|
| 366 | {
|
|---|
| 367 | const TArrayD &data = fData->GetData();
|
|---|
| 368 |
|
|---|
| 369 | //
|
|---|
| 370 | // check the number of all pixels against the noise level and
|
|---|
| 371 | // set them to 'unused' state if necessary
|
|---|
| 372 | //
|
|---|
| 373 | MCerPhotPix *pix;
|
|---|
| 374 |
|
|---|
| 375 | // Loop over all pixels
|
|---|
| 376 | MCerPhotEvtIter Next(fEvt, kFALSE);
|
|---|
| 377 | while ((pix=static_cast<MCerPhotPix*>(Next())))
|
|---|
| 378 | if (!pix->IsPixelUnmapped() && data[pix->GetPixId()] <= fCleanLvl1)
|
|---|
| 379 | pix->SetPixelUnused();
|
|---|
| 380 | }
|
|---|
| 381 |
|
|---|
| 382 | // --------------------------------------------------------------------------
|
|---|
| 383 | //
|
|---|
| 384 | // Check if the survived pixel have a neighbor, that also
|
|---|
| 385 | // survived, otherwise set pixel to unused (removes pixels without
|
|---|
| 386 | // neighbors).
|
|---|
| 387 | //
|
|---|
| 388 | void MImgCleanStd::CleanStep2()
|
|---|
| 389 | {
|
|---|
| 390 | MCerPhotPix *pix;
|
|---|
| 391 |
|
|---|
| 392 | // Loop over used pixels only
|
|---|
| 393 | TIter Next(*fEvt);
|
|---|
| 394 |
|
|---|
| 395 | while ((pix=static_cast<MCerPhotPix*>(Next())))
|
|---|
| 396 | {
|
|---|
| 397 | // get pixel id of this entry
|
|---|
| 398 | const Int_t idx = pix->GetPixId();
|
|---|
| 399 |
|
|---|
| 400 | // check for 'used' neighbors of this pixel
|
|---|
| 401 | const MGeomPix &gpix = (*fCam)[idx];
|
|---|
| 402 | const Int_t nnmax = gpix.GetNumNeighbors();
|
|---|
| 403 |
|
|---|
| 404 | Bool_t hasNeighbor = kFALSE;
|
|---|
| 405 |
|
|---|
| 406 | //loop on the neighbors to check if they are used
|
|---|
| 407 | for (Int_t j=0; j<nnmax; j++)
|
|---|
| 408 | {
|
|---|
| 409 | const Int_t idx2 = gpix.GetNeighbor(j);
|
|---|
| 410 |
|
|---|
| 411 | // when you find an used neighbor, break the loop
|
|---|
| 412 | if (fEvt->IsPixelUsed(idx2))
|
|---|
| 413 | {
|
|---|
| 414 | hasNeighbor = kTRUE;
|
|---|
| 415 | break;
|
|---|
| 416 | }
|
|---|
| 417 | }
|
|---|
| 418 |
|
|---|
| 419 | if (hasNeighbor == kFALSE)
|
|---|
| 420 | pix->SetPixelUnused();
|
|---|
| 421 | }
|
|---|
| 422 |
|
|---|
| 423 | //
|
|---|
| 424 | // now we declare all pixels that survive as CorePixels
|
|---|
| 425 | //
|
|---|
| 426 |
|
|---|
| 427 | Next.Reset();
|
|---|
| 428 | while ((pix=static_cast<MCerPhotPix*>(Next())))
|
|---|
| 429 | {
|
|---|
| 430 | if (pix->IsPixelUsed())
|
|---|
| 431 | pix->SetPixelCore();
|
|---|
| 432 | }
|
|---|
| 433 | }
|
|---|
| 434 |
|
|---|
| 435 | void MImgCleanStd::CleanStep3b(MCerPhotPix &pix)
|
|---|
| 436 | {
|
|---|
| 437 | const Int_t idx = pix.GetPixId();
|
|---|
| 438 |
|
|---|
| 439 | //
|
|---|
| 440 | // check if the pixel's next neighbor is a core pixel.
|
|---|
| 441 | // if it is a core pixel set pixel state to: used.
|
|---|
| 442 | //
|
|---|
| 443 | MGeomPix &gpix = (*fCam)[idx];
|
|---|
| 444 | const Int_t nnmax = gpix.GetNumNeighbors();
|
|---|
| 445 |
|
|---|
| 446 | for (Int_t j=0; j<nnmax; j++)
|
|---|
| 447 | {
|
|---|
| 448 | const Int_t idx2 = gpix.GetNeighbor(j);
|
|---|
| 449 |
|
|---|
| 450 | if (!fEvt->IsPixelCore(idx2))
|
|---|
| 451 | continue;
|
|---|
| 452 |
|
|---|
| 453 | pix.SetPixelUsed();
|
|---|
| 454 | break;
|
|---|
| 455 | }
|
|---|
| 456 | }
|
|---|
| 457 |
|
|---|
| 458 | // --------------------------------------------------------------------------
|
|---|
| 459 | //
|
|---|
| 460 | // NT: Add option "rings": default value = 1.
|
|---|
| 461 | // Look n (n>1) times for the boundary pixels around the used pixels.
|
|---|
| 462 | // If a pixel has more than 2.5 (clean level 2.5) sigma,
|
|---|
| 463 | // it is declared as used.
|
|---|
| 464 | //
|
|---|
| 465 | // If a value<2 for fCleanRings is used, no CleanStep4 is done.
|
|---|
| 466 | //
|
|---|
| 467 | void MImgCleanStd::CleanStep4(UShort_t r, MCerPhotPix &pix)
|
|---|
| 468 | {
|
|---|
| 469 | //
|
|---|
| 470 | // Skip events that have already a defined status;
|
|---|
| 471 | //
|
|---|
| 472 | if (pix.GetRing() != 0)
|
|---|
| 473 | return;
|
|---|
| 474 |
|
|---|
| 475 | //
|
|---|
| 476 | // check if the pixel's next neighbor is a used pixel.
|
|---|
| 477 | // if it is a used pixel set pixel state to: used,
|
|---|
| 478 | // and tell to which ring it belongs to.
|
|---|
| 479 | //
|
|---|
| 480 | const Int_t idx = pix.GetPixId();
|
|---|
| 481 |
|
|---|
| 482 | MGeomPix &gpix = (*fCam)[idx];
|
|---|
| 483 |
|
|---|
| 484 | const Int_t nnmax = gpix.GetNumNeighbors();
|
|---|
| 485 |
|
|---|
| 486 | for (Int_t j=0; j<nnmax; j++)
|
|---|
| 487 | {
|
|---|
| 488 | const Int_t idx2 = gpix.GetNeighbor(j);
|
|---|
| 489 |
|
|---|
| 490 | MCerPhotPix *npix = fEvt->GetPixById(idx2);
|
|---|
| 491 | if (!npix || !npix->IsPixelUsed() || npix->GetRing()>r-1 )
|
|---|
| 492 | continue;
|
|---|
| 493 |
|
|---|
| 494 | pix.SetRing(r);
|
|---|
| 495 | break;
|
|---|
| 496 | }
|
|---|
| 497 | }
|
|---|
| 498 |
|
|---|
| 499 | // --------------------------------------------------------------------------
|
|---|
| 500 | //
|
|---|
| 501 | // Look for the boundary pixels around the core pixels
|
|---|
| 502 | // if a pixel has more than 2.5 (clean level 2.5) sigma, and
|
|---|
| 503 | // a core neigbor, it is declared as used.
|
|---|
| 504 | //
|
|---|
| 505 | void MImgCleanStd::CleanStep3()
|
|---|
| 506 | {
|
|---|
| 507 | const TArrayD &data = fData->GetData();
|
|---|
| 508 |
|
|---|
| 509 | for (UShort_t r=1; r<fCleanRings+1; r++)
|
|---|
| 510 | {
|
|---|
| 511 | MCerPhotPix *pix;
|
|---|
| 512 |
|
|---|
| 513 | // Loop over all pixels
|
|---|
| 514 |
|
|---|
| 515 | MCerPhotEvtIter NextAll(fEvt, kFALSE);
|
|---|
| 516 | while ((pix=static_cast<MCerPhotPix*>(NextAll())))
|
|---|
| 517 | {
|
|---|
| 518 | //
|
|---|
| 519 | // if pixel is a core pixel or unmapped, go to the next pixel
|
|---|
| 520 | //
|
|---|
| 521 | if (pix->IsPixelCore() || pix->IsPixelUnmapped())
|
|---|
| 522 | continue;
|
|---|
| 523 |
|
|---|
| 524 | if (data[pix->GetPixId()] <= fCleanLvl2)
|
|---|
| 525 | continue;
|
|---|
| 526 |
|
|---|
| 527 | if (r==1)
|
|---|
| 528 | CleanStep3b(*pix);
|
|---|
| 529 | else
|
|---|
| 530 | CleanStep4(r, *pix);
|
|---|
| 531 | }
|
|---|
| 532 | }
|
|---|
| 533 | }
|
|---|
| 534 |
|
|---|
| 535 | // --------------------------------------------------------------------------
|
|---|
| 536 | //
|
|---|
| 537 | // Check if MEvtHeader exists in the Parameter list already.
|
|---|
| 538 | // if not create one and add them to the list
|
|---|
| 539 | //
|
|---|
| 540 | Int_t MImgCleanStd::PreProcess (MParList *pList)
|
|---|
| 541 | {
|
|---|
| 542 | fCam = (MGeomCam*)pList->FindObject(AddSerialNumber("MGeomCam"));
|
|---|
| 543 | if (!fCam)
|
|---|
| 544 | {
|
|---|
| 545 | *fLog << err << "MGeomCam not found (no geometry information available)... aborting." << endl;
|
|---|
| 546 | return kFALSE;
|
|---|
| 547 | }
|
|---|
| 548 |
|
|---|
| 549 | fEvt = (MCerPhotEvt*)pList->FindObject(AddSerialNumber("MCerPhotEvt"));
|
|---|
| 550 | if (!fEvt)
|
|---|
| 551 | {
|
|---|
| 552 | *fLog << err << "MCerPhotEvt not found... aborting." << endl;
|
|---|
| 553 | return kFALSE;
|
|---|
| 554 | }
|
|---|
| 555 |
|
|---|
| 556 | fPed = (MPedPhotCam*)pList->FindObject(AddSerialNumber(fNamePedPhotCam), "MPedPhotCam");
|
|---|
| 557 | if (!fPed)
|
|---|
| 558 | {
|
|---|
| 559 | *fLog << err << "MPedPhotCam not found... aborting." << endl;
|
|---|
| 560 | return kFALSE;
|
|---|
| 561 | }
|
|---|
| 562 |
|
|---|
| 563 | fTime = (MArrivalTime*)pList->FindObject(AddSerialNumber("MArrivalTime"));
|
|---|
| 564 | if (!fTime && fCleaningMethod==kProbability)
|
|---|
| 565 | *fLog << warn << "MArrivalTime not found... probability cleaning done with signal only!" << endl;
|
|---|
| 566 |
|
|---|
| 567 | fData = (MCameraData*)pList->FindCreateObj(AddSerialNumber("MCameraData"));
|
|---|
| 568 | if (!fData)
|
|---|
| 569 | return kFALSE;
|
|---|
| 570 |
|
|---|
| 571 | Print();
|
|---|
| 572 |
|
|---|
| 573 | return kTRUE;
|
|---|
| 574 | }
|
|---|
| 575 |
|
|---|
| 576 | // --------------------------------------------------------------------------
|
|---|
| 577 | //
|
|---|
| 578 | // Cleans the image.
|
|---|
| 579 | //
|
|---|
| 580 | Int_t MImgCleanStd::Process()
|
|---|
| 581 | {
|
|---|
| 582 | switch (fCleaningMethod)
|
|---|
| 583 | {
|
|---|
| 584 | case kStandard:
|
|---|
| 585 | fData->CalcCleaningLevel(*fEvt, *fPed, *fCam);
|
|---|
| 586 | break;
|
|---|
| 587 | case kScaled:
|
|---|
| 588 | fData->CalcCleaningLevel2(*fEvt, *fPed, *fCam);
|
|---|
| 589 | break;
|
|---|
| 590 | case kDemocratic:
|
|---|
| 591 | fData->CalcCleaningLevelDemocratic(*fEvt, *fPed, *fCam);
|
|---|
| 592 | break;
|
|---|
| 593 | case kProbability:
|
|---|
| 594 | fData->CalcCleaningProbability(*fEvt, *fPed, *fCam, fTime);
|
|---|
| 595 | break;
|
|---|
| 596 | case kAbsolute:
|
|---|
| 597 | fData->CalcCleaningAbsolute(*fEvt, *fCam);
|
|---|
| 598 | break;
|
|---|
| 599 | default:
|
|---|
| 600 | break;
|
|---|
| 601 | }
|
|---|
| 602 |
|
|---|
| 603 | #ifdef DEBUG
|
|---|
| 604 | *fLog << all << "CleanStep 1" << endl;
|
|---|
| 605 | #endif
|
|---|
| 606 | CleanStep1();
|
|---|
| 607 |
|
|---|
| 608 |
|
|---|
| 609 | #ifdef DEBUG
|
|---|
| 610 | *fLog << all << "CleanStep 2" << endl;
|
|---|
| 611 | #endif
|
|---|
| 612 | CleanStep2();
|
|---|
| 613 |
|
|---|
| 614 | // For speed reasons skip the rest of the cleaning if no
|
|---|
| 615 | // action will be taken!
|
|---|
| 616 | if (fCleanLvl1>fCleanLvl2)
|
|---|
| 617 | {
|
|---|
| 618 | #ifdef DEBUG
|
|---|
| 619 | *fLog << all << "CleanStep 3" << endl;
|
|---|
| 620 | #endif
|
|---|
| 621 | CleanStep3();
|
|---|
| 622 | }
|
|---|
| 623 |
|
|---|
| 624 | #ifdef DEBUG
|
|---|
| 625 | *fLog << all << "Calc Islands" << endl;
|
|---|
| 626 | #endif
|
|---|
| 627 | // Takes roughly 10% of the time
|
|---|
| 628 | fEvt->CalcIslands(*fCam);
|
|---|
| 629 |
|
|---|
| 630 | #ifdef DEBUG
|
|---|
| 631 | *fLog << all << "Done." << endl;
|
|---|
| 632 | #endif
|
|---|
| 633 |
|
|---|
| 634 | return kTRUE;
|
|---|
| 635 | }
|
|---|
| 636 |
|
|---|
| 637 | // --------------------------------------------------------------------------
|
|---|
| 638 | //
|
|---|
| 639 | // Print descriptor and cleaning levels.
|
|---|
| 640 | //
|
|---|
| 641 | void MImgCleanStd::Print(Option_t *o) const
|
|---|
| 642 | {
|
|---|
| 643 | *fLog << all << GetDescriptor() << " using ";
|
|---|
| 644 | switch (fCleaningMethod)
|
|---|
| 645 | {
|
|---|
| 646 | case kDemocratic:
|
|---|
| 647 | *fLog << "democratic";
|
|---|
| 648 | break;
|
|---|
| 649 | case kStandard:
|
|---|
| 650 | *fLog << "standard";
|
|---|
| 651 | break;
|
|---|
| 652 | case kScaled:
|
|---|
| 653 | *fLog << "scaled";
|
|---|
| 654 | break;
|
|---|
| 655 | case kProbability:
|
|---|
| 656 | *fLog << "probability";
|
|---|
| 657 | break;
|
|---|
| 658 | case kAbsolute:
|
|---|
| 659 | *fLog << "absolute";
|
|---|
| 660 | break;
|
|---|
| 661 | }
|
|---|
| 662 | *fLog << " cleaning initialized with level " << fCleanLvl1 << " and " << fCleanLvl2;
|
|---|
| 663 | *fLog << " (CleanRings=" << fCleanRings << ")" << endl;
|
|---|
| 664 | }
|
|---|
| 665 |
|
|---|
| 666 | // --------------------------------------------------------------------------
|
|---|
| 667 | //
|
|---|
| 668 | // Create two text entry fields, one for each cleaning level and a
|
|---|
| 669 | // describing text line.
|
|---|
| 670 | //
|
|---|
| 671 | void MImgCleanStd::CreateGuiElements(MGGroupFrame *f)
|
|---|
| 672 | {
|
|---|
| 673 | //
|
|---|
| 674 | // Create a frame for line 3 and 4 to be able
|
|---|
| 675 | // to align entry field and label in one line
|
|---|
| 676 | //
|
|---|
| 677 | TGHorizontalFrame *f1 = new TGHorizontalFrame(f, 0, 0);
|
|---|
| 678 | TGHorizontalFrame *f2 = new TGHorizontalFrame(f, 0, 0);
|
|---|
| 679 |
|
|---|
| 680 | /*
|
|---|
| 681 | * --> use with root >=3.02 <--
|
|---|
| 682 | *
|
|---|
| 683 |
|
|---|
| 684 | TGNumberEntry *fNumEntry1 = new TGNumberEntry(frame, 3.0, 2, M_NENT_LVL1, kNESRealOne, kNEANonNegative);
|
|---|
| 685 | TGNumberEntry *fNumEntry2 = new TGNumberEntry(frame, 2.5, 2, M_NENT_LVL1, kNESRealOne, kNEANonNegative);
|
|---|
| 686 |
|
|---|
| 687 | */
|
|---|
| 688 | TGTextEntry *entry1 = new TGTextEntry(f1, "****", kImgCleanLvl1);
|
|---|
| 689 | TGTextEntry *entry2 = new TGTextEntry(f2, "****", kImgCleanLvl2);
|
|---|
| 690 |
|
|---|
| 691 | // --- doesn't work like expected (until root 3.02?) --- fNumEntry1->SetAlignment(kTextRight);
|
|---|
| 692 | // --- doesn't work like expected (until root 3.02?) --- fNumEntry2->SetAlignment(kTextRight);
|
|---|
| 693 |
|
|---|
| 694 | entry1->SetText("3.0");
|
|---|
| 695 | entry2->SetText("2.5");
|
|---|
| 696 |
|
|---|
| 697 | entry1->Associate(f);
|
|---|
| 698 | entry2->Associate(f);
|
|---|
| 699 |
|
|---|
| 700 | TGLabel *l1 = new TGLabel(f1, "Cleaning Level 1");
|
|---|
| 701 | TGLabel *l2 = new TGLabel(f2, "Cleaning Level 2");
|
|---|
| 702 |
|
|---|
| 703 | l1->SetTextJustify(kTextLeft);
|
|---|
| 704 | l2->SetTextJustify(kTextLeft);
|
|---|
| 705 |
|
|---|
| 706 | //
|
|---|
| 707 | // Align the text of the label centered, left in the row
|
|---|
| 708 | // with a left padding of 10
|
|---|
| 709 | //
|
|---|
| 710 | TGLayoutHints *laylabel = new TGLayoutHints(kLHintsCenterY|kLHintsLeft, 10);
|
|---|
| 711 | TGLayoutHints *layframe = new TGLayoutHints(kLHintsCenterY|kLHintsLeft, 5, 0, 10);
|
|---|
| 712 |
|
|---|
| 713 | //
|
|---|
| 714 | // Add one entry field and the corresponding label to each line
|
|---|
| 715 | //
|
|---|
| 716 | f1->AddFrame(entry1);
|
|---|
| 717 | f2->AddFrame(entry2);
|
|---|
| 718 |
|
|---|
| 719 | f1->AddFrame(l1, laylabel);
|
|---|
| 720 | f2->AddFrame(l2, laylabel);
|
|---|
| 721 |
|
|---|
| 722 | f->AddFrame(f1, layframe);
|
|---|
| 723 | f->AddFrame(f2, layframe);
|
|---|
| 724 |
|
|---|
| 725 | f->AddToList(entry1);
|
|---|
| 726 | f->AddToList(entry2);
|
|---|
| 727 | f->AddToList(l1);
|
|---|
| 728 | f->AddToList(l2);
|
|---|
| 729 | f->AddToList(laylabel);
|
|---|
| 730 | f->AddToList(layframe);
|
|---|
| 731 | }
|
|---|
| 732 |
|
|---|
| 733 | // --------------------------------------------------------------------------
|
|---|
| 734 | //
|
|---|
| 735 | // Process the GUI Events comming from the two text entry fields.
|
|---|
| 736 | //
|
|---|
| 737 | Bool_t MImgCleanStd::ProcessMessage(Int_t msg, Int_t submsg, Long_t param1, Long_t param2)
|
|---|
| 738 | {
|
|---|
| 739 | if (msg!=kC_TEXTENTRY || submsg!=kTE_ENTER)
|
|---|
| 740 | return kTRUE;
|
|---|
| 741 |
|
|---|
| 742 | TGTextEntry *txt = (TGTextEntry*)FindWidget(param1);
|
|---|
| 743 |
|
|---|
| 744 | if (!txt)
|
|---|
| 745 | return kTRUE;
|
|---|
| 746 |
|
|---|
| 747 | Float_t lvl = atof(txt->GetText());
|
|---|
| 748 |
|
|---|
| 749 | switch (param1)
|
|---|
| 750 | {
|
|---|
| 751 | case kImgCleanLvl1:
|
|---|
| 752 | fCleanLvl1 = lvl;
|
|---|
| 753 | *fLog << "Cleaning level 1 set to " << lvl << " sigma." << endl;
|
|---|
| 754 | return kTRUE;
|
|---|
| 755 |
|
|---|
| 756 | case kImgCleanLvl2:
|
|---|
| 757 | fCleanLvl2 = lvl;
|
|---|
| 758 | *fLog << "Cleaning level 2 set to " << lvl << " sigma." << endl;
|
|---|
| 759 | return kTRUE;
|
|---|
| 760 | }
|
|---|
| 761 |
|
|---|
| 762 | return kTRUE;
|
|---|
| 763 | }
|
|---|
| 764 |
|
|---|
| 765 | // --------------------------------------------------------------------------
|
|---|
| 766 | //
|
|---|
| 767 | // Implementation of SavePrimitive. Used to write the call to a constructor
|
|---|
| 768 | // to a macro. In the original root implementation it is used to write
|
|---|
| 769 | // gui elements to a macro-file.
|
|---|
| 770 | //
|
|---|
| 771 | void MImgCleanStd::StreamPrimitive(ofstream &out) const
|
|---|
| 772 | {
|
|---|
| 773 | out << " MImgCleanStd " << GetUniqueName() << "(";
|
|---|
| 774 | out << fCleanLvl1 << ", " << fCleanLvl2;
|
|---|
| 775 |
|
|---|
| 776 | if (fName!=gsDefName || fTitle!=gsDefTitle)
|
|---|
| 777 | {
|
|---|
| 778 | out << ", \"" << fName << "\"";
|
|---|
| 779 | if (fTitle!=gsDefTitle)
|
|---|
| 780 | out << ", \"" << fTitle << "\"";
|
|---|
| 781 | }
|
|---|
| 782 | out << ");" << endl;
|
|---|
| 783 |
|
|---|
| 784 | if (fCleaningMethod!=kStandard)
|
|---|
| 785 | {
|
|---|
| 786 | out << " " << GetUniqueName() << ".SetMethod(MImgCleanStd::k";
|
|---|
| 787 | switch (fCleaningMethod)
|
|---|
| 788 | {
|
|---|
| 789 | case kScaled: out << "Scaled"; break;
|
|---|
| 790 | case kDemocratic: out << "Democratic"; break;
|
|---|
| 791 | case kProbability: out << "Probability"; break;
|
|---|
| 792 | case kAbsolute: out << "Absolute"; break;
|
|---|
| 793 | default:
|
|---|
| 794 | break;
|
|---|
| 795 | }
|
|---|
| 796 | out << ");" << endl;
|
|---|
| 797 | }
|
|---|
| 798 | if (fCleanRings!=1)
|
|---|
| 799 | out << " " << GetUniqueName() << ".SetCleanRings(" << fCleanRings << ");" << endl;
|
|---|
| 800 |
|
|---|
| 801 | if (gsNamePedPhotCam!=fNamePedPhotCam)
|
|---|
| 802 | out << " " << GetUniqueName() << ".SetNamePedPhotCam(\"" << fNamePedPhotCam << "\");" << endl;
|
|---|
| 803 | }
|
|---|
| 804 |
|
|---|
| 805 | // --------------------------------------------------------------------------
|
|---|
| 806 | //
|
|---|
| 807 | // Read the setup from a TEnv, eg:
|
|---|
| 808 | // MImgCleanStd.CleanLevel1: 3.0
|
|---|
| 809 | // MImgCleanStd.CleanLevel2: 2.5
|
|---|
| 810 | // MImgCleanStd.CleanMethod: Standard, Scaled, Democratic, Probability, Absolute
|
|---|
| 811 | // MImgCleanStd.CleanRings: 1
|
|---|
| 812 | //
|
|---|
| 813 | Int_t MImgCleanStd::ReadEnv(const TEnv &env, TString prefix, Bool_t print)
|
|---|
| 814 | {
|
|---|
| 815 | Bool_t rc = kFALSE;
|
|---|
| 816 | if (IsEnvDefined(env, prefix, "CleanRings", print))
|
|---|
| 817 | {
|
|---|
| 818 | rc = kTRUE;
|
|---|
| 819 | SetCleanRings(GetEnvValue(env, prefix, "CleanRings", fCleanRings));
|
|---|
| 820 | }
|
|---|
| 821 | if (IsEnvDefined(env, prefix, "CleanLevel1", print))
|
|---|
| 822 | {
|
|---|
| 823 | rc = kTRUE;
|
|---|
| 824 | fCleanLvl1 = GetEnvValue(env, prefix, "CleanLevel1", fCleanLvl1);
|
|---|
| 825 | }
|
|---|
| 826 | if (IsEnvDefined(env, prefix, "CleanLevel2", print))
|
|---|
| 827 | {
|
|---|
| 828 | rc = kTRUE;
|
|---|
| 829 | fCleanLvl2 = GetEnvValue(env, prefix, "CleanLevel2", fCleanLvl2);
|
|---|
| 830 | }
|
|---|
| 831 |
|
|---|
| 832 | if (IsEnvDefined(env, prefix, "CleanMethod", print))
|
|---|
| 833 | {
|
|---|
| 834 | rc = kTRUE;
|
|---|
| 835 | TString s = GetEnvValue(env, prefix, "CleanMethod", "");
|
|---|
| 836 | s.ToLower();
|
|---|
| 837 | if (s.BeginsWith("standard"))
|
|---|
| 838 | SetMethod(kStandard);
|
|---|
| 839 | if (s.BeginsWith("scaled"))
|
|---|
| 840 | SetMethod(kScaled);
|
|---|
| 841 | if (s.BeginsWith("democratic"))
|
|---|
| 842 | SetMethod(kDemocratic);
|
|---|
| 843 | if (s.BeginsWith("probability"))
|
|---|
| 844 | SetMethod(kProbability);
|
|---|
| 845 | if (s.BeginsWith("absolute"))
|
|---|
| 846 | SetMethod(kAbsolute);
|
|---|
| 847 | }
|
|---|
| 848 |
|
|---|
| 849 | return rc;
|
|---|
| 850 | }
|
|---|