Chuanjun Li
ABSTRACT
Haptic data such as 3D motion capture data and sign language animation data are new forms of multimedia data. The motion data is multi-attribute, and indexing of multi-attribute data is important for quickly pruning the majority of irrelevant motions in order to have real-time animation applications. Indexing of multi-attribute data has been attempted for data of a few attributes by using R-tree or its variants after dimensionality reduction. In this paper, we exploit the singular value decomposition (SVD) properties of multi-attribute motion data matrices to obtain one representative vector for each of the motion data matrices of dozens or hundreds of attributes. Based on this representative vector, we propose a simple and efficient interval-tree based index structure for indexing motion data with large amount of attributes. At each tree level, only one component of the query vector needs to be checked during searching, comparing to all the components of the query vector that should get involved if an R-tree or its variants are used for indexing. Searching time is independent of the number of pattern motions indexed by the tree, making the index structure well scalable to large data repositories. Experiments show that up to 91∼93% irrelevant motions can be pruned for a query with no false dismissals, and the query searching time is less than 30 μ <i>s</i> with the existence of motion variations.
- R. Agrawal, C. Faloutsos, and A. Swami. Efficient similarity search in sequence databases. In Proceedings of the 4th Conference on Foundations of Data Organization and Algorithms, pages 69--84, October 1993. Google Scholar
Digital Library
- N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger. The R-tree: an efficient and robust access method for points and rectangles. In Proceedings of ACM SIGMOD Int'l Conference on Management of Data, pages 322--331, May 1990. Google ScholarDigital Library
- V. Castelli, A. Thomasian, and C.-S. Li. CSVD: Clustering and singular value decomposition for approximate similarity search in high-dimensional spaces. IEEE Transactions on knowledge and data engineering, 15(3):671--685, 2003. Google ScholarDigital Library
- K. Chakrabarti, E. J. Keogh, S. Mehrotra, and M. J. Pazzani. Locally adaptive dimensionality reduction for indexing large time series databases. ACM Transactions on Database Systems, 27(2):188--228, 2002. Google ScholarDigital Library
- K.-P. Chan and A. W.-C. Fu. Efficient time series matching by wavelets. In Proceedings of The 15th International Conference on Data Engineering, pages 126 -- 133, March 1999. Google ScholarDigital Library
- K.-P. Chan, A. W.-C. Fu, and C. Yu. Haar wavelets for efficient similarity search of time-seiers: With and without time warping. IEEE Transactions on knowledge and data engineering, 15(3):686--705, 2003. Google ScholarDigital Library
- C. Faloutsos, M. Ranganathan, and Y. Manolopoulos. Fast subsequence matching in time-series databases. In Proceedings of ACM SIGMOD Int'l Conference on Management of Data, pages 419--429, May 1994. Google ScholarDigital Library
- G. H. Golub and C. F. V. Loan. Matrix Computations. The Johns Hopkins University Press, Baltimore, Maryland, 1996.Google Scholar
- A. Guttman. R-trees: a dynamic index structure for spatial searching. In Proceedings of ACM SIGMOD Int'l Conference on Management of Data, pages 47--57, June 1984. Google ScholarDigital Library
- T. Kahveci, A. Singh, and A. Gurel. Similarity searching for multi-attribute sequences. In Proceedings. of 14th Int'l Conference on Scientific and Statistical Database Management, pages 175 -- 184, July 2002. Google ScholarDigital Library
- N. Katayama and S. Satoh. The SR-tree: a index structure for high-dimensional nearest neighbor queries. In Proceedings of ACM SIGMOD Int'l Conference on Management of Data, pages 369--380, May 1997. Google ScholarDigital Library
- E. J. Keogh, K. Chakrabarti, M. J. Pazzani, and S. Mehrotra. Dimensionality reduction for fast similarity search in large time series databases. Knowledge and Information Systems, 3(3):263--286, 2001.Google ScholarCross Ref
- F. Korn, H. V. Jagadish, and C. Faloutsos. Efficiently supporting ad hoc queries in large datasets of time sequences. In Proceedings of ACM SIGMOD Int'l Conference on Management of Data, pages 289--300, May 1997. Google ScholarDigital Library
- S.-L. Lee, S.-J. Chun, D.-H. Kim, J.-H. Lee, and C.-W. Chung. Similarity search for multidimensional data sequences. In Proceedings. of 16th Int'l Conference on Data Engineering, pages 599 -- 608, Feb./Mar. 2000. Google ScholarDigital Library
- C. Li, P. Zhai, S.-Q. Zheng, and B. Prabhakaran. Segmentation and recognition of multi-attribute motion sequences. To appear in Proceedings of The ACM Multimedia Conference 2004, October 2004. Google ScholarDigital Library
- I. Popivanov and R. J. Miller. Similarity search over time series data using wavelets. In Proceedings of The 18th International Conference on Data Engineering, pages 212--221, Feburary 2002. Google ScholarDigital Library
- B. D. Schutter and B. D. Moor. The singular value decomposition in the extended max algebra. Linear Algebra and Its Applications, 250:143--176, 1997.Google ScholarCross Ref
- C. Shahabi and D. Yan. Real-time pattern isolation and recognition over immersive sensor data streams. In Proceedings of The 9th Int'l Conference on Multi-Media Modeling, pages 93--113, January 2003.Google Scholar
- M. Vlachos, M. Hadjieleftheriou, D. Gunopulos, and E. Keogh. Indexing multi-dimensional time-series with support for multiple distance measures. In Proceedings of ACM SIGMOD Int'l Conference on Management of Data, pages 216--225, August 2003. Google ScholarDigital Library
Index Terms
- Indexing of variable length multi-attribute motion data
Recommendations
Real-time classification of variable length multi-attribute motions
Multi-attribute motion data can be generated in many applications/ devices, such as motion capture devices and animations. It can have dozens of attributes, thousands of rows, and even similar motions can have different durations and different speeds at ...
Segmentation and recognition of multi-attribute motion sequences
MULTIMEDIA '04: Proceedings of the 12th annual ACM international conference on MultimediaIn this work, we focus on fast and efficient recognition of motions in multi-attribute continuous motion sequences. 3D motion capture data, animation motion data, and sensor data from gesture sensing devices are examples of multi-attribute continuous ...
An efficient parallel indexing structure for multi-dimensional big data using spark
AbstractWith the increasing daily production of data in recent years, indexing, storing and retrieving huge amounts of data have become a common problem, especially for multi-dimensional big data. Although R-tree has proved to be efficient for indexing ...
Comments