Pub Date : 1996-06-17DOI: 10.1109/MMCS.1996.534962
G. Dermler, W. Fiederer, I. Barth, K. Rothermel
Distributed multimedia applications require negotiation of quality of service (QoS) and resource reservation for distributed application parts and communication links. Negotiation of QoS is a balancing process between the QoS specified by a client, the resource availabilities of the distributed system and the functional capabilities of the distributed application. Negotiation requires application level QoS descriptions and an end to end view spanning the whole distributed application. NRP is an application level protocol meeting these requirements. NRP performs negotiation based on client specified QoS value ranges and given resource availability on endsystems and communication links. NRP is independent of application level QoS semantics. It allows QoS negotiation and resource reservation in three phases and supports a wide range of distributed application topologies.
{"title":"A negotiation and resource reservation protocol (NRP) for configurable multimedia applications","authors":"G. Dermler, W. Fiederer, I. Barth, K. Rothermel","doi":"10.1109/MMCS.1996.534962","DOIUrl":"https://doi.org/10.1109/MMCS.1996.534962","url":null,"abstract":"Distributed multimedia applications require negotiation of quality of service (QoS) and resource reservation for distributed application parts and communication links. Negotiation of QoS is a balancing process between the QoS specified by a client, the resource availabilities of the distributed system and the functional capabilities of the distributed application. Negotiation requires application level QoS descriptions and an end to end view spanning the whole distributed application. NRP is an application level protocol meeting these requirements. NRP performs negotiation based on client specified QoS value ranges and given resource availability on endsystems and communication links. NRP is independent of application level QoS semantics. It allows QoS negotiation and resource reservation in three phases and supports a wide range of distributed application topologies.","PeriodicalId":371043,"journal":{"name":"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems","volume":"33 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":"128841327","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.535020
Chun-Hung Lin, Ja-Ling Wu
Genetic algorithms (GAs) recently have been successfully applied to perform block-based motion estimation. It is shown that the performance of the GA-based motion estimation algorithms nearly approaches that of the full search algorithm (FSA). However, the computational complexity of the existing GA-based algorithms is too high to be used in practice. In this paper, a lightweight genetic search algorithm (LGSA) is proposed. It can be seen from the simulation results that the performance of the proposed LGSA is not only as good as that of the FSA, but the computational complexity is also much lower than that of the FSA and the other existing genetic motion estimation algorithms.
{"title":"Genetic block matching algorithm for video coding","authors":"Chun-Hung Lin, Ja-Ling Wu","doi":"10.1109/MMCS.1996.535020","DOIUrl":"https://doi.org/10.1109/MMCS.1996.535020","url":null,"abstract":"Genetic algorithms (GAs) recently have been successfully applied to perform block-based motion estimation. It is shown that the performance of the GA-based motion estimation algorithms nearly approaches that of the full search algorithm (FSA). However, the computational complexity of the existing GA-based algorithms is too high to be used in practice. In this paper, a lightweight genetic search algorithm (LGSA) is proposed. It can be seen from the simulation results that the performance of the proposed LGSA is not only as good as that of the FSA, but the computational complexity is also much lower than that of the FSA and the other existing genetic motion estimation algorithms.","PeriodicalId":371043,"journal":{"name":"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems","volume":"123 19 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":"125439883","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.535011
Y. Theodoridis, M. Vazirgiannis, T. Sellis
Multimedia applications usually involve a large number of multimedia objects (texts, images, sounds, etc.). Spatial and temporal relationships among these objects should be efficiently supported and retrieved within a multimedia authoring tool. In this paper, we present several spatial, temporal and spatio-temporal relationships of interest, and propose efficient indexing schemes, based on multidimensional (spatial) data structures, for large multimedia applications that involve thousands of objects. Evaluation models of the proposed schemes are also presented, as well as hints for the selection of the most appropriate one, according to the multimedia author's requirements.
{"title":"Spatio-temporal indexing for large multimedia applications","authors":"Y. Theodoridis, M. Vazirgiannis, T. Sellis","doi":"10.1109/MMCS.1996.535011","DOIUrl":"https://doi.org/10.1109/MMCS.1996.535011","url":null,"abstract":"Multimedia applications usually involve a large number of multimedia objects (texts, images, sounds, etc.). Spatial and temporal relationships among these objects should be efficiently supported and retrieved within a multimedia authoring tool. In this paper, we present several spatial, temporal and spatio-temporal relationships of interest, and propose efficient indexing schemes, based on multidimensional (spatial) data structures, for large multimedia applications that involve thousands of objects. Evaluation models of the proposed schemes are also presented, as well as hints for the selection of the most appropriate one, according to the multimedia author's requirements.","PeriodicalId":371043,"journal":{"name":"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems","volume":"186 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":"128075960","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.534976
Tony C. T. Kuo, Arbee L. P. Chen
Presents CVQL (Content-based Video Query Language) for video databases. Spatial and temporal relationships of content objects are used for the specification of query predicates. Queries of realism are illustrated to show the power of CVQL. Macro definitions are supported to simplify query specification. Index structures and query processing for CVQL are considered, and a prototype video database system is implemented, which consists of a GUI and a CVQL processor. Users can sketch a query and its corresponding predicate by using the GUI, and the query can then be converted to CVQL for processing.
{"title":"A content-based query language for video databases","authors":"Tony C. T. Kuo, Arbee L. P. Chen","doi":"10.1109/MMCS.1996.534976","DOIUrl":"https://doi.org/10.1109/MMCS.1996.534976","url":null,"abstract":"Presents CVQL (Content-based Video Query Language) for video databases. Spatial and temporal relationships of content objects are used for the specification of query predicates. Queries of realism are illustrated to show the power of CVQL. Macro definitions are supported to simplify query specification. Index structures and query processing for CVQL are considered, and a prototype video database system is implemented, which consists of a GUI and a CVQL processor. Users can sketch a query and its corresponding predicate by using the GUI, and the query can then be converted to CVQL for processing.","PeriodicalId":371043,"journal":{"name":"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems","volume":"22 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":"124872515","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.535005
Roberto Willrich, P. Sénac, M. Diaz, Pierre de Saqui-Sannes
Proposes a formal framework for the specification, analysis and generation of standardized hypermedia documents. This framework is based on the hierarchical time stream Petri net (HTSPN) model adapted to the specification of temporal and logical constraints in distributed hypermedia systems. The interpreted HTSPN model presented in the paper allows the accurate and unambiguous specification of hypermedia documents. Moreover, it permits powerful analysis techniques to be applied for insuring the quality of hypermedia documents. It is important for a HTSPN specification to be stored, exchanged and presented within open hypermedia systems. Therefore, a procedure for translating interpreted HTSPN specification into an MHEG (Multimedia and Hypermedia Experts Group) representation is also proposed.
{"title":"A formal framework for the specification, analysis and generation of standardized hypermedia documents","authors":"Roberto Willrich, P. Sénac, M. Diaz, Pierre de Saqui-Sannes","doi":"10.1109/MMCS.1996.535005","DOIUrl":"https://doi.org/10.1109/MMCS.1996.535005","url":null,"abstract":"Proposes a formal framework for the specification, analysis and generation of standardized hypermedia documents. This framework is based on the hierarchical time stream Petri net (HTSPN) model adapted to the specification of temporal and logical constraints in distributed hypermedia systems. The interpreted HTSPN model presented in the paper allows the accurate and unambiguous specification of hypermedia documents. Moreover, it permits powerful analysis techniques to be applied for insuring the quality of hypermedia documents. It is important for a HTSPN specification to be stored, exchanged and presented within open hypermedia systems. Therefore, a procedure for translating interpreted HTSPN specification into an MHEG (Multimedia and Hypermedia Experts Group) representation is also proposed.","PeriodicalId":371043,"journal":{"name":"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems","volume":"307 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":"124909731","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.535024
M. Billot, V. Issarny, I. Puaut, M. Banâtre
Multimedia applications are characterized by QoS (quality of service) requirements, which depend an the quality of video and audio transmitted to the client, and the respect of time constraints associated with video and audio data. Much work has been done in order to provide system support that meets these requirements. However, existing proposals do not include the consequences of failure occurrence on QoS. In this paper, we address this issue by introducing a resource reservation model that integrates availability requirements. Our design goals for this model were: (i) to allow programmers to reserve resources with respect to various QoS requirements including availability; and (ii) to preserve the transparency of mechanisms used for availability. This paper details the resulting model, together with its integration in a distributed system.
{"title":"Ensuring high availability of distributed multimedia applications","authors":"M. Billot, V. Issarny, I. Puaut, M. Banâtre","doi":"10.1109/MMCS.1996.535024","DOIUrl":"https://doi.org/10.1109/MMCS.1996.535024","url":null,"abstract":"Multimedia applications are characterized by QoS (quality of service) requirements, which depend an the quality of video and audio transmitted to the client, and the respect of time constraints associated with video and audio data. Much work has been done in order to provide system support that meets these requirements. However, existing proposals do not include the consequences of failure occurrence on QoS. In this paper, we address this issue by introducing a resource reservation model that integrates availability requirements. Our design goals for this model were: (i) to allow programmers to reserve resources with respect to various QoS requirements including availability; and (ii) to preserve the transparency of mechanisms used for availability. This paper details the resulting model, together with its integration in a distributed system.","PeriodicalId":371043,"journal":{"name":"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems","volume":"57 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":"125141746","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.534965
Tsun-Ping J. To, B. Hamidzadeh
We study a dynamic approach to the problem of scheduling real time requests in a video on demand server. Most of the previous VOD scheduling approaches use limited run time information, and thus cannot exploit the potential capacity fully. Our approach improves throughput by making use of run time information to relax admission control, and to reduce admission to start delay by providing earliest initial service. We establish conditions for greedy admission, dynamic control of the sequence and sizes of disk accesses, and fast initial service. We conduct thorough simulations over a wide range of buffer capacities, load settings, and over varying playout rates to demonstrate the significant improvements in throughput and admission re start delay of our approach relative to a typical static approach which does not use run time information.
{"title":"A greedy-but-safe dynamic scheduling strategy for an interactive video-on-demand server","authors":"Tsun-Ping J. To, B. Hamidzadeh","doi":"10.1109/MMCS.1996.534965","DOIUrl":"https://doi.org/10.1109/MMCS.1996.534965","url":null,"abstract":"We study a dynamic approach to the problem of scheduling real time requests in a video on demand server. Most of the previous VOD scheduling approaches use limited run time information, and thus cannot exploit the potential capacity fully. Our approach improves throughput by making use of run time information to relax admission control, and to reduce admission to start delay by providing earliest initial service. We establish conditions for greedy admission, dynamic control of the sequence and sizes of disk accesses, and fast initial service. We conduct thorough simulations over a wide range of buffer capacities, load settings, and over varying playout rates to demonstrate the significant improvements in throughput and admission re start delay of our approach relative to a typical static approach which does not use run time information.","PeriodicalId":371043,"journal":{"name":"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems","volume":"286 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":"116564295","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.535897
Yuichi Nakamura, Miwa Takahashi, Masayuki Onda, Y. Ohta
We introduce a new framework for knowledge extraction from written texts and diagrams and utilization of the obtained knowledge. We use a combination of multiple media for effective communication. To realize this mechanism as a hyper-medium, we propose a noble idea of media integration. First, the correlation between the two media is analyzed to automatically interpret the semantic structure of both media. The integrated hypermedia obtained as a result of the correspondence and the semantic interpretation is quite useful to derive knowledge about topics being described. To demonstrate the usefulness of the integrated media, we have constructed a prototype system for flexible explanation generation. Various kinds of explanation can be generated in our system.
{"title":"Knowledge extraction from diagram and text for media integration","authors":"Yuichi Nakamura, Miwa Takahashi, Masayuki Onda, Y. Ohta","doi":"10.1109/MMCS.1996.535897","DOIUrl":"https://doi.org/10.1109/MMCS.1996.535897","url":null,"abstract":"We introduce a new framework for knowledge extraction from written texts and diagrams and utilization of the obtained knowledge. We use a combination of multiple media for effective communication. To realize this mechanism as a hyper-medium, we propose a noble idea of media integration. First, the correlation between the two media is analyzed to automatically interpret the semantic structure of both media. The integrated hypermedia obtained as a result of the correspondence and the semantic interpretation is quite useful to derive knowledge about topics being described. To demonstrate the usefulness of the integrated media, we have constructed a prototype system for flexible explanation generation. Various kinds of explanation can be generated in our system.","PeriodicalId":371043,"journal":{"name":"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems","volume":"38 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":"128861061","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.534997
Takahiro Watanabe, Chil-Woo Lee, A. Tsukamoto, M. Yachida
We describe a new method for real-time gesture recognition and its application. The key idea of the method is that we use multiple template models for specific feature parts of the body such as arms and estimate the pose of this part by comparing similarities of an input image to the models. To calculate the similarity for the part, we developed the Maskable Template Model (MTM) with which both masking and template matching operations are simultaneously completed. As an application of this method, we realize a real-time interactive system, Gesture Game System, which can activate the characters of a video game by gestures in real-time.
{"title":"Real-time gesture recognition using Maskable Template Model","authors":"Takahiro Watanabe, Chil-Woo Lee, A. Tsukamoto, M. Yachida","doi":"10.1109/MMCS.1996.534997","DOIUrl":"https://doi.org/10.1109/MMCS.1996.534997","url":null,"abstract":"We describe a new method for real-time gesture recognition and its application. The key idea of the method is that we use multiple template models for specific feature parts of the body such as arms and estimate the pose of this part by comparing similarities of an input image to the models. To calculate the similarity for the part, we developed the Maskable Template Model (MTM) with which both masking and template matching operations are simultaneously completed. As an application of this method, we realize a real-time interactive system, Gesture Game System, which can activate the characters of a video game by gestures in real-time.","PeriodicalId":371043,"journal":{"name":"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems","volume":"23 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":"114607165","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.535009
Hideaki Kikuchi, Yusuke Mishina, Minoru Ashizawa, Naoko Yamazaki, H. Fujisawa
Describes the development of a prototype user interface to support the construction of "virtual personal libraries" from digital libraries. The virtual personal library provides broad support for user-information activities such as browsing, editing, storing and annotating. We propose the use of a book metaphor interface that represents virtual books and bookshelves on computer displays. Users can browse, edit and store information freely by using this interface. We also propose a pointer-storing method based on the concept of transclusion to legally validate the use of information resources. An extended HTML is used to realize the pointer-storing method on the World Wide Web.
{"title":"User interface for a digital library to support construction of a \"virtual personal library\"","authors":"Hideaki Kikuchi, Yusuke Mishina, Minoru Ashizawa, Naoko Yamazaki, H. Fujisawa","doi":"10.1109/MMCS.1996.535009","DOIUrl":"https://doi.org/10.1109/MMCS.1996.535009","url":null,"abstract":"Describes the development of a prototype user interface to support the construction of \"virtual personal libraries\" from digital libraries. The virtual personal library provides broad support for user-information activities such as browsing, editing, storing and annotating. We propose the use of a book metaphor interface that represents virtual books and bookshelves on computer displays. Users can browse, edit and store information freely by using this interface. We also propose a pointer-storing method based on the concept of transclusion to legally validate the use of information resources. An extended HTML is used to realize the pointer-storing method on the World Wide Web.","PeriodicalId":371043,"journal":{"name":"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems","volume":"156 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":"133340056","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
扫码关注我们
求助内容：
应助结果提醒方式：