首页 > 最新文献
paperpass

Proceedings of the 19th ACM international conference on Multimedia最新文献

英文 中文
Positionit: an image-based remote target localization system on smartphones 定位:智能手机上基于图像的远程目标定位系统
Pub Date : 2011-11-28 DOI: 10.1145/2072298.2072476
Qia Wang, Alex Lobzhanidze, S. Roy, W. Zeng, Yi Shang
We present PositionIt, a novel, low-cost, image-based remote target localization system using commodity smartphones. By leveraging smartphones' built-in sensors such as camera, digital compass, GPS, etc., the system can estimate the distance/position of remote targets. The system also takes advantage of the user-friendly interface of the smartphones to facilitate low complexity implementation (e.g., to locate target of interest and restrict the search area for matching).The feasibility of both single-image and two-image based systems are demonstrated.
我们提出的定位,一个新颖的,低成本的,基于图像的远程目标定位系统使用商品智能手机。通过利用智能手机内置的传感器,如摄像头、数字指南针、GPS等,该系统可以估计远程目标的距离/位置。该系统还利用智能手机的用户友好界面来促进低复杂性的实现(例如,定位感兴趣的目标并限制匹配的搜索区域)。论证了单图像和双图像系统的可行性。
{"title":"Positionit: an image-based remote target localization system on smartphones","authors":"Qia Wang, Alex Lobzhanidze, S. Roy, W. Zeng, Yi Shang","doi":"10.1145/2072298.2072476","DOIUrl":"https://doi.org/10.1145/2072298.2072476","url":null,"abstract":"We present PositionIt, a novel, low-cost, image-based remote target localization system using commodity smartphones. By leveraging smartphones' built-in sensors such as camera, digital compass, GPS, etc., the system can estimate the distance/position of remote targets. The system also takes advantage of the user-friendly interface of the smartphones to facilitate low complexity implementation (e.g., to locate target of interest and restrict the search area for matching).The feasibility of both single-image and two-image based systems are demonstrated.","PeriodicalId":318758,"journal":{"name":"Proceedings of the 19th ACM international conference on Multimedia","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123342328","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
A real-time database architecture for motion capture data 动态捕捉数据的实时数据库架构
Pub Date : 2011-11-28 DOI: 10.1145/2072298.2072008
Pengjie Wang, Rynson W. H. Lau, Mingmin Zhang, Jiang Wang, Haiyu Song, Zhigeng Pan
Due to the popularity of motion capture data in many applications, such as games, movies and virtual environments, huge collections of motion capture data are now available. It is becoming important to store these data in compressed form while being able to retrieve them without much overhead. However, there is little work that addresses both issues together. In this paper, we address these two issues by proposing a novel database architecture. First, we propose a lossless compression algorithm to compress the motion clips, which is based on a novel Alpha Parallelogram Predictor (APP) to estimate the degree of freedom (DOF) of each child joint from its immediate neighbors and parents that have already been processed. Second, we propose to store selected eigenvalues and eigenvectors of each motion clip, which only require a very small amount of memory overheads, for faster filtering of irrelevant motions. Based on this architecture, real-time queries become a three-step process. In the first two steps, we perform a quick filtering to identify relevant motion clips in the database through a two-level indexing structure. In the third step, only a small number of candidate clips are uncompressed and accurately matched with a Dynamic Time Warping algorithm. Our results show that users can efficiently search clips from this losslessly compressed motion database.
由于动作捕捉数据在许多应用中的普及,例如游戏,电影和虚拟环境,现在可以获得大量的动作捕捉数据。以压缩形式存储这些数据,同时能够在没有太多开销的情况下检索它们,这一点变得越来越重要。然而,很少有工作能同时解决这两个问题。在本文中,我们通过提出一种新的数据库体系结构来解决这两个问题。首先,我们提出了一种无损压缩算法来压缩运动片段,该算法基于一种新颖的Alpha平行四边形预测器(APP)来估计每个子关节的自由度(DOF),该自由度来自于它的近邻和已经处理过的父关节。其次,我们建议存储每个运动片段的选定特征值和特征向量,这只需要非常少的内存开销,以便更快地过滤不相关的运动。基于这种体系结构,实时查询变成了一个分为三步的过程。在前两步中,我们通过两级索引结构执行快速过滤以识别数据库中的相关动作剪辑。在第三步中,只有少数候选剪辑未压缩,并与动态时间扭曲算法进行精确匹配。我们的结果表明,用户可以有效地从这个无损压缩的运动数据库中搜索片段。
{"title":"A real-time database architecture for motion capture data","authors":"Pengjie Wang, Rynson W. H. Lau, Mingmin Zhang, Jiang Wang, Haiyu Song, Zhigeng Pan","doi":"10.1145/2072298.2072008","DOIUrl":"https://doi.org/10.1145/2072298.2072008","url":null,"abstract":"Due to the popularity of motion capture data in many applications, such as games, movies and virtual environments, huge collections of motion capture data are now available. It is becoming important to store these data in compressed form while being able to retrieve them without much overhead. However, there is little work that addresses both issues together. In this paper, we address these two issues by proposing a novel database architecture. First, we propose a lossless compression algorithm to compress the motion clips, which is based on a novel Alpha Parallelogram Predictor (APP) to estimate the degree of freedom (DOF) of each child joint from its immediate neighbors and parents that have already been processed. Second, we propose to store selected eigenvalues and eigenvectors of each motion clip, which only require a very small amount of memory overheads, for faster filtering of irrelevant motions. Based on this architecture, real-time queries become a three-step process. In the first two steps, we perform a quick filtering to identify relevant motion clips in the database through a two-level indexing structure. In the third step, only a small number of candidate clips are uncompressed and accurately matched with a Dynamic Time Warping algorithm. Our results show that users can efficiently search clips from this losslessly compressed motion database.","PeriodicalId":318758,"journal":{"name":"Proceedings of the 19th ACM international conference on Multimedia","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123401745","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
Exploiting user information for image tag refinement 利用用户信息进行图像标记细化
Pub Date : 2011-11-28 DOI: 10.1145/2072298.2071956
J. Sang, J. Liu, Changsheng Xu
Photo sharing websites allow users to describe images with freely chosen tags. The user-generated tags not only facilitate the users in sharing and organizing images, but also provide large scale meaningful data for image retrieval and management. Extensive studies on improving the quality of user-generated tags for tag-based applications focused on exploiting the image-tag, image-image and tag-tag binary relationships. Considering that user is the originator of the tagging activity and user involves with image and tag in many aspects, in this paper we tackle the problem of tag refinement by leveraging user information. We propose a Tensor Decomposition framework to jointly model the ternary user-image-tag interrelation and respective intra-relations. The users, images and tags are represented in the corresponding latent subspaces. For a given image, the tags with the highest cross-space associations are reserved as the final annotation. The proposed method is validated on a large-scale real-world dataset.
照片分享网站允许用户用自由选择的标签来描述图片。用户生成的标签不仅方便了用户共享和组织图像,而且为图像检索和管理提供了大量有意义的数据。在基于标签的应用中,对提高用户生成标签质量的广泛研究集中在利用图像-标签、图像-图像和标签-标签的二元关系上。考虑到用户是标签活动的发起者,用户涉及图像和标签的许多方面,本文利用用户信息来解决标签的细化问题。我们提出了一个张量分解框架来联合建模三元用户-图像-标签的相互关系和各自的内部关系。用户、图像和标签在相应的潜在子空间中表示。对于给定的图像,保留具有最高跨空间关联的标记作为最终注释。该方法在大规模真实数据集上得到了验证。
{"title":"Exploiting user information for image tag refinement","authors":"J. Sang, J. Liu, Changsheng Xu","doi":"10.1145/2072298.2071956","DOIUrl":"https://doi.org/10.1145/2072298.2071956","url":null,"abstract":"Photo sharing websites allow users to describe images with freely chosen tags. The user-generated tags not only facilitate the users in sharing and organizing images, but also provide large scale meaningful data for image retrieval and management. Extensive studies on improving the quality of user-generated tags for tag-based applications focused on exploiting the image-tag, image-image and tag-tag binary relationships. Considering that user is the originator of the tagging activity and user involves with image and tag in many aspects, in this paper we tackle the problem of tag refinement by leveraging user information. We propose a Tensor Decomposition framework to jointly model the ternary user-image-tag interrelation and respective intra-relations. The users, images and tags are represented in the corresponding latent subspaces. For a given image, the tags with the highest cross-space associations are reserved as the final annotation. The proposed method is validated on a large-scale real-world dataset.","PeriodicalId":318758,"journal":{"name":"Proceedings of the 19th ACM international conference on Multimedia","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129122671","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 15
Random partial paired comparison for subjective video quality assessment via hodgerank 基于hodgerank主观视频质量评价的随机偏配对比较
Pub Date : 2011-11-28 DOI: 10.1145/2072298.2072350
Qianqian Xu, Tingting Jiang, Y. Yao, Qingming Huang, Bowei Yan, Weisi Lin
Subjective visual quality evaluation provides the groundtruth and source of inspiration in building objective visual quality metrics. Paired comparison is expected to yield more reliable results; however, this is an expensive and timeconsuming process. In this paper, we propose a novel framework of HodgeRank on Random Graphs (HRRG) to achieve efficient and reliable subjective Video Quality Assessment (VQA). To address the challenge of a potentially large number of combinations of videos to be assessed, the proposed methodology does not require the participants to perform the complete comparison of all the paired videos. Instead, participants only need to perform a random sample of all possible paired comparisons, which saves a great amount of time and labor. In contrast to the traditional deterministic incomplete block designs, our random design is not only suitable for traditional laboratory and focus-group studies, but also fit for crowdsourcing experiments on Internet where the raters are distributive over Internet and it is hard to control with precise experimental designs. Our contribution in this work is three-fold: 1) a HRRG framework is proposed to quantify the quality of video; 2) a new random design principle is investigated to conduct paired comparison based on Erdos-Renyi random graph theory; 3) Hodge decomposition is introduced to derive, from incomplete and imbalanced data, quality scores of videos and inconsistency of participants'judgments. We demonstrate the effectiveness of the proposed framework on LIVE Database. Equipped with random graph theory and HodgeRank, our scheme has the following advantages over the traditional ones: 1) data collection is simple and easy to handle, and thus is more suitable for crowdsourcing on Internet; 2) workload on participants is lower and more flexible; 3) the rating procedure is efficient, labor-saving, and more importantly, without jeopardizing the accuracy of the results.
主观视觉质量评价为建立客观视觉质量指标提供了依据和灵感来源。配对比较有望产生更可靠的结果;然而,这是一个昂贵且耗时的过程。为了实现高效可靠的主观视频质量评估(VQA),本文提出了一种新的随机图HodgeRank (HRRG)框架。为了解决要评估的潜在大量视频组合的挑战,所提出的方法不要求参与者对所有成对的视频进行完整的比较。相反,参与者只需要对所有可能的配对比较进行随机抽样,这节省了大量的时间和劳动力。与传统的确定性不完全块设计相比,我们的随机设计不仅适用于传统的实验室和焦点小组研究,也适用于互联网上的众包实验,因为评分者分布在互联网上,很难用精确的实验设计来控制。我们在这项工作中的贡献有三个方面:1)提出了一个HRRG框架来量化视频质量;2)研究了一种新的基于Erdos-Renyi随机图理论的配对比较随机设计原理;3)引入Hodge分解,从不完整和不平衡的数据中推导出视频的质量分数和参与者判断的不一致性。我们在LIVE数据库上验证了该框架的有效性。结合随机图理论和HodgeRank,我们的方案比传统的方案有以下优点:1)数据收集简单,易于处理,更适合互联网众包;2)参与者的工作量更低,更灵活;3)评定过程高效、省力,更重要的是不影响评定结果的准确性。
{"title":"Random partial paired comparison for subjective video quality assessment via hodgerank","authors":"Qianqian Xu, Tingting Jiang, Y. Yao, Qingming Huang, Bowei Yan, Weisi Lin","doi":"10.1145/2072298.2072350","DOIUrl":"https://doi.org/10.1145/2072298.2072350","url":null,"abstract":"Subjective visual quality evaluation provides the groundtruth and source of inspiration in building objective visual quality metrics. Paired comparison is expected to yield more reliable results; however, this is an expensive and timeconsuming process. In this paper, we propose a novel framework of HodgeRank on Random Graphs (HRRG) to achieve efficient and reliable subjective Video Quality Assessment (VQA). To address the challenge of a potentially large number of combinations of videos to be assessed, the proposed methodology does not require the participants to perform the complete comparison of all the paired videos. Instead, participants only need to perform a random sample of all possible paired comparisons, which saves a great amount of time and labor. In contrast to the traditional deterministic incomplete block designs, our random design is not only suitable for traditional laboratory and focus-group studies, but also fit for crowdsourcing experiments on Internet where the raters are distributive over Internet and it is hard to control with precise experimental designs. Our contribution in this work is three-fold: 1) a HRRG framework is proposed to quantify the quality of video; 2) a new random design principle is investigated to conduct paired comparison based on Erdos-Renyi random graph theory; 3) Hodge decomposition is introduced to derive, from incomplete and imbalanced data, quality scores of videos and inconsistency of participants'judgments. We demonstrate the effectiveness of the proposed framework on LIVE Database. Equipped with random graph theory and HodgeRank, our scheme has the following advantages over the traditional ones: 1) data collection is simple and easy to handle, and thus is more suitable for crowdsourcing on Internet; 2) workload on participants is lower and more flexible; 3) the rating procedure is efficient, labor-saving, and more importantly, without jeopardizing the accuracy of the results.","PeriodicalId":318758,"journal":{"name":"Proceedings of the 19th ACM international conference on Multimedia","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130288224","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 44
Hierarchical video browsing with a 3D carousel 分层视频浏览与3D旋转木马
Pub Date : 2011-11-28 DOI: 10.1145/2072298.2072479
Klaus Schöffmann, Manfred del Fabro
We present a video browsing tool that combines advantages of the hierarchical browsing concept with 3D projection and multi-threaded programming in order to provide a convenient and efficient interface. The tool allows for instantaneous hierarchical browsing of video and uses a dynamic approach (i.e. tree of playable video segments instead of static key frames)that also supports parallel playback.
为了提供一个方便高效的界面,我们提出了一个视频浏览工具,它结合了层次浏览概念与三维投影和多线程编程的优点。该工具允许视频的即时分层浏览,并使用动态方法(即可播放视频片段的树,而不是静态关键帧),也支持并行播放。
{"title":"Hierarchical video browsing with a 3D carousel","authors":"Klaus Schöffmann, Manfred del Fabro","doi":"10.1145/2072298.2072479","DOIUrl":"https://doi.org/10.1145/2072298.2072479","url":null,"abstract":"We present a video browsing tool that combines advantages of the hierarchical browsing concept with 3D projection and multi-threaded programming in order to provide a convenient and efficient interface. The tool allows for instantaneous hierarchical browsing of video and uses a dynamic approach (i.e. tree of playable video segments instead of static key frames)that also supports parallel playback.","PeriodicalId":318758,"journal":{"name":"Proceedings of the 19th ACM international conference on Multimedia","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129324746","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
Active query sensing for mobile location search 主动查询感知移动位置搜索
Pub Date : 2011-11-28 DOI: 10.1145/2072298.2072301
Felix X. Yu, R. Ji, Shih-Fu Chang
While much exciting progress is being made in mobile visual search, one important question has been left unexplored in all current systems. When the first query fails to find the right target (up to 50% likelihood), how should the user form his/her search strategy in the subsequent interaction? In this paper, we propose a novel Active Query Sensing system to suggest the best way for sensing the surrounding scenes while forming the second query for location search. We accomplish the goal by developing several unique components -- an offline process for analyzing the saliency of the views associated with each geographical location based on score distribution modeling, predicting the visual search precision of individual views and locations, estimating the view of an unseen query, and suggesting the best subsequent view change. Using a scalable visual search system implemented over a NYC street view data set (0.3 million images), we show a performance gain as high as two folds, reducing the failure rate of mobile location search to only 12% after the second query. This work may open up an exciting new direction for developing interactive mobile media applications through innovative exploitation of active sensing and query formulation.
虽然在移动视觉搜索方面取得了许多令人兴奋的进展,但在所有当前的系统中都有一个重要的问题没有被探索。当第一个查询没有找到正确的目标(高达50%的可能性)时,用户应该如何在随后的交互中形成他/她的搜索策略?在本文中,我们提出了一种新颖的主动查询感知系统,以提供感知周围场景的最佳方式,同时形成位置搜索的第二个查询。我们通过开发几个独特的组件来实现这一目标——一个离线过程,用于分析基于分数分布建模的与每个地理位置相关的视图的显著性,预测单个视图和位置的视觉搜索精度,估计未见查询的视图,并建议最佳的后续视图更改。通过在纽约市街景数据集(30万张图像)上实现的可扩展视觉搜索系统,我们展示了高达两倍的性能提升,将移动位置搜索的失败率降低到第二次查询后的12%。这项工作可能会通过创新地利用主动感知和查询公式,为开发交互式移动媒体应用程序开辟一个令人兴奋的新方向。
{"title":"Active query sensing for mobile location search","authors":"Felix X. Yu, R. Ji, Shih-Fu Chang","doi":"10.1145/2072298.2072301","DOIUrl":"https://doi.org/10.1145/2072298.2072301","url":null,"abstract":"While much exciting progress is being made in mobile visual search, one important question has been left unexplored in all current systems. When the first query fails to find the right target (up to 50% likelihood), how should the user form his/her search strategy in the subsequent interaction? In this paper, we propose a novel Active Query Sensing system to suggest the best way for sensing the surrounding scenes while forming the second query for location search. We accomplish the goal by developing several unique components -- an offline process for analyzing the saliency of the views associated with each geographical location based on score distribution modeling, predicting the visual search precision of individual views and locations, estimating the view of an unseen query, and suggesting the best subsequent view change. Using a scalable visual search system implemented over a NYC street view data set (0.3 million images), we show a performance gain as high as two folds, reducing the failure rate of mobile location search to only 12% after the second query. This work may open up an exciting new direction for developing interactive mobile media applications through innovative exploitation of active sensing and query formulation.","PeriodicalId":318758,"journal":{"name":"Proceedings of the 19th ACM international conference on Multimedia","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129276149","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 51
Tennis real play: an interactive tennis game with models from real videos 网球真人游戏:一个互动的网球游戏与模型从真实的视频
Pub Date : 2011-11-28 DOI: 10.1145/2072298.2072361
Jui-Hsin Lai, Chieh-Li Chen, Po-Chen Wu, Chieh-Chi Kao, Shao-Yi Chien
Tennis Real Play (TRP) is an interactive tennis game system constructed with models extracted from videos of real matches. The key techniques proposed for TRP include player modeling and video-based player/court rendering. For player model creation, we propose a database normalization process and a behavioral transition model of tennis players, which might be a good alternative for motion capture in the conventional video games. For player/court rendering, we propose a framework for rendering vivid game characters and providing the real-time ability. We can say that image-based rendering leads to a more interactive and realistic rendering. Experiments show that video games with vivid viewing effects and characteristic players can be generated from match videos without much user intervention. Because the player model can adequately record the ability and condition of a player in the real world, it can then be used to roughly predict the results of real tennis matches in the next days. The results of a user study reveal that subjects like the increased interaction, immersive experience, and enjoyment from playing TRP.
TRP (Tennis Real Play)是一个基于从真实比赛视频中提取的模型构建的交互式网球游戏系统。为TRP提出的关键技术包括球员建模和基于视频的球员/球场渲染。对于球员模型的创建,我们提出了一个数据库规范化过程和网球运动员的行为转换模型,这可能是传统电子游戏中动作捕捉的一个很好的替代方案。对于球员/球场渲染,我们提出了一个框架来渲染生动的游戏角色并提供实时能力。我们可以说,基于图像的渲染导致了更具互动性和真实感的渲染。实验表明,在不需要用户过多干预的情况下,可以从比赛视频中生成具有生动视觉效果和特色玩家的视频游戏。因为玩家模型可以充分记录现实世界中玩家的能力和状态,所以它可以用来粗略预测未来几天真实网球比赛的结果。一项用户研究的结果显示,受试者喜欢增加的互动、沉浸式体验和玩TRP的乐趣。
{"title":"Tennis real play: an interactive tennis game with models from real videos","authors":"Jui-Hsin Lai, Chieh-Li Chen, Po-Chen Wu, Chieh-Chi Kao, Shao-Yi Chien","doi":"10.1145/2072298.2072361","DOIUrl":"https://doi.org/10.1145/2072298.2072361","url":null,"abstract":"Tennis Real Play (TRP) is an interactive tennis game system constructed with models extracted from videos of real matches. The key techniques proposed for TRP include player modeling and video-based player/court rendering. For player model creation, we propose a database normalization process and a behavioral transition model of tennis players, which might be a good alternative for motion capture in the conventional video games. For player/court rendering, we propose a framework for rendering vivid game characters and providing the real-time ability. We can say that image-based rendering leads to a more interactive and realistic rendering. Experiments show that video games with vivid viewing effects and characteristic players can be generated from match videos without much user intervention. Because the player model can adequately record the ability and condition of a player in the real world, it can then be used to roughly predict the results of real tennis matches in the next days. The results of a user study reveal that subjects like the increased interaction, immersive experience, and enjoyment from playing TRP.","PeriodicalId":318758,"journal":{"name":"Proceedings of the 19th ACM international conference on Multimedia","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129007889","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Social image tag recommendation by concept matching 基于概念匹配的社会图像标签推荐
Pub Date : 2011-11-28 DOI: 10.1145/2072298.2071969
Aixin Sun, S. Bhowmick, Jun-An Chong
Tags associated with social images are valuable information source for superior image search and retrieval experiences. In this paper, we propose a novel tag recommendation technique that exploits the user-given tags associated with images. Each candidate tag to be recommended is described by a few tag concepts derived from the collective knowledge embedded in the tag co-occurrence pairs. Each concept, represented by a few tags with high co-occurrences among themselves, is indexed as a textual document. Then user-given tags of an image is represented as a text query and the matching concepts are retrieved from the index. The candidate tags associated with the matching concepts are then recommended. Leverages on the well studied Information Retrieval (IR) techniques, the proposed approach leads to superior tag recommendation accuracy and lower execution time compared to the state-of-the-art.
与社交图像相关的标签是提供优质图像搜索和检索体验的有价值的信息源。在本文中,我们提出了一种新的标签推荐技术,该技术利用用户给出的与图像相关的标签。推荐的每个候选标签由嵌入在标签共现对中的集体知识派生的几个标签概念来描述。每个概念都由几个标签表示,它们之间的共现率很高,被索引为文本文档。然后将用户给定的图像标记表示为文本查询,并从索引中检索匹配的概念。然后推荐与匹配概念相关联的候选标记。该方法充分利用了已有研究的信息检索(IR)技术,与现有方法相比,具有更高的标签推荐精度和更短的执行时间。
{"title":"Social image tag recommendation by concept matching","authors":"Aixin Sun, S. Bhowmick, Jun-An Chong","doi":"10.1145/2072298.2071969","DOIUrl":"https://doi.org/10.1145/2072298.2071969","url":null,"abstract":"Tags associated with social images are valuable information source for superior image search and retrieval experiences. In this paper, we propose a novel tag recommendation technique that exploits the user-given tags associated with images. Each candidate tag to be recommended is described by a few tag concepts derived from the collective knowledge embedded in the tag co-occurrence pairs. Each concept, represented by a few tags with high co-occurrences among themselves, is indexed as a textual document. Then user-given tags of an image is represented as a text query and the matching concepts are retrieved from the index. The candidate tags associated with the matching concepts are then recommended. Leverages on the well studied Information Retrieval (IR) techniques, the proposed approach leads to superior tag recommendation accuracy and lower execution time compared to the state-of-the-art.","PeriodicalId":318758,"journal":{"name":"Proceedings of the 19th ACM international conference on Multimedia","volume":"36 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129036245","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 37
Million-scale near-duplicate video retrieval system 百万级近复制视频检索系统
Pub Date : 2011-11-28 DOI: 10.1145/2072298.2072484
Yang Cai, Linjun Yang, Wei Ping, Fei Wang, Tao Mei, Xiansheng Hua, Shipeng Li
In this paper, we present a novel near-duplicate video retrieval system serving one million web videos. To achieve both the effectiveness and efficiency, a visual word based approach is proposed, which quantizes each video frame into a word and represents the whole video as a bag of words. The system can respond to a query in 41ms with 78.4% MAP on average.
本文提出了一种服务于100万个网络视频的近重复视频检索系统。为了达到有效和高效的目的,提出了一种基于视觉词的方法,该方法将每个视频帧量化为一个词,并将整个视频表示为一个词包。系统可以在41毫秒内响应查询,平均MAP为78.4%。
{"title":"Million-scale near-duplicate video retrieval system","authors":"Yang Cai, Linjun Yang, Wei Ping, Fei Wang, Tao Mei, Xiansheng Hua, Shipeng Li","doi":"10.1145/2072298.2072484","DOIUrl":"https://doi.org/10.1145/2072298.2072484","url":null,"abstract":"In this paper, we present a novel near-duplicate video retrieval system serving one million web videos. To achieve both the effectiveness and efficiency, a visual word based approach is proposed, which quantizes each video frame into a word and represents the whole video as a bag of words. The system can respond to a query in 41ms with 78.4% MAP on average.","PeriodicalId":318758,"journal":{"name":"Proceedings of the 19th ACM international conference on Multimedia","volume":"202 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114091358","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 42
Personalized portraits ranking 个性化画像排名
Pub Date : 2011-11-28 DOI: 10.1145/2072298.2071993
Lei Huang, Tian Xia, Ji Wan, Yongdong Zhang, Shouxun Lin
Portraits, also known as images of people, constitute an important part of consumer photos. Existing methods manage portraits based on either explicit objectives, e.g., a specified person or event, or aesthetics, i.e., the aesthetic quality of portraits. This paper presents a novel system for personalized portraits ranking. First, four kinds of personalized features, i.e., composition, clothing style, affection and social relationship are proposed to quantify users' intent. Then, example-based and sketch-based user interfaces (UI) are developed, which are capable of capturing users' personal intent hardly described by queries or aesthetics. Finally, portraits ranking is implemented by combing these features together with the developed user interfaces. Experimental results show that the system performs well in providing personalized preferences and the proposed features are effective for portraits ranking. From the user study, our system gets promising results.
人像,又称人物形象,是消费照片的重要组成部分。现有的方法管理肖像要么基于明确的目标,例如,一个特定的人或事件,要么基于美学,即,肖像的美学品质。提出了一种新的个性化画像排序系统。首先,提出了四种个性化特征,即构成、服装风格、情感和社会关系,以量化用户意图。然后,开发了基于示例和基于草图的用户界面(UI),它们能够捕捉用户的个人意图,而这些意图很难被查询或美学所描述。最后,将这些特征与开发的用户界面相结合,实现画像排序。实验结果表明,该系统在提供个性化偏好方面表现良好,所提出的特征对肖像排序是有效的。从用户的研究中,我们的系统取得了良好的效果。
{"title":"Personalized portraits ranking","authors":"Lei Huang, Tian Xia, Ji Wan, Yongdong Zhang, Shouxun Lin","doi":"10.1145/2072298.2071993","DOIUrl":"https://doi.org/10.1145/2072298.2071993","url":null,"abstract":"Portraits, also known as images of people, constitute an important part of consumer photos. Existing methods manage portraits based on either explicit objectives, e.g., a specified person or event, or aesthetics, i.e., the aesthetic quality of portraits. This paper presents a novel system for personalized portraits ranking. First, four kinds of personalized features, i.e., composition, clothing style, affection and social relationship are proposed to quantify users' intent. Then, example-based and sketch-based user interfaces (UI) are developed, which are capable of capturing users' personal intent hardly described by queries or aesthetics. Finally, portraits ranking is implemented by combing these features together with the developed user interfaces. Experimental results show that the system performs well in providing personalized preferences and the proposed features are effective for portraits ranking. From the user study, our system gets promising results.","PeriodicalId":318758,"journal":{"name":"Proceedings of the 19th ACM international conference on Multimedia","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126135352","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 15
期刊
Proceedings of the 19th ACM international conference on Multimedia
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
﹀
mjeditor
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1