15686205
Transform coding of arbitrarily-shaped image segments
Envisioned advanced multimedia video services include both rectangular and arbitrarily-shaped image segments. Image segments of the TV weather reporter produced by the chromo-key technique and image segments produced by video segmentation or image editing are typical examples. In this paper, we investigate efficient transform coding techniques of arbitrarily-shaped image segments. We formulate the optimal representation problem in two different domains — the full rectangular domain and the shape-projected domain. In the former, we still use the traditional rectangular transform coding method (e.g. DCT) but try to find optimal pixel values outside the segment boundary in order to make the transform spectrum as compact as possible. A simple but efficient mirror-image extension technique is proposed. In the shape-projected domain, we project the image segment and all basis functions into the subspace spanned over the image region only. Existing coding algorithms, such as orthogonal transform by Gilge [1] and iterative coding by Kaup and Aach [2], can be intuitively interpreted. To demonstrate the flexibility of the proposed formulation, we also derive a new KLT-like algorithm in the shape-projected domain. We analyze tradeoff between compression performance, computational complexity, and codec complexity for different coding schemes. Simulation results show that complicated algorithms (e.g. iterative, adaptive) can improve the quality by about 5-10 dB at some computational or hardware cost. On the other hand, the proposed simple mirror-image extension technique improves the quality by about 3-4 dB without any overheads. The contributions of this paper lie in efficient problem formulation, new transform coding techniques, and numerical tradeoff analyses. Currently, we are implementing a software program for AS image object editing and manipulation .
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.
34016873
Parsing 2D Languages by a Pictorial GLR Parser
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.
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.
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.
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.
14323284
A Delphi examination of public sector ERP implementation issues
A Delphi survey of ERP life cycle management issues was conducted within five agencies of the Queensland government. The five agencies each implemented SAP Financials at around the same time using the services of a common implementation partner. Responses were elicited from ERP project participants, from managers at the agencies, and from users of the financial systems. Valid questionnaires were returned from 61respondents in the first round survey (response rate = 55%) and yielded 274 perceived issues. Through two rounds of the Delphi survey, these issues have been summarized and categorized into 10 major issue categories (with 38 sub-issues). The final survey round in which respondents will assign weights to these issues is currently underway. Lessons drawn from this study will assist in understanding the ERP life cycle and specific characteristics of the public sector ERP life cycle, and will provide insights into the strengths and weaknesses of ERP systems for public sector organizations.
18088728
Order Consolidation for Batch Processing
We consider the batch processing of orders where either whole or part of a single order or a specific pair of different orders may be grouped in a batch with a fixed capacity. The problem can be modelled by a graph G = (V,E), where each node v$${\in}$$V corresponds to an order, its weight w(v) corresponds to the amount of ordered quantity and a pair of orders, say u and v may be grouped in a batch if there exists the edge (u,v) $${\in}$$E. The objective is to maximize the number of batches filled up to its capacity $$\lambda$$. In this paper, we prove that the problem is NP-hard and, moreover, that no PTAS exists unless P = NP. Then, an optimal algorithm is developed with running time O(|V|log |V|) for the special case when G is a tree.