Pub Date : 1996-06-17DOI: 10.1109/MMCS.1996.534982
S. Jha, M. Fry
The purpose of this paper is to examine problems associated with display (playback) of live continuous media under varying conditions for an internetwork of workstations running a general purpose operating system such as Unix. Under the assumption that the network cannot guarantee the required bounds on delay and jitter, there is a need to accommodate the delay jitter in the end systems. Various methods of jitter smoothing at the end systems and their suitability to audio as well as video transmission are discussed. An experimental testbed used to investigate these problems is described. Some initial empirical results obtained using this testbed are also presented.
{"title":"Continuous media playback and jitter control","authors":"S. Jha, M. Fry","doi":"10.1109/MMCS.1996.534982","DOIUrl":"https://doi.org/10.1109/MMCS.1996.534982","url":null,"abstract":"The purpose of this paper is to examine problems associated with display (playback) of live continuous media under varying conditions for an internetwork of workstations running a general purpose operating system such as Unix. Under the assumption that the network cannot guarantee the required bounds on delay and jitter, there is a need to accommodate the delay jitter in the end systems. Various methods of jitter smoothing at the end systems and their suitability to audio as well as video transmission are discussed. An experimental testbed used to investigate these problems is described. Some initial empirical results obtained using this testbed are also presented.","PeriodicalId":371043,"journal":{"name":"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems","volume":"101 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":"114710819","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}
Pub Date : 1996-06-17DOI: 10.1109/MMCS.1996.534994
Y. Yaginuma, M. Sakauchi
Automatic image recognition is usually difficult. However, drama is composed of not only image but also sound and script. Therefore, higher level recognition of drama which cannot be achieved by the image analysis will be realized by integrating image analysis, sound analysis and document analysis. In this paper, focusing on the semantic descriptions in the script, content-based drama editing based on inter-media synchronization is proposed. In the proposed method, inter-media synchronization between image, sound and script is carried out using DP matching. Then, the script is edited using an ordinary text editor. Finally, the editing of drama is carried out by selecting and aligning the image and sound based on the edited script. Therefore, the proposed method can realize effective and semantic-based video editing by handling smaller and more abstracted data. The experimental results reveal the effectiveness of the proposed method.
{"title":"Content-based drama editing based on inter-media synchronization","authors":"Y. Yaginuma, M. Sakauchi","doi":"10.1109/MMCS.1996.534994","DOIUrl":"https://doi.org/10.1109/MMCS.1996.534994","url":null,"abstract":"Automatic image recognition is usually difficult. However, drama is composed of not only image but also sound and script. Therefore, higher level recognition of drama which cannot be achieved by the image analysis will be realized by integrating image analysis, sound analysis and document analysis. In this paper, focusing on the semantic descriptions in the script, content-based drama editing based on inter-media synchronization is proposed. In the proposed method, inter-media synchronization between image, sound and script is carried out using DP matching. Then, the script is edited using an ordinary text editor. Finally, the editing of drama is carried out by selecting and aligning the image and sound based on the edited script. Therefore, the proposed method can realize effective and semantic-based video editing by handling smaller and more abstracted data. The experimental results reveal the effectiveness of the proposed method.","PeriodicalId":371043,"journal":{"name":"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems","volume":"16 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":"115108931","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}
Pub Date : 1996-06-17DOI: 10.1109/MMCS.1996.535028
J. Wang, K. Hua, H. Young
We present techniques for managing disks as a buffer for the tertiary storage of multimedia servers. A unified disk space is used to not only cache frequently referenced objects, but also to provide staging buffers for playing back objects. A new staging technique and three buffer replacement policies are investigated. The simulation results indicate that the staging method is very efficient, and each of the replacement policies offers significant additional improvement. Some of the performance issues are also analyzed analytically. The mathematical model provides guidelines for good multimedia systems design using the proposed techniques.
{"title":"SEP: a space efficient pipelining technique for managing disk buffers in multimedia servers","authors":"J. Wang, K. Hua, H. Young","doi":"10.1109/MMCS.1996.535028","DOIUrl":"https://doi.org/10.1109/MMCS.1996.535028","url":null,"abstract":"We present techniques for managing disks as a buffer for the tertiary storage of multimedia servers. A unified disk space is used to not only cache frequently referenced objects, but also to provide staging buffers for playing back objects. A new staging technique and three buffer replacement policies are investigated. The simulation results indicate that the staging method is very efficient, and each of the replacement policies offers significant additional improvement. Some of the performance issues are also analyzed analytically. The mathematical model provides guidelines for good multimedia systems design using the proposed techniques.","PeriodicalId":371043,"journal":{"name":"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems","volume":"44 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":"127468891","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}
Pub Date : 1996-06-17DOI: 10.1109/MMCS.1996.535002
C. Drummond, D. Ionescu, R. Holte, N. Georganas, E. Petriu
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.
{"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}
Pub Date : 1996-06-17DOI: 10.1109/MMCS.1996.534983
C. Aggarwal, J. Wolf, Philip S. Yu
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.
{"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}
Pub Date : 1996-06-17DOI: 10.1109/MMCS.1996.534996
Mitsukazu Washisaka, T. Takada, S. Aoyagi, R. Onai
This paper describes a system for two-way linkage between video and its transcribed text that supports observational data analysis. One distinct feature of the system is that a specific area in the video image is linked to the text. The luminance (Y) signal of the video image is used to assist in linkage establishment from video to text. Another feature is that it is possible to extract concepts of the search term and to compare these with the text data on a conceptual level.
{"title":"Video/text linkage system assisted by a concept dictionary and image recognition","authors":"Mitsukazu Washisaka, T. Takada, S. Aoyagi, R. Onai","doi":"10.1109/MMCS.1996.534996","DOIUrl":"https://doi.org/10.1109/MMCS.1996.534996","url":null,"abstract":"This paper describes a system for two-way linkage between video and its transcribed text that supports observational data analysis. One distinct feature of the system is that a specific area in the video image is linked to the text. The luminance (Y) signal of the video image is used to assist in linkage establishment from video to text. Another feature is that it is possible to extract concepts of the search term and to compare these with the text data on a conceptual level.","PeriodicalId":371043,"journal":{"name":"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems","volume":"267 1 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":"114239186","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}
Pub Date : 1996-06-17DOI: 10.1109/MMCS.1996.535000
E. Biersack, C. Bernhardt, Werner Geyer
Multimedia streams such as audio and video impose tight temporal constraints due to their continuous nature. Often, different multimedia streams must be presented in a synchronized way. We introduce a scheme for the continuous and synchronous delivery of distributed stored multimedia streams across a communications network. We propose a protocol for the synchronized playback, compute the buffer requirement, and describe the experimental results of our implementation. The scheme is very general and does not require bounded jitter or synchronized clocks and is able to cope with clock drifts and server drop outs.
{"title":"Intra- and inter-stream synchronisation for stored multimedia streams","authors":"E. Biersack, C. Bernhardt, Werner Geyer","doi":"10.1109/MMCS.1996.535000","DOIUrl":"https://doi.org/10.1109/MMCS.1996.535000","url":null,"abstract":"Multimedia streams such as audio and video impose tight temporal constraints due to their continuous nature. Often, different multimedia streams must be presented in a synchronized way. We introduce a scheme for the continuous and synchronous delivery of distributed stored multimedia streams across a communications network. We propose a protocol for the synchronized playback, compute the buffer requirement, and describe the experimental results of our implementation. The scheme is very general and does not require bounded jitter or synchronized clocks and is able to cope with clock drifts and server drop outs.","PeriodicalId":371043,"journal":{"name":"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems","volume":"569 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":"122932850","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}
Pub Date : 1996-06-17DOI: 10.1109/MMCS.1996.535031
Vijnan Shastri, P. Rangan, V. Rajaraman, A. Pittet, Srihari Sampath Kumar
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.
cd - rom作为桌面机器的一种分发媒介，用于各种各样的多媒体应用。我们将研究与单用户桌面环境相关的问题。由于这些多媒体应用程序本质上是高度交互的，因此我们采取了一种实用的方法，并通过跟踪这些模式，从生成到CD-ROM子系统的I/O请求模式的角度详细研究了多媒体应用程序的行为。我们讨论了预取缓冲器的设计，并在分析这些轨迹的背景下寻求时间特征。我们表明最好将多媒体流放在靠近CD-ROM中心的位置。我们给出了自适应主存托管缓存的参数，该缓存接收来自应用程序的缓存提示，以减少用户从超图的一个节点移动到另一个节点时的延迟。结果表明，100米的短距离投掷是最重要的。我们将查看视频点播服务器(VoD)中cd - rom的使用情况，并讨论在此场景中调度多个请求流和缓冲区管理的问题。我们采用C-SCAN (Circular SCAN)算法来适应CD-ROM驱动器的特性，并证明了它在缓冲区大小管理方面是最优的。我们提供了计算成本低廉的关系，通过这种关系可以实现该算法。然后，我们提出了一种“恒定满负荷”接纳控制算法，该算法从虚拟请求池中接收新的请求流，而不会中断先前请求流的播放连续性。该算法还支持快进和回放等操作。
{"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}
Pub Date : 1996-06-17DOI: 10.1109/MMCS.1996.535899
T. Yamasaki, T. Hattori
We propose a computer formation of brush-written Kanji characters for a brush writing training system using calligraphic knowledge. The style of brush handwriting depends mainly on the way of using a writing brush. Brush writing skills include the direction of the brush at the beginning, curvature and turning the brush, and the brush-up at the termination point in a stroke. We revise the calligraphic knowledge base according to the above mentioned brush writing skills. For simulating real brush movement, we represent the brush contact form that is the brush shape on the writing plane as a brush-touch. The system can control the size and direction of this brush-touch during the brush simulation. The system simulates the real brush writing to move the brush-touch along the skeleton letter shape in the standard database. We can get the brush written Kanji from the locus of the brush-touch movement. This system is also useful for students learning how to write Japanese letters beautifully with a brush.
{"title":"Forming square-styled brush-written Kanji through calligraphic skill knowledge","authors":"T. Yamasaki, T. Hattori","doi":"10.1109/MMCS.1996.535899","DOIUrl":"https://doi.org/10.1109/MMCS.1996.535899","url":null,"abstract":"We propose a computer formation of brush-written Kanji characters for a brush writing training system using calligraphic knowledge. The style of brush handwriting depends mainly on the way of using a writing brush. Brush writing skills include the direction of the brush at the beginning, curvature and turning the brush, and the brush-up at the termination point in a stroke. We revise the calligraphic knowledge base according to the above mentioned brush writing skills. For simulating real brush movement, we represent the brush contact form that is the brush shape on the writing plane as a brush-touch. The system can control the size and direction of this brush-touch during the brush simulation. The system simulates the real brush writing to move the brush-touch along the skeleton letter shape in the standard database. We can get the brush written Kanji from the locus of the brush-touch movement. This system is also useful for students learning how to write Japanese letters beautifully with a brush.","PeriodicalId":371043,"journal":{"name":"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems","volume":"13 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":"132214392","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}
Pub Date : 1996-06-17DOI: 10.1109/MMCS.1996.535003
A. Ichikawa, K. Yamaoka, Toshiyuki Yoshida, Y. Sakai
Proposes a media synchronization method for MPEG video stored in distributed databases in a computer network. The proposed method takes account not only of the video frame synchronization but also of the played-back frame sequence quality. First, we propose a quality measure for moving pictures based on the smoothness of motion, which makes use of motion vectors between frames. Then a synchronization method for MPEG video, based on such a quality measure, is proposed, and its performance is evaluated by a computer simulation, by comparing it with other media synchronization methods for MPEG video.
{"title":"Multimedia synchronization system for MPEG video based on quality of pictures","authors":"A. Ichikawa, K. Yamaoka, Toshiyuki Yoshida, Y. Sakai","doi":"10.1109/MMCS.1996.535003","DOIUrl":"https://doi.org/10.1109/MMCS.1996.535003","url":null,"abstract":"Proposes a media synchronization method for MPEG video stored in distributed databases in a computer network. The proposed method takes account not only of the video frame synchronization but also of the played-back frame sequence quality. First, we propose a quality measure for moving pictures based on the smoothness of motion, which makes use of motion vectors between frames. Then a synchronization method for MPEG video, based on such a quality measure, is proposed, and its performance is evaluated by a computer simulation, by comparing it with other media synchronization methods for MPEG video.","PeriodicalId":371043,"journal":{"name":"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems","volume":"15 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":"132602654","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：