TY - JOUR
T1 - A flexible sequence alignment approach on pattern mining and matching for human activity recognition
AU - Huang, Po Cheng
AU - Lee, Sz Shian
AU - Kuo, Yaw Huang
AU - Lee, Kuan Rong
N1 - Funding Information:
This study is conducted under the “III Innovative and Prospective Technologies Project” of the Institute for Information Industry which is subsidized by the Ministry of Economy Affairs of the Republic of China.
PY - 2010/1
Y1 - 2010/1
N2 - This paper proposes a flexible sequence alignment approach for pattern mining and matching in the recognition of human activities. During pattern mining, the proposed sequence alignment algorithm is invoked to extract out the representative patterns which denote specific activities of a person from the training patterns. It features high performance and robustness on pattern diversity. Besides, the algorithm evaluates the appearance probability of each pattern as weight and allows adapting pattern length to various human activities. Both of them are able to improve the accuracy of activity recognition. In pattern matching, the proposed algorithm adopts a dynamic programming based strategy to evaluate the correlation degree between each representative activity pattern and the observed activity sequence. It can avoid the trouble on segmenting the observed sequence. Moreover, we are able to obtain recognition results continuously. Besides, the proposed matching algorithm favors recognition of concurrent human activities with parallel matching. The experimental result confirms the high accuracy of human activity recognition by the proposed approach.
AB - This paper proposes a flexible sequence alignment approach for pattern mining and matching in the recognition of human activities. During pattern mining, the proposed sequence alignment algorithm is invoked to extract out the representative patterns which denote specific activities of a person from the training patterns. It features high performance and robustness on pattern diversity. Besides, the algorithm evaluates the appearance probability of each pattern as weight and allows adapting pattern length to various human activities. Both of them are able to improve the accuracy of activity recognition. In pattern matching, the proposed algorithm adopts a dynamic programming based strategy to evaluate the correlation degree between each representative activity pattern and the observed activity sequence. It can avoid the trouble on segmenting the observed sequence. Moreover, we are able to obtain recognition results continuously. Besides, the proposed matching algorithm favors recognition of concurrent human activities with parallel matching. The experimental result confirms the high accuracy of human activity recognition by the proposed approach.
UR - http://www.scopus.com/inward/record.url?scp=70349445623&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70349445623&partnerID=8YFLogxK
U2 - 10.1016/j.eswa.2009.05.057
DO - 10.1016/j.eswa.2009.05.057
M3 - Article
AN - SCOPUS:70349445623
SN - 0957-4174
VL - 37
SP - 298
EP - 306
JO - Expert Systems With Applications
JF - Expert Systems With Applications
IS - 1
ER -