MULTIMEDIA '99Pub Date : 1999-10-30DOI: 10.1145/319463.319685
A. Neogi, Ashish Raniwala, T. Chiueh
{"title":"Phoenix: a low-power fault-tolerant real-time network-attached storage device","authors":"A. Neogi, Ashish Raniwala, T. Chiueh","doi":"10.1145/319463.319685","DOIUrl":"https://doi.org/10.1145/319463.319685","url":null,"abstract":"Phoenix is a real-time network-attached storage device (NASD) that guarantees real-time data delivery to network clients even across single disk failure. The service interfaces that Phoenix provides are best-effort/real-time reads/writes based on unique object identifiers and block offsets. Data retrieval from Phoenix can be serviced in server push or client pull modes. Phoenix's real-time disk subsystem performance results from a standard cycle-based scan-order disk scheduling mechanism. However, the disk I/O cycle of Phoenix is either completely active or completely idle. This on-off disk scheduling model effectively reduces the power consumption of the disk subsystem, without increasing the buffer size requirement. Phoenix also exploits unused disk storage space and maintains additional redundancy beyond the generic RAID5-style parity. This extra redundancy, typically in the form of block replication, reduces the time to reconstruct the data on the failed disk. This paper describes the design, implementation, and evaluation of Phoenix, one of the first, if not the first, NASDs that support fault-tolerant, real-time, and low-power network storage service.","PeriodicalId":265329,"journal":{"name":"MULTIMEDIA '99","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125444325","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}
MULTIMEDIA '99Pub Date : 1999-10-30DOI: 10.1145/319463.319474
E. Fox, R. Heller, Anna Long, David Watkins
{"title":"CRIM: curricular resources in interactive multimedia","authors":"E. Fox, R. Heller, Anna Long, David Watkins","doi":"10.1145/319463.319474","DOIUrl":"https://doi.org/10.1145/319463.319474","url":null,"abstract":"The CRIM project addresses the need for curricular guidelines and educational resources for the Interactive Multimedia area. A digital library / repository allows educators to submit knowledge modules that will be reviewed and made available for use by teachers or students. Recommendations are given for courses and topics, and a process is outlined to reach consensus and improve education. This efforts is connected with the Computer Science Teaching Center, http://www.cstc.org/.","PeriodicalId":265329,"journal":{"name":"MULTIMEDIA '99","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121363506","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}
MULTIMEDIA '99Pub Date : 1999-10-30DOI: 10.1145/319463.319660
Ye-Kui Wang, M. Vilermo
{"title":"An excitation level based psychoacoustic model for audio compression","authors":"Ye-Kui Wang, M. Vilermo","doi":"10.1145/319463.319660","DOIUrl":"https://doi.org/10.1145/319463.319660","url":null,"abstract":"This paper describes an excitation level based psychoacoustic model to estimate the simultaneous masking threshold for audio coding. The system has the following stages: 1) a windowing function; 2) a time-to-frequency transformation; 3) an excitation level calculation block similar to that in Moore and Glasberg's loudness model; 4) a correction factor for estimating masking threshold; 5) the inclusion of the absolute masking threshold; 6) the output Signal-to-Masking ratio. We have evaluated the performance by integrating the proposed psychoacoustic model into an audio coder similar to MPEG-2 AAC, which contains only the basic coding tools. Our model performs better than or as well as the psychoacoustic model suggested in the MPEG-2 AAC audio coding standard for all the test signals. We can achieve almost transparent quality with bitrate below 64 kbps for most of the critical test signals. Significant improvements have been achieved with speech signals, which are always difficult for transform audio coders.","PeriodicalId":265329,"journal":{"name":"MULTIMEDIA '99","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122879049","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}
MULTIMEDIA '99Pub Date : 1999-10-30DOI: 10.1145/319463.319600
Jehan-Francois Pâris, D. Long, P. Mantey
{"title":"Zero-delay broadcasting protocols for video-on-demand","authors":"Jehan-Francois Pâris, D. Long, P. Mantey","doi":"10.1145/319463.319600","DOIUrl":"https://doi.org/10.1145/319463.319600","url":null,"abstract":"Broadcasting protocols for video-on-demand continuously retransmit videos that are watched simultaneously by many viewers. Nearly all broadcasting protocols assume that the client set-top box has enough storage to store between 48 and 60 minutes of video. We propose to use this storage to anticipate the customer requests and to preload, say, the first 3 minutes of the top 16 to 20 videos. This would provide instantaneous access to these videos and also eliminate the extra bandwidth required to handle compressed video signal.\u0000We present two broadcasting protocols using partial preloading to eliminate this extra bandwidth. The first of these protocols, Polyharmonic Broadcasting with Partial Preloading (PHB-PP), partitions each video into between 20 and 160 segments of equal duration and allocates a separate data stream to each individual segment. Our second protocol, the Mayan Temple Broadcasting protocol, uses fewer data streams but requires more overall bandwidth.","PeriodicalId":265329,"journal":{"name":"MULTIMEDIA '99","volume":"804 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131706952","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}
MULTIMEDIA '99Pub Date : 1999-10-30DOI: 10.1145/319463.319610
K. Hua, Khanh Vu, Jung-Hwan Oh
{"title":"SamMatch: a flexible and efficient sampling-based image retrieval technique for large image databases","authors":"K. Hua, Khanh Vu, Jung-Hwan Oh","doi":"10.1145/319463.319610","DOIUrl":"https://doi.org/10.1145/319463.319610","url":null,"abstract":"The rapid growth of digital image data increases the need for efficient and effective image retrieval systems. Such systems should provide functionality that tailors to the user's need at the query time. In this paper, we propose a new image retrieval technique that allows users to control the relevantness of the results. For each image, the color contents of its regions are captured and used to compute similarity. Various factors, assigned automatically or by the user, allow high recall and precision to be obtained. We implemented the proposed technique for a large database of 16,000 images. Our experimental results show that this technique is not only space-time efficient but also more effective than recently proposed color histogram techniques.","PeriodicalId":265329,"journal":{"name":"MULTIMEDIA '99","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132567994","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}
MULTIMEDIA '99Pub Date : 1999-10-30DOI: 10.1145/319463.319483
Patrick Chiu, Ashutosh Kapuskar, Sarah Reitmeier, L. Wilcox
{"title":"NoteLook: taking notes in meetings with digital video and ink","authors":"Patrick Chiu, Ashutosh Kapuskar, Sarah Reitmeier, L. Wilcox","doi":"10.1145/319463.319483","DOIUrl":"https://doi.org/10.1145/319463.319483","url":null,"abstract":"NoteLook is a client-server system designed and built to support multimedia note taking in meetings with digital video and ink. It is integrated into a conference room equipped with computer controllable video cameras, video conference camera, and a large display rear video projector. The NoteLook client application runs on wireless pen-based notebook computers. Video channels containing images of the room activity and presentation material are transmitted by the NoteLook servers to the clients, and the images can be interactively and automatically incorporated into the note pages. Users can select channels, snap in large background images and sequences of thumbnails, and write freeform ink notes. A smart video source management component enables the capture of high quality images of the presentation material from a variety of sources. For accessing and browsing the notes and recorded video, NoteLook generates Web pages with links from the images and ink strokes correlated to the video.","PeriodicalId":265329,"journal":{"name":"MULTIMEDIA '99","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133297155","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}
MULTIMEDIA '99Pub Date : 1999-10-30DOI: 10.1145/319463.319476
A. Adams, M. A. Sasse
{"title":"Taming the wolf in sheep's clothing: privacy in multimedia communications","authors":"A. Adams, M. A. Sasse","doi":"10.1145/319463.319476","DOIUrl":"https://doi.org/10.1145/319463.319476","url":null,"abstract":"When ubiquitous multimedia technology is introduced in an organization, the privacy implications of that technology are rarely addressed. Users usually extend the trust they have in an organization to the technology it employs. This paper reports results from interviews with 24 Internet Engineering Task Force (IETF) attendees whose presentations or contributions to IETF sessions were transmitted on the multicast backbone (Mbone). Due to a high level of trust in the organization, these users had few initial concerns about the privacy implications of this technology. However, interviewees' trust relied on inaccurate assumptions, since the interviews revealed a number of potential and actual invasions of privacy in transmission, recording and editing of multicast data. Previous research found that users who experience an unexpected invasion of their privacy are not only likely to reject the technology that afforded the invasion, but lose trust in the organization that introduced it [2,3]. We discuss a number of mechanisms and policies for protecting users' privacy in this particular application, and propose a strategy for introducing networked multimedia technology in general.","PeriodicalId":265329,"journal":{"name":"MULTIMEDIA '99","volume":"357 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122807268","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}
MULTIMEDIA '99Pub Date : 1999-10-30DOI: 10.1145/319463.319691
Li-wei He, Elizabeth Sanocki, Anoop Gupta, J. Grudin
{"title":"Auto-summarization of audio-video presentations","authors":"Li-wei He, Elizabeth Sanocki, Anoop Gupta, J. Grudin","doi":"10.1145/319463.319691","DOIUrl":"https://doi.org/10.1145/319463.319691","url":null,"abstract":"As streaming audio-video technology becomes widespread, there is a dramatic increase in the amount of multimedia content available on the net. Users face a new challenge: How to examine large amounts of multimedia content quickly. One technique that can enable quick overview of multimedia is video summaries; that is, a shorter version assembled by picking important segments from the original.\u0000We evaluate three techniques for automatic creation of summaries for online audio-video presentations. These techniques exploit information in the audio signal (e.g., pitch and pause information), knowledge of slide transition points in the presentation, and information about access patterns of previous users. We report a user study that compares automatically generated summaries that are 20%-25% the length of full presentations to author generated summaries. Users learn from the computer-generated summaries, although less than from authors' summaries. They initially find computer-generated summaries less coherent, but quickly grow accustomed to them.","PeriodicalId":265329,"journal":{"name":"MULTIMEDIA '99","volume":"173 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121135795","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}
MULTIMEDIA '99Pub Date : 1999-10-30DOI: 10.1145/319463.319629
M. Alghoniemy, A. Tewfik
{"title":"Progressive quantized projection watermarking scheme","authors":"M. Alghoniemy, A. Tewfik","doi":"10.1145/319463.319629","DOIUrl":"https://doi.org/10.1145/319463.319629","url":null,"abstract":"In this paper we present a new watermarking technique for digital images. Our approach modifies blocks of the image after projecting them onto certain directions. By quantizing the projected blocks to even and odd values we can represent the hidden information properly. The proposed algorithm does the modification progressively to ensure successful data extraction without any prior information being sent to the receiver side. In order to increase the robustness of our watermark to scaling and rotation attacks we also present a solution to recover the original size and orientation based on a training sequence which is inserted as part of the watermark.","PeriodicalId":265329,"journal":{"name":"MULTIMEDIA '99","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126856852","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}
MULTIMEDIA '99Pub Date : 1999-10-30DOI: 10.1145/319463.319616
Jeongnam Youn, Ming-Ting Sun, Jun Xin
{"title":"Video transcoder architectures for bit rate scaling of H.263 bit streams","authors":"Jeongnam Youn, Ming-Ting Sun, Jun Xin","doi":"10.1145/319463.319616","DOIUrl":"https://doi.org/10.1145/319463.319616","url":null,"abstract":"Video transcoding is one of the key technologies in implementing dynamic adaptation of the bit rate of a pre-encoded video stream to the available bandwidth over various networks. Many different transcoder architectures have been proposed to achieve fast processing. However, they suffer from quality degradation due to the drift error. In this paper, we investigate the drift caused by the fast transcoder architectures for transcoding H.263 bitstreams. We also discuss the limitations of the existing fast transcoder architectures and the flexibility that can be offered by a cascaded pixel-domain transcoder. In favor of drift-free performance and transcoding flexibility, we propose methods to reduce the computational complexity of the cascaded pixel-domain transcoder.","PeriodicalId":265329,"journal":{"name":"MULTIMEDIA '99","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133619724","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}