Except for gait analysis in a controlled environment, few have considered the use of motion characteristics for human identification, due to the complexity caused by the spatial nonrigidity and temporal randomness of human action. This work is a new attempt at mining biometric information from more general actions. A novel method for calculating the distance between two time series is proposed, where automatic segmentation and matching are conducted simultaneously. Given a query sequence, our method can efficiently match it against the gallery dataset. Local continuity and global optimality are both considered. The matching algorithm is efficiently solved by Linear Programming (LP). Synthetic data sequences and challenging broadcast sports videos are used to validate the effectiveness of our algorithm. The results show that action-based biometrics are promising for human identification, and the proposed approach is effective for this application. © 2013 Springer-Verlag.
CITATION STYLE
Hu, M., Wang, Y., & Little, J. J. (2013). Combinational subsequence matching for human identification from general actions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7726 LNCS, pp. 453–464). https://doi.org/10.1007/978-3-642-37431-9_35
Mendeley helps you to discover research relevant for your work.