Automatic Recognition of Gait Phases Using a Multiple-Regression Hidden Markov Model

This paper presents a new approach for automatic recognition of gait phases based on the use of an in-shoe pressure measurement system and a multiple-regression hidden Markov model (MRHMM) that takes into account the sequential completion of the gait phases. Recognition of gait phases is formulated...

Full description

Saved in:
Bibliographic Details
Published inIEEE/ASME transactions on mechatronics Vol. 23; no. 4; pp. 1597 - 1607
Main Authors Attal, Ferhat, Amirat, Yacine, Chibani, Abdelghani, Mohammed, Samer
Format Journal Article
LanguageEnglish
Published New York IEEE 01.08.2018
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Institute of Electrical and Electronics Engineers
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:This paper presents a new approach for automatic recognition of gait phases based on the use of an in-shoe pressure measurement system and a multiple-regression hidden Markov model (MRHMM) that takes into account the sequential completion of the gait phases. Recognition of gait phases is formulated as a multiple polynomial regression problem, in which each phase, called a segment, is modeled using an appropriate polynomial function. The MRHMM is learned in an unsupervised manner to avoid manual data labeling, which is a laborious time-consuming task that is subject to potential errors, particularly for large amounts of data. To evaluate the efficiency of the proposed approach, several performance metrics for classification are used: accuracy, F-measure, recall, and precision. Experiments conducted with five subjects during walking show the potential of the proposed method to recognize gait phases with relatively high accuracy. The proposed approach outperforms standard unsupervised classification methods (Gaussian mixture model, k-means, and hidden Markov model), while remaining competitive with respect to standard supervised classification methods (support vector machine, random forest, and k-nearest neighbor).
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1083-4435
1941-014X
DOI:10.1109/TMECH.2018.2836934