Page History

...

All peak finders and a few other image processing algorithms are available in a single class suit suite supporting common infrastructure. All algorithms work with good pixels defined by the a mask and inside specified rectangular windows. Both these mechanisms (windows and mask) can be used to describe a region of interest. By default, if mask or/and windows are not specified, all pixels are processed. A few versions of the peak finder use different approach to the peak definition (finding group of pixels forming a peak) at a first stage and , but can use the same algorithms at final stage for evaluation of peak parameters, as explained below. 

...

Peak Finder "V3"

This algorithm first finds the largest intensity pixel in a square region set by a "rank" -radial parameter (local maximum for rank).  Peak candidate includes parameter:  peaks include all pixels with intensity above zero in the square region spanning from −rank to +rank in both the row and column directions relative to the maximal intensity pixel.

At final In a second stage, all pixels associated with a peak are used to evaluate peak maximum the row and column of the peak maximum, total intensity, center of gravity coordinates, limits and edges of the peak region.  A surrounding user-specified ring-region of pixels around the peak is used to evaluate average background level, its rms spread, and signal-over-noise ratio. The user will typically reduce the number of peaks returned from these algorithms by applying cuts to signal levels or signal-over-noise ratio.