Comparison of centroid computation algorithms in a Shack-Hartmann sensor

Physics – Optics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

21

Turbulence, Instrumentation: Adaptive Optics

Scientific paper

Analytical theory is combined with extensive numerical simulations to compare different flavours of centroiding algorithms: thresholding, weighted centroid, correlation, quad cell (QC). For each method, optimal parameters are defined in function of photon flux, readout noise and turbulence level. We find that at very low flux the noise of QC and weighted centroid leads the best result, but the latter method can provide linear and optimal response if the weight follows spot displacements. Both methods can work with average flux as low as 10 photons per subaperture under a readout noise of three electrons. At high-flux levels, the dominant errors come from non-linearity of response, from spot truncations and distortions and from detector pixel sampling. It is shown that at high flux, centre of gravity approaches and correlation methods are equivalent (and provide better results than QC estimator) as soon as their parameters are optimized. Finally, examples of applications are given to illustrate the results obtained in the paper.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Comparison of centroid computation algorithms in a Shack-Hartmann sensor does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Comparison of centroid computation algorithms in a Shack-Hartmann sensor, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Comparison of centroid computation algorithms in a Shack-Hartmann sensor will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-953784

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.