Proceedings of IEEE International Conference on Multimedia Computing and Systems最新文献

筛选
英文 中文
Designing a distributed multimedia synchronization scheduler 设计一个分布式多媒体同步调度程序
Proceedings of IEEE International Conference on Multimedia Computing and Systems Pub Date : 1997-06-03 DOI: 10.1109/MMCS.1997.609756
Jerzy Jarmasz, N. Georganas
{"title":"Designing a distributed multimedia synchronization scheduler","authors":"Jerzy Jarmasz, N. Georganas","doi":"10.1109/MMCS.1997.609756","DOIUrl":"https://doi.org/10.1109/MMCS.1997.609756","url":null,"abstract":"Distributed multimedia applications need an effective synchronization strategy to deal with the temporal disturbances introduced into the data streams by the transport and operating systems. An essential part of this strategy is scheduling-i.e. determining optimal times for the retrieval of data from the data servers. The CITR News-On-Demand project prototype currently uses a centralized synchronization system which lacks effective high-level scheduling. This paper looks at how to add this functionality without seriously disturbing the components already in place. The proposed solution is a distributed synchronization scheduler designed and implemented in a way which makes use of the current prototype's components.","PeriodicalId":302885,"journal":{"name":"Proceedings of IEEE International Conference on Multimedia Computing and Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129069265","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}
引用次数: 12
Novel scene generation, merging and stitching views using the 2D affine space 新颖的场景生成,使用二维仿射空间合并和拼接视图
Proceedings of IEEE International Conference on Multimedia Computing and Systems Pub Date : 1997-06-03 DOI: 10.1109/MMCS.1997.609776
K. Sengupta, J. Ohya
{"title":"Novel scene generation, merging and stitching views using the 2D affine space","authors":"K. Sengupta, J. Ohya","doi":"10.1109/MMCS.1997.609776","DOIUrl":"https://doi.org/10.1109/MMCS.1997.609776","url":null,"abstract":"The authors present an algorithm to generate new views of a scene, starting from stereo images. Errors in 3D scene reconstruction usually get reflected in the quality of the new scene generated, so they seek a direct method for reprojection. They use the knowledge of dense point matches and their affine coordinate values to estimate the corresponding affine coordinate values in the new scene.","PeriodicalId":302885,"journal":{"name":"Proceedings of IEEE International Conference on Multimedia Computing and Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129977011","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
Metrics for scene change detection in digital video sequences 数字视频序列中场景变化检测的度量
Proceedings of IEEE International Conference on Multimedia Computing and Systems Pub Date : 1997-06-03 DOI: 10.1109/MMCS.1997.609780
R. M. Ford, C. Robson, Daniel Temple, Michael Gerlach
{"title":"Metrics for scene change detection in digital video sequences","authors":"R. M. Ford, C. Robson, Daniel Temple, Michael Gerlach","doi":"10.1109/MMCS.1997.609780","DOIUrl":"https://doi.org/10.1109/MMCS.1997.609780","url":null,"abstract":"Five metrics for scene change detection in video sequences are presented. Metrics previously applied to this problem are surveyed, and are quantitatively compared to the new metrics. Results show that the proposed metrics are superior.","PeriodicalId":302885,"journal":{"name":"Proceedings of IEEE International Conference on Multimedia Computing and Systems","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130497781","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}
引用次数: 38
Modelling static and dynamic aspects of hypermedia systems 对超媒体系统的静态和动态方面建模
Proceedings of IEEE International Conference on Multimedia Computing and Systems Pub Date : 1997-06-03 DOI: 10.1109/MMCS.1997.609792
P. Díaz, I. Aedo, F. Panetsos
{"title":"Modelling static and dynamic aspects of hypermedia systems","authors":"P. Díaz, I. Aedo, F. Panetsos","doi":"10.1109/MMCS.1997.609792","DOIUrl":"https://doi.org/10.1109/MMCS.1997.609792","url":null,"abstract":"The static and dynamic properties of the Labyrinth model, used for the definition and management of hypermedia applications, are presented in this paper. The most relevant characteristics of Labyrinth are the following: the structure of applications can be modelled by means of composite objects; the reactive nature and temporal dimension of multimedia contents are considered; and security policies to preserve information confidentiality and integrity can be defined.","PeriodicalId":302885,"journal":{"name":"Proceedings of IEEE International Conference on Multimedia Computing and Systems","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129801325","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}
引用次数: 2
IFQ: a visual query interface and query generator for object-based media retrieval IFQ:用于基于对象的媒体检索的可视化查询界面和查询生成器
Proceedings of IEEE International Conference on Multimedia Computing and Systems Pub Date : 1997-06-03 DOI: 10.1109/MMCS.1997.609635
Wen-Syan Li, K. Candan, K. Hirata, Y. Hara
{"title":"IFQ: a visual query interface and query generator for object-based media retrieval","authors":"Wen-Syan Li, K. Candan, K. Hirata, Y. Hara","doi":"10.1109/MMCS.1997.609635","DOIUrl":"https://doi.org/10.1109/MMCS.1997.609635","url":null,"abstract":"There are two major directions for image retrieval system development. The first direction is the direct manipulation of information using query languages, which are precise to computers but not user friendly. The second direction is the development of natural interfaces, such as query by image example. The latter approach has the advantage of better query visualization, but it usually yields a low precision because users' drawings may not be precise. IFQ (In Frame Query) is a visual user query interface for object-based media retrieval systems. It aims at not only providing a natural visual query interface but also supporting precise direct manipulation through automated query generation. Furthermore, IFQ gives users the flexibility of using combinations of semantic expressions, conceptual definitions, sketch, and image examples to pose queries.","PeriodicalId":302885,"journal":{"name":"Proceedings of IEEE International Conference on Multimedia Computing and Systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115427871","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}
引用次数: 17
A rate allocation policy with MCR/PCR support and distributed ABR implementation using explicit rate feedback 支持MCR/PCR的速率分配策略和使用显式速率反馈的分布式ABR实现
Proceedings of IEEE International Conference on Multimedia Computing and Systems Pub Date : 1997-06-03 DOI: 10.1109/MMCS.1997.609519
Yiwei Thomas Hou, H. Tzeng, S. Panwar
{"title":"A rate allocation policy with MCR/PCR support and distributed ABR implementation using explicit rate feedback","authors":"Yiwei Thomas Hou, H. Tzeng, S. Panwar","doi":"10.1109/MMCS.1997.609519","DOIUrl":"https://doi.org/10.1109/MMCS.1997.609519","url":null,"abstract":"An important concept in the available bit rate (ABR) service model, as defined by the ATM Forum, is the minimum cell rate (MCR) guarantee as well as the peak cell rate (PCR) constraint for each ABR virtual connection (VC). Because of the MCR and PCR requirements, the well-known max-min fairness policy no longer suffices to determine rate allocation in the ABR service model. We introduce a network bandwidth assignment policy, MCRadd, which supports both the MCR and PCR requirements for each ABR virtual connection. A centralized algorithm is presented to compute network-wide bandwidth allocation to achieve this policy. Furthermore, an explicit-rate (ER) based ABR switch algorithm is developed to achieve the MCRadd policy in the distributed ABR environment and its convergence proof is also given. The performance of our ABR algorithm is demonstrated by simulation results based on the benchmark network configurations suggested by the ATM Forum.","PeriodicalId":302885,"journal":{"name":"Proceedings of IEEE International Conference on Multimedia Computing and Systems","volume":"178 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132335510","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}
引用次数: 0
A pre-scheduling mechanism for multimedia presentation synchronization 多媒体表示同步的预调度机制
Proceedings of IEEE International Conference on Multimedia Computing and Systems Pub Date : 1997-06-03 DOI: 10.1109/MMCS.1997.609640
Tae Il Jeong, Jae Wook Ham, S. J. Kim
{"title":"A pre-scheduling mechanism for multimedia presentation synchronization","authors":"Tae Il Jeong, Jae Wook Ham, S. J. Kim","doi":"10.1109/MMCS.1997.609640","DOIUrl":"https://doi.org/10.1109/MMCS.1997.609640","url":null,"abstract":"In general a natural presentation of multimedia objects requires solving many problems such as the process of unformatted data in mass storage and the specification of the temporal relationship among media objects. In particular, it is important for a multimedia presentation system to guarantee the precise presentation time in order to provide the user with meaningful information. In this paper, we design the event prescheduler (EPS), which guarantees the precise presentation time in a single-user multimedia system. The EPS sets the optimal prefetch points (OFPs), and then performs an instant scheduling algorithm and/or a buffer management algorithm to rearrange them. We also design the temporal relation translator (TERT), which translates the relative temporal information into the absolute one. In order to measure the actual presentation time of various scenarios we apply the EPS to the scenarios, and compare the time with that obtained from other scheduling algorithms. The evaluation results show that the EPS reduces the termination delays by an average of 38.5% and prevents the expressive presentation delays.","PeriodicalId":302885,"journal":{"name":"Proceedings of IEEE International Conference on Multimedia Computing and Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130864934","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}
引用次数: 19
Playback restart in interactive streaming video applications 在交互式流媒体视频应用程序中重新启动播放
Proceedings of IEEE International Conference on Multimedia Computing and Systems Pub Date : 1997-06-03 DOI: 10.1109/MMCS.1997.609757
J. Dey, S. Sen, J. Kurose, D. Towsley, James D. Salehi
{"title":"Playback restart in interactive streaming video applications","authors":"J. Dey, S. Sen, J. Kurose, D. Towsley, James D. Salehi","doi":"10.1109/MMCS.1997.609757","DOIUrl":"https://doi.org/10.1109/MMCS.1997.609757","url":null,"abstract":"Low latency is crucial in networked multimedia applications such as on-demand streaming audio and video. In this paper we consider the problem of restarting or resuming playback following an interactive operation such as fast forward, rewind, or indexed jump in stored on-demand video. We present two approaches to restart playback after an interactive operation, and develop algorithms to compute the latencies incurred in restarting playback. Using long MPEG-1 traces, with an optimal smoothing technique to transmit data for regular playback, we demonstrate that the latencies incurred under our approaches are very small. We next examine the latencies incurred when restarting playback in a video server under two policies for sharing its bandwidth: (a) one in which only regular playback bandwidth is available to restart playback and (b) one in which additional free server bandwidth (if any) is accessible. We find playback restart latencies to be similarly low under both policies, suggesting that the simpler approach (a) is sufficient.","PeriodicalId":302885,"journal":{"name":"Proceedings of IEEE International Conference on Multimedia Computing and Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116839799","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}
引用次数: 26
Creating a virtual network laboratory 创建虚拟网络实验室
Proceedings of IEEE International Conference on Multimedia Computing and Systems Pub Date : 1997-06-03 DOI: 10.1109/MMCS.1997.609796
Yen-Jen Lee, Wei-hsiu Ma, D. Du, James A. Schnepf
{"title":"Creating a virtual network laboratory","authors":"Yen-Jen Lee, Wei-hsiu Ma, D. Du, James A. Schnepf","doi":"10.1109/MMCS.1997.609796","DOIUrl":"https://doi.org/10.1109/MMCS.1997.609796","url":null,"abstract":"Networking courses are traditionally conceptual in nature, with little opportunity for students to apply what they have learned in order to strengthen their knowledge. To support these courses, the University of Minnesota established a hands-on network laboratory. Educational and operational concerns have surfaced throughout the years due to the physical laboratory constraints and difficulty of satisfying the high demand. To address these issues, and to overcome the shortcomings of current approaches, we are developing a virtual network laboratory environment to eliminate most of the constraints, though it is not necessarily replacing all of the physical settings at once. The kernel consists of a collection of online multimedia learning modules which integrate the key laboratory devices with instructional material. The modules are designed to allow students to carry out hands-on networking in a virtual environment or through remote access. This virtual laboratory is easily accessible over the Internet.","PeriodicalId":302885,"journal":{"name":"Proceedings of IEEE International Conference on Multimedia Computing and Systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115212943","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}
引用次数: 16
Virtual memory management for interactive continuous media applications 交互式连续媒体应用程序的虚拟内存管理
Proceedings of IEEE International Conference on Multimedia Computing and Systems Pub Date : 1997-06-03 DOI: 10.1109/MMCS.1997.609752
T. Nakajima, H. Tezuka
{"title":"Virtual memory management for interactive continuous media applications","authors":"T. Nakajima, H. Tezuka","doi":"10.1109/MMCS.1997.609752","DOIUrl":"https://doi.org/10.1109/MMCS.1997.609752","url":null,"abstract":"This paper proposes a virtual memory management system suitable for interactive continuous media applications. Interactive continuous media applications usually require a large amount of memory for storing their code, data, and stack segments. In traditional operating systems, demand paging makes it possible to execute such large applications by storing most pages in secondary disks. However, continuous media applications should avoid page faults for ensuring timing constraints of continuous media since it takes a long time to swap pages between physical memory and secondary storage. Thus, it is difficult to satisfy timing constraints of continuous media. Therefore, some operating systems provide memory wiring primitives that enable applications to wire pages in physical memory by specifying the range of virtual address spaces explicitly. On the other hand, our virtual memory management system enables continuous media applications to reserve physical memory for allocating pages as soon as possible when the applications require the pages. The system implicitly and incrementally allocates and wires pages used for processing timing critical media data. Also, our system supports applications that adapt the amount of wired memory to the memory usage of other continuous media applications.","PeriodicalId":302885,"journal":{"name":"Proceedings of IEEE International Conference on Multimedia Computing and Systems","volume":"65 13","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120919731","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}
引用次数: 16
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信