206803869
Compressed-domain techniques for image/video indexing and manipulation
As massive amount of visual materials are captured and stored in visual information systems, effective and efficient image indexing and manipulation techniques are required. Most visual materials in visual information systems are stored in some compressed forms. Therefore, it is desirable to explore image technologies for feature extraction and image manipulation in the compressed domain. In other words, image feature extraction and manipulation are performed on compressed images/video without decoding, or with minimal decoding only. Although the compressed-domain approach imposes many constraints, it provides great potential for reducing computational complexity, because of reduction of the amount of data after compression. This paper provides an overview of our research in this area. Specifically, it describes the results and the future directions of our work on compressed-domain texture feature extraction, image matching, image manipulation, and video indexing.
35519508
Extending Visual Languages for Multimedia
Visual languages, which let users customize iconic sentences, can be extended to accommodate multimedia objects, letting users access media dynamically. Teleaction objects, or multimedia objects with knowledge structures, can be designed using visual languages to automatically respond to events and perform tasks like "find related books" in a virtual library.
15816324
Multi-level specification and protocol design for distributed multimedia communication
The major challenge in the design of an efficient distributed multimedia system is the integration and support of a wide variety of applications. Investigating the basic issues involved in the design and specification of distributed muttimcdia systems is the focus of this paper. A basic layered network architecture is proposed as the uniform framework for the investigation of different levels of functionality typically associated with the communication network that supports multimedia communication. Within this framework, we propose to identify the communication requirements for multimedia applications and characterize a set of communication primitives which specify different qualities of scrvicc to reflect different real-time rcquircmcnts. ‘Ilis investigation is guided by an efficient and flexible multi-level specification model. We will characterize this model and show that the model can be amenable to the construction of a set of communication primitives that support synchronization and communication of multimedia applications.
39945679
Iconic Language Design for People with Significant Speech and Multiple Impairments
17298481
Iconic language design for people with significant speech and multiple impairments
We present an approach of iconic language design for people with significant speech and multiple impairments (SSMI), based upon the theory of Icon Algebra and the theory of Conceptual Dependency (CD) to derive the meaning of iconic sentences. An interactive design environment based upon this methodology is described.
34016873
Parsing 2D Languages by a Pictorial GLR Parser
17634440
An optimal cache algorithm for streaming VBR video over a heterogeneous network
High quality video content for on-demand services is usually stored and streamed in a compressed format with a VBR (variable bit rate) property; however, the streaming traffic is extremely bursty. If there is no client buffer to regulate the video's delivery, the backbone WAN (wide area network) bandwidth needs to allocate the video's peak bit rate to guarantee playback quality. To reduce the bandwidth requirement in the backbone WAN, previous researchers have proposed a Video Staging Mechanism to cache portions of the video in a video proxy close to clients. In this paper, we propose a very effective OC (optimal cache) algorithm to handle the Video Staging Mechanism and prove theoretically that the proxy cache computed by our OC algorithm for each video is minimal when all other resources remain constant. On the basis of experiment results, we cache the least amount of video data in the video proxy by using the OC algorithm, and reduce the WAN bandwidth requirement by an amount equal to that of conventional algorithms. In contrast, given the equal size of the storage in a video proxy, the OC algorithm reduces the bandwidth requirement in the backbone WAN much more than conventional algorithms.
43612588
Priority-Based Internet Access Control for Fairness Improvement and Abuse Reduction
In this paper, we exploit a prioritized-service architecture and apply a priority based traffic control scheme to reduce abusive Internet access, improve fairness among users and study users' behavior under a prioritized service for Internet access. The Internet access by dormitory users of National Taiwan University (NTU) serves as a conveyer problem. There are two classes of service. The regular class has a volume quota for each user, which is designed to meet majority users' essential demands while limiting abusive usage of quality service. The custody class is lower in service priority with no volume quota limitation. Our mathematical models for design and analysis include individual and aggregate user demand models and a network performance model. The priority control scheme is implemented over an existing NTU dormitory network with additions of a QoS router, a meter reading server, an accounting server and a user interface server. The control leads to 48.9% reduction in average packet drop rate, 42.2% improvement in a fairness measure, reduction of abusive Internet access by 57.82% and 145.09% Internet access increase in majority users. Such results are quite consistent with predictions of our mathematical models.
16824799
A heuristic method for self‐healing ring design in a single‐homing cluster
In this paper, we consider a SONET (Synchronous Optical NETwork) USHR (Uni‐directional Self‐Healing Ring) design problem for a single‐homing cluster, i.e., a cluster with a single designated hub. The problem is formulated as a nonlinear integer programming problem and a branch and bound heuristic method based on the Lagrangian relaxation and subgradient optimization technique is proposed to handle the problem. In solving any ring design problem, we should deal with two different aspects of the ring design, namely, the ring routing aspect and the ring loading aspect. Both of these two aspects are well integrated and represented in our model. Such an integrated formulation has not been proposed in the existing literature mainly due to its computationally intractable complexity. In order to cope with such complexity, a preprocessing technique for reducing the complexity and several branch and bound strategies are proposed. The efficiency of the proposed method is tested through computational experiments. For the computational experiments, test problems are generated using the data obtained from the actual topologies in Seoul, Korea. The computational experiments show that the proposed method yields near‐optimum designs within reasonable computation time.
28693312
A new architecture for motion-compensated image coding
Abstract In motion-compensated image coding (MCIC), the block matching algorithm requires a very complex computational procedure. To overcome this problem, several fast search procedures have been proposed. However, the resultant errors for these procedures may be too large unless small displacement is assumed. In order to reduce the computational complexity and preserve the quality of the original image, a new architecture for MCIC without the small displacement assumption is proposed in this paper. Based on a so-called characteristic mapping, certain important features of the block will be extracted and matched in the space of features. Hence, the procedure of matching any two blocks is very much simplified and the time required is drastically reduced. Moreover, the simulation results indicate that its performance is superior to those fast search procedures based on the error between the reconstructed image and the original one. This property will result in low bit rates for transmitting the error frame.
44477744
Efficient selection of scheduling rule combination by combining design of experiment and ordinal optimization-based simulation
In a fab with heterogeneous machine groups, the number of scheduling policies grows in a combinatorial way because each machine group has its specific dispatching rules. In this paper, we design a fast simulation methodology by an innovative combination of the notions of ordinal optimization (OO) and design of experiments (DOE) to efficiently select a good scheduling policy for fab operation, Instead of finding the exact performance among scheduling policies, our approach compares their relative orders of performance to a specified level of confidence. The DOE method is exploited to largely reduce the number of scheduling policies to be evaluated by the OO-based simulation. Simulation results of applications to scheduling wafer fabrications show that most of the OO-based DOE simulations require 2 to 3 orders of magnitude less computation time than those of traditional approach, and the speedup is up to 7,000 times in certain cases.