Pub Date : 1996-08-14DOI: 10.1109/MMDBMS.1996.541866
H. Thimm, W. Klas, J. Walpole, C. Pu, Crispin Cowan
The paper describes recent progress in research on database system support for executing multimedia presentations. It proposes the general concept of reactive playout management to adjust multimedia presentations. This adjustment can be required due to performance fluctuations as in the absence of end-to-end quality of service guarantees, cost constraints specified by the user and other reasons. A concrete concept to realize performance-based reactive playout management in distributed multimedia database systems is proposed. This covers the identification of respective components in distributed database system architectures along with corresponding algorithms.
{"title":"Managing adaptive presentation executions in distributed multimedia database systems","authors":"H. Thimm, W. Klas, J. Walpole, C. Pu, Crispin Cowan","doi":"10.1109/MMDBMS.1996.541866","DOIUrl":"https://doi.org/10.1109/MMDBMS.1996.541866","url":null,"abstract":"The paper describes recent progress in research on database system support for executing multimedia presentations. It proposes the general concept of reactive playout management to adjust multimedia presentations. This adjustment can be required due to performance fluctuations as in the absence of end-to-end quality of service guarantees, cost constraints specified by the user and other reasons. A concrete concept to realize performance-based reactive playout management in distributed multimedia database systems is proposed. This covers the identification of respective components in distributed database system architectures along with corresponding algorithms.","PeriodicalId":170651,"journal":{"name":"Proceedings of International Workshop on Multimedia Database Management Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121406872","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-08-14DOI: 10.1109/MMDBMS.1996.541859
R. Pajarola, P. Widmayer
The maintenance of large raster images under spatial operations is still a major performance bottleneck. For reasons of storage space, images in a collection such as satellite pictures in geographic information systems, are maintained in compressed form. Instead of performing a spatially selective operation on an image by first decompressing the compressed version, we propose to perform queries directly on the compressed version of the image. We suggest a compression technique that allows for the subsequent use of a data structure to guide a spatial search. In response to a range query, our algorithm delivers a compressed partial image. Experiments show that the new algorithm supports spatial queries on satellite images efficiently. In addition it is even competitive in terms of the compression that it achieves.
{"title":"Spatial indexing into compressed raster images: how to answer range queries without decompression","authors":"R. Pajarola, P. Widmayer","doi":"10.1109/MMDBMS.1996.541859","DOIUrl":"https://doi.org/10.1109/MMDBMS.1996.541859","url":null,"abstract":"The maintenance of large raster images under spatial operations is still a major performance bottleneck. For reasons of storage space, images in a collection such as satellite pictures in geographic information systems, are maintained in compressed form. Instead of performing a spatially selective operation on an image by first decompressing the compressed version, we propose to perform queries directly on the compressed version of the image. We suggest a compression technique that allows for the subsequent use of a data structure to guide a spatial search. In response to a range query, our algorithm delivers a compressed partial image. Experiments show that the new algorithm supports spatial queries on satellite images efficiently. In addition it is even competitive in terms of the compression that it achieves.","PeriodicalId":170651,"journal":{"name":"Proceedings of International Workshop on Multimedia Database Management Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124457270","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-08-14DOI: 10.1109/MMDBMS.1996.541852
Zhi-Jie Zheng, C. Leung
Four models of image data representations are examined for automatic indexing from pixel, nearest neighbourhood, block to full image. For each their invariant properties (translation, reflection and connection) and complexities are assessed. The nearest neighbourhood approach is found to be the best under these criteria. Using the nearest neighbourhood approach, a new automatic feature extraction and indexing algorithm for images on rectangular grid is presented. The algorithm enumerates the number of entire feature points in the ten clusters to form ten integers, which correspond to specific strengths of the ten feature clusters in the image. A probability model is then used to generate a quantitative feature index for supporting the rapid retrieval of images based on their contents. Some sample images and their indexes are also illustrated.
{"title":"Automatic image indexing for rapid content-based retrieval","authors":"Zhi-Jie Zheng, C. Leung","doi":"10.1109/MMDBMS.1996.541852","DOIUrl":"https://doi.org/10.1109/MMDBMS.1996.541852","url":null,"abstract":"Four models of image data representations are examined for automatic indexing from pixel, nearest neighbourhood, block to full image. For each their invariant properties (translation, reflection and connection) and complexities are assessed. The nearest neighbourhood approach is found to be the best under these criteria. Using the nearest neighbourhood approach, a new automatic feature extraction and indexing algorithm for images on rectangular grid is presented. The algorithm enumerates the number of entire feature points in the ten clusters to form ten integers, which correspond to specific strengths of the ten feature clusters in the image. A probability model is then used to generate a quantitative feature index for supporting the rapid retrieval of images based on their contents. Some sample images and their indexes are also illustrated.","PeriodicalId":170651,"journal":{"name":"Proceedings of International Workshop on Multimedia Database Management Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115796358","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-08-14DOI: 10.1109/MMDBMS.1996.541854
I. Kamel, Daniel Barbará
This paper deals with a new emerging multimedia data, namely, electronic ink. As pen-based computers and personal digital assistants (PDAs) become more popular, searching electronic ink becomes an important issue. We treat the ink object as a one dimensional image which is described by a set of features. This is different from the traditional methods that use handwritten recognition techniques to convert it into ASCII. The search retrieves a set of ink objects that most resembles the query object. We describe a multi-stages filter for searching large repository of electronic ink. The first stage is an R-tree based index used to prune the search space. The output of the first stage is a set of words that have some common features with the query. A sequential search algorithm is then used to extract the most similar word to the query string. Our schema is 12 time faster than the sequential and improves the retrieval rate by up to 50%.
{"title":"Retrieving electronic ink by content","authors":"I. Kamel, Daniel Barbará","doi":"10.1109/MMDBMS.1996.541854","DOIUrl":"https://doi.org/10.1109/MMDBMS.1996.541854","url":null,"abstract":"This paper deals with a new emerging multimedia data, namely, electronic ink. As pen-based computers and personal digital assistants (PDAs) become more popular, searching electronic ink becomes an important issue. We treat the ink object as a one dimensional image which is described by a set of features. This is different from the traditional methods that use handwritten recognition techniques to convert it into ASCII. The search retrieves a set of ink objects that most resembles the query object. We describe a multi-stages filter for searching large repository of electronic ink. The first stage is an R-tree based index used to prune the search space. The output of the first stage is a set of words that have some common features with the query. A sequential search algorithm is then used to extract the most similar word to the query string. Our schema is 12 time faster than the sequential and improves the retrieval rate by up to 50%.","PeriodicalId":170651,"journal":{"name":"Proceedings of International Workshop on Multimedia Database Management Systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132906646","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-08-14DOI: 10.1109/MMDBMS.1996.541849
Y. Won, J. Srivastava
We investigate the relationship between the blocking probability and the configuration of storage hierarchy in a VOD server. Due to limited system resources available in a VOD server, some user requests can not be serviced immediately and are thus blocked. In general, one would expect the increasing the I/O rate will reduce the request blockage. However, we report the interesting observation that increasing the data rate from the secondary storage may increase the blocking probability, and hence degrade the server performance. We provide an analytical model of the blocking probability, which is to be used to find the optimal data rate to minimize the blocking probability for a given system configuration. By enforcing the files to reside at the staging disk for a certain amount of time, it is possible to further improve the blocking probability. We examine the problem of space management for video files on the staging disks, and devise a policy called enforced duration to arbitrate the duration of the file on the staging disk. Results of a simulation based performance evaluation are presented.
{"title":"Minimizing blocking probability in a hierarchical storage based VOD server","authors":"Y. Won, J. Srivastava","doi":"10.1109/MMDBMS.1996.541849","DOIUrl":"https://doi.org/10.1109/MMDBMS.1996.541849","url":null,"abstract":"We investigate the relationship between the blocking probability and the configuration of storage hierarchy in a VOD server. Due to limited system resources available in a VOD server, some user requests can not be serviced immediately and are thus blocked. In general, one would expect the increasing the I/O rate will reduce the request blockage. However, we report the interesting observation that increasing the data rate from the secondary storage may increase the blocking probability, and hence degrade the server performance. We provide an analytical model of the blocking probability, which is to be used to find the optimal data rate to minimize the blocking probability for a given system configuration. By enforcing the files to reside at the staging disk for a certain amount of time, it is possible to further improve the blocking probability. We examine the problem of space management for video files on the staging disks, and devise a policy called enforced duration to arbitrate the duration of the file on the staging disk. Results of a simulation based performance evaluation are presented.","PeriodicalId":170651,"journal":{"name":"Proceedings of International Workshop on Multimedia Database Management Systems","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124340149","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-08-14DOI: 10.1109/MMDBMS.1996.541857
K. Walczak
Increasing capabilities of computer systems enable development of new, better ways of data visualization and interaction between users and computers. One of the most powerful mechanisms of data visualization and interaction is virtual reality. In this paper the use of virtual reality as a platform for multimedia presentations is proposed. A technique which enables common storage and retrieval of virtual reality and multimedia data in databases is presented. An appropriate modeling method for virtual reality data in databases and dynamic synthesis of their presentations is discussed. A geographic information system is described as an example.
{"title":"Integration of virtual reality and multimedia data in databases","authors":"K. Walczak","doi":"10.1109/MMDBMS.1996.541857","DOIUrl":"https://doi.org/10.1109/MMDBMS.1996.541857","url":null,"abstract":"Increasing capabilities of computer systems enable development of new, better ways of data visualization and interaction between users and computers. One of the most powerful mechanisms of data visualization and interaction is virtual reality. In this paper the use of virtual reality as a platform for multimedia presentations is proposed. A technique which enables common storage and retrieval of virtual reality and multimedia data in databases is presented. An appropriate modeling method for virtual reality data in databases and dynamic synthesis of their presentations is discussed. A geographic information system is described as an example.","PeriodicalId":170651,"journal":{"name":"Proceedings of International Workshop on Multimedia Database Management Systems","volume":"389 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115853333","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-08-14DOI: 10.1109/MMDBMS.1996.541851
Veli Hakkoymaz, G. Özsoyoglu
We introduce a constraint-driven methodology for the automated assembly, organization and playout of presentations from multimedia databases. We use inclusion and exclusion constraints for extracting a semantically coherent set of multimedia segments. Presentation organization constraints are utilized for organizing the multimedia segments into a presentation, which in turn helps decide the playout order of the extracted multimedia segments. The playout order of the segments is represented in a presentation graph. If the specified set of organization constraints are not sufficient to construct a unique presentation graph, we propose two techniques so that a unique graph is constructible. We also propose playout algorithms, one for the generation, start and termination of playout agents, the other to provide dynamic controls for playout management of organized presentations. The characteristics of these algorithms are expressed in terms of presentation playout parameters.
{"title":"Automating the organization of presentations for playout management in multimedia databases","authors":"Veli Hakkoymaz, G. Özsoyoglu","doi":"10.1109/MMDBMS.1996.541851","DOIUrl":"https://doi.org/10.1109/MMDBMS.1996.541851","url":null,"abstract":"We introduce a constraint-driven methodology for the automated assembly, organization and playout of presentations from multimedia databases. We use inclusion and exclusion constraints for extracting a semantically coherent set of multimedia segments. Presentation organization constraints are utilized for organizing the multimedia segments into a presentation, which in turn helps decide the playout order of the extracted multimedia segments. The playout order of the segments is represented in a presentation graph. If the specified set of organization constraints are not sufficient to construct a unique presentation graph, we propose two techniques so that a unique graph is constructible. We also propose playout algorithms, one for the generation, start and termination of playout agents, the other to provide dynamic controls for playout management of organized presentations. The characteristics of these algorithms are expressed in terms of presentation playout parameters.","PeriodicalId":170651,"journal":{"name":"Proceedings of International Workshop on Multimedia Database Management Systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114164801","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-08-14DOI: 10.1109/MMDBMS.1996.541848
E. Chang, H. Garcia-Molina
A multimedia server delivers presentations (e.g., videos, movies, games), providing high bandwidth and continuous real-time delivery. We present techniques for reducing the initial latency of presentations, i.e., for reducing the time between the arrival of a request and the start of the presentation. Traditionally, initial latency has not received much attention. This is because one major application of multimedia servers is "movies on demand" where a delay of a few minutes before a new multi-hour movie starts is acceptable. However, latency reduction is important in interactive applications such as video games and browsing of multimedia documents. Various latency reduction schemes are proposed and analyzed, and their performance compared. We show that our techniques can significantly reduce (almost eliminate in some cases) initial latency without adversely affecting throughput. Moreover, a novel on-disk partial data replication scheme that we propose proves to be far more cost effective than any other previous attempts at reducing initial latency.
{"title":"Reducing initial latency in a multimedia storage system","authors":"E. Chang, H. Garcia-Molina","doi":"10.1109/MMDBMS.1996.541848","DOIUrl":"https://doi.org/10.1109/MMDBMS.1996.541848","url":null,"abstract":"A multimedia server delivers presentations (e.g., videos, movies, games), providing high bandwidth and continuous real-time delivery. We present techniques for reducing the initial latency of presentations, i.e., for reducing the time between the arrival of a request and the start of the presentation. Traditionally, initial latency has not received much attention. This is because one major application of multimedia servers is \"movies on demand\" where a delay of a few minutes before a new multi-hour movie starts is acceptable. However, latency reduction is important in interactive applications such as video games and browsing of multimedia documents. Various latency reduction schemes are proposed and analyzed, and their performance compared. We show that our techniques can significantly reduce (almost eliminate in some cases) initial latency without adversely affecting throughput. Moreover, a novel on-disk partial data replication scheme that we propose proves to be far more cost effective than any other previous attempts at reducing initial latency.","PeriodicalId":170651,"journal":{"name":"Proceedings of International Workshop on Multimedia Database Management Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129516931","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-08-14DOI: 10.1109/MMDBMS.1996.541858
Edward Remias, Gholamhosein Sheikholeslami, A. Zhang
We investigate approaches to support effective and efficient retrieval of image data based on content. We first introduce an effective block-oriented image decomposition structure which can be used to represent image content in image database systems. We then discuss the application of this image data model to content-based image retrieval. Using wavelet transforms to extract image features, significant content features can be extracted from image data through decorrelating the data in their pixel format into the frequency domain. Feature vectors of images can then be constructed. Content-based image retrieval is performed by comparing the feature vectors of the query image and the decomposed segments in database images. Our experimental analysis illustrates that the proposed block-oriented image representation offers a novel decomposition structure to be used to facilitate effective and efficient image retrieval.
{"title":"Block-oriented image decomposition and retrieval in image database systems","authors":"Edward Remias, Gholamhosein Sheikholeslami, A. Zhang","doi":"10.1109/MMDBMS.1996.541858","DOIUrl":"https://doi.org/10.1109/MMDBMS.1996.541858","url":null,"abstract":"We investigate approaches to support effective and efficient retrieval of image data based on content. We first introduce an effective block-oriented image decomposition structure which can be used to represent image content in image database systems. We then discuss the application of this image data model to content-based image retrieval. Using wavelet transforms to extract image features, significant content features can be extracted from image data through decorrelating the data in their pixel format into the frequency domain. Feature vectors of images can then be constructed. Content-based image retrieval is performed by comparing the feature vectors of the query image and the decomposed segments in database images. Our experimental analysis illustrates that the proposed block-oriented image representation offers a novel decomposition structure to be used to facilitate effective and efficient image retrieval.","PeriodicalId":170651,"journal":{"name":"Proceedings of International Workshop on Multimedia Database Management Systems","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124162256","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-08-14DOI: 10.1109/MMDBMS.1996.541865
T. Prückler, M. Schrefl
As a large amount of hypermedia data is collected the question of storing these data in hypermedia databases arises. One of the problems encountered is how to separate applications from the data so that the same data can be used by many applications and changes to data organization have-besides execution-time-no effect on applications. In conventional databases this problem is solved by the concept of physical data independence. We argue that the concept of physical data independence can be applied beneficially to hypermedia databases, too. So far, while the demand for physical data independence has been voiced in a number of papers, only partial solutions have been proposed. We describe the part of a hypermedia database management system which deals with physical data independence and show how an existing database management system can be extended in this direction. In particular; we present a DataBlade for Ilustra, extending Illustra with physical data independence for images.
{"title":"Achieving physical data independence in hypermedia databases","authors":"T. Prückler, M. Schrefl","doi":"10.1109/MMDBMS.1996.541865","DOIUrl":"https://doi.org/10.1109/MMDBMS.1996.541865","url":null,"abstract":"As a large amount of hypermedia data is collected the question of storing these data in hypermedia databases arises. One of the problems encountered is how to separate applications from the data so that the same data can be used by many applications and changes to data organization have-besides execution-time-no effect on applications. In conventional databases this problem is solved by the concept of physical data independence. We argue that the concept of physical data independence can be applied beneficially to hypermedia databases, too. So far, while the demand for physical data independence has been voiced in a number of papers, only partial solutions have been proposed. We describe the part of a hypermedia database management system which deals with physical data independence and show how an existing database management system can be extended in this direction. In particular; we present a DataBlade for Ilustra, extending Illustra with physical data independence for images.","PeriodicalId":170651,"journal":{"name":"Proceedings of International Workshop on Multimedia Database Management Systems","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132345841","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
扫码关注我们
求助内容：
应助结果提醒方式：