搜索Top-K相似的移动视频

Wei Ding, Qingbin Yu, Zhongxin Du, Mengru Ma, Yingjie Chen
{"title":"搜索Top-K相似的移动视频","authors":"Wei Ding, Qingbin Yu, Zhongxin Du, Mengru Ma, Yingjie Chen","doi":"10.1145/3546000.3546026","DOIUrl":null,"url":null,"abstract":"The application of sensors enables mobile devices to generate amounts of content-aware data, such as trajectory, gyro, and video data. Moving video is an emerging new type of moving object that can provide a potential source for geo-referenced applications. Measuring the similarity of moving videos is widely used in traffic management, tourist recommendations, and location-based advertising. Our prior work proposed two similarity measures, the Largest Common View Subsequences can accurately calculate similar moving videos, and the View Vector Subsequences can fast calculate similar moving videos. In this paper, we proposed the searching top-k similar moving videos (K-SSMV). First, we give the problem definition of searching top-k similar moving videos. Then, we illustrated the strategy of searching for moving videos. Specifically, we sorted the video pairs by the most similar videos. Since the similar videos would be less than k, we first calculated the similarity of moving videos by the Largest Common View Subsequences algorithm, if the number of similar videos is less than k, we will adopt the View Vector Subsequences algorithm to compute the similarity of moving videos. Next, we mixed the candidate videos calculated by the Largest Common View Subsequences and the View Vector Subsequences algorithms, the searching top-k similar moving videos algorithm picked the top-k similar videos from candidate videos. Finally, we evaluated the performance of our proposed algorithms on the accuracy and computational cost. The experiments verified that our algorithms can efficiently search top-k similar moving videos.","PeriodicalId":196955,"journal":{"name":"Proceedings of the 6th International Conference on High Performance Compilation, Computing and Communications","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2022-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Searching Top-K Similar Moving Videos\",\"authors\":\"Wei Ding, Qingbin Yu, Zhongxin Du, Mengru Ma, Yingjie Chen\",\"doi\":\"10.1145/3546000.3546026\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The application of sensors enables mobile devices to generate amounts of content-aware data, such as trajectory, gyro, and video data. Moving video is an emerging new type of moving object that can provide a potential source for geo-referenced applications. Measuring the similarity of moving videos is widely used in traffic management, tourist recommendations, and location-based advertising. Our prior work proposed two similarity measures, the Largest Common View Subsequences can accurately calculate similar moving videos, and the View Vector Subsequences can fast calculate similar moving videos. In this paper, we proposed the searching top-k similar moving videos (K-SSMV). First, we give the problem definition of searching top-k similar moving videos. Then, we illustrated the strategy of searching for moving videos. Specifically, we sorted the video pairs by the most similar videos. Since the similar videos would be less than k, we first calculated the similarity of moving videos by the Largest Common View Subsequences algorithm, if the number of similar videos is less than k, we will adopt the View Vector Subsequences algorithm to compute the similarity of moving videos. Next, we mixed the candidate videos calculated by the Largest Common View Subsequences and the View Vector Subsequences algorithms, the searching top-k similar moving videos algorithm picked the top-k similar videos from candidate videos. Finally, we evaluated the performance of our proposed algorithms on the accuracy and computational cost. The experiments verified that our algorithms can efficiently search top-k similar moving videos.\",\"PeriodicalId\":196955,\"journal\":{\"name\":\"Proceedings of the 6th International Conference on High Performance Compilation, Computing and Communications\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-06-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 6th International Conference on High Performance Compilation, Computing and Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3546000.3546026\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 6th International Conference on High Performance Compilation, Computing and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3546000.3546026","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

传感器的应用使移动设备能够生成大量的内容感知数据,如轨迹、陀螺仪和视频数据。移动视频是一种新兴的新型移动对象,可以为地理参考应用提供潜在的来源。测量移动视频的相似性被广泛应用于交通管理、旅游推荐和基于位置的广告。我们之前的工作提出了两种相似度度量,最大公共视图子序列可以准确地计算相似的运动视频,而视图向量子序列可以快速计算相似的运动视频。本文提出了搜索top-k相似运动视频的方法(K-SSMV)。首先,给出了搜索top-k相似运动视频的问题定义。然后,我们说明了搜索移动视频的策略。具体来说,我们根据最相似的视频对视频对进行排序。由于相似视频的个数小于k,我们首先用最大公共视图子序列算法计算运动视频的相似度,如果相似视频的个数小于k,我们将采用视图向量子序列算法计算运动视频的相似度。接下来,我们将最大公共视图子序列和视图向量子序列算法计算的候选视频进行混合,搜索top-k相似移动视频算法从候选视频中选择top-k相似视频。最后,我们从准确率和计算成本两方面评估了所提出算法的性能。实验证明,我们的算法可以有效地搜索top-k相似的运动视频。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Searching Top-K Similar Moving Videos
The application of sensors enables mobile devices to generate amounts of content-aware data, such as trajectory, gyro, and video data. Moving video is an emerging new type of moving object that can provide a potential source for geo-referenced applications. Measuring the similarity of moving videos is widely used in traffic management, tourist recommendations, and location-based advertising. Our prior work proposed two similarity measures, the Largest Common View Subsequences can accurately calculate similar moving videos, and the View Vector Subsequences can fast calculate similar moving videos. In this paper, we proposed the searching top-k similar moving videos (K-SSMV). First, we give the problem definition of searching top-k similar moving videos. Then, we illustrated the strategy of searching for moving videos. Specifically, we sorted the video pairs by the most similar videos. Since the similar videos would be less than k, we first calculated the similarity of moving videos by the Largest Common View Subsequences algorithm, if the number of similar videos is less than k, we will adopt the View Vector Subsequences algorithm to compute the similarity of moving videos. Next, we mixed the candidate videos calculated by the Largest Common View Subsequences and the View Vector Subsequences algorithms, the searching top-k similar moving videos algorithm picked the top-k similar videos from candidate videos. Finally, we evaluated the performance of our proposed algorithms on the accuracy and computational cost. The experiments verified that our algorithms can efficiently search top-k similar moving videos.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Track planning and obstacle avoidance of wave glider based on improved artificial potential field algorithm Explore Deep Feature Learning to Power Equipment Monitoring and Defect Detection Attention Modulates the Neural Oscillation of Theta Frequency in Audiovisual Integration Research on Medical Image Classification Based on Image Segmentation and Feature Fusion High-Performance Cryptographic SoC Virtual Prototyping Platform Based on RISC-V VP
×
引用
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