ACM Home Page
Please provide us with feedback. Feedback
Rotation invariant distance measures for trajectories
Full text PdfPdf (306 KB)
Source International Conference on Knowledge Discovery and Data Mining archive
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining table of contents
Seattle, WA, USA
POSTER SESSION: Research track posters table of contents
Pages: 707 - 712  
Year of Publication: 2004
ISBN:1-58113-888-1
Authors
Michail Vlachos  UCR
D. Gunopulos  UCR
Gautam Das  Microsoft Research
Sponsors
SIGMOD: ACM Special Interest Group on Management of Data
SIGKDD: ACM Special Interest Group on Knowledge Discovery in Data
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 80,   Citation Count: 8
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1014052.1014144
What is a DOI?

ABSTRACT

For the discovery of similar patterns in 1D time-series, it is very typical to perform a normalization of the data (for example a transformation so that the data follow a zero mean and unit standard deviation). Such transformations can reveal latent patterns and are very commonly used in datamining applications. However, when dealing with multidimensional time-series, which appear naturally in applications such as video-tracking, motion-capture etc, similar motion patterns can also be expressed at different orientations. It is therefore imperative to provide support for additional transformations, such as rotation. In this work, we transform the positional information of moving data, into a space that is translation, scale and rotation invariant. Our distance measure in the new space is able to detect elastic matches and can be efficiently lower bounded, thus being computationally tractable. The proposed methods are easy to implement, fast to compute and can have many applications for real world problems, in areas such as handwriting recognition and posture estimation in motion-capture data. Finally, we empirically demonstrate the accuracy and the efficiency of the technique, using real and synthetic handwriting data.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
D. Berndt and J. Clifford. Using Dynamic Time Warping to Find Patterns in Time Series. In Proc. of KDD Workshop, 1994.
 
3
 
4
 
5
S. Gold, A. Rangarajan, C.-P. Lu, S. Pappu, and E. Mjolsness. New algorithms for 2d and 3d point matching: Pose estimation and correspondence. In Pattern Recognition, vol. 31, no. 8, 1998.
 
6
 
7
 
8
E. Keogh. Exact indexing of dynamic time warping. In Proc. of VLDB, pages 406--417, 2002.
 
9
E. Keogh, K. Chakrabarti, M. Pazzani, and S. Mehrotra. Dimensionality reduction for fast similarity search in large time series databases. In Journal of Knowledge and Information Systems, 2000.
 
10
J. B. A. Maintz and M. A. Viergever. A survey of medical image registration. In Medical Image Analysis, 1998.
 
11
W. Rodriguez, M. Last, A. Kandel, and H. Bunke. 3-dimensional curve similarity using string matching. In 3rd International Symposium on Intelligent Manufacturing Systems, Sakarya, Turkey, 2001.
 
12
B. Scassellati. Retrieving images by 2d shape: a comparison of computation methods with human perceptual judgments. In Storage and Retrieval for Image and Video Databases (SPIE), 1994.
 
13
J. B. Tenenbaum, V. de Silva, and J. C. Langford. A global geometric framework for nonlinear dimensionality reduction. Science v.290 no.5500, pages 2319--2323, 2000.
14
 
15
16

CITED BY  8

Collaborative Colleagues:
Michail Vlachos: colleagues
D. Gunopulos: colleagues
Gautam Das: colleagues