5738405
Zodiac: A history-based interactive video authoring system
Abstract. Easy-to-use audio/video authoring tools play a crucial role in moving multimedia software from research curiosity to mainstream applications. However, research in multimedia authoring systems has rarely been documented in the literature. This paper describes the design and implementation of an interactive video authoring system called Zodiac, which employs an innovative edit history abstraction to support several unique editing features not found in existing commercial and research video editing systems. Zodiac provides users a conceptually clean and semantically powerful branching history model of edit operations to organize the authoring process, and to navigate among versions of authored documents. In addition, by analyzing the edit history, Zodiac is able to reliably detect a composed video stream's shot and scene boundaries, which facilitates interactive video browsing. Zodiac also features a video object annotation capability that allows users to associate annotations to moving objects in a video sequence. The annotations themselves could be text, image, audio, or video. Zodiac is built on top of MMFS, a file system specifically designed for interactive multimedia development environments, and implements an internal buffer manager that supports transparent lossless compression/decompression. Shot/scene detection, video object annotation, and buffer management all exploit the edit history information for performance optimization.
6822991
An Integrated Pipeline of Decompression, Simplification and Rendering for Irregular Volume Data
Very large irregular-grid volume data sets are typically represented as tetrahedral mesh and require substantial disk I/O and rendering computation. One effective way to reduce this demanding resource requirement is compression. Previous research showed how rendering and decompression of a losslessly compressed irregular-grid data set can be integrated into a one-pass computation. This work advances the state of the art one step further by showing that a losslessly compressed irregular volume data set can be simplified while it is being decompressed and that simplification, decompression, and rendering can again be integrated into a pipeline that requires only a single pass through the data sets. Since simplification is a form of lossy compression, the on-the-fly volume simplification algorithm provides a powerful mechanism to dynamically create versions of a tetrahedral mesh at multiple resolution levels directly from its losslessly compressed representation, which also corresponds to the finest resolution level. In particular, an irregular-grid volume renderer can exploit this multi-resolution representation to maintain interactivity on a given hardware/software platform by automatically adjusting the amount of rendering computation that could be afforded, or performing so called time-critical rendering. The proposed tetrahedral mesh simplification algorithm and its integration with volume decompression and rendering has been successfully implemented in the Gatun system. Performance measurements on the Gatun prototype show that simplification only adds less than 5% of performance overhead on an average and with multi-resolution pre-simplification the end-to-end rendering delay indeed decreases in an approximately linear fashion with respect to the simplification ratio.
35542914
A Decoupled Architecture for Application-Specific File Prefetching
6374629
A Multimedia Synchronization Model and Its Implementation in Transport Protocols
An implementation of a synchronization mechanism in transport protocol to support multimedia applications over a packet or cell switched network is proposed. In designing such a mechanism for practical use, ease of implementation and capability of handling random delay of packets are two key issues for success. Since the random delay of packet or cell switched networks makes synchronization among media more complicated after the transmission across the network, a model which considers the random transmission delay is hence required to specify the temporal relationship among media. Therefore, a real-time synchronization model is presented to satisfy this requirement in the paper. Based on the proposed synchronization model, a transport protocol, namely the multimedia synchronization transport protocol (MSTP), is designed and implemented. We have implemented a prototype system using the MSTP protocol and built a simulation system for the wide area network (WAN) environment in order to evaluate the performance of the MSTP protocol.
17968973
Authoring Cases from Free-Text Maintenance Data
Automatically authoring or acquiring cases in the case-based reasoning (CBR) systems is recognized as a bottleneck issue that can determine whether a CBR system will be successful or not. In order to reduce human effort required for authoring the cases, we propose a framework for authoring the case from the unstructured, free-text, historic maintenance data by applying natural language processing technology. This paper provides an overview of the proposed framework, and outlines its implementation, an automated case creation system for the Integrated Diagnostic System. Some experimental results for testing the framework are also presented.
6654135
Finding interesting associations without support pruning
Association rule mining has heretofore relied on the condition of high support to do its work efficiently. In particular, the well-known a-priori algorithm is only effective when the only rules of interest are relationships that occur very frequently. However, there are a number of applications, such as data mining, identification of similar Web documents, clustering and collaborative filtering, where the rules of interest have comparatively few instances in the data. In these cases, we must look for highly correlated items, or possibly even causal relationships between infrequent items. We develop a family of algorithms for solving this problem, employing a combination of random sampling and hashing techniques. We provide an analysis of the algorithms developed and conduct experiments on real and synthetic data to obtain a comparative performance analysis.
42663338
Automatic curve fitting with quadratic B-spline functions and its applications to computer-assisted animation
Abstract Automatic fitting to digitized curves by quadratic B-spline functions is discussed. Due to its simplicity, it is possible to find a quick fit within a given error tolerance bound which is defined as the maximum distance between the fitted curve and the original curve. Again due to the simple form of a quadratic polynomial, some complicated computations in computer-assisted animation such as hidden line removal can also be easily handled.
15244741
Automated Case Base Creation and Management
In this paper, we report on a scheme for automated case base creation and management. The scheme aims at reducing the difficulty and human effort required for case creation. This paper provides an overview of the proposed scheme and outlines its technical implementation as an automated case creation system for the Integrated Diagnostic System. Some experimental results for testing the scheme and an interactive tool for evaluating the constructed case base are presented.