Sciweavers

38 search results - page 1 / 8
» Quasi-Random Sampling for Condensation
Sort
View
ECCV
2000
Springer
14 years 6 months ago
Quasi-Random Sampling for Condensation
The problem of tracking pedestrians from a moving car is a challenging one. The Condensation tracking algorithm is appealing for its generality and potential for real-time implemen...
Vasanth Philomin, Ramani Duraiswami, Larry S. Davi...
TSMC
2010
12 years 11 months ago
Adaptive Appearance Model and Condensation Algorithm for Robust Face Tracking
We present an adaptive framework for condensation algorithms in the context of human-face tracking. We attack the face tracking problem by making factored sampling more efficient a...
Yui Man Lui, J. Ross Beveridge, L. Darrell Whitley
IVC
2002
148views more  IVC 2002»
13 years 4 months ago
Detecting lameness using 'Re-sampling Condensation' and 'multi-stream cyclic hidden Markov models'
A system for the tracking and classification of livestock movements is presented. The combined `tracker-classifier' scheme is based on a variant of Isard and Blakes `Condensa...
Derek R. Magee, Roger D. Boyle
ECCV
2000
Springer
13 years 8 months ago
How Does CONDENSATION Behave with a Finite Number of Samples?
Abstract. Condensation is a popular algorithm for sequential inference that resamples a sampled representation of the posterior. The algorithm is known to be asymptotically correct...
Oliver D. King, David A. Forsyth
FOCS
2006
IEEE
13 years 10 months ago
Better lossless condensers through derandomized curve samplers
Lossless condensers are unbalanced expander graphs, with expansion close to optimal. Equivalently, they may be viewed as functions that use a short random seed to map a source on ...
Amnon Ta-Shma, Christopher Umans