Name
Abstract | ||
|---|---|---|
Particle filtering provides a well-developed and widely adopted approach to visual tracking. For effective tracking in real-world environments the particle set must sample widely enough that it can represent alternative target states in areas of ambiguity. It must not, however, become diffuse, spreading across the image plane rather than clustering around the object(s) of interest. A key issue in the design of particle filter-based trackers is how to manage the spread of the particle set to balance these conflicting requirements. To be computationally efficient, balance must be achieved with as small a particle set as reasonably possible. A number of hybrid particle filter/mean-shift trackers have recently been proposed. We believe that their strength lies in their ability to alternately disperse and cluster particles together, providing both a degree of balance and a reduced particle set. We present a novel hybrid of the annealed particle filter and kernel mean-shift algorithms that emphasises this behaviour. The algorithm has been applied to a wide variety of artificial and real image sequences. The method has performance and efficiency advantages over both pure kernel mean-shift and particle filtering trackers and existing hybrid algorithms |
Year | Venue | Keywords |
|---|---|---|
2007 | BMVC | hybrid algorithm,mean shift,particle filter,visual tracking |
Field | DocType | Citations |
Kernel (linear algebra),Computer vision,Computer science,Particle filter,Image plane,Artificial intelligence,Real image,Mean-shift,Monte Carlo localization,Cluster analysis,Auxiliary particle filter | Conference | 5 |
PageRank | References | Authors |
0.44 | 7 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Asad Naeem | 1 | 15 | 1.60 |
| Tony P. Pridmore | 2 | 143 | 40.24 |
| Steven Mills | 3 | 5 | 0.44 |