TY - GEN
T1 - Indexing of variable length multi-attribute motion data
AU - Li, Chuanjun
AU - Pradhan, Gaurav
AU - Zheng, S. Q.
AU - Prabhakaran, B.
PY - 2004
Y1 - 2004
N2 - 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 μs with the existence of motion variations.
AB - 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 μs with the existence of motion variations.
KW - Dimensionality reduction
KW - Indexing
KW - Multi-attribute motion
KW - Similarity
KW - Singular value decomposition
UR - http://www.scopus.com/inward/record.url?scp=20444497937&partnerID=8YFLogxK
U2 - 10.1145/1032604.1032617
DO - 10.1145/1032604.1032617
M3 - Conference contribution
AN - SCOPUS:20444497937
SN - 1581139756
SN - 9781581139754
T3 - MMDB 2004: Proceedings of the Second ACM International Workshop on Multimedia Databases
SP - 75
EP - 84
BT - MMDB 2004
PB - Association for Computing Machinery
T2 - MMDB 2004: Proceedings of the Second ACM International Workshop on Multimedia Databases
Y2 - 13 November 2004 through 13 November 2004
ER -