DMCA
Class of Algorithms for Realtime Subpixel Registration (0)
| Venue: | Proceedings of SPIE, Vol |
| Citations: | 10 - 0 self |
BibTeX
@INPROCEEDINGS{Frischholz_classof,
author = {Robert W. Frischholz and Klaus P. Spinnler},
title = {Class of Algorithms for Realtime Subpixel Registration},
booktitle = {Proceedings of SPIE, Vol},
year = {},
pages = {50--59}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In 1972, Barnea and Silverman presented a new approach to the wide field of template matching, the SSD--algorithm. Further work has been done to adapt the method to gain subpixel accuracy. Intense investigation of the proposed algorithms led to our new approach: by interpolating the template instead of the reference image, and by applying sort of an error--correction to the resulting subpixel--value, both computation time and accuracy can be improved. Exhaustive experiments with a CCD--camera and various kinds of reference images showed that a maximum error of 10% of the pixel period can be expected. Depending on the kind of image, mean square errors range from 0.4% to 4%. INTRODUCTION In 1972, Barnea and Silverman presented the SSD--algorithm, a fast way to solve the problem of image registration [1]. Extending it to subpixel accuracy ([2],[3]), nevertheless, increased the computational cost to an amount where real--time applications seemed almost impossible. In this paper we presen...
Keyphrases
realtime subpixel registration ssd algorithm new approach reference image computation time subpixel value error correction fast way image registration mean square error real time application ccd camera template matching various kind intense investigation wide field maximum error computational cost subpixel accuracy exhaustive experiment pixel period
