TY - GEN
T1 - Distributed activity recognition with fuzzy-enabled wireless sensor networks
AU - Marin-Perianu, M.
AU - Lombriser, C.
AU - Amft, O.D.
AU - Havinga, P.J.M.
AU - Tröster, G.
PY - 2008
Y1 - 2008
N2 - Wireless sensor nodes can act as distributed detectors for recognizing activities online, with the final goal of assisting the users in their working environment. We propose an activity recognition architecture based on fuzzy logic, through which multiple nodes collaborate to produce a reliable recognition result from unreliable sensor data. As an extension to the regular fuzzy inference, we incorporate temporal order knowledge of the sequences of operations involved in the activities. The performance evaluation is based on experimental data from a car assembly trial. The system achieves an overall recognition performance of 0.81 recall and 0.79 precision with regular fuzzy inference, and 0.85 recall and 0.85 precision when considering temporal order knowledge. We also present early experiences with implementing the recognition system on sensor nodes. The results show that the algorithms can run online, with execution times in the order of 40ms, for the whole recognition chain, and memory overhead in the order of 1.5kB RAM. © 2008 Springer-Verlag Berlin Heidelberg.
AB - Wireless sensor nodes can act as distributed detectors for recognizing activities online, with the final goal of assisting the users in their working environment. We propose an activity recognition architecture based on fuzzy logic, through which multiple nodes collaborate to produce a reliable recognition result from unreliable sensor data. As an extension to the regular fuzzy inference, we incorporate temporal order knowledge of the sequences of operations involved in the activities. The performance evaluation is based on experimental data from a car assembly trial. The system achieves an overall recognition performance of 0.81 recall and 0.79 precision with regular fuzzy inference, and 0.85 recall and 0.85 precision when considering temporal order knowledge. We also present early experiences with implementing the recognition system on sensor nodes. The results show that the algorithms can run online, with execution times in the order of 40ms, for the whole recognition chain, and memory overhead in the order of 1.5kB RAM. © 2008 Springer-Verlag Berlin Heidelberg.
U2 - 10.1007/978-3-540-69170-9_20
DO - 10.1007/978-3-540-69170-9_20
M3 - Conference contribution
T3 - Lecture Notes in Computer Science
SP - 296
EP - 313
BT - 4th IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2008, 11 June 2008 through 14 June 2008, Santorini Island
ER -