Target classification in sparse sampling acoustic sensor networks using IDDC algorithm

Authors:
Youngsoo Kim;Daeyoung Kim;Taehong Kim;Jongwoo Sung;Seongeun Yoo
Affiliations:
Real-time and Embedded Systems Laboratory, Information and Communications University, Daejon, Korea;Real-time and Embedded Systems Laboratory, Information and Communications University, Daejon, Korea;Real-time and Embedded Systems Laboratory, Information and Communications University, Daejon, Korea;Real-time and Embedded Systems Laboratory, Information and Communications University, Daejon, Korea;Real-time and Embedded Systems Laboratory, Information and Communications University, Daejon, Korea
Venue:
EUC'07 Proceedings of the 2007 conference on Emerging direction in embedded and ubiquitous computing
Year:
2007

Citing 5
Cited 0

GroupLens: an open architecture for collaborative filtering of netnews

CSCW '94 Proceedings of the 1994 ACM conference on Computer supported cooperative work
Vehicle classification in distributed sensor networks

Journal of Parallel and Distributed Computing
Robust and fast similarity search for moving object trajectories

Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Partial Elastic Matching of Time Series

ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
On the marriage of Lp-norms and edit distance

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30

Quantified Score

Hi-index	0.00

Visualization

Abstract

The analysis of time series using data mining techniques can be effective when all targets have their own inherent patterns in a sparse sampling acoustic sensor network where no valid feature of frequency can be extracted. However, both problems of local time shifting and spatial variations should be solved to deploy the time series analysis. This paper presents time-warped similarity measure algorithms in order to solve the two problems through time series, and we propose the IDDC (Improved Derivative DTW-Cosine) algorithm to deliver the optimal result and prove the performance with some experiments. The experimental results show that the object classification accuracy rate of the proposed algorithm outperforms the other time-warped similarity measure algorithms by at least 10.23%. Since this proposed algorithm produces such a satisfactory result with sparse sampling data, it allows us to classify objects with relatively low overhead.