Curvature tells much about details of surfaces and is studied widely by researchers in the computer graphics com- munity. In this paper, we first explain the mean-curvature view of Dirichlet energy of triangular surfa...
详细信息
Curvature tells much about details of surfaces and is studied widely by researchers in the computer graphics com- munity. In this paper, we first explain the mean-curvature view of Dirichlet energy of triangular surfaces and introduce a curvature representation of details, and then present surfaces editing applications based on their curvature representation. We apply our method to surfaces with complex boundaries and rich details. Results show the validity and robustness of our method and dem- onstrate curvature map can be a helpful surfaces detail representation.
We present an efficient approach that merges the virtual objects into video sequences taken by a freely moving camera in a realistic manner. The composition is visually and geometrically consistent through three main ...
详细信息
This paper implements a digital dictionary system on the mobile platform and proposes a novel algorithm for the wildcard search problem. Our approach, which is based on the advanced trie tree, performs the wildcard se...
详细信息
Modeling complex architectures is quite challenging. We introduce a novel intelligent system, which can generate semi-style or semi-structure Chinese ancient architectures automatically. By using an ontology based app...
详细信息
Sequential point trees provide the state-of-the-art technique for rendering point models, by re-arranging hierarchical points sequentially according to geometric errors running on GPU for fast rendering. This paper pr...
详细信息
Sequential point trees provide the state-of-the-art technique for rendering point models, by re-arranging hierarchical points sequentially according to geometric errors running on GPU for fast rendering. This paper presents a view dependent method to augment sequential point trees by embedding the hierarchical tree structures in the sequential list of hierarchical points. By the method, two kinds of indices are constructed to facilitate the points rendering in an order mostly from near to far and from coarse to fine. As a result, invisible points can be culled view-dependently in high efficiency for hardware acceleration, and at the same time, the advantage of sequential point trees could be still fully taken. Therefore, the new method can run much faster than the conventional sequential point trees, and the acceleration can be highly promoted particularly when the objects possess complex occlusion relationship and viewed closely because invisible points would be in a high percentage of the points at finer levels.
Based on the newly appeared image editing and image processing techniques, a novel interactive, computer-assisted system is proposed for facial synthesis. This paper presents the architecture of this facial synthesis ...
详细信息
ISBN:
(纸本)3540334238
Based on the newly appeared image editing and image processing techniques, a novel interactive, computer-assisted system is proposed for facial synthesis. This paper presents the architecture of this facial synthesis system and gives a detailed description of the four key modules. The techniques used in these modules are also particularized. First, graph cut algorithm is used to automatically select region. Then gradient domain fusion is used to get better result. Finally, k-means method is used to improve efficiency. The experimental results show that our experimental facial synthesis system can produce visually good synthesized face images.
This paper presents a novel interactive mesh deformation method that can achieve various dynamic material effects, including elastic membrane and cloth effects. In our framework, a mesh is encoded by some differential...
详细信息
The detection of failures is a fundamental issue for fault tolerance in distributed systems. Recently, many people have come to realize that failure detection ought to be provided as some form of generic service, simi...
详细信息
ISBN:
(纸本)0769524664
The detection of failures is a fundamental issue for fault tolerance in distributed systems. Recently, many people have come to realize that failure detection ought to be provided as some form of generic service, similar to IP address lookup. However, this has not been successful so far;one of the reasons being the fact that classical failure detectors were not designed to satisfy several application requirements simultaneously. More specifically, traditional implementations of failure detectors are often tuned for running over local networks and fail to address some important problems found in wide-area distributed systems with a large number of monitored components. In this paper, we study the quality of service (QoS) of failure detectors. We first present a novel failure detector scheme combined with control theory that can help in solving or optimizing some problems. Furthermore, this paper discusses the design and analysis of implementing a scalable failure detection service for such large wide-area distributed systems considering dynamically adjusting the heartbeat streams, so that it satisfies the bottleneck router requirements. We further show how the online failure detector control algorithm can be used to design a controller, analyze the theoretical aspects of the proposed algorithm and verify its agreement. Simulation results show the efficiency of our scheme in terms of high utilization of the bottleneck link fast response and good stability of the bottleneck router buffer occupancy as well as of the controlled sending rates. In conclusion, the new failure detector algorithm provides a better QoS than an algorithm that is proposed by Stelling et al [1, 2].
A major unsolved problem in human-like agent is the construction and application of realistic human facial expression models. Human-like agents should interact with human by recognizing human facial expression and syn...
详细信息
In this paper, we propose a new scheme for marker-driven free form global mesh deformation without manually establishing a skeleton orfreeform deformation domain beforehand. It allows a user to deform a given mesh int...
详细信息
暂无评论