Pub Date : 1999-06-07DOI: 10.1109/MMCS.1999.778546
E. Ichihara, H. Takao, Y. Ohta
AHS (Automated Highway System) will increase the traffic potential of highways because it enables drivers to shorten the distance between cars. On the other hand, AHS may make the drivers uncomfortable because it presents them with a reduced field of vision of the car ahead and may induce anxiety over the reliability of the control system. In order to improve the comfort of drivers under the control of AHS it is necessary to recover the driver's field of vision. We propose the NaviView system for this purpose. In AHS, the entire traffic load on the highway is visually monitored by many roadside video cameras. NaviView utilizes these video images for the recovery of the driver's visual field. It enables the driver to observe the behavior of other cars by means of a virtual view from a point just above his car. The virtual view presented to the driver is generated by combining the video images of the fixed roadside cameras. The proposed algorithm was tested by using a miniature highway model and a real road scene.
{"title":"NaviView: bird's-eye view for highway drivers using roadside cameras","authors":"E. Ichihara, H. Takao, Y. Ohta","doi":"10.1109/MMCS.1999.778546","DOIUrl":"https://doi.org/10.1109/MMCS.1999.778546","url":null,"abstract":"AHS (Automated Highway System) will increase the traffic potential of highways because it enables drivers to shorten the distance between cars. On the other hand, AHS may make the drivers uncomfortable because it presents them with a reduced field of vision of the car ahead and may induce anxiety over the reliability of the control system. In order to improve the comfort of drivers under the control of AHS it is necessary to recover the driver's field of vision. We propose the NaviView system for this purpose. In AHS, the entire traffic load on the highway is visually monitored by many roadside video cameras. NaviView utilizes these video images for the recovery of the driver's visual field. It enables the driver to observe the behavior of other cars by means of a virtual view from a point just above his car. The virtual view presented to the driver is generated by combining the video images of the fixed roadside cameras. The proposed algorithm was tested by using a miniature highway model and a real road scene.","PeriodicalId":408680,"journal":{"name":"Proceedings IEEE International Conference on Multimedia Computing and Systems","volume":"12 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":"115846594","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.778559
M. Mauve, V. Hilt, Christoph Kuhmünch, W. Effelsberg
In this paper we present a general framework for the transmission of interactive media with real-time characteristics, i.e. media involving user interaction. By identifying and supporting the common aspects of interactive media the framework allows the development of generic services for distributed, collaborative work involving the transmission of interactive media. Derived from the experience gained with audio and video transmission using the Real-Time Transport Protocol (RTP), we define a new RTP profile for interactive media.
{"title":"A general framework and communication protocol for the transmission of interactive media with real-time characteristics","authors":"M. Mauve, V. Hilt, Christoph Kuhmünch, W. Effelsberg","doi":"10.1109/MMCS.1999.778559","DOIUrl":"https://doi.org/10.1109/MMCS.1999.778559","url":null,"abstract":"In this paper we present a general framework for the transmission of interactive media with real-time characteristics, i.e. media involving user interaction. By identifying and supporting the common aspects of interactive media the framework allows the development of generic services for distributed, collaborative work involving the transmission of interactive media. Derived from the experience gained with audio and video transmission using the Real-Time Transport Protocol (RTP), we define a new RTP profile for interactive media.","PeriodicalId":408680,"journal":{"name":"Proceedings IEEE International Conference on Multimedia Computing and Systems","volume":"22 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":"131355895","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.778648
Guy Vardi, Roni Shaliv
The article describes a prototype that implements a new model for interactive movie viewing. The demo contains a short movie that was filmed from several points of view. The user can choose the angle from which he would like to watch the movie by selecting an appropriate link. The user's selections do not interfere with the development of the narrative. The plot and the previous selections determine the availability of further navigation options. The narrative and the correlation between the characters and the links serve as guide line during the navigation. The interactive dimension of the project affect some of the cinematic conventions of the movie, without changing the traditional structure of the narrative.
{"title":"Point of view-an experiment in linear hypervideo","authors":"Guy Vardi, Roni Shaliv","doi":"10.1109/MMCS.1999.778648","DOIUrl":"https://doi.org/10.1109/MMCS.1999.778648","url":null,"abstract":"The article describes a prototype that implements a new model for interactive movie viewing. The demo contains a short movie that was filmed from several points of view. The user can choose the angle from which he would like to watch the movie by selecting an appropriate link. The user's selections do not interfere with the development of the narrative. The plot and the previous selections determine the availability of further navigation options. The narrative and the correlation between the characters and the links serve as guide line during the navigation. The interactive dimension of the project affect some of the cinematic conventions of the movie, without changing the traditional structure of the narrative.","PeriodicalId":408680,"journal":{"name":"Proceedings IEEE International Conference on Multimedia Computing and Systems","volume":"123 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":"131478903","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.778260
F. Bartolini, G. Bini, V. Cappellini, A. Fringuelli, G. Meucci, A. Piva, M. Barni
A new classification of digital watermarking techniques, which is based on the way the decoding process works, is introduced. This classification is used to analyze the impact concepts such as watermark blindness, privateness, readability and reversibility have on practical application scenarios. In the second part of the work, a new, object-oriented, electronic copyright management system (ECMS) is presented which, by relying on state-of-the-art technology, makes it possible the enforcement of copyright laws in an open-network environment.
{"title":"Enforcement of copyright laws for multimedia through blind, detectable, reversible watermarking","authors":"F. Bartolini, G. Bini, V. Cappellini, A. Fringuelli, G. Meucci, A. Piva, M. Barni","doi":"10.1109/MMCS.1999.778260","DOIUrl":"https://doi.org/10.1109/MMCS.1999.778260","url":null,"abstract":"A new classification of digital watermarking techniques, which is based on the way the decoding process works, is introduced. This classification is used to analyze the impact concepts such as watermark blindness, privateness, readability and reversibility have on practical application scenarios. In the second part of the work, a new, object-oriented, electronic copyright management system (ECMS) is presented which, by relying on state-of-the-art technology, makes it possible the enforcement of copyright laws in an open-network environment.","PeriodicalId":408680,"journal":{"name":"Proceedings IEEE International Conference on Multimedia Computing and Systems","volume":"16 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":"125230280","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.778224
A. Hiraiwa, Keisuke Fuse, N. Komatsu, K. Komiya, H. Ikeda
This paper proposes an approach to automatically extract an accurate object from a video stream. The new approach consists of a skip-labeling algorithm for feature-based segmentation, an occlusion-killer algorithm for estimating accurately optical flow, and a shrink-merge tracking algorithm for tracking an object. The shrink-merge tracking algorithm is executed, based on the time continuity of moving-objects, using morphological image processing, such as dilation and erosion. The dilation and erosion are repeatedly executed using projection processing in which the object area in a following frame is derived from the object area in a current frame. The shrink-merge tracking algorithm can also project the area of a rotating object in a current frame on the rotating-object containing the newly appearing regions in the next frame. The automated object extraction method works satisfactory for objects which are moving nonlinearly within the video stream, and works satisfactory in 450 frames.
{"title":"A fully automated object extraction from video stream: a useful tool for distributed object-based browsing and content-based searching systems","authors":"A. Hiraiwa, Keisuke Fuse, N. Komatsu, K. Komiya, H. Ikeda","doi":"10.1109/MMCS.1999.778224","DOIUrl":"https://doi.org/10.1109/MMCS.1999.778224","url":null,"abstract":"This paper proposes an approach to automatically extract an accurate object from a video stream. The new approach consists of a skip-labeling algorithm for feature-based segmentation, an occlusion-killer algorithm for estimating accurately optical flow, and a shrink-merge tracking algorithm for tracking an object. The shrink-merge tracking algorithm is executed, based on the time continuity of moving-objects, using morphological image processing, such as dilation and erosion. The dilation and erosion are repeatedly executed using projection processing in which the object area in a following frame is derived from the object area in a current frame. The shrink-merge tracking algorithm can also project the area of a rotating object in a current frame on the rotating-object containing the newly appearing regions in the next frame. The automated object extraction method works satisfactory for objects which are moving nonlinearly within the video stream, and works satisfactory in 450 frames.","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":"130882987","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.779313
Simon So, C. Leung
A scheme based on bitplane signatures for fast image searching is presented. It makes use of composite bitplanes obtained from overlaying bitplane signatures to form composite bitplane signatures. For large image databases, a hierarchical structure of composite bitplane signatures can be used to provide ranked images without the need to compare and traverse all the images in the database, as many existing retrieval methods do. To search a particular signature embedded in a composite bitplane signature, we rank all the signatures, not by the number of matched bits but by the least difference of 1-bits from the query signature. Experiments are performed using 1,000 images to observe the behavior of composite bitplane signatures under wavelets, and we have also determined the most suitable number of images for insertion into a composite bitplane signature for its efficient operation.
{"title":"A new paradigm in image indexing and retrieval using composite bitplane signatures","authors":"Simon So, C. Leung","doi":"10.1109/MMCS.1999.779313","DOIUrl":"https://doi.org/10.1109/MMCS.1999.779313","url":null,"abstract":"A scheme based on bitplane signatures for fast image searching is presented. It makes use of composite bitplanes obtained from overlaying bitplane signatures to form composite bitplane signatures. For large image databases, a hierarchical structure of composite bitplane signatures can be used to provide ranked images without the need to compare and traverse all the images in the database, as many existing retrieval methods do. To search a particular signature embedded in a composite bitplane signature, we rank all the signatures, not by the number of matched bits but by the least difference of 1-bits from the query signature. Experiments are performed using 1,000 images to observe the behavior of composite bitplane signatures under wavelets, and we have also determined the most suitable number of images for insertion into a composite bitplane signature for its efficient operation.","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":"130887423","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.779270
C. Shahabi, Maytham Safar
Besides traditional applications (e.g., CAD/CAM and Trademark registry), new multimedia applications such as structured video, animation and MPEG-4 standard require the storage and management of well-defined objects. For efficient retrieval of 2D objects by shape, we propose three index structures on features that are extracted from the objects' minimum bounding circles (MBC). A major observation is that those features are unique per object and can be utilized to filter out non-similar candidates. To evaluate our techniques, we conducted a simulation study on a database of 2D objects. The results show the superiority of our techniques as compared to a naive indexing (at least 40% improvement in I/O cost). We also identify one of the indexing structures as the superior one, independent of the size of the database and the number of vertices of the objects.
{"title":"Efficient retrieval and spatial querying of 2D objects","authors":"C. Shahabi, Maytham Safar","doi":"10.1109/MMCS.1999.779270","DOIUrl":"https://doi.org/10.1109/MMCS.1999.779270","url":null,"abstract":"Besides traditional applications (e.g., CAD/CAM and Trademark registry), new multimedia applications such as structured video, animation and MPEG-4 standard require the storage and management of well-defined objects. For efficient retrieval of 2D objects by shape, we propose three index structures on features that are extracted from the objects' minimum bounding circles (MBC). A major observation is that those features are unique per object and can be utilized to filter out non-similar candidates. To evaluate our techniques, we conducted a simulation study on a database of 2D objects. The results show the superiority of our techniques as compared to a naive indexing (at least 40% improvement in I/O cost). We also identify one of the indexing structures as the superior one, independent of the size of the database and the number of vertices of the objects.","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":"131123606","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.778587
J. S. Payne, L. Hepplewhite, T. Stonham
Texture is widely used in CBIR, and there have been a number of studies over the years to establish which features are perceptually significant. However it is still difficult to retrieve reliably images that the human user would agree are "similar". This paper reviews a range of computational methods, and compares their performance in classifying and retrieving images from the Brodatz set. Their performance is then related to the combined ranking of "similar" images from the same dataset, obtained from experiments where human volunteers were asked to identify which images were most like each of the Brodatz images. The full set of 112 images was used. We conclude that no one method consistently returns retrievals which the human user would agree were similar across the full range of textures, but that statistical methods appear to perform better overall. We propose a subset of the Brodatz images for comparison of retrieval methods, based on the correlation between individual rankings.
{"title":"Perceptually based metrics for the evaluation of textural image retrieval methods","authors":"J. S. Payne, L. Hepplewhite, T. Stonham","doi":"10.1109/MMCS.1999.778587","DOIUrl":"https://doi.org/10.1109/MMCS.1999.778587","url":null,"abstract":"Texture is widely used in CBIR, and there have been a number of studies over the years to establish which features are perceptually significant. However it is still difficult to retrieve reliably images that the human user would agree are \"similar\". This paper reviews a range of computational methods, and compares their performance in classifying and retrieving images from the Brodatz set. Their performance is then related to the combined ranking of \"similar\" images from the same dataset, obtained from experiments where human volunteers were asked to identify which images were most like each of the Brodatz images. The full set of 112 images was used. We conclude that no one method consistently returns retrievals which the human user would agree were similar across the full range of textures, but that statistical methods appear to perform better overall. We propose a subset of the Brodatz images for comparison of retrieval methods, based on the correlation between individual rankings.","PeriodicalId":408680,"journal":{"name":"Proceedings IEEE International Conference on Multimedia Computing and Systems","volume":"1 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":"131255756","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.778139
Wen-Kuo Lin, B. Ng, N. Burgess
This paper presents a color image zerotree coding algorithm with a significantly reduced memory requirement, thus making it hardware implementation friendly. The memory reduction was achieved by using the lifted wavelet transform and listless zerotree coding (LZC). The lifted wavelet transform has a lower memory requirement and lower implementation complexity than the traditional filter bank implementation. Unlike other zerotree coding algorithms such as Said and Pearlman's (1996) SPIHT our LZC algorithm uses no lists during encoding and decoding. Without the lists, the memory requirement for the VLSI implementation is reduced significantly. PSNR values for LZC are only slightly lower than SPIHT's. Our approach illustrates well the trade-off between memory requirement and compressed image quality.
{"title":"Reduced memory zerotree coding algorithm for hardware implementation","authors":"Wen-Kuo Lin, B. Ng, N. Burgess","doi":"10.1109/MMCS.1999.778139","DOIUrl":"https://doi.org/10.1109/MMCS.1999.778139","url":null,"abstract":"This paper presents a color image zerotree coding algorithm with a significantly reduced memory requirement, thus making it hardware implementation friendly. The memory reduction was achieved by using the lifted wavelet transform and listless zerotree coding (LZC). The lifted wavelet transform has a lower memory requirement and lower implementation complexity than the traditional filter bank implementation. Unlike other zerotree coding algorithms such as Said and Pearlman's (1996) SPIHT our LZC algorithm uses no lists during encoding and decoding. Without the lists, the memory requirement for the VLSI implementation is reduced significantly. PSNR values for LZC are only slightly lower than SPIHT's. Our approach illustrates well the trade-off between memory requirement and compressed image quality.","PeriodicalId":408680,"journal":{"name":"Proceedings IEEE International Conference on Multimedia Computing and Systems","volume":"24 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":"133551553","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.779251
E. Chang, H. Garcia-Molina
We propose an integrated memory and disk cache for managing the resources of a multimedia client's computer or set-top box. The cache cushions the multimedia decoder from input rate fluctuations and mismatches, and because data can be cached to disk, the acceptable fluctuations can be very large. This lets the client operate efficiently at low cost when the network rate is much larger or smaller than the media display rate, and gives the media server much greater flexibility for balancing workload and supporting VCR-like functions. We analyze the memory requirements for this cache, and analytically derive safe values for its control parameters. Using a realistic case study, we examine the interaction between memory size, peak input rate, and disk performance, and show that a relatively modest amount of main memory can support a wide range of scenarios.
{"title":"MEDIC: a memory and disk cache for multimedia clients","authors":"E. Chang, H. Garcia-Molina","doi":"10.1109/MMCS.1999.779251","DOIUrl":"https://doi.org/10.1109/MMCS.1999.779251","url":null,"abstract":"We propose an integrated memory and disk cache for managing the resources of a multimedia client's computer or set-top box. The cache cushions the multimedia decoder from input rate fluctuations and mismatches, and because data can be cached to disk, the acceptable fluctuations can be very large. This lets the client operate efficiently at low cost when the network rate is much larger or smaller than the media display rate, and gives the media server much greater flexibility for balancing workload and supporting VCR-like functions. We analyze the memory requirements for this cache, and analytically derive safe values for its control parameters. Using a realistic case study, we examine the interaction between memory size, peak input rate, and disk performance, and show that a relatively modest amount of main memory can support a wide range of scenarios.","PeriodicalId":408680,"journal":{"name":"Proceedings IEEE International Conference on Multimedia Computing and Systems","volume":"13 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":"133800916","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
扫码关注我们
求助内容：
应助结果提醒方式：