You are viewing an old version of this page. View the current version.

Compare with Current View Page History

« Previous Version 6 Next »

Algorithm of peak_finder_v3

  • makes a map of pixels with local maximums of requested rank for data ndarray and mask, pixel code in the map may have bits 0/1/2/4 standing for not-a-maximum / maximum-in-row / maximum-in-column / maximum-in-rectangular-region of radius=rank.
  • for each pixel with local maximal intensity in the region defined by the rank radius counts a number of pixels with intensity above zero, total positive intensity, center of gravity coordinates and rms,
  • using parameters r0(ex.=5.0), dr(ex.=0.05) evaluates background level, rms of noise, and S/N for the pixel with maximal intensity.
  • makes list of peaks which pass selector with parameters set in set_peak_selection_pars, for example
alg.set_peak_selection_pars(npix_min=5, npix_max=500, amax_thr=0, atot_thr=1000, son_min=6)

 

Demonstration for local maximum map

Test for 100x100 image with random normal distribution of intensities

Example of the map of local maximums found for rank from 1 to 5:

color coding of pixels:

  • blue=0 - not a local maximum
  • green=1 - local maximum in row
  • yellow=1+2 - local maximum in row and column
  • red=1+2+4 - local maximum in rectangular region of radius=rank.

Table for rank, associated 2-d region size, fraction of pixels recognized as local maximums for rank, and time consumption for this algorithm.

rank2-d regionfractiontime, ms
13x30.10625.4
25x50.03725.2
37x70.01795.1
49x90.01045.2
511x110.00665.2

 

 

 

 

 

  • No labels