This paper proposes the Information Skimming Space (ISS) which provides users with a window through which interesting news reports can be culled from the large number of reports created daily by the mass media, such as newspapers and TV stations, as well as serving as a powerful information retrieval system. Our idea is that information acquisition can be best performed by enhancing the efficiency with which the information is presented to and accessed by the user. To realize this concept, newspapers are analyzed as an information acquisition tool to make an effective presentation scheme suitable for rapid cognitive understanding. News Transmission Model is proposed to define navigation paths that allow the user to access other reports according to his or her interests.
{"title":"Design of an information skimming space","authors":"M. Ohkubo, N. Kobayashi, Toru Nakagawa","doi":"10.1145/166266.168424","DOIUrl":"https://doi.org/10.1145/166266.168424","url":null,"abstract":"This paper proposes the Information Skimming Space (ISS) which provides users with a window through which interesting news reports can be culled from the large number of reports created daily by the mass media, such as newspapers and TV stations, as well as serving as a powerful information retrieval system. Our idea is that information acquisition can be best performed by enhancing the efficiency with which the information is presented to and accessed by the user. To realize this concept, newspapers are analyzed as an information acquisition tool to make an effective presentation scheme suitable for rapid cognitive understanding. News Transmission Model is proposed to define navigation paths that allow the user to access other reports according to his or her interests.","PeriodicalId":412458,"journal":{"name":"MULTIMEDIA '93","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125347880","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}
G. Rossum, Jack Jansen, K. S. Mullender, D. Bulterman
This paper discusses the architecture and implementation of CMIFed, an editing and presentation environment for hypermedia documents. Typically such documents contain a mixture of text, images, audio, and video (and possibly other media), augmented with user interaction. CMIFed allows the author flexibility in specifying what is presented when, using multiple simultaneous output channels. Unlike systems that use a timeline or scripting metaphor to control the presentation, in CMIFed the user manipulates a collection of events and timing constraints among those events. Common timing requirements can be specified by grouping events together in a tree whose nodes indicate sequential and parallel composition. More general timing constraints between events can be added in the form of synchronization arcs. User interaction is supported in the form of hyperlinks. We place CMIFed in the context of the CMIF model for hypermedia documents, which formalizes the properties of hypermedia presentations in a platform-independent manner. CR Subject Classification (1991): H.5.1, H.5.2, I.7.2, I.3.6, I.3.4, D.4.1, D.4.4, D.4.7.
{"title":"CMIFed: a presentation environment for portable hypermedia documents","authors":"G. Rossum, Jack Jansen, K. S. Mullender, D. Bulterman","doi":"10.1145/166266.166287","DOIUrl":"https://doi.org/10.1145/166266.166287","url":null,"abstract":"This paper discusses the architecture and implementation of CMIFed, an editing and presentation environment for hypermedia documents. Typically such documents contain a mixture of text, images, audio, and video (and possibly other media), augmented with user interaction. CMIFed allows the author flexibility in specifying what is presented when, using multiple simultaneous output channels. Unlike systems that use a timeline or scripting metaphor to control the presentation, in CMIFed the user manipulates a collection of events and timing constraints among those events. Common timing requirements can be specified by grouping events together in a tree whose nodes indicate sequential and parallel composition. More general timing constraints between events can be added in the form of synchronization arcs. User interaction is supported in the form of hyperlinks. We place CMIFed in the context of the CMIF model for hypermedia documents, which formalizes the properties of hypermedia presentations in a platform-independent manner. CR Subject Classification (1991): H.5.1, H.5.2, I.7.2, I.3.6, I.3.4, D.4.1, D.4.4, D.4.7.","PeriodicalId":412458,"journal":{"name":"MULTIMEDIA '93","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127672826","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}
Object-oriented application frameworks help software engineers develop sophisticated interactive applications quickly and reduce maintenance costs significantly. An application framework provides, among others, predefined visual classes for text or graphics display and for user interaction elements, as well as integrated control of these elements. Designed before motion video display was technically feasible on desktop computers, these frameworks’ architectures are built around the assumption of relatively slowly changing bitmap images to be displayed on a computer screen. Motion video screen update rates were not anticipated. We extended a typical application framework in a multitasking environment to support motion video display in full generality. The internal architecture of the framework was changed to remove the subtle obstacles for high screen update rates and a data type ‘video’ was designed and integrated seamlessly with the existing visual classes. Our video objects display motion video generated by autonomous hardware or software processes. They may appear in any shape or number mixed with other visual objects in scrollable views, as building blocks in graphics editors, as characters in text editors, as items in list or pop-up menus, etc. Video objects support the full visual class protocol for client-transparent double buffering, cut/copy/paste/undo operations, and output to or input from files. In this paper, we describe the features of these video objects and our changes to the architecture of the application framework necessary to support the new paradigms of motion video.
{"title":"Integrating video into an application framework","authors":"Peter Schnorf","doi":"10.1145/166266.168439","DOIUrl":"https://doi.org/10.1145/166266.168439","url":null,"abstract":"Object-oriented application frameworks help software engineers develop sophisticated interactive applications quickly and reduce maintenance costs significantly. An application framework provides, among others, predefined visual classes for text or graphics display and for user interaction elements, as well as integrated control of these elements. Designed before motion video display was technically feasible on desktop computers, these frameworks’ architectures are built around the assumption of relatively slowly changing bitmap images to be displayed on a computer screen. Motion video screen update rates were not anticipated. We extended a typical application framework in a multitasking environment to support motion video display in full generality. The internal architecture of the framework was changed to remove the subtle obstacles for high screen update rates and a data type ‘video’ was designed and integrated seamlessly with the existing visual classes. Our video objects display motion video generated by autonomous hardware or software processes. They may appear in any shape or number mixed with other visual objects in scrollable views, as building blocks in graphics editors, as characters in text editors, as items in list or pop-up menus, etc. Video objects support the full visual class protocol for client-transparent double buffering, cut/copy/paste/undo operations, and output to or input from files. In this paper, we describe the features of these video objects and our changes to the architecture of the application framework necessary to support the new paradigms of motion video.","PeriodicalId":412458,"journal":{"name":"MULTIMEDIA '93","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128601179","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}
We are investigating alternative transport protocol strategies for realizing large scale dissemination services across a wide area network. Communication requirements of such applications are distinct from those based on conventional client-server interactions. Conventional ow and error control methods based on the retransmissions-with-timeout paradigm are not appropriate for such applications. Instead, we are interested in using optimistic ow and error control strategies that take into account application-speci c error tolerance and media rates of multimedia applications. This paper describes transport level policies that use a combination of redundant transmissions, rate-based ow control, and selective feedback from receivers. A simulation-based performance evaluation demonstrates that relatively simple techniques succeed well in meeting the QOS requirements of a multimedia multicast and in scaling to hundreds of recipients.
{"title":"Optimistic strategies for large-scale dissemination of multimedia information","authors":"R. Yavatkar, Leelanivas Manoj","doi":"10.1145/166266.166267","DOIUrl":"https://doi.org/10.1145/166266.166267","url":null,"abstract":"We are investigating alternative transport protocol strategies for realizing large scale dissemination services across a wide area network. Communication requirements of such applications are distinct from those based on conventional client-server interactions. Conventional ow and error control methods based on the retransmissions-with-timeout paradigm are not appropriate for such applications. Instead, we are interested in using optimistic ow and error control strategies that take into account application-speci c error tolerance and media rates of multimedia applications. This paper describes transport level policies that use a combination of redundant transmissions, rate-based ow control, and selective feedback from receivers. A simulation-based performance evaluation demonstrates that relatively simple techniques succeed well in meeting the QOS requirements of a multimedia multicast and in scaling to hundreds of recipients.","PeriodicalId":412458,"journal":{"name":"MULTIMEDIA '93","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126396706","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}
Jian-Kang Wu, Y. H. Ang, P. Lam, S. Moorthy, A. D. Narasimhalu
Recognition of a human face is very easy even to a child, but is extremely difficult for computers. Here we present a Computer Aided Facial Image Identification, Retrieval and Inference System (CAFIIRIS) for criminal identification. The system stores and manages facial images and criminal records, providing necessary image and text processing, and editing tools. Inference of facial images of different ages of a person is also possible. Access to facial images can be done via key words, fuzzy descriptions, and visual browsing. A facial image database system stores and manages a large amount of facial images together with text-based criminal record. It provides users with a flexible means to manipulate, archive, retrieve, and make use of facial images and text data. The facial images are visual rather than descriptive. Each digital image is a large array of pixels of various sizes, and a facial image database contains thousands or even hundred thousands of images. Therefore, this huge visual database needs special techniques for its management, namely, embedded functions for image pre-processing, feature extraction, presentation (screen display and report formatter); visual access to image data via special indexing techniques; application-specific image inference to derive new images based on images and other available information.
{"title":"Facial image retrieval, identification, and inference system","authors":"Jian-Kang Wu, Y. H. Ang, P. Lam, S. Moorthy, A. D. Narasimhalu","doi":"10.1145/166266.166271","DOIUrl":"https://doi.org/10.1145/166266.166271","url":null,"abstract":"Recognition of a human face is very easy even to a child, but is extremely difficult for computers. Here we present a Computer Aided Facial Image Identification, Retrieval and Inference System (CAFIIRIS) for criminal identification. The system stores and manages facial images and criminal records, providing necessary image and text processing, and editing tools. Inference of facial images of different ages of a person is also possible. Access to facial images can be done via key words, fuzzy descriptions, and visual browsing. A facial image database system stores and manages a large amount of facial images together with text-based criminal record. It provides users with a flexible means to manipulate, archive, retrieve, and make use of facial images and text data. The facial images are visual rather than descriptive. Each digital image is a large array of pixels of various sizes, and a facial image database contains thousands or even hundred thousands of images. Therefore, this huge visual database needs special techniques for its management, namely, embedded functions for image pre-processing, feature extraction, presentation (screen display and report formatter); visual access to image data via special indexing techniques; application-specific image inference to derive new images based on images and other available information.","PeriodicalId":412458,"journal":{"name":"MULTIMEDIA '93","volume":"190 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122360938","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}
Video compositing is the editing and integrating of many video images into a single presentation. Several single-user compositing systems have already been suggested, but the multiple users problem remains unstudied. We propose two new architectures for digital video compositing in a multiuser environment that are both memory efficient and can operate in real-time. We show that under hard throughput and bandwidth constraints, a memoryless solution for transferring data from many video sources to many users does not exist. We overcome this using (i) a dynamic memory buffering architecture ; and (ii) a constant memory bandwidth solution that transforms the sources-to-users transfer schedule into 2 schedules, then pipelines the computation. The architectures support opaque overlapping of images, arbitrarily shaped images, and images whose shapes dynamically change from frame to frame.
{"title":"Architectures for multi-source multi-user video compositing","authors":"L. C. Yun, D. G. Messerschmidt","doi":"10.1145/166266.166291","DOIUrl":"https://doi.org/10.1145/166266.166291","url":null,"abstract":"Video compositing is the editing and integrating of many video images into a single presentation. Several single-user compositing systems have already been suggested, but the multiple users problem remains unstudied. We propose two new architectures for digital video compositing in a multiuser environment that are both memory efficient and can operate in real-time. We show that under hard throughput and bandwidth constraints, a memoryless solution for transferring data from many video sources to many users does not exist. We overcome this using (i) a dynamic memory buffering architecture ; and (ii) a constant memory bandwidth solution that transforms the sources-to-users transfer schedule into 2 schedules, then pipelines the computation. The architectures support opaque overlapping of images, arbitrarily shaped images, and images whose shapes dynamically change from frame to frame.","PeriodicalId":412458,"journal":{"name":"MULTIMEDIA '93","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126346789","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}
L. Delgrossi, C. Halstrick, D. Hehmann, R. Herrtwich, O. Krone, J. Sandvoss, C. Vogt
HeiTS, the Heidelberg Transport System, is a multimedia communication system for real-time delivery of digital audio and video. HeiTS operates on top of guaranteed-performance networks that apply resource reservation techniques. To make HeiTS also work with networks for which no reservation scheme can be realized (for example, Ethernet or existing internetworks), we implement an extension to HeiTS which performs media scaling at the transport level: The media encoding is modified according to the bandwidth available in the underlying networks. Both transparent and non-transparent scaling methods are examined. HeiTS lends itself to implement transparent temporal and spatial scaling of media streams. At the HeiTS interface, functions are provided which report information on the available resource bandwidth to the application so that non-transparent scaling methods may be used, too. Both a continuous and discrete scaling solution for HeiTS are presented. The continuous solution uses feedback messages to adjust the data flow. The discrete solution also exploits the multipoint network connection mechanism of HeiTS. Whereas the first method is more flexible, the second technique is better suited for multicast scenarios. The combination of resource reservation and media scaling seems to be particularly well-suited to meet the varying demands of distributed multimedia applications.
{"title":"Media scaling for audiovisual communication with the Heidelberg transport system","authors":"L. Delgrossi, C. Halstrick, D. Hehmann, R. Herrtwich, O. Krone, J. Sandvoss, C. Vogt","doi":"10.1145/166266.166277","DOIUrl":"https://doi.org/10.1145/166266.166277","url":null,"abstract":"HeiTS, the Heidelberg Transport System, is a multimedia communication system for real-time delivery of digital audio and video. HeiTS operates on top of guaranteed-performance networks that apply resource reservation techniques. To make HeiTS also work with networks for which no reservation scheme can be realized (for example, Ethernet or existing internetworks), we implement an extension to HeiTS which performs media scaling at the transport level: The media encoding is modified according to the bandwidth available in the underlying networks. Both transparent and non-transparent scaling methods are examined. HeiTS lends itself to implement transparent temporal and spatial scaling of media streams. At the HeiTS interface, functions are provided which report information on the available resource bandwidth to the application so that non-transparent scaling methods may be used, too. Both a continuous and discrete scaling solution for HeiTS are presented. The continuous solution uses feedback messages to adjust the data flow. The discrete solution also exploits the multipoint network connection mechanism of HeiTS. Whereas the first method is more flexible, the second technique is better suited for multicast scenarios. The combination of resource reservation and media scaling seems to be particularly well-suited to meet the varying demands of distributed multimedia applications.","PeriodicalId":412458,"journal":{"name":"MULTIMEDIA '93","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124148341","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}
A traditional static document has a spatial layout that indicates where objects in the document appear. Because multimedia documents incorporate time, they also require a temporal layout, or schedule, that indicates when events in the document occur. This paper argues that multimedia document systems should provide mechanisms for automatically producing temporal layouts for documents. The major advantage of this approach is that it makes it easier for authors to create and modify multimedia documents. This paper constructs a framework for understanding automatic temporal formatters and explores the basic issues surrounding them. It also describes the Firefly multimedia document system, which has been developed to test the potential of automatic temporal formatting.
{"title":"Automatic temporal layout mechanisms","authors":"M. C. Buchanan, P. Zellweger","doi":"10.1145/166266.168415","DOIUrl":"https://doi.org/10.1145/166266.168415","url":null,"abstract":"A traditional static document has a spatial layout that indicates where objects in the document appear. Because multimedia documents incorporate time, they also require a temporal layout, or schedule, that indicates when events in the document occur. This paper argues that multimedia document systems should provide mechanisms for automatically producing temporal layouts for documents. The major advantage of this approach is that it makes it easier for authors to create and modify multimedia documents. \u0000 \u0000This paper constructs a framework for understanding automatic temporal formatters and explores the basic issues surrounding them. It also describes the Firefly multimedia document system, which has been developed to test the potential of automatic temporal formatting.","PeriodicalId":412458,"journal":{"name":"MULTIMEDIA '93","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129441092","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}
This paper presents a novel approach to processing encoded video sequences prior to decoding. Scene changes may be easily detected using DCT coefficients in JPEG and MPEG encoded video sequences. In addition, by analyzing the DCT coefficients, regions of interest may be isolated prior to decompression, increasing efficiency of any subsequent image processing steps, such as edge detection. The results are currently used in a video browser, and are part of an ongoing research project in creating large video databases. The procedure is presented in detail and several examples are exhibited.
{"title":"Image processing on compressed data for large video databases","authors":"F. Arman, A. Hsu, M. Chiu","doi":"10.1145/166266.166297","DOIUrl":"https://doi.org/10.1145/166266.166297","url":null,"abstract":"This paper presents a novel approach to processing encoded video sequences prior to decoding. Scene changes may be easily detected using DCT coefficients in JPEG and MPEG encoded video sequences. In addition, by analyzing the DCT coefficients, regions of interest may be isolated prior to decompression, increasing efficiency of any subsequent image processing steps, such as edge detection. The results are currently used in a video browser, and are part of an ongoing research project in creating large video databases. The procedure is presented in detail and several examples are exhibited.","PeriodicalId":412458,"journal":{"name":"MULTIMEDIA '93","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132863995","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}
Fundamental problems will confront those who wish to take full advantage of the power of tomorrow`s multimodal environments. We argue that our recently introduced concept of meta-widget, when embedded within a high level, networked user interface server, can support the effective implementation of complex multimedia applications. We develop algorithms which enable a multimodal system to select the ``best`` combination of representations for the various ``information packets`` in a display at any moment. If no acceptable - combination of available representations can be found, strategies are provided for creating a new and useful, if not beautiful, representation to resolve the impasse. A running example is provided to motivate and clarify the discussion.
{"title":"Programming the multimodal interface","authors":"E. Glinert, M. Blattner","doi":"10.1145/166266.166288","DOIUrl":"https://doi.org/10.1145/166266.166288","url":null,"abstract":"Fundamental problems will confront those who wish to take full advantage of the power of tomorrow`s multimodal environments. We argue that our recently introduced concept of meta-widget, when embedded within a high level, networked user interface server, can support the effective implementation of complex multimedia applications. We develop algorithms which enable a multimodal system to select the ``best`` combination of representations for the various ``information packets`` in a display at any moment. If no acceptable - combination of available representations can be found, strategies are provided for creating a new and useful, if not beautiful, representation to resolve the impasse. A running example is provided to motivate and clarify the discussion.","PeriodicalId":412458,"journal":{"name":"MULTIMEDIA '93","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130486909","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
扫码关注我们
求助内容：
应助结果提醒方式：