可变长度多属性运动数据的索引

Chuanjun Li, G. Pradhan, Si-Qing Zheng, B. Prabhakaran
{"title":"可变长度多属性运动数据的索引","authors":"Chuanjun Li, G. Pradhan, Si-Qing Zheng, B. Prabhakaran","doi":"10.1145/1032604.1032617","DOIUrl":null,"url":null,"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.","PeriodicalId":415406,"journal":{"name":"ACM International Workshop on Multimedia Databases","volume":"53 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":"{\"title\":\"Indexing of variable length multi-attribute motion data\",\"authors\":\"Chuanjun Li, G. Pradhan, Si-Qing Zheng, B. Prabhakaran\",\"doi\":\"10.1145/1032604.1032617\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":415406,\"journal\":{\"name\":\"ACM International Workshop on Multimedia Databases\",\"volume\":\"53 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-11-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"19\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM International Workshop on Multimedia Databases\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1032604.1032617\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM International Workshop on Multimedia Databases","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1032604.1032617","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 19

摘要

三维动作捕捉数据、手语动画数据等触觉数据是多媒体数据的新形式。运动数据是多属性的,多属性数据的索引对于快速修剪大部分不相关的运动以实现实时动画应用非常重要。利用r树或r树的变体在降维后,尝试对少数属性的数据进行多属性数据索引。本文利用多属性运动数据矩阵的奇异值分解(SVD)特性,对包含数十个或数百个属性的运动数据矩阵分别获得一个代表向量。在此代表性向量的基础上,提出了一种简单高效的基于区间树的索引结构,用于索引具有大量属性的运动数据。在每个树级别,在搜索期间只需要检查查询向量的一个组件,而如果使用r树或其变体进行索引,则应该检查查询向量的所有组件。搜索时间与树索引的模式运动的数量无关,这使得索引结构可以很好地扩展到大型数据存储库。实验表明,在不存在假解散的情况下,查询可以修剪高达91 ~ 93%的不相关运动,并且在存在运动变化的情况下,查询搜索时间小于30 μ s。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Indexing of variable length multi-attribute motion data
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Automatic image annotation and retrieval using subspace clustering algorithm Indexing of variable length multi-attribute motion data A motion based scene tree for browsing and retrieval of compressed videos VRules: an effective association-based classifier for videos Content-based sub-image retrieval using relevance feedback
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1