The hypermedia document is also a kind of structured document. However more factors should be considered in handling hypermedia documents because they contain multimedia data and also have multiple complex structures such as hyperlink networks and spatial/temporal layout structures as well as logical structures. We propose an object-oriented model for multi-structured hypermedia documents and multimedia data, and a query language for retrieving hypermedia document elements based on the content and multiple complex structures. By using an indexing scheme which exploits multiple structures, we can process queries efficiently with minimal storage overhead.
{"title":"Object-oriented modeling, querying, and indexing for multi-structured hypermedia document database","authors":"Kyuchul Lee, Yong Kyu Lee, Seong-Joon Yoo, Kyoungro Yoon, P. Berra","doi":"10.1109/MMDBMS.1996.541864","DOIUrl":"https://doi.org/10.1109/MMDBMS.1996.541864","url":null,"abstract":"The hypermedia document is also a kind of structured document. However more factors should be considered in handling hypermedia documents because they contain multimedia data and also have multiple complex structures such as hyperlink networks and spatial/temporal layout structures as well as logical structures. We propose an object-oriented model for multi-structured hypermedia documents and multimedia data, and a query language for retrieving hypermedia document elements based on the content and multiple complex structures. By using an indexing scheme which exploits multiple structures, we can process queries efficiently with minimal storage overhead.","PeriodicalId":170651,"journal":{"name":"Proceedings of International Workshop on Multimedia Database Management Systems","volume":"1 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":"129488981","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.541853
Ta-Chun Chou, Arbee L. P. Chen, Chih-Chin Liu
A music database with search-by-content ability is studied. Chords are used to represent music. The input fault tolerance ability is equipped with the chord-representation model. The PAT-tree is proposed as the index structure. The "unstructured search" is an important characteristic of PAT-tree. We have implemented a music database system based on the chord-representation model and the PAT-tree index structure.
{"title":"Music databases: indexing techniques and implementation","authors":"Ta-Chun Chou, Arbee L. P. Chen, Chih-Chin Liu","doi":"10.1109/MMDBMS.1996.541853","DOIUrl":"https://doi.org/10.1109/MMDBMS.1996.541853","url":null,"abstract":"A music database with search-by-content ability is studied. Chords are used to represent music. The input fault tolerance ability is equipped with the chord-representation model. The PAT-tree is proposed as the index structure. The \"unstructured search\" is an important characteristic of PAT-tree. We have implemented a music database system based on the chord-representation model and the PAT-tree index structure.","PeriodicalId":170651,"journal":{"name":"Proceedings of International Workshop on Multimedia Database Management Systems","volume":"24 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":"126368389","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.541856
Paul N Pazandak, J. Srivastava
This report describes metrics to be used to determine the suitability of object database management systems to support multimedia data storage and use. Support at all levels of hardware and software are discussed, as even the most ideal database software cannot operate independent of operating systems, networks, and hardware. Most commercially available ODBMS today provide basic multimedia support, but significant component changes will be required to support the next-generation of multimedia applications.
{"title":"Metrics for evaluating ODBMSs functionality to support MMDBMS","authors":"Paul N Pazandak, J. Srivastava","doi":"10.1109/MMDBMS.1996.541856","DOIUrl":"https://doi.org/10.1109/MMDBMS.1996.541856","url":null,"abstract":"This report describes metrics to be used to determine the suitability of object database management systems to support multimedia data storage and use. Support at all levels of hardware and software are discussed, as even the most ideal database software cannot operate independent of operating systems, networks, and hardware. Most commercially available ODBMS today provide basic multimedia support, but significant component changes will be required to support the next-generation of multimedia applications.","PeriodicalId":170651,"journal":{"name":"Proceedings of International Workshop on Multimedia Database Management Systems","volume":"2 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133322372","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.541860
Tony C. T. Kuo, Yi Lin, Arbee L. P. Chen, S. Chen, C. Ni
Video segmentation is an elementary operation for video index construction. A video sequence is usually decomposed into several basic meaningful segments. We propose a new approach to detect shot changes for video segmentation, which is based on the processing of MPEG compressed video data. This approach takes advantage of the information implied in the compressed data. The reference ratios among video frames are analyzed to determine their similarities. A shot change is detected if the similarity degrees of a frame and its adjacent frames are low. A function is used to quantize the results into the shot change probabilities. Considering the motion variations of video contents between frames, a conversion function is designed to increase the correctness of the shot change detection. The experimental results show the performance of our approach.
{"title":"Efficient shot change detection on compressed video data","authors":"Tony C. T. Kuo, Yi Lin, Arbee L. P. Chen, S. Chen, C. Ni","doi":"10.1109/MMDBMS.1996.541860","DOIUrl":"https://doi.org/10.1109/MMDBMS.1996.541860","url":null,"abstract":"Video segmentation is an elementary operation for video index construction. A video sequence is usually decomposed into several basic meaningful segments. We propose a new approach to detect shot changes for video segmentation, which is based on the processing of MPEG compressed video data. This approach takes advantage of the information implied in the compressed data. The reference ratios among video frames are analyzed to determine their similarities. A shot change is detected if the similarity degrees of a frame and its adjacent frames are low. A function is used to quantize the results into the shot change probabilities. Considering the motion variations of video contents between frames, a conversion function is designed to increase the correctness of the shot change detection. The experimental results show the performance of our approach.","PeriodicalId":170651,"journal":{"name":"Proceedings of International Workshop on Multimedia Database Management Systems","volume":"67 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":"132615003","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.541850
Martha Escobar-Molano, Shahram Ghandeharizadeh
A structured presentation consists of a collection of objects (3-D representations) with spatial and temporal constraints along with rendering features such as shading and the audiences' viewpoint. A challenging task is to schedule the retrieval of objects from disk to display a presentation in real-time. The study introduces a taxonomy of such scheduling techniques and three techniques to support the display of structured presentations assuming a multi-disk architecture. These heuristics are evaluated using a simulation study to quantify their trade-offs. The results are compared with a theoretical minimum, demonstrating that one of the proposed techniques provides a performance almost identical to this minimum.
{"title":"Resource scheduling for coordinated display of structured presentations using a multi-disk architecture","authors":"Martha Escobar-Molano, Shahram Ghandeharizadeh","doi":"10.1109/MMDBMS.1996.541850","DOIUrl":"https://doi.org/10.1109/MMDBMS.1996.541850","url":null,"abstract":"A structured presentation consists of a collection of objects (3-D representations) with spatial and temporal constraints along with rendering features such as shading and the audiences' viewpoint. A challenging task is to schedule the retrieval of objects from disk to display a presentation in real-time. The study introduces a taxonomy of such scheduling techniques and three techniques to support the display of structured presentations assuming a multi-disk architecture. These heuristics are evaluated using a simulation study to quantify their trade-offs. The results are compared with a theoretical minimum, demonstrating that one of the proposed techniques provides a performance almost identical to this minimum.","PeriodicalId":170651,"journal":{"name":"Proceedings of International Workshop on Multimedia Database Management Systems","volume":"3 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":"128702763","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.541863
John Z. Li, M. Tamer Özsu, D. Szafron
A key aspect in video modeling is spatial relationships. We propose a spatial representation for specifying the spatial semantics of video data. Based on such a representation, a set of spatial relationships for salient objects is defined to support qualitative and quantitative spatial properties. The model captures both topological and directional spatial relationships. We present a novel way of incorporating this model into a video model, and integrating the abstract video model into an object database management system which has rich multimedia temporal operations. The integrated model is further enhanced by a spatial inference engine. The powerful expressiveness of our video model is validated by some query examples.
{"title":"Modeling of video spatial relationships in an object database management system","authors":"John Z. Li, M. Tamer Özsu, D. Szafron","doi":"10.1109/MMDBMS.1996.541863","DOIUrl":"https://doi.org/10.1109/MMDBMS.1996.541863","url":null,"abstract":"A key aspect in video modeling is spatial relationships. We propose a spatial representation for specifying the spatial semantics of video data. Based on such a representation, a set of spatial relationships for salient objects is defined to support qualitative and quantitative spatial properties. The model captures both topological and directional spatial relationships. We present a novel way of incorporating this model into a video model, and integrating the abstract video model into an object database management system which has rich multimedia temporal operations. The integrated model is further enhanced by a spatial inference engine. The powerful expressiveness of our video model is validated by some query examples.","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":"124611986","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.541868
Ya Xu, D. Adjeroh, C. Orji
We present a fault avoidance and recovery algorithm designed for distributed multimedia multicast. Our algorithm is focused on fault avoidance to provide heterogeneous quality of service (QoS) guarantees to applications. We adopt a receiver-oriented approach to fault avoidance and recovery to achieve scalability. The receiver-oriented approach also addresses the heterogeneity of distributed multicast. The QoS of an application is used as an important parameter for fault detection. Both the fault avoidance and fault recovery aspects of the algorithm are based on the estimate of the QoS parameter. To suppress the overhead of multicast, a two-phase commit protocol is used in the algorithm. The key contribution of the algorithm lies in combining proactive and reactive control: (1) to avoid congestion in the network prior to the occurrence of error; (2) to provide heterogeneous QoS to applications by QoS-based fault detection and control; (3) to achieve scalability of distributed multimedia multicasts by receiver-oriented fault control and message suppression. Our algorithm makes very few assumptions about the underlying network, hence it can be easily integrated with popular multicast protocols.
{"title":"Fault avoidance and recovery for distributed multimedia multicast","authors":"Ya Xu, D. Adjeroh, C. Orji","doi":"10.1109/MMDBMS.1996.541868","DOIUrl":"https://doi.org/10.1109/MMDBMS.1996.541868","url":null,"abstract":"We present a fault avoidance and recovery algorithm designed for distributed multimedia multicast. Our algorithm is focused on fault avoidance to provide heterogeneous quality of service (QoS) guarantees to applications. We adopt a receiver-oriented approach to fault avoidance and recovery to achieve scalability. The receiver-oriented approach also addresses the heterogeneity of distributed multicast. The QoS of an application is used as an important parameter for fault detection. Both the fault avoidance and fault recovery aspects of the algorithm are based on the estimate of the QoS parameter. To suppress the overhead of multicast, a two-phase commit protocol is used in the algorithm. The key contribution of the algorithm lies in combining proactive and reactive control: (1) to avoid congestion in the network prior to the occurrence of error; (2) to provide heterogeneous QoS to applications by QoS-based fault detection and control; (3) to achieve scalability of distributed multimedia multicasts by receiver-oriented fault control and message suppression. Our algorithm makes very few assumptions about the underlying network, hence it can be easily integrated with popular multicast protocols.","PeriodicalId":170651,"journal":{"name":"Proceedings of International Workshop on Multimedia Database Management Systems","volume":"09 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":"127196022","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.541862
D. Adjeroh, Moon-Chuen Lee, C. Orji
One basic technique often used to reduce the huge computation involved in video partitioning is by selective processing of a subpart of the video frames. However, the choice of this proportion has so far been made randomly, without any formal basis. An ad hoc selection of this subpart cannot always guarantee a reduction in computation while ensuring effective partitioning. The paper argues for a principled basis for the selection of such parameters to ensure effective and efficient partitioning of video sequences. It presents a formal method for determining the optimal window size and the minimum thresholds which ensure that decisions on scene similarity are made on a reliable, effective and principled basis. To account for illumination variations and possible motion in the video, the use of neighbourhood-based colour ratio features is proposed, which avoids the huge computational requirements of explicit motion compensation operations.
{"title":"A principled approach to fast partitioning of uncompressed video","authors":"D. Adjeroh, Moon-Chuen Lee, C. Orji","doi":"10.1109/MMDBMS.1996.541862","DOIUrl":"https://doi.org/10.1109/MMDBMS.1996.541862","url":null,"abstract":"One basic technique often used to reduce the huge computation involved in video partitioning is by selective processing of a subpart of the video frames. However, the choice of this proportion has so far been made randomly, without any formal basis. An ad hoc selection of this subpart cannot always guarantee a reduction in computation while ensuring effective partitioning. The paper argues for a principled basis for the selection of such parameters to ensure effective and efficient partitioning of video sequences. It presents a formal method for determining the optimal window size and the minimum thresholds which ensure that decisions on scene similarity are made on a reliable, effective and principled basis. To account for illumination variations and possible motion in the video, the use of neighbourhood-based colour ratio features is proposed, which avoids the huge computational requirements of explicit motion compensation operations.","PeriodicalId":170651,"journal":{"name":"Proceedings of International Workshop on Multimedia Database Management Systems","volume":"1 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":"131223813","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.541867
Sreenivas Gollapudi, A. Zhang
Advances in multimedia computing technologies offer new approaches to support on-line accesses to information from a variety of sources such as video clips, audio, images, and books. A client-server distributed multimedia system would be a practical approach to support such functionalities. We present the design and implementation of a client-server distributed multimedia database environment that can be used to support large digital libraries. System architecture and design are described. Server functionalities, including client scheduling, data buffering and admission control, are investigated. A client request can only be admitted if both the quality-of-service (QoS) requirements from the client and the upper bound on total buffer consumption at the server are maintained.
{"title":"NetMedia: a client-server distributed multimedia environment","authors":"Sreenivas Gollapudi, A. Zhang","doi":"10.1109/MMDBMS.1996.541867","DOIUrl":"https://doi.org/10.1109/MMDBMS.1996.541867","url":null,"abstract":"Advances in multimedia computing technologies offer new approaches to support on-line accesses to information from a variety of sources such as video clips, audio, images, and books. A client-server distributed multimedia system would be a practical approach to support such functionalities. We present the design and implementation of a client-server distributed multimedia database environment that can be used to support large digital libraries. System architecture and design are described. Server functionalities, including client scheduling, data buffering and admission control, are investigated. A client request can only be admitted if both the quality-of-service (QoS) requirements from the client and the upper bound on total buffer consumption at the server are maintained.","PeriodicalId":170651,"journal":{"name":"Proceedings of International Workshop on Multimedia Database Management Systems","volume":"172 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":"128808143","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.541861
M. Livny, Viresh Ratnakar
We propose the QCLICS algorithm for quality-controlled JPEG compression of image sets. Lossy compression of images results in a tradeoff between compression and quality: the greater the compression, the poorer the resulting image quality. Quality-controlled compression has two goals: meeting any desired compression/quality specification accurately and optimizing the compression-quality tradeoff. When a large set of images is to be compressed into a limited amount of disk space, it is desirable to optimize the compression-quality tradeoff for individual images as well as across images. This is an important issue in multimedia CD-ROM production, where hundreds or thousands of digital images need to be compressed to fit in the available space. The QCLICS algorithm uses the RD-OPT algorithm (Ratnakar and Livny, 1995) for optimizing JPEG quantization tables for individual images, and uses a dynamic programming strategy to apportion the target compression/quality to the individual images. The complexity overhead of optimizing across the images is minimal, while significant gains in compression/quality are obtained. QCLICS offer flexibility in choosing the image quality metric and allows various constraints to be placed on compression/quality for individual images. We present performance results for several sets of images. These images were taken from various scientific sources at the University of Wisconsin-Madison, such as microscopy images of cells, crystals, brains, and spacecraft images of Venus.
我们提出了QCLICS算法用于图像集的质量控制JPEG压缩。有损图像压缩导致压缩和质量之间的权衡:压缩越大，生成的图像质量越差。质量控制压缩有两个目标:准确地满足任何期望的压缩/质量规范，并优化压缩质量权衡。当要将大量映像压缩到数量有限的磁盘空间中时，需要优化单个映像以及跨映像的压缩质量权衡。这是多媒体CD-ROM制作中的一个重要问题，因为需要压缩成百上千的数字图像以适应可用空间。QCLICS算法使用RD-OPT算法(Ratnakar and Livny, 1995)优化单个图像的JPEG量化表，并使用动态规划策略将目标压缩/质量分配给单个图像。跨图像优化的复杂性开销是最小的，而在压缩/质量方面获得了显著的收益。QCLICS在选择图像质量度量方面提供了灵活性，并允许对单个图像的压缩/质量施加各种限制。我们给出了几组图像的性能结果。这些图像来自威斯康星大学麦迪逊分校的各种科学来源，如细胞、晶体、大脑的显微镜图像和金星的航天器图像。
{"title":"Quality-controlled compression of sets of images","authors":"M. Livny, Viresh Ratnakar","doi":"10.1109/MMDBMS.1996.541861","DOIUrl":"https://doi.org/10.1109/MMDBMS.1996.541861","url":null,"abstract":"We propose the QCLICS algorithm for quality-controlled JPEG compression of image sets. Lossy compression of images results in a tradeoff between compression and quality: the greater the compression, the poorer the resulting image quality. Quality-controlled compression has two goals: meeting any desired compression/quality specification accurately and optimizing the compression-quality tradeoff. When a large set of images is to be compressed into a limited amount of disk space, it is desirable to optimize the compression-quality tradeoff for individual images as well as across images. This is an important issue in multimedia CD-ROM production, where hundreds or thousands of digital images need to be compressed to fit in the available space. The QCLICS algorithm uses the RD-OPT algorithm (Ratnakar and Livny, 1995) for optimizing JPEG quantization tables for individual images, and uses a dynamic programming strategy to apportion the target compression/quality to the individual images. The complexity overhead of optimizing across the images is minimal, while significant gains in compression/quality are obtained. QCLICS offer flexibility in choosing the image quality metric and allows various constraints to be placed on compression/quality for individual images. We present performance results for several sets of images. These images were taken from various scientific sources at the University of Wisconsin-Madison, such as microscopy images of cells, crystals, brains, and spacecraft images of Venus.","PeriodicalId":170651,"journal":{"name":"Proceedings of International Workshop on Multimedia Database Management Systems","volume":"1 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":"129594932","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
扫码关注我们
求助内容：
应助结果提醒方式：