Joint-dependent local deformations for hand animation and object grasping
Proceedings on Graphics interface '88
Ten lectures on wavelets
Sparse Approximate Solutions to Linear Systems
SIAM Journal on Computing
Unitary Triangularization of a Nonsymmetric Matrix
Journal of the ACM (JACM)
Compressive Sensing for Background Subtraction
ECCV '08 Proceedings of the 10th European Conference on Computer Vision: Part II
Robust Face Recognition via Sparse Representation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Random Projections of Smooth Manifolds
Foundations of Computational Mathematics
Decoding by linear programming
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Hi-index | 0.00 |
The powerful theory of compressive sensing enables an efficient way to recover sparse or compressible signals from non-adaptive, sub-Nyquist-rate linear measurements. In particular, it has been shown that random projections can well approximate an isometry, provided that the number of linear measurements is no less than twice of the sparsity level of the signal. Inspired by these, we propose a compressive anneal particle filter to exploit sparsity existing in image-based human motion tracking. Instead of performing full signal recovery, we evaluate the observation likelihood directly in the compressive domain of the observed images. Moreover, we introduce a progressive multilevel wavelet decomposition staged at each anneal layer to accelerate the compressive evaluation in a coarse-to-fine fashion. The experiments with the benchmark dataset HumanEvaII show that the tracking process can be significantly accelerated, and the tracking accuracy is well maintained and comparable to the method using original image observations.