We enjoyed reading this article on human recognition based on gait using shape space theory. Having attended the recently held SAMSI workshop on statistical analysis of shapes, we appreciate the need to bring together mathematicians, statisticians, and computer vision researchers. Before we begin a discussion of the article, we would like to provide a brief history of shape analysis in the image analysis and computer vision community. Analysis of planar shapes has a long history in image analysis and computer vision dating back to the early 1960s, when moments were introduced as shape descriptors (Hu 1962). In the early 1970s, Fourier descriptors of several types (Persoon and Fu 1977; Zahn and Roskies 1972; Pavlidis 1978) and extensions of moments (Khotanzad and Hong 1990) were introduced. Stochastic descriptions of shapes were introduced by Kashyap and Chellappa (1981) using the notion of circular autoregressive (CAR) models, a special case of cyclostationary process used in the article under discussion. The CAR models were used for OCR applications by Dubois and Glanz (1986). Some of the shape descriptors (Zahn and Roskies 1972) were naturally invariant to transformations such as rotation, scaling, and translation, whereas for many others, simple (Kashyap and Chellappa 1981) to complicated transformations (Khotanzad and Hong 1990) of the shape parameters were used. Recently, the procrustes matching algorithm has been extended to tackle small errors in feature correspondence using the softassign Procrustes matching algorithm (Rangarajan, Chui, and Bookstein 1997) which simultaneously establishes correspondences and determines the Procrustes fit. Another approach for shape matching produces a dense shape descriptor called the shape-context (Belongie, Malik, and Puzicha 2002) which captures the distribution of all pairs of points on the boundary of a shape. This method has recently been extended in order to make the shape-context feature invariant to articulations by using the inner-distance shape context (Ling and Jacobs 2007). In passing, we would like to note that the representation used by the authors is similar to the tangent angle versus arc length used by Zahn and Roskies (1972). Some of these descriptors are sensitive to where the origin of tracing is placed, as in the representation used by Kaziska and Srivastava. Because most image analysis and computer vision researchers have not been exposed to differential geometry, shape-matching techniques have been derived using linear techniques and Euclidean metrics. The notion of using statistical shape theory to analyze gait sequences has been of recent interest. Landmark-based descriptions were considered by Vaswani, Roy-Chowdhury, and
[1]
Haibin Ling,et al.
Shape Classification Using the Inner-Distance
,
2007,
IEEE Transactions on Pattern Analysis and Machine Intelligence.
[2]
Ashok Veeraraghavan,et al.
The Function Space of an Activity
,
2006,
2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).
[3]
Sudeep Sarkar,et al.
Improved gait recognition by gait dynamics normalization
,
2006,
IEEE Transactions on Pattern Analysis and Machine Intelligence.
[4]
Rama Chellappa,et al.
"Shape Activity": a continuous-state HMM for moving/deforming shapes with application to abnormal activity detection
,
2005,
IEEE Transactions on Image Processing.
[5]
Sudeep Sarkar,et al.
The humanID gait challenge problem: data sets, performance, and analysis
,
2005,
IEEE Transactions on Pattern Analysis and Machine Intelligence.
[6]
Rama Chellappa,et al.
Identification of humans using gait
,
2004,
IEEE Transactions on Image Processing.
[7]
Anand Rangarajan,et al.
The Softassign Procrustes Matching Algorithm
,
1997,
IPMI.
[8]
Alireza Khotanzad,et al.
Invariant Image Recognition by Zernike Moments
,
1990,
IEEE Trans. Pattern Anal. Mach. Intell..
[9]
Filson H. Glanz,et al.
An Autoregressive Model Approach to Two-Dimensional Shape Classification
,
1986,
IEEE Transactions on Pattern Analysis and Machine Intelligence.
[10]
Rama Chellappa,et al.
Stochastic models for closed boundary analysis: Representation and reconstruction
,
1981,
IEEE Trans. Inf. Theory.
[11]
Theodosios Pavlidis,et al.
A review of algorithms for shape analysis
,
1978
.
[12]
King-Sun Fu,et al.
Shape Discrimination Using Fourier Descriptors
,
1977,
IEEE Transactions on Pattern Analysis and Machine Intelligence.
[13]
Ralph Roskies,et al.
Fourier Descriptors for Plane Closed Curves
,
1972,
IEEE Transactions on Computers.
[14]
Ming-Kuei Hu,et al.
Visual pattern recognition by moment invariants
,
1962,
IRE Trans. Inf. Theory.