• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Chen Changyou and Zhang Junping. An Iterative Gait Prototype Learning Algorithm Based on Tangent Distance[J]. Journal of Computer Research and Development, 2008, 45(7).
Citation: Chen Changyou and Zhang Junping. An Iterative Gait Prototype Learning Algorithm Based on Tangent Distance[J]. Journal of Computer Research and Development, 2008, 45(7).

An Iterative Gait Prototype Learning Algorithm Based on Tangent Distance

More Information
  • Published Date: July 14, 2008
  • Being the only biometry certification techniques for remote surveillance, gait recognition, on one hand, is regarded as being of important potential value, hence a lot of algorithms have been proposed, on the other hand, it has encountered a lot of challenges. Among all of the challenges gait recognition encountered, one of them is how to extract features efficiently from a sequence of gait frames. To solve this problem, and also based on the fact that gait energy image (GEI) is effective for feature representation, an iterative prototype algorithm based on tangent distance is proposed. Firstly, it is assumed that different gaits lie in different manifolds. As a result, the proposed algorithm refines the definition of gait energy image(GEI) using tangent distance. Then an iterative algorithm is proposed to learn the prototypes by solving an optimization problem. Finally, principal component analysis (PCA) is performed on the prototypes to obtain gait features for classification. The proposed method is proved converged, and experiment results show the promising results of the proposed algorithm in accuracy compared with the GEIs. The rationality of the assumption that gaits lie in specific manifolds is also validated through experiments.
  • Related Articles

    [1]Wang Xianghai, Huang Junying, Li Ming. Approximate Degree Reduction Method by Blending of Multi-Triangular Bézier Surfaces with GC\+1 Constraint[J]. Journal of Computer Research and Development, 2013, 50(5): 1012-1020.
    [2]Liu Zhi, Tan Jieqing, Chen Xiaoyan. Cubic Bézier Triangular Patch with Shape Parameters[J]. Journal of Computer Research and Development, 2012, 49(1): 152-157.
    [3]Huang Weixian and Wang Guojin. Ribs and Fans of Bézier Curves and Surfaces with Endpoints G1 Continuity[J]. Journal of Computer Research and Development, 2011, 48(9): 1781-1787.
    [4]Zhi Dejia and Wang Guojin. Bézier Approximate Merging by Interval Curves[J]. Journal of Computer Research and Development, 2011, 48(4): 675-682.
    [5]Chen Jun and Wang Guojin. Optimal Parameterizations of the Degree 2 Rational Bézier Curves[J]. Journal of Computer Research and Development, 2008, 45(9): 1601-1604.
    [6]Tang Min, Tang Yang, Xu Lizhong, Pheng Ann Heng, Xia Deshen. 3D Segmentation Based on Cylindrical B-Spline Active Surface Model[J]. Journal of Computer Research and Development, 2007, 44(9): 1604-1611.
    [7]Xu Gang and Wang Guozhao. Extensions of Uniform Cubic B-Spline Curve with Local Shape Parameters[J]. Journal of Computer Research and Development, 2007, 44(6): 1032-1037.
    [8]Liu Xumin, Huang Houkuan, Wang Liuqiang, Ma Sujing. Study of Spline-Curves with Shape Parameters[J]. Journal of Computer Research and Development, 2007, 44(3).
    [9]Chen Jun and Wang Guojin. Constructing Convexity-Preserving Interpolation Curves of Hyperbolic Polynomial B-Splines Using a Shape Parameter[J]. Journal of Computer Research and Development, 2006, 43(7): 1216-1224.
    [10]Liu Yi and Zhang Caiming. Study of Determining a Conic with Five Constrained Points and Its Application in Parametric Interpolation[J]. Journal of Computer Research and Development, 2005, 42(12): 2161-2168.

Catalog

    Article views (341) PDF downloads (585) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return