Sciweavers

Share
ICMCS
2006
IEEE

Coarse-to-Fine Pedestrian Localization and Silhouette Extraction for the Gait Challenge Data Sets

9 years 11 months ago
Coarse-to-Fine Pedestrian Localization and Silhouette Extraction for the Gait Challenge Data Sets
This paper presents a localized coarse-to-fine algorithm for efficient and accurate pedestrian localization and silhouette extraction for the Gait Challenge data sets. The coarse detection phase is simple and fast. It locates the target quickly based on temporal differences and some knowledge on the human target. Based on this coarse detection, the fine detection phase applies a robust background subtraction algorithm to the coarse target regions and the detection obtained is further processed to produce the final results. This algorithm has been tested on 285 outdoor sequences from the Gait Challenge data sets, with wide variety of capture conditions. The pedestrian targets are localized very well and silhouettes extracted resemble the manually labeled silhouettes closely.
Haiping Lu, Konstantinos N. Plataniotis, Anastasio
Added 11 Jun 2010
Updated 11 Jun 2010
Type Conference
Year 2006
Where ICMCS
Authors Haiping Lu, Konstantinos N. Plataniotis, Anastasios N. Venetsanopoulos
Comments (0)
books