%0 Conference Paper
%B Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004
%D 2004
%T A Rao-Blackwellized particle filter for EigenTracking
%A Zia Khan
%A Balch, T.
%A Dellaert, F.
%K analytically tractable integrals
%K Computer vision
%K EigenTracking
%K Filters
%K Gaussian processes
%K modal analysis
%K multi-modal distributions
%K NOISE
%K noisy targets
%K optimisation
%K optimization-based algorithms
%K Particle filters
%K Particle measurements
%K Particle tracking
%K Principal component analysis
%K probabilistic principal component analysis
%K Rao-Blackwellized particle filter
%K Robustness
%K SHAPE
%K State estimation
%K state vector
%K subspace coefficients
%K Subspace representations
%K target tracking
%K vectors
%X Subspace representations have been a popular way to model appearance in computer vision. In Jepson and Black's influential paper on EigenTracking, they were successfully applied in tracking. For noisy targets, optimization-based algorithms (including EigenTracking) often fail catastrophically after losing track. Particle filters have recently emerged as a robust method for tracking in the presence of multi-modal distributions. To use subspace representations in a particle filter, the number of samples increases exponentially as the state vector includes the subspace coefficients. We introduce an efficient method for using subspace representations in a particle filter by applying Rao-Blackwellization to integrate out the subspace coefficients in the state vector. Fewer samples are needed since part of the posterior over the state vector is analytically calculated. We use probabilistic principal component analysis to obtain analytically tractable integrals. We show experimental results in a scenario in which we track a target in clutter.
%B Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004
%V 2
%P II - 980-II-986 Vol.2
%8 2004/06//
%G eng