Simplest Representation Yet for Gait Recognition: Averaged Silhouette

We present a robust representation for gait recognition that is compact, easy to construct, and affords efficient matching. Instead of a time series based representation comprising of a sequence of raw silhouette frames or of features extracted therein, as has been the practice, we simply align and average the silhouettes over one gait cycle. We then base recognition on the Euclidean distance between these averaged silhouette representations. We show, using the recently formulated gait challenge problem (www.gaitchallenge.org), that the improvement in execution time is 30 times while possessing recognition power that is comparable to the gait baseline algorithm, which is becoming the comparison standard in gait recognition. Experiments with portions of the average silhouette representation show that recognition power is not entirely derived from upper body shape, rather the dynamics of the legs also contribute equally to recognition. However, this study does raise intriguing doubts ab...

• Type: Conference
• Year: 2004
• Where: ICPR
• Authors: Sudeep Sarkar, Zongyi Liu
• Keywords: Computer Vision, Gait Baseline Algorithm, Gait Challenge Problem, Gait Recognition, ICPR 2004