|
MOPEX Online Manual |
||||||||||
Box Outlier DetectionThe fourth outlier detection method is designed to use both the temporal and spatial information like the dual outlier, but it uses the statistical analysis of the kind used by the temporal outlier. It is implemented by module Box Outlier. Important: Using this module does not mean that MOPEX will automatically use the results for outlier detection. In order to use the results from this module, you must include the USE_BOX_OUTLIER_FOR_RMASK trigger in the namelist and set the RMask_Fatal_BitPattern to use bit 3. Note that this is not the same as setting it to a value of 3. See Appendix 2: Fatal Bit Patterns for more information. For each mosaic pixel position, Box Outlier creates two stacks of pixel values. The first stack is the same as the one created for the regular outlier detection method. It includes pixels from each interpolated image corresponding to the mosaic pixel position. This pixel in each interpolated image will be referred to as the main pixel. In each interpolated image a box of the user defined size is created centered on the main pixel. Input parameters Box X and Box Y define the size of the box. The second stack -- the box stack -- includes pixels from the above box in each interpolated image. The values of M and σ are computer in the box stack: M = biased_meadian(Ik) σ = MAD(Ik) = biased_median(|Ik biased_median(Ii)|)/0.6745 The biased_median is defined as follows. If there are N pixels in the stack, then the biased median is equal to the N/2-Bias element of the stack: biased_median(Ik) = I[N/2-Bias] The input parameter Box Median Bias controls the value of Bias. The product of this step is an outlier map. The pixel value Ok in an outlier map is the deviation of the pixel k in the input images from the mean M in the stack in terms of the number of standard deviations: Ok = (Ik - M) / σ If all the pixels in the main stack are outside of the M +/- σ range, the programs falls back on the temporal outlier method 1 using the main stack and the uncertainty images, if the latter are available. Inclusion of the neighboring pixels allows for outlier detection, even in the case of coverage of two, where the simple temporal detection is completely powerless. Clearly, a single pixel radhit on a relatively constant background can be easily identified as outlier, even with the smallest box size of 3. However, even radhit in the shape of wide and long streaks can be successfully detected by this method owing to the Box Median Bias. Suppose, the box size is 3, so the stack consists of 18 pixels, and the size of the radhit is at least 3x3 pixels. Out of the 18 pixels 9 background pixels have values relatively close to each other. The 9 radhit pixels will in general have greater scatter, then the 9 background pixels. Because of the bias, the median will be equal to the highest value of the background pixels. The difference between the highest and the lowest values of the background pixels are expected to be smaller, than the difference between the highest value of the background pixel and the lowest value of the radhit pixels. Consequently, the biased median deviation will be equal to the difference between the highest and lowest values of the background pixels.
The problem with temporal outlier rejection is that it sometimes rejects valid pixels in the center of bright sources. It is especially acute for the undersampled data. Interpolation of such data results in significant errors and some interpolated pixels have values higher than the uncertainties and the scatter in the stack. Including the neighboring pixels increases the estimate of the scatter and prevents identifying such pixels as outliers.
|
help@spitzer.caltech.edu