同步多媒体演示的最佳流

David A. Turner, K. Ross
{"title":"同步多媒体演示的最佳流","authors":"David A. Turner, K. Ross","doi":"10.1145/319878.319903","DOIUrl":null,"url":null,"abstract":"A synchronized multimedia presentation consists of a collection of objects, with each object having one or more rendering intervals within the presentation timeline. These intervals specify the objects' start times and end times relative to the presentation timeline. In this paper we consider the problem of streaming a multimedia presentation from a server to a client over a bandwidth-limited communication network. We suppose that each of the static objects is layered-encoded. For a given maximum delay, we consider the problem of finding the optimal number of layers in each object in order to maximize a measure of the overall quality of the presentation. We devise efficient algorithms for determining an optimal policy for several natural criteria. We also consider the problem of gradual rendering of objects after their start times. We then apply the algorithms to a randomly generated presentation containing layer-encoded JPEG images.","PeriodicalId":265329,"journal":{"name":"MULTIMEDIA '99","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Optimal streaming of synchronized multimedia presentations\",\"authors\":\"David A. Turner, K. Ross\",\"doi\":\"10.1145/319878.319903\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A synchronized multimedia presentation consists of a collection of objects, with each object having one or more rendering intervals within the presentation timeline. These intervals specify the objects' start times and end times relative to the presentation timeline. In this paper we consider the problem of streaming a multimedia presentation from a server to a client over a bandwidth-limited communication network. We suppose that each of the static objects is layered-encoded. For a given maximum delay, we consider the problem of finding the optimal number of layers in each object in order to maximize a measure of the overall quality of the presentation. We devise efficient algorithms for determining an optimal policy for several natural criteria. We also consider the problem of gradual rendering of objects after their start times. We then apply the algorithms to a randomly generated presentation containing layer-encoded JPEG images.\",\"PeriodicalId\":265329,\"journal\":{\"name\":\"MULTIMEDIA '99\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"MULTIMEDIA '99\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/319878.319903\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"MULTIMEDIA '99","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/319878.319903","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

同步的多媒体表示由一组对象组成,每个对象在表示时间轴内具有一个或多个呈现间隔。这些间隔指定对象相对于表示时间轴的开始时间和结束时间。在本文中,我们考虑了在带宽有限的通信网络上将多媒体演示从服务器流到客户端的问题。我们假设每个静态对象都是分层编码的。对于给定的最大延迟,我们考虑在每个对象中找到最优层数的问题,以便最大限度地衡量呈现的整体质量。我们设计了有效的算法来确定几种自然标准的最优策略。我们还考虑了物体开始时间之后的渐变渲染问题。然后,我们将算法应用于包含图层编码的JPEG图像的随机生成的表示。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimal streaming of synchronized multimedia presentations
A synchronized multimedia presentation consists of a collection of objects, with each object having one or more rendering intervals within the presentation timeline. These intervals specify the objects' start times and end times relative to the presentation timeline. In this paper we consider the problem of streaming a multimedia presentation from a server to a client over a bandwidth-limited communication network. We suppose that each of the static objects is layered-encoded. For a given maximum delay, we consider the problem of finding the optimal number of layers in each object in order to maximize a measure of the overall quality of the presentation. We devise efficient algorithms for determining an optimal policy for several natural criteria. We also consider the problem of gradual rendering of objects after their start times. We then apply the algorithms to a randomly generated presentation containing layer-encoded JPEG images.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信