|
Документ взят из кэша поисковой машины. Адрес
оригинального документа
: http://xmm.vilspa.esa.es/sas/8.0.0/doc/embadpixfind/node6.html
Дата изменения: Wed Jul 2 04:57:39 2008 Дата индексирования: Fri Sep 5 22:39:55 2008 Кодировка: Поисковые слова: m 11 |
If findbadsegments=Y embadpixfind
looks for bright rows and columns too. This is done by projecting
the image along rows and columns, and applying the same algorithm
as above on the resulting 1-D vectors, except the width of
the 1-D window (2 halfwidth1D + 1) is normally chosen larger
than that of the 2-D window, to improve the background determination.
If a bright row or column is found, it is analysed to look for
bright segments within. If it is found that the rest of the row/column
is compatible (to 10% probability) with the neighbouring rows/columns,
then only the bright segments are declared as bad.
The minimum length of the bright segments is set such that one
expects about 1 count in that length in the normal (not bright) parts.