MULTIMEDIA '00Pub Date : 2000-11-04DOI: 10.1145/357744.357885
S. Pfeiffer, Uma Srinivasan
{"title":"TV anytime as an application scenario for MPEG-7","authors":"S. Pfeiffer, Uma Srinivasan","doi":"10.1145/357744.357885","DOIUrl":"https://doi.org/10.1145/357744.357885","url":null,"abstract":"The ISO/MPEG group has identified a wide range of application scenarios [1] for their emerging MPEG-7 standard on audio-visual metadata. TV Anytime with their vision of future digital TV services [2] encompasses a large number of them. As TV Anytime has also identified metadata as one of the key requirements to realize their vision, MPEG-7 is the natural candidate to fill that role. Here, we describe technically how metadata for the TV Anytime scenario can be created using MPEG-7.","PeriodicalId":234597,"journal":{"name":"MULTIMEDIA '00","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114498149","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 '00Pub Date : 2000-11-04DOI: 10.1145/357744.357748
B. Beaumont
{"title":"Decompression: a living laboratory in cyberspace","authors":"B. Beaumont","doi":"10.1145/357744.357748","DOIUrl":"https://doi.org/10.1145/357744.357748","url":null,"abstract":"Decompression is a proposed cyberworld created by electronically collaging multiple stories and images of the contiguous worlds of technology, science and art. The developing Decompression centers around Ocean Landmark (1980), a collaborative art work that transformed 500 tons of an industrial coal waste product into a thriving underwater environment that is fished and feeds people. Decompression will image —for the first time— Ocean Landmark in its life-sustaining form. The technologically mediated images of this underwater oasis will be dynamic images visually related to sonograms, such as images of the fetus (a highly technologically mediated dynamic image) and side-scan sonar. As Ocean Landmark is a flourishing ecosystem, Decompression will develop into Living Laboratory, a thriving information-system in cyberspace. Modeled on virtual environments in which the user's perception and spatial position affects their experience of the space, Living Laboratory will be a dynamically changing art space with an architecture that combines technologically mediated images and virtual diverse perceptual displays. The realized Ocean Landmark, a model for ecological equilibrium in the invisible underwater world, is an interdisciplinary project that for two decades has resided in the domain of the imagination. By visualizing Ocean Landmark's invisible realm, Living Laboratory will elucidate and elaborate virtual perceptual models of different ways of experiencing information within a contemporaneous context. This Living Laboratory will grow, develop and evolve into a mature and provocative discursive community.","PeriodicalId":234597,"journal":{"name":"MULTIMEDIA '00","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124197616","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 '00Pub Date : 2000-11-04DOI: 10.1145/357744.357760
R. Crinon, E. Heredia
{"title":"The ATSC data broadcast Standard","authors":"R. Crinon, E. Heredia","doi":"10.1145/357744.357760","DOIUrl":"https://doi.org/10.1145/357744.357760","url":null,"abstract":"The Advanced Television Systems Committee (ATSC) is about to complete its data broadcast standard. This specification will enable multimedia content providers to deliver applications using the broadband channels of digital television. This specification will also enable the integration of data based information technologies and television audio-visual services. The purpose of the paper is to provide a description of the most important principles making up the specification. More specifically, four components are presented: A collection of unidirectional delivery protocols, an application signaling framework for service discovery, an MPEG-2 Transport buffer model and finally, a Profile and Level-based classification of data services. The functionality provided by each of these components is reviewed.","PeriodicalId":234597,"journal":{"name":"MULTIMEDIA '00","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126193451","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 '00Pub Date : 2000-11-04DOI: 10.1145/357744.357749
S. Fels
{"title":"Intimacy and embodiment: implications for art and technology","authors":"S. Fels","doi":"10.1145/357744.357749","DOIUrl":"https://doi.org/10.1145/357744.357749","url":null,"abstract":"People have aesthetic experiences when they manipulate objects skillfully. Highly skilled performance with an object requires forming a highly intimate relationship with it. Aesthetics flow from this intimacy. This paper discusses three works which bring together technology and art to illustrate the issues of intimacy and embodiment. The three works are: Iamascope, video cubism and the forklift ballet.","PeriodicalId":234597,"journal":{"name":"MULTIMEDIA '00","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126645532","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 '00Pub Date : 2000-11-04DOI: 10.1145/357744.357921
Z. Song, N. Roussopoulos
{"title":"Using Hilbert curve in image storing and retrieving","authors":"Z. Song, N. Roussopoulos","doi":"10.1145/357744.357921","DOIUrl":"https://doi.org/10.1145/357744.357921","url":null,"abstract":"In this paper, we present a method to accelerate the speed of retrieving subset of uncompressed images in a database without using extra disk space. First we change the storing method: pixels of an image are saved in Hilbert order instead of Row-wise order in traditional method. After studying the property of Hilbert curve, we give a new algorithm which greatly reduces the data segment numbers on the disk. Although we have to retrieve more data than necessary, because the speed of sequential readings is much faster than the speed of random readings, our method spends about 10% less elapsed time which is showed in our simulation experiments. In some systems, the saving can be as high as 90%.","PeriodicalId":234597,"journal":{"name":"MULTIMEDIA '00","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127813175","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 '00Pub Date : 2000-11-04DOI: 10.1145/357744.357763
Michelle Y. Kim, Steve Wood, Lai-Tee Cheok
{"title":"Extensible MPEG-4 textual format (XMT)","authors":"Michelle Y. Kim, Steve Wood, Lai-Tee Cheok","doi":"10.1145/357744.357763","DOIUrl":"https://doi.org/10.1145/357744.357763","url":null,"abstract":"This paper describes the Extensible MPEG-4 Textual format (XMT), a framework for representing MPEG-4 scene description using a textual syntax. The XMT allows the content authors to exchange their content with other authors, tools or service providers, and facilitates interoperability with both the X3D, developed by the Web3D consortium, and the Synchronized Multimedia Integration Language (SMIL) from the W3C consortium.","PeriodicalId":234597,"journal":{"name":"MULTIMEDIA '00","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116937237","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 '00Pub Date : 2000-11-04DOI: 10.1145/357744.357919
Franck Leprévost, Raphaël Erard, T. Ebrahimi
{"title":"How to bypass the Wassenaar arrangement: a new application for watermarking","authors":"Franck Leprévost, Raphaël Erard, T. Ebrahimi","doi":"10.1145/357744.357919","DOIUrl":"https://doi.org/10.1145/357744.357919","url":null,"abstract":"The scope of this article is to clarify the current legal and political situation related to electronic surveillance on the one hand, and to export regulations for encryption software on the other hand. We will look at different international agreements, such as the UKUSA agreement and the Wassenaar arrangement, and elaborate on current encryption techniques falling under these regulations. This discussion is then followed by introducing the basic concepts of steganography and digital watermarking which could be used for secret communication. As a consequence, we propose an original way to legally bypass the international export regulations using these technologies. To this end a new watermarking technique is proposed, which is robust to JPEG2000 compression and provides a good channel capacity. The efficiency of the proposed technique is analyzed by means of simulations to allow for secure communications.","PeriodicalId":234597,"journal":{"name":"MULTIMEDIA '00","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125215223","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 '00Pub Date : 2000-11-04DOI: 10.1145/357744.357950
E. Kuruoğlu, Vern T. Tan
{"title":"Document image retrieval without OCRing using a video scanning system","authors":"E. Kuruoğlu, Vern T. Tan","doi":"10.1145/357744.357950","DOIUrl":"https://doi.org/10.1145/357744.357950","url":null,"abstract":"In this paper, we propose a technique for efficient document retrieval from digital libraries containing document images which are token based compressed. The query image is captured from a paper document by the video scanning tool of a multimedia system. The technique we propose uses the layout information supplied by the relative positions of the character tokens on the page of a “query” paper document to retrieve the original document in the image database. This technique avoids OCRing the query document and the documents in the database; moreover avoids decompressing the token based compressed documents in the database, therefore achieving important time and computational gains.","PeriodicalId":234597,"journal":{"name":"MULTIMEDIA '00","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114948115","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 '00Pub Date : 2000-11-04DOI: 10.1145/357744.357935
N. Babaguchi, Yoshihiko Kawai, Yukinobu Yasugi, T. Kitahashi
{"title":"Linking live and replay scenes in broadcasted sports video","authors":"N. Babaguchi, Yoshihiko Kawai, Yukinobu Yasugi, T. Kitahashi","doi":"10.1145/357744.357935","DOIUrl":"https://doi.org/10.1145/357744.357935","url":null,"abstract":"Content based video organization requires to understand semantical relationships such as identity and similarity between video segments. In particular, it is of great interest to identify scenes of the same event which may differ in their appearances. For broadcasted sports video, such scenes correspond to live and replay scenes that appear at different temporal positions. In this paper, we propose a method of linking up live and replay scenes by focusing on the domain knowledge about producing TV programs of sports: most of the replay scenes are sandwiched in between specific digital video effects. The replay scenes are linked with live scenes when the game is in play based on salient image features. We clarify the effectiveness of our method through fundamental experiments for American football games.","PeriodicalId":234597,"journal":{"name":"MULTIMEDIA '00","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133552942","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 '00Pub Date : 2000-11-04DOI: 10.1145/357744.357746
E. Akleman, Jianer Chen, Burak Meric
{"title":"Web-based intuitive and effective design of symmetric tiles","authors":"E. Akleman, Jianer Chen, Burak Meric","doi":"10.1145/357744.357746","DOIUrl":"https://doi.org/10.1145/357744.357746","url":null,"abstract":"This paper presents a new approach for intuitive and effective design of periodic symmetric tiles. We observe that planar graphs can effectively represent symmetric tiles and graph drawing provides an intuitive paradigm for designing symmetric tiles. Moreover, based on our theoretical work to represent hexagonal symmetry by rectangular symmetry, we are able to present all symmetric tiles as graphs embedded on a torus and based on simple modulo operations. This approach enables us to develop a simple and efficient algorithm, which has been implemented in Java. By using this software, designers, architects and artists can create interesting symmetric tiles directly on the web. We also have designed a few examples of symmetric tiles to show the effectiveness of the approach.","PeriodicalId":234597,"journal":{"name":"MULTIMEDIA '00","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116766735","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号
