Pub Date : 1996-06-17DOI: 10.1109/MMCS.1996.534960
T. Nakajima
The paper proposes a dynamic QOS control scheme using a processor reservation system. In our scheme, a system allocates processor capacity for each application, then the application increases or decreases the current resource usage by using a feedback mechanism. This scheme allows the application to reserve resources optimistically. This means that a system can allocate all processor resources to respective applications every time. Our approach makes it easy to build a continuous media application with a dynamic QOS control scheme, and allocates processor capacity very efficiently without unexpected degradation of a media stream's quality.
{"title":"A dynamic QoS control based on optimistic processor reservation","authors":"T. Nakajima","doi":"10.1109/MMCS.1996.534960","DOIUrl":"https://doi.org/10.1109/MMCS.1996.534960","url":null,"abstract":"The paper proposes a dynamic QOS control scheme using a processor reservation system. In our scheme, a system allocates processor capacity for each application, then the application increases or decreases the current resource usage by using a feedback mechanism. This scheme allows the application to reserve resources optimistically. This means that a system can allocate all processor resources to respective applications every time. Our approach makes it easy to build a continuous media application with a dynamic QOS control scheme, and allocates processor capacity very efficiently without unexpected degradation of a media stream's quality.","PeriodicalId":371043,"journal":{"name":"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems","volume":"47 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":"130100206","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.534959
M. Moser
The paper introduces a mechanism for optimally graceful QoS degradation in distributed real time multimedia services, declarative scheduling. We assume that for each medium of a multimedia service there are a set of implementations, both with differing resource consumption and provided QoS, thus allowing to exploit both resource-resource and resource-QoS tradeoffs. If the amount of available resources changes, the service may locally adapt without changing the provided QoS by scheduling a different set of implementations with different resource requirements. Should this kind of rescheduling not be possible, the service may adapt by scheduling implementations with a lower QoS providable with the resources available. In the latter case declarative scheduling degrades the QoS optimally, i.e. the difference between the provided QoS and the requested QoS is minimal with respect to the user's preferences. The problem, which implementations to select to minimize the QoS degradation is shown to be a so far unconsidered instance of the NP complete knapsack problem. A heuristic for this knapsack problem is proposed and shown to be sufficiently efficient and accurate to implement declarative scheduling.
{"title":"Declarative scheduling for optimally graceful QoS degradation","authors":"M. Moser","doi":"10.1109/MMCS.1996.534959","DOIUrl":"https://doi.org/10.1109/MMCS.1996.534959","url":null,"abstract":"The paper introduces a mechanism for optimally graceful QoS degradation in distributed real time multimedia services, declarative scheduling. We assume that for each medium of a multimedia service there are a set of implementations, both with differing resource consumption and provided QoS, thus allowing to exploit both resource-resource and resource-QoS tradeoffs. If the amount of available resources changes, the service may locally adapt without changing the provided QoS by scheduling a different set of implementations with different resource requirements. Should this kind of rescheduling not be possible, the service may adapt by scheduling implementations with a lower QoS providable with the resources available. In the latter case declarative scheduling degrades the QoS optimally, i.e. the difference between the provided QoS and the requested QoS is minimal with respect to the user's preferences. The problem, which implementations to select to minimize the QoS degradation is shown to be a so far unconsidered instance of the NP complete knapsack problem. A heuristic for this knapsack problem is proposed and shown to be sufficiently efficient and accurate to implement declarative scheduling.","PeriodicalId":371043,"journal":{"name":"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems","volume":"131 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":"116239149","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.534975
Atsushi Ono, Masashi Amano, Mitsuhiro Hakaridani, T. Satou, M. Sakauchi
Proposes an image database with a fully automated keyword extraction function. Our approach can extract two different conceptual-level keywords from images. One is the "conceptual keyword", which is extracted by an image recognition technique using the "state transition model", which is a hierarchical model. The other keyword is the "scene description keyword", which is extracted by primitive parameters of color segments. We also propose the introduction of a "transition probability" to raise the retrieval accuracy (precision). Moreover, we evaluate the retrieval accuracy of this image database through a retrieval experiment using about 170 scenery images.
{"title":"A flexible content-based image retrieval system with combined scene description keyword","authors":"Atsushi Ono, Masashi Amano, Mitsuhiro Hakaridani, T. Satou, M. Sakauchi","doi":"10.1109/MMCS.1996.534975","DOIUrl":"https://doi.org/10.1109/MMCS.1996.534975","url":null,"abstract":"Proposes an image database with a fully automated keyword extraction function. Our approach can extract two different conceptual-level keywords from images. One is the \"conceptual keyword\", which is extracted by an image recognition technique using the \"state transition model\", which is a hierarchical model. The other keyword is the \"scene description keyword\", which is extracted by primitive parameters of color segments. We also propose the introduction of a \"transition probability\" to raise the retrieval accuracy (precision). Moreover, we evaluate the retrieval accuracy of this image database through a retrieval experiment using about 170 scenery images.","PeriodicalId":371043,"journal":{"name":"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems","volume":"3 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":"131376060","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.535030
Freddy Deppner, B. Gennart, R. Hersch
Existing models for serving continuous streams from disks are generally based on worst-case deterministic head displacement times and on a round-robin strand service approach consisting of serving all strands once per round. We propose an alternative approach, where the head displacement time is described as a random variable with known probability density and where strands are served in a round-robin manner consecutively several times per service period. By establishing the frame loss rate separately in each cycle and for each of the strand's display deadlines, we compute the mean number of lost frames per second for a given configuration. By serving strands consecutively several times in consecutive cycles, we show that for a given frame loss rate, less buffer space is needed than in the conventional single round approach.
{"title":"A probabilistic multi-cycle model for serving continuous streams from disks","authors":"Freddy Deppner, B. Gennart, R. Hersch","doi":"10.1109/MMCS.1996.535030","DOIUrl":"https://doi.org/10.1109/MMCS.1996.535030","url":null,"abstract":"Existing models for serving continuous streams from disks are generally based on worst-case deterministic head displacement times and on a round-robin strand service approach consisting of serving all strands once per round. We propose an alternative approach, where the head displacement time is described as a random variable with known probability density and where strands are served in a round-robin manner consecutively several times per service period. By establishing the frame loss rate separately in each cycle and for each of the strand's display deadlines, we compute the mean number of lost frames per second for a given configuration. By serving strands consecutively several times in consecutive cycles, we show that for a given frame loss rate, less buffer space is needed than in the conventional single round approach.","PeriodicalId":371043,"journal":{"name":"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems","volume":"105 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":"124740006","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.535012
Guang-Ho Cha, C. Chung
We propose a new index structure called the HG-tree, to support content-based retrieval in multimedia databases. Our goals are twofold: increasing the storage utilization and decreasing the directory coverage of the index tree. The first goal is achieved by absorbing splitting if possible, and when splitting is necessary, converting two nodes to three. This is done by proposing a good ordering on the directory nodes. The second goal is achieved by representing the directory regions compactly. We note that there is a trade-off between the two design goals, but the HG-tree is so flexible that it can control the trade-off. We present the design of our index tree and associated algorithms. In addition, we report the results of a series of tests, comparing the proposed index tree with the buddy-tree, which is one of the most successful access methods for a multidimensional space. The results show the superiority of our method.
{"title":"HG-tree: an index structure for multimedia databases","authors":"Guang-Ho Cha, C. Chung","doi":"10.1109/MMCS.1996.535012","DOIUrl":"https://doi.org/10.1109/MMCS.1996.535012","url":null,"abstract":"We propose a new index structure called the HG-tree, to support content-based retrieval in multimedia databases. Our goals are twofold: increasing the storage utilization and decreasing the directory coverage of the index tree. The first goal is achieved by absorbing splitting if possible, and when splitting is necessary, converting two nodes to three. This is done by proposing a good ordering on the directory nodes. The second goal is achieved by representing the directory regions compactly. We note that there is a trade-off between the two design goals, but the HG-tree is so flexible that it can control the trade-off. We present the design of our index tree and associated algorithms. In addition, we report the results of a series of tests, comparing the proposed index tree with the buddy-tree, which is one of the most successful access methods for a multidimensional space. The results show the superiority of our method.","PeriodicalId":371043,"journal":{"name":"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems","volume":"759 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":"123877053","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.534992
Yuh-Lin Chang, Wenjun Zeng, I. Kamel, Rafael Alonso
We study an important problem in multimedia database, namely the automatic extraction of indexing information from raw data based on video contents. The goal of our research project is to develop a prototype system for automatic indexing of sports videos. The novelty of our work is that we propose to integrate speech understanding and image analysis algorithms for extracting information. The main thrust of this work comes from the observation that in news or sports video indexing, usually speech analysis is more efficient in detecting events than image analysis. Therefore, in our system, the audio processing modules are first applied to locate candidates in the whole data. This information is passed to the video processing modules, which further analyze the video. The final products of video analysis are in the form of pointers to the locations of interesting events in a video. Our algorithms have been tested extensively with real TV programs, and results are presented and discussed.
{"title":"Integrated image and speech analysis for content-based video indexing","authors":"Yuh-Lin Chang, Wenjun Zeng, I. Kamel, Rafael Alonso","doi":"10.1109/MMCS.1996.534992","DOIUrl":"https://doi.org/10.1109/MMCS.1996.534992","url":null,"abstract":"We study an important problem in multimedia database, namely the automatic extraction of indexing information from raw data based on video contents. The goal of our research project is to develop a prototype system for automatic indexing of sports videos. The novelty of our work is that we propose to integrate speech understanding and image analysis algorithms for extracting information. The main thrust of this work comes from the observation that in news or sports video indexing, usually speech analysis is more efficient in detecting events than image analysis. Therefore, in our system, the audio processing modules are first applied to locate candidates in the whole data. This information is passed to the video processing modules, which further analyze the video. The final products of video analysis are in the form of pointers to the locations of interesting events in a video. Our algorithms have been tested extensively with real TV programs, and results are presented and discussed.","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":"124025525","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.534999
S. Goose, J. Dale, G. Hill, D. D. Roure, W. Hall
The success of the WWW has served as an illustration of how hypermedia can enhance access to large repositories of distributed information. However, current distributed hypermedia systems offer limited hypermedia functionality which cannot easily be augmented or simply applied to existing applications and data formats. This paper describes a model and prototype, based on the Microcosm system, of a reflexive and extensible distributed hypermedia framework for managing hypermedia application development, sharing and re-use.
{"title":"An open framework for integrating widely distributed hypermedia resources","authors":"S. Goose, J. Dale, G. Hill, D. D. Roure, W. Hall","doi":"10.1109/MMCS.1996.534999","DOIUrl":"https://doi.org/10.1109/MMCS.1996.534999","url":null,"abstract":"The success of the WWW has served as an illustration of how hypermedia can enhance access to large repositories of distributed information. However, current distributed hypermedia systems offer limited hypermedia functionality which cannot easily be augmented or simply applied to existing applications and data formats. This paper describes a model and prototype, based on the Microcosm system, of a reflexive and extensible distributed hypermedia framework for managing hypermedia application development, sharing and re-use.","PeriodicalId":371043,"journal":{"name":"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems","volume":"149 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":"115193577","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.535895
H. Arisawa, T. Tomii, Kiril Salev
This paper presents a methodology of database design and a query language for multimedia data, especially for video image data. It focuses on how to specify/identify "objects" in video frames, and the way of representing and storing them in a database. The result of the database query is a short "movie", in which retrieved objects are always emphasized by spotlighting or highlighting.
{"title":"Design of multimedia database and a query language for video image data","authors":"H. Arisawa, T. Tomii, Kiril Salev","doi":"10.1109/MMCS.1996.535895","DOIUrl":"https://doi.org/10.1109/MMCS.1996.535895","url":null,"abstract":"This paper presents a methodology of database design and a query language for multimedia data, especially for video image data. It focuses on how to specify/identify \"objects\" in video frames, and the way of representing and storing them in a database. The result of the database query is a short \"movie\", in which retrieved objects are always emphasized by spotlighting or highlighting.","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":"115050847","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.534995
M. Shibata, Yeun-Bae Kim
For flexible handling of video images, it is important to structure video information according to its content. We focus on linguistic descriptions of such video contents that can be extracted during the process of video production. This paper proposes a component-based scene description model for computerizing linguistic descriptions written by the directors and a method for extracting a content-based hierarchical structure for video sequences based on this model.
{"title":"Content-based structuring of video information","authors":"M. Shibata, Yeun-Bae Kim","doi":"10.1109/MMCS.1996.534995","DOIUrl":"https://doi.org/10.1109/MMCS.1996.534995","url":null,"abstract":"For flexible handling of video images, it is important to structure video information according to its content. We focus on linguistic descriptions of such video contents that can be extracted during the process of video production. This paper proposes a component-based scene description model for computerizing linguistic descriptions written by the directors and a method for extracting a content-based hierarchical structure for video sequences based on this model.","PeriodicalId":371043,"journal":{"name":"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems","volume":"321 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":"115866121","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.535029
K. Ng, A. Yeung
Previous studies on disk scheduling for video services are usually based on computer simulation. We present an analysis of disk scheduling for video services. The purpose of the analysis is to obtain the maximum number of simultaneous video streams which can be supported by a disk using CLOOK or LOOK algorithm. The analysis is then extended to study disk scheduling for special user functions such as 'forward search' and 'reverse search'. Analysis on a technique called REdundancy for Special User Functions (RESUF) is also performed and the results show that the technique can keep the I/O demands to almost constant under all user request conditions.
{"title":"Analysis on disk scheduling for special user functions","authors":"K. Ng, A. Yeung","doi":"10.1109/MMCS.1996.535029","DOIUrl":"https://doi.org/10.1109/MMCS.1996.535029","url":null,"abstract":"Previous studies on disk scheduling for video services are usually based on computer simulation. We present an analysis of disk scheduling for video services. The purpose of the analysis is to obtain the maximum number of simultaneous video streams which can be supported by a disk using CLOOK or LOOK algorithm. The analysis is then extended to study disk scheduling for special user functions such as 'forward search' and 'reverse search'. Analysis on a technique called REdundancy for Special User Functions (RESUF) is also performed and the results show that the technique can keep the I/O demands to almost constant under all user request conditions.","PeriodicalId":371043,"journal":{"name":"Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems","volume":"24 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":"117211576","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
扫码关注我们
求助内容：
应助结果提醒方式：