Quasi-Random Sampling for Condensation

By Vasanth Philomin, Ramani Duraiswami, Larry S. Davis. 2000

59 citations recorded by the source corpus.

Subfields: Computer Vision and Pattern Recognition, Numerical Analysis, Statistics and Probability, Probabilistic & Bayesian Methods

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Vision and Pattern Recognition

In Numerical Analysis

In Statistics and Probability

In Probabilistic & Bayesian Methods

Citations in the corpus

Sequential Kernel Herding: Frank-Wolfe Optimization for Particle Filtering (2015, methodology): “By re-placing random sampling with a quasi-random number sequence, we obtain the already proposed sequential quasi-Monte Carlo scheme (Philomin et al., 2000; Or-moneit et al., 2001; Gerber and Chopin, 2014).”
Data fusion for visual tracking with particles (2004, unknown): “See examples in [7], [13], [14], [26], [28], [41], [43], [45], [46], [48], [49].”
Monte Carlo and Quasi-Monte Carlo Sampling (2009, background): “In addition to the reference [354] mentioned above, other papers that discuss the use of quasi–Monte Carlo within bootstrap filters are [117, 376].”
Multi-cue Pedestrian Detection and Tracking from a Moving Vehicle (2007, background): “Representations such as Active Shape Models (Baumberg and Hogg, 1994; Cootes et al., 1995; Philomin et al., 2000), shape exemplars (Stenger et al., 2003; Toyama and Blake, 2001) and color blobs (Heisele and Wöhler, 1998) have been combined with Kalman- (Baumberg and Hogg, 1994; Cootes et al., 1995)”
Fast multiple object tracking via a hierarchical particle filter (2005, methodology): “To improve the running of the tracking algorithm we also employ the Streaming SIMD Extensions (SSE) and SSE2 instructions in the Pentium 4 processor.”
Monocular Pedestrian Detection: Survey and Experiments (2009, unknown): “For this, either single [4], [26], [55], [70], [76] or multiple cues [32], [43], [50], [58], [65] are used.”
Lattice Particle Filters (2001, methodology): “e that the random shift in (9) is essential to this result and is a principal difference between the LPF and previous work on QMC-based filtering where samples are gen erated deterministically, e.g. [18]. 6 Experiments To test the LPF we compare it to a conventional PF that uses residual sampling [1”