Abstract
We propose an efficient robust version of the Lucas–Kanade template matching algorithm. The robust weights used by the algorithm
are based on evidence which is accumulated over many frames. We also present a robust extension of the algorithm proposed by Matthews
et al. [Matthews, I., Ishikawa, T., Baker, S., 2004. The template update problem. IEEE Trans. Pattern Anal. Machine Intell. 26 (6),
810–815] which corrects the template drift. We demonstrate that in terms of tracking accuracy, the robust version of the drift-correcting
algorithm outperforms the original algorithm, while remaining still extremely fast.
are based on evidence which is accumulated over many frames. We also present a robust extension of the algorithm proposed by Matthews
et al. [Matthews, I., Ishikawa, T., Baker, S., 2004. The template update problem. IEEE Trans. Pattern Anal. Machine Intell. 26 (6),
810–815] which corrects the template drift. We demonstrate that in terms of tracking accuracy, the robust version of the drift-correcting
algorithm outperforms the original algorithm, while remaining still extremely fast.
| Originalsprache | Englisch |
|---|---|
| Seiten (von - bis) | 1483-1491 |
| Seitenumfang | 8 |
| Fachzeitschrift | Pattern Recognition Letters |
| Volume | 28 |
| Issue | 12 |
| DOIs | |
| Publikationsstatus | Veröffentlicht - 7 März 2007 |
Research Field
- Former Research Field - Surveillance and Protection