7 December 1981 Evaluation Of Peak Location Algorithms With Subpixel Accuracy For Mosaic Focal Planes
Author Affiliations +
Abstract
The ability to achieve subpixel peak location accuracy for point source taraets in the cross-scan direction for scanning sensors and in both directions for staring sensors is examined systematically by means of Monte Carlo experiments. The performance of three peak location algorithms (simple centroid, extended centroid, polynomial least squares fit) is tested for sensitivity to system signal-to-noise ratio, detector deadspace, and blur spot size relative to detector size. A symmetrical, gaussian intensity profile of the blur spot is used in all cases. Computational efficiency, in terms of the number of multiplies and adds required, was considered in selecting the algorithms to be compared. Overall, we found that the simple centroid algorithm provides the optimum performance, giving %1/10 pixel accuracy for S/N=10 and no deadspace. In addition, performance improves for the centroid algorithms and degrades for the least squares fit algorithm as the blur spot size increases. Increasing deadspace markedly degrades the performance of the centroid algo-rithms.
© (1981) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
J. Allen Cox, J. Allen Cox, } "Evaluation Of Peak Location Algorithms With Subpixel Accuracy For Mosaic Focal Planes", Proc. SPIE 0292, Processing of Images and Data from Optical Sensors, (7 December 1981); doi: 10.1117/12.932843; https://doi.org/10.1117/12.932843
PROCEEDINGS
12 PAGES


SHARE
Back to Top