{"title":"Wireless multimedia communication through multichannel multipoint distribution service","authors":"W. Biagini, Ning Yang","doi":"10.1109/ITCC.2000.844190","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844190","url":null,"abstract":"The multichannel multipoint distribution service (MMDS) spectrum has been the focus for a variety of business ventures and technologies over the past twenty years and is anticipated to be the at the forefront for competitive multimedia services to the consumer in the near future. We review the architecture and technical challenges encountered in the design and deployment of a digital video broadcast system for the island of Oahu. Such networks provide insight to the technical challenges and potential solutions in future two way systems.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123550911","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}
{"title":"Optimizing processing of query subscription in an WDM network environment","authors":"W. Liang, M. Orlowska","doi":"10.1109/ITCC.2000.844278","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844278","url":null,"abstract":"We examine query subscription processing in a wavelength division multiplexing (WDM) network environment. The users (clients) launch their queries through the Internet to an information center which consists of several servers. The information center then assigns proper servers to process the queries, and sends the query results back to the users. We first model the problem in terms of several optimization criteria such as query processing time required by the servers, the number of wavelengths used for the query result transmission, and the other parameters contributing to the overall execution/transmission cost. We then present efficient heuristic algorithms to solve the problem.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122628273","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}
{"title":"Media-independent watermarking classification and the need for combining digital video and audio watermarking for media authentication","authors":"J. Dittmann, A. Mukherjee, M. Steinebach","doi":"10.1109/ITCC.2000.844184","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844184","url":null,"abstract":"Watermarking has become a major topic to solve authentication problems and copyright protection as major security demands in digital marketplaces. A wide variety of watermarking techniques have been proposed in the literature. Most techniques have been developed for still images; currently the research community is also enforcing approaches for other multimedia data like video, audio and 3D models. In our paper we summarize the main watermarking parameters and introduce a media independent classification scheme. Our classification scheme is based on the application areas. We show the important parameters and possible attacks. Based on our proposed classification the quality of the watermarking techniques can be evaluated. Furthermore we address the need for combining digital video and audio watermarking for media authentication.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128497717","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}
D. Rigas, D. Memery, D. Hopwood, Marcos A. Rodrigues
{"title":"Empirically derived design issues in auditory information processing for mobile telephony","authors":"D. Rigas, D. Memery, D. Hopwood, Marcos A. Rodrigues","doi":"10.1109/ITCC.2000.844271","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844271","url":null,"abstract":"This paper investigates empirically design issues in auditory information processing, relevant to interfaces for mobile telephony. This investigation forms the initial part of a larger experimental programme, which aims to investigate design methodologies for auditory-multimedia interfaces. Structured musical and environmental audio was used to communicate simple and complex (i.e., larger amounts) information for mobile telephony. The contribution of this paper is in the empirical investigation of the perceptual principles involved in using auditory stimuli to communicate information rather than the mere application of sound in this problem domain. Some of these experiments also aim to communicate information that would normally be communicated using the visual displays of mobile devices. Results indicate perceptual issues that need to be considered in the design process of auditory interfaces. Memory demands on users may in some cases prevent the correct interpretation of the auditory stimuli. Other issues observed to help the designing process of auditory user interfaces include the creation of perceptual context, semantic coding and auditory user interaction model.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126943054","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}
Jung S. Cho, Seungwon Shin, Won H. Lee, Jong W. Kim, Jonguk Choi
{"title":"Enhancement of robustness of image watermarks embedding into colored image, based on WT and DCT","authors":"Jung S. Cho, Seungwon Shin, Won H. Lee, Jong W. Kim, Jonguk Choi","doi":"10.1109/ITCC.2000.844274","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844274","url":null,"abstract":"This research is concerned with the watermarking technique which embeds image data invisibly into a colored image based on the wavelet transform (FT) and discrete cosine transform (DCT) so that the watermark data be not impaired in compression, filtering, cropping, rescaling, re-sampling, and other digital manipulations. The suggested method comprises the steps of transforming the target image using the WT, transforming an image watermark using DCT, integrating the wavelet transformed digital image with the DCT-transformed watermark image to embed the fingerprint into the intellectual property, and generating the watermarked image using the inverse wavelet transform. In the experiments, it was found that the suggested method is highly effective against impairment of the watermark that would otherwise be caused by the image processing operations, such as compression, filtering, re-sampling, rotation, and cropping.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127669963","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}
{"title":"Modelling rate-based dynamic cache sharing for distributed VOD systems","authors":"B. Sonah, M. Ito","doi":"10.1109/ITCC.2000.844275","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844275","url":null,"abstract":"A distributed VOD system includes several VOD sub-systems, each VOD sub-system consisting of an archive server (AS), a continuous media server (CMS) and a medata DB. A VOD sub-system employs an object replacement algorithm by which a video is selected to be replaced by a new video. Upon a miss, the VOD system must decide onto which CMS to load the new video. We address this issue by modelling a dynamic approach of logically sharing the overall CMS cache space among the CMSs based on the current average arrival rate of requests at each VOD sub-system to achieve superior cache performance. Our simulation results show that dynamic cache sharing is a means by which the hit performance at the CMSs can be improved.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"721 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133216331","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}
{"title":"Statistical multiplexing and admission control policy for smoothed video streams using e-PCRTT algorithm","authors":"O. Hadar, S. Greenberg","doi":"10.1109/ITCC.2000.844237","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844237","url":null,"abstract":"Improvements in telecommunication and computer technologies have made integrated services packet-switched networks possible. It is expected that a significant portion of future networks will carry prerecorded video and that traffic in applications such as video on demand (VoD) will include high-fidelity audio, short multimedia clips, and full-length movies. In this paper we study the effect of video rate smoothing, of prerecorded VBR sources, on network utilization and admission control of a VoD system, such that the end users receive a satisfactory service. The enhancement piecewise constant rate transmission and transport (e-PCRTT) algorithm is used as the smoothing algorithm, which utilizes equal size intervals. The effect of smoothing on the statistical characteristics of multiplexed video streams is explored. We found that synchronization between the smoothing intervals can significantly improve the efficiency of the smoothing process by reducing the number of bandwidth changes and the rate variability of the multiplexed stream. In this paper we propose an admission control policy in which a bandwidth rate-plan is negotiated at stream initiation. The algorithm is evaluated via simulation for the VoD scenario.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134019230","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}
{"title":"How do image statistics impact lossy coding performance?","authors":"S. Saha, V. Vemuri","doi":"10.1109/ITCC.2000.844181","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844181","url":null,"abstract":"It has been observed (Saha and Vemuri, 1999) that when we compress a variety of images of different types using a fixed wavelet filter, the peak signal-to-noise ratio (PSNR) values vary widely from image to image. This large variation in PSNR by as much as 30 dB, can only be attributed to the nature and inherent characteristics of the image, since everything else is fixed. In this paper, we analyze the set of test images to determine the features in the images that may cause the coding performance variations. It is shown that most of the gray-level image features do not have any direct effect on the coding performance, and image activity measure is the only feature that has a correlation with the PSNR value.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131184253","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}
{"title":"Modelling multi-player games traffic","authors":"R. A. Bangun, E. Dutkiewicz","doi":"10.1109/ITCC.2000.844216","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844216","url":null,"abstract":"The growing popularity of delay-sensitive multi-player games over the Internet is creating a need for proper characterisation of such traffic. We are currently developing source models for game traffic, on a per-player basis, with the intended use being to scale the models to simulate scenarios involving large numbers of players, which will enable us to observe the effects of game traffic on the network. We outline the procedure used, and we show that for certain cases, relatively simple source models are able to provide sufficiently accurate results (in terms of mean delay and mean buffer occupancy).","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133285255","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}
{"title":"A hard real-time tasks model for the VBR video server","authors":"Jae-dong Lee","doi":"10.1109/ITCC.2000.844208","DOIUrl":"https://doi.org/10.1109/ITCC.2000.844208","url":null,"abstract":"At the design of the video server to service video data as real-time, we must consider network bandwidth, buffer space and disk bandwidth. As buffer space and disk bandwidth affect each other tightly, they should be considered at the same time. In this paper, we propose the hard real-time tasks' model for the streams on the video server. The stream on the server can be considered as the hard real-time task in that the server must guarantee the continuity of streams like the hard real-time system must guarantee the deadline of tasks. The management of streams in the server is induced from the scheduling of real-time tasks. We propose hard read-time tasks models for the video server and the scheduling algorithms for real-time tasks. The real-time scheduling algorithms are used for admission control of streams, scheduling of disks, and management of buffers in the video server. We design the effective video server using the real-time tasks a model. We evaluate the performance of our suggested video server via simulation. We show that our mechanism can service more streams with a few buffers simultaneously.","PeriodicalId":146581,"journal":{"name":"Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132577018","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}