Efficient hyperplane tracking by intelligent region selection

The main aim of our work is to improve the accuracy of the hyperplane tracker of F. Jurie and M. Dhome (see IEEE Trans. Pattern Anal. and Machine Intelligence, vol.24, no.7, p.996-1000, 2002) for real-time template matching. As the computation time of the initialization of the algorithm depends on t...

Full description

Saved in:
Bibliographic Details
Main Authors: Grassl, C., Zinsser, T., Niemann, H.
Format: Conference Proceeding
Language:English
Subjects:
Approximation algorithms
Costs
Image sequences
Jacobian matrices
Lighting
Military computing
Pattern matching
Pattern recognition
Robustness
Video sequences
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The main aim of our work is to improve the accuracy of the hyperplane tracker of F. Jurie and M. Dhome (see IEEE Trans. Pattern Anal. and Machine Intelligence, vol.24, no.7, p.996-1000, 2002) for real-time template matching. As the computation time of the initialization of the algorithm depends on the number of points used for estimating the motion of the template, only a subset of points in the tracked template is considered. Traditionally, this subset is determined at random. We present three different methods for selecting points better suited for the hyperplane tracker. We also propose to incorporate color information by working with eigenintensities instead of gray-level intensities, which can greatly improve the estimation accuracy, but only entails a slight increase in computation time. We have carefully evaluated the performance of the proposed methods in experiments with real image sequences.
DOI:10.1109/IAI.2004.1300943