By Topic

Human Motion De-noising via Greedy Kernel Principal Component Analysis Filtering

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
T. Tangkuampien ; Monash University, Victoria, Australia. ; D. Suter

Kernel principal component analysis (KPCA) has been shown to be a powerful non-linear de-noising technique. A disadvantage of KPCA, however, is that the storage of the kernel matrix grows quadratically, and the evaluation cost grows linearly with the number of exemplars. The size of the training set composing of these exemplars is therefore vital in any real system incorporating KPCA. Given long human motion sequences, we show how the greedy KPCA algorithm can be applied to filter exemplar poses to build a reduced training set that optimally describes the entire sequence. We compare motion de-noising between standard KPCA using all poses in the original sequence as training exemplars and de-noising using the reduced set filtered by the greedy algorithm. We show how both have superior de-noising qualities over PCA, whilst Greedy KPCA results in lower evaluation cost due to the reduced training set

Published in:

18th International Conference on Pattern Recognition (ICPR'06)  (Volume:3 )

Date of Conference:

0-0 0