Pub Date : 1999-06-07DOI: 10.1109/MMCS.1999.778291
Combi Carlo, G. Foresti, Massimo Franceschet, A. Montanari
We propose an original indexing by shape of image databases based on extended grid files. We first introduce a recently developed shape description method and tailor it to obtain suitable representation structures for image databases. Then, in order to efficiently support image retrieval, we define an indexing structure based on grid files, since grid files were originally developed to speed up point (exact match) and range (nearest neighbors within a threshold) queries on multidimensional data with a fired number of attributes, we extend them to cope with data provided with a varying number of attributes and to deal with a new class of queries relevant to image databases, namely, nearest neighbor queries. We give a detailed description of the proposed search algorithms and a systematic analysis of their complexity, and discuss the outcomes of some experimental tests on sample image databases.
{"title":"Indexing by shape of image databases based on extended grid files","authors":"Combi Carlo, G. Foresti, Massimo Franceschet, A. Montanari","doi":"10.1109/MMCS.1999.778291","DOIUrl":"https://doi.org/10.1109/MMCS.1999.778291","url":null,"abstract":"We propose an original indexing by shape of image databases based on extended grid files. We first introduce a recently developed shape description method and tailor it to obtain suitable representation structures for image databases. Then, in order to efficiently support image retrieval, we define an indexing structure based on grid files, since grid files were originally developed to speed up point (exact match) and range (nearest neighbors within a threshold) queries on multidimensional data with a fired number of attributes, we extend them to cope with data provided with a varying number of attributes and to deal with a new class of queries relevant to image databases, namely, nearest neighbor queries. We give a detailed description of the proposed search algorithms and a systematic analysis of their complexity, and discuss the outcomes of some experimental tests on sample image databases.","PeriodicalId":408680,"journal":{"name":"Proceedings IEEE International Conference on Multimedia Computing and Systems","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123016225","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 : 1999-06-07DOI: 10.1109/MMCS.1999.779113
Brian Chen, G. Wornell
A variety of digital watermarking applications have emerged recently that require the design of systems for embedding one signal (the "embedded signal" or "watermark") within another signal (the "host signal"). We develop a framework for analyzing achievable performance trade-offs of these systems among robustness, distortion, and embedding rate. We also describe a recently introduced class of embedding methods, quantization index modulation (QIM), in which an ensemble of quantizers is constructed and information is embedded by quantizing the host signal with a quantizer associated with the watermark. We introduce an implementation of such a method called spread-transform dither modulation where the embedded information modulates the dither signal of a dithered quantizer, which quantizes projections of the host signal onto a spreading vector. We show that QIM systems have considerable performance advantages over previously proposed spread-spectrum and low-bit modulation systems.
{"title":"Achievable performance of digital watermarking systems","authors":"Brian Chen, G. Wornell","doi":"10.1109/MMCS.1999.779113","DOIUrl":"https://doi.org/10.1109/MMCS.1999.779113","url":null,"abstract":"A variety of digital watermarking applications have emerged recently that require the design of systems for embedding one signal (the \"embedded signal\" or \"watermark\") within another signal (the \"host signal\"). We develop a framework for analyzing achievable performance trade-offs of these systems among robustness, distortion, and embedding rate. We also describe a recently introduced class of embedding methods, quantization index modulation (QIM), in which an ensemble of quantizers is constructed and information is embedded by quantizing the host signal with a quantizer associated with the watermark. We introduce an implementation of such a method called spread-transform dither modulation where the embedded information modulates the dither signal of a dithered quantizer, which quantizes projections of the host signal onto a spreading vector. We show that QIM systems have considerable performance advantages over previously proposed spread-spectrum and low-bit modulation systems.","PeriodicalId":408680,"journal":{"name":"Proceedings IEEE International Conference on Multimedia Computing and Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114387303","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 : 1999-06-07DOI: 10.1109/MMCS.1999.778427
A. Roytman, I. Ben-Shaul, I. Cidon
The Distributed Video Service (DVS) system provides a comprehensive solution for the management and distribution of global video on demand. DVS presents a scalable architecture that combines the global accessibility of the Internet with an acceptable quality of service through an optional private high-speed backbone, and by distributing movies off-line to servers that are closer to potential viewers. To cope with dynamic changes in movie demand and server load, DVS employs adaptive algorithms for server selection and for movie distribution. DVS was implemented in Java, integrated with a front-end playing software, and supports IP and ATM as the public and private networks, respectively.
分布式视频服务(Distributed Video Service, DVS)系统为全球视频点播管理和分发提供了全面的解决方案。分布式交换机提供了一种可扩展的体系结构，通过可选的专用高速骨干网将互联网的全球可访问性与可接受的服务质量结合起来，并通过将电影分发到离潜在观众更近的服务器上。为了应对电影需求和服务器负载的动态变化，分布式交换机采用自适应算法进行服务器选择和电影分发。分布式交换机采用Java语言实现，集成前端播放软件，支持IP作为公网，支持ATM作为私网。
{"title":"DVS: a system for distribution and management of global video on demand services","authors":"A. Roytman, I. Ben-Shaul, I. Cidon","doi":"10.1109/MMCS.1999.778427","DOIUrl":"https://doi.org/10.1109/MMCS.1999.778427","url":null,"abstract":"The Distributed Video Service (DVS) system provides a comprehensive solution for the management and distribution of global video on demand. DVS presents a scalable architecture that combines the global accessibility of the Internet with an acceptable quality of service through an optional private high-speed backbone, and by distributing movies off-line to servers that are closer to potential viewers. To cope with dynamic changes in movie demand and server load, DVS employs adaptive algorithms for server selection and for movie distribution. DVS was implemented in Java, integrated with a front-end playing software, and supports IP and ATM as the public and private networks, respectively.","PeriodicalId":408680,"journal":{"name":"Proceedings IEEE International Conference on Multimedia Computing and Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129500676","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 : 1999-06-07DOI: 10.1109/MMCS.1999.778602
A. Pelagotti, G. Haan
Displaying broadcast video on a multimedia PC, implies the use of video format conversion (VFC) techniques, as computer displays and television receivers use quite distinct scanning rasters. VFC consists of spatial scaling, deinterlacing and picture rate conversion. Although scaling is rather straightforward, the other two tasks are far from trivial, and advanced motion compensated interpolation techniques are necessary to achieve a performance level that can compete with that of a standard TV. The paper discusses the options for picture rate conversion, and shows how even advanced motion compensated algorithms can run real time on a currently available programmable device.
{"title":"High quality video on multimedia PCs","authors":"A. Pelagotti, G. Haan","doi":"10.1109/MMCS.1999.778602","DOIUrl":"https://doi.org/10.1109/MMCS.1999.778602","url":null,"abstract":"Displaying broadcast video on a multimedia PC, implies the use of video format conversion (VFC) techniques, as computer displays and television receivers use quite distinct scanning rasters. VFC consists of spatial scaling, deinterlacing and picture rate conversion. Although scaling is rather straightforward, the other two tasks are far from trivial, and advanced motion compensated interpolation techniques are necessary to achieve a performance level that can compete with that of a standard TV. The paper discusses the options for picture rate conversion, and shows how even advanced motion compensated algorithms can run real time on a currently available programmable device.","PeriodicalId":408680,"journal":{"name":"Proceedings IEEE International Conference on Multimedia Computing and Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129784219","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 : 1999-06-07DOI: 10.1109/MMCS.1999.778446
Wei Zhao, M. Willebeek-LeMair, Prasoon Tiwari
The fast increasing network connectivities to a wider range of end-users and cheaper and diverse end-user devices further exacerbate the need for adaptive and scalable streaming solutions. Motivated by these streaming requirements, we introduce the notion of a layered multimedia presentation and outline a framework for the media scaling and streaming of such presentations across heterogeneous networks to different end-user devices. Layered multimedia is designed to handle heterogeneous and fluctuating resource conditions by trading-off the presentation quality. Based on the results of streaming buffer effects, an efficient on-demand media scaling technique is devised to deliver the highest quality presentation to the end-users, according to their specific network bandwidth and device constraints. Once a presentation is selected, an associated on-the-fly transmission scheduling and streaming technique is used for the streaming of multimedia with high efficiency. Efficient media scaling and streaming reduce startup and quality switch delays and facilitates scalable media server design under heavy loads.
{"title":"Efficient adaptive media scaling and streaming of layered multimedia in heterogeneous environment","authors":"Wei Zhao, M. Willebeek-LeMair, Prasoon Tiwari","doi":"10.1109/MMCS.1999.778446","DOIUrl":"https://doi.org/10.1109/MMCS.1999.778446","url":null,"abstract":"The fast increasing network connectivities to a wider range of end-users and cheaper and diverse end-user devices further exacerbate the need for adaptive and scalable streaming solutions. Motivated by these streaming requirements, we introduce the notion of a layered multimedia presentation and outline a framework for the media scaling and streaming of such presentations across heterogeneous networks to different end-user devices. Layered multimedia is designed to handle heterogeneous and fluctuating resource conditions by trading-off the presentation quality. Based on the results of streaming buffer effects, an efficient on-demand media scaling technique is devised to deliver the highest quality presentation to the end-users, according to their specific network bandwidth and device constraints. Once a presentation is selected, an associated on-the-fly transmission scheduling and streaming technique is used for the streaming of multimedia with high efficiency. Efficient media scaling and streaming reduce startup and quality switch delays and facilitates scalable media server design under heavy loads.","PeriodicalId":408680,"journal":{"name":"Proceedings IEEE International Conference on Multimedia Computing and Systems","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129278675","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 : 1999-06-07DOI: 10.1109/MMCS.1999.778553
C. Meghini, F. Sebastiani, U. Straccia
Multidimensional image retrieval (MIR) views an image as a multidimensional object, where each dimension is a channel for retrieval. MIR has the potential of putting at work together the many methods and techniques for image retrieval proposed in several different fields of computer science. We have developed a model of MIR, based on a fuzzy description logic, that identifies two main dimensions in an image (form and content) and views MIR as a special form of uncertain implication. In this paper we present ARIANNA, a system that implements the model. ARIANNA allows to quickly develop a prototype of a MIR application, and use it to test the adequacy of the application to the user's functional requirements.
{"title":"A system for the fast prototyping of multidimensional image retrieval","authors":"C. Meghini, F. Sebastiani, U. Straccia","doi":"10.1109/MMCS.1999.778553","DOIUrl":"https://doi.org/10.1109/MMCS.1999.778553","url":null,"abstract":"Multidimensional image retrieval (MIR) views an image as a multidimensional object, where each dimension is a channel for retrieval. MIR has the potential of putting at work together the many methods and techniques for image retrieval proposed in several different fields of computer science. We have developed a model of MIR, based on a fuzzy description logic, that identifies two main dimensions in an image (form and content) and views MIR as a special form of uncertain implication. In this paper we present ARIANNA, a system that implements the model. ARIANNA allows to quickly develop a prototype of a MIR application, and use it to test the adequacy of the application to the user's functional requirements.","PeriodicalId":408680,"journal":{"name":"Proceedings IEEE International Conference on Multimedia Computing and Systems","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124646274","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 : 1999-06-07DOI: 10.1109/MMCS.1999.779256
S. Santini, R. Jain
The paper presents the main features of the image database El Nino. The main characteristic of El Nino is its search model which, rejecting the idea of querying image databases, proposes an approach based on a mix of browsing and querying that we call exploration. The paper presents the interface and query models of El Nino, as well as some of the architectural issues deriving from our query model.
{"title":"The \"El Nino\" image database system","authors":"S. Santini, R. Jain","doi":"10.1109/MMCS.1999.779256","DOIUrl":"https://doi.org/10.1109/MMCS.1999.779256","url":null,"abstract":"The paper presents the main features of the image database El Nino. The main characteristic of El Nino is its search model which, rejecting the idea of querying image databases, proposes an approach based on a mix of browsing and querying that we call exploration. The paper presents the interface and query models of El Nino, as well as some of the architectural issues deriving from our query model.","PeriodicalId":408680,"journal":{"name":"Proceedings IEEE International Conference on Multimedia Computing and Systems","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124741019","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 : 1999-06-07DOI: 10.1109/MMCS.1999.778580
A. Lumini, D. Maio
Similarity selections of objects in a very large database can be executed by an incremental search on the basis of their distance from a given point. To cope with this problem, indexing support and retrieval strategies, that are able to ensure good performance for different kinds of queries, need to be developed. In this work we propose incremental and approximate retrieval approaches for searching points in a d-dimensional metric space. Four new retrieval algorithms coupled with dynamical disk-based spatial structures are discussed and some experimental results are presented. In particular, two strategies named Chessboard and City Block respectively, implement approximate incremental searches on a grid file data structure and the others, heap queue and virtual tree, apply to hierarchical data structures such us the R-tree.
{"title":"Approximate retrieval approaches for incremental similarity searches","authors":"A. Lumini, D. Maio","doi":"10.1109/MMCS.1999.778580","DOIUrl":"https://doi.org/10.1109/MMCS.1999.778580","url":null,"abstract":"Similarity selections of objects in a very large database can be executed by an incremental search on the basis of their distance from a given point. To cope with this problem, indexing support and retrieval strategies, that are able to ensure good performance for different kinds of queries, need to be developed. In this work we propose incremental and approximate retrieval approaches for searching points in a d-dimensional metric space. Four new retrieval algorithms coupled with dynamical disk-based spatial structures are discussed and some experimental results are presented. In particular, two strategies named Chessboard and City Block respectively, implement approximate incremental searches on a grid file data structure and the others, heap queue and virtual tree, apply to hierarchical data structures such us the R-tree.","PeriodicalId":408680,"journal":{"name":"Proceedings IEEE International Conference on Multimedia Computing and Systems","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130347827","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 : 1999-06-07DOI: 10.1109/MMCS.1999.778584
F. Garzotto, M. Matera, P. Paolini
To evaluate the usability of hypermedia applications, traditional HCl techniques need to be complemented with methods that specifically address the peculiar features of this class of systems. In this paper, we focus on the usability of hypermedia synchronisation, i.e., on all the features related to the (synchronised) execution of dynamic media and to their interplay with link behaviour. We discuss the concept of inspection-by-reuse and present the notion of evaluation pattern as a way to support it. Our approach provides operational guidelines to inspect hypermedia synchronization properties systematically and in a cost-effective way. It also supports the sharing of usability know-how and enables the standardization of the inspection process among multiple evaluators.
{"title":"Inspection by-reuse: evaluation patterns for hypermedia synchronization","authors":"F. Garzotto, M. Matera, P. Paolini","doi":"10.1109/MMCS.1999.778584","DOIUrl":"https://doi.org/10.1109/MMCS.1999.778584","url":null,"abstract":"To evaluate the usability of hypermedia applications, traditional HCl techniques need to be complemented with methods that specifically address the peculiar features of this class of systems. In this paper, we focus on the usability of hypermedia synchronisation, i.e., on all the features related to the (synchronised) execution of dynamic media and to their interplay with link behaviour. We discuss the concept of inspection-by-reuse and present the notion of evaluation pattern as a way to support it. Our approach provides operational guidelines to inspect hypermedia synchronization properties systematically and in a cost-effective way. It also supports the sharing of usability know-how and enables the standardization of the inspection process among multiple evaluators.","PeriodicalId":408680,"journal":{"name":"Proceedings IEEE International Conference on Multimedia Computing and Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130400173","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 : 1999-06-07DOI: 10.1109/MMCS.1999.779312
Yihong Gong
Many shot boundary detection methods have been proposed in recent years. Comparison studies have revealed that, among the existing methods, the local histogram-based method gives the highest precision rate if the highest shot boundary detection rate is not the first priority. In this paper, we present a new shot boundary detection method that surpasses the local histogram-based method in both the boundary detection rate and the precision rate. We propose a novel method of extracting color distributions from video frames to effectively suppress both the intra-frame and the inter-frame color variations caused by noise, minor illumination changes, as well as camera and object motions. We also provide a systematic approach to combine the color and the spatial features of video frames for more accurate shot boundary detection. An experimental evaluation confirms the superior performance of our proposed method.
{"title":"An accurate and robust method for detecting video shot boundaries","authors":"Yihong Gong","doi":"10.1109/MMCS.1999.779312","DOIUrl":"https://doi.org/10.1109/MMCS.1999.779312","url":null,"abstract":"Many shot boundary detection methods have been proposed in recent years. Comparison studies have revealed that, among the existing methods, the local histogram-based method gives the highest precision rate if the highest shot boundary detection rate is not the first priority. In this paper, we present a new shot boundary detection method that surpasses the local histogram-based method in both the boundary detection rate and the precision rate. We propose a novel method of extracting color distributions from video frames to effectively suppress both the intra-frame and the inter-frame color variations caused by noise, minor illumination changes, as well as camera and object motions. We also provide a systematic approach to combine the color and the spatial features of video frames for more accurate shot boundary detection. An experimental evaluation confirms the superior performance of our proposed method.","PeriodicalId":408680,"journal":{"name":"Proceedings IEEE International Conference on Multimedia Computing and Systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123338143","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
扫码关注我们
求助内容：
应助结果提醒方式：