Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems最新文献_第2页

Continuous media playback and jitter control 连续媒体播放和抖动控制

Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems Pub Date : 1996-06-17 DOI: 10.1109/MMCS.1996.534982

S. Jha, M. Fry

引用次数: 11

Content-based drama editing based on inter-media synchronization 基于跨媒体同步的基于内容的话剧编辑

Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems Pub Date : 1996-06-17 DOI: 10.1109/MMCS.1996.534994

Y. Yaginuma, M. Sakauchi

引用次数: 10

SEP: a space efficient pipelining technique for managing disk buffers in multimedia servers SEP:在多媒体服务器中管理磁盘缓冲区的一种空间高效的流水线技术

Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems Pub Date : 1996-06-17 DOI: 10.1109/MMCS.1996.535028

J. Wang, K. Hua, H. Young

引用次数: 12

Intelligent browsing for multimedia applications 多媒体应用的智能浏览

Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems Pub Date : 1996-06-17 DOI: 10.1109/MMCS.1996.535002

C. Drummond, D. Ionescu, R. Holte, N. Georganas, E. Petriu

{"title":"Intelligent browsing for multimedia applications","authors":"C. Drummond, D. Ionescu, R. Holte, N. Georganas, E. Petriu","doi":"10.1109/MMCS.1996.535002","DOIUrl":"https://doi.org/10.1109/MMCS.1996.535002","url":null,"abstract":"Describes a technique which we term \"intelligent browsing\"; the software built upon this technique assists the users in their search through a multimedia database. Searching for an item of interest in a large multimedia database is a complex task, even for users who have knowledge about it. An active (intelligent) browser suggests to the user items it estimates to be close to the target of the search. The intelligent part of the active browser consists of a learning module, whose object of study is the profile of the users' search actions. After a target is detected, the intelligent browser brings the item or items of interest on to the screen in a dedicated window, and controls the synchronization of the audio, video or written components of the item. If confirmed by the user, the dedicated window is transformed into a series of windows allocated to the desired item. The novel aspect of intelligent browsing is that it is entirely unobtrusive: it infers its similarity measure from the user's normal browsing actions, without any special input. Use of the browser on a multimedia application is illustrated in this paper.","PeriodicalId":371043,"journal":{"name":"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130235134","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

On optimal batching policies for video-on-demand storage servers 视频点播存储服务器的最优批处理策略

Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems Pub Date : 1996-06-17 DOI: 10.1109/MMCS.1996.534983

C. Aggarwal, J. Wolf, Philip S. Yu

{"title":"On optimal batching policies for video-on-demand storage servers","authors":"C. Aggarwal, J. Wolf, Philip S. Yu","doi":"10.1109/MMCS.1996.534983","DOIUrl":"https://doi.org/10.1109/MMCS.1996.534983","url":null,"abstract":"In a video-on-demand environment, batching of video requests is often used to reduce I/O demand and improve throughput. Since viewers may defect if they experience long waits, a good video scheduling policy needs to consider not only the batch size but also the viewer defection probabilities and wait times. Two conventional scheduling policies for batching are first-come-first-served (FCFS) and maximum queue length (MOL). Neither of these policies lead to entirely satisfactory results. MQL tends to be too aggressive in scheduling popular videos by only considering the queue length to maximize batch size, while FCFS has the opposite effect. We introduce the notion of factored queue length and propose a batching policy that schedules the video with the maximum factored queue length. We refer to this as the MFQ policy. The factored queue length is obtained by weighting each video queue length with a factor which is biased against the more popular videos. An optimization problem is formulated to solve the best weighting factors for the various videos. A simulation is developed to compare the proposed MFQ policy with FCFS and MQL. Our study shows that MFQ yields excellent empirical results in terms of standard performance measures such as average latency time, defection rates and fairness.","PeriodicalId":371043,"journal":{"name":"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126894708","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}

引用次数: 280

Video/text linkage system assisted by a concept dictionary and image recognition 视频/文本联动系统，辅以概念词典和图像识别

Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems Pub Date : 1996-06-17 DOI: 10.1109/MMCS.1996.534996

Mitsukazu Washisaka, T. Takada, S. Aoyagi, R. Onai

引用次数: 2

Intra- and inter-stream synchronisation for stored multimedia streams 存储多媒体流的流内和流间同步

Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems Pub Date : 1996-06-17 DOI: 10.1109/MMCS.1996.535000

E. Biersack, C. Bernhardt, Werner Geyer

引用次数: 35

Performance issues in CD-ROM-based storage systems for multimedia 多媒体用cd - rom存储系统的性能问题

Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems Pub Date : 1996-06-17 DOI: 10.1109/MMCS.1996.535031

Vijnan Shastri, P. Rangan, V. Rajaraman, A. Pittet, Srihari Sampath Kumar

{"title":"Performance issues in CD-ROM-based storage systems for multimedia","authors":"Vijnan Shastri, P. Rangan, V. Rajaraman, A. Pittet, Srihari Sampath Kumar","doi":"10.1109/MMCS.1996.535031","DOIUrl":"https://doi.org/10.1109/MMCS.1996.535031","url":null,"abstract":"CD-ROMs have proliferated as a distribution media for desktop machines for a large variety of multimedia applications. We look at issues related to the single-user desktop environment. Since these multimedia applications are highly interactive in nature, we take a pragmatic approach, and have made a detailed study of the multimedia application behavior in terms of the I/O request patterns generated to the CD-ROM subsystem by tracing these patterns. We discuss prefetch buffer design and seek time characteristics in the context of the analysis of these traces. We show that it is best to place multimedia streams near the center of the CD-ROM. We present the parameters of an adaptive main-memory hosted cache that receives caching hints from the application to reduce the latency when the user moves from one node of the hypergraph to another. We show that short-throw seeks of distance 100 are the most important. We look at the use of CD-ROMs in a video on demand server (VoD) and discuss the problem of scheduling multiple request streams and buffer management in this scenario. We adapt C-SCAN (Circular SCAN) algorithm to suit the CD-ROM drive characteristics and prove that it is optimal in terms of buffer size management. We provide computationally inexpensive relations by which this algorithm can be implemented. We then propose a 'constant-full-load' admission control algorithm which admits new request streams from a pool of dummy requests without disrupting the continuity of playback of the previous request streams. The algorithm also supports operations such as fast forward and replay.","PeriodicalId":371043,"journal":{"name":"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116514476","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}

引用次数: 3

Dynamic QOS control based on the QOS-Ticket model 基于QOS- ticket模型的动态QOS控制

Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems Pub Date : 1996-06-17 DOI: 10.1109/MMCS.1996.534958

K. Kawachiya, H. Tokuda

引用次数: 13

New algorithms for admission control and scheduling to support multimedia feedback remote control applications 新算法的入场控制和调度，以支持多媒体反馈远程控制应用

Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems Pub Date : 1996-06-17 DOI: 10.1109/MMCS.1996.535901

K. Nahrstedt, Jonathan M. Smith

引用次数: 11