17359946
Optimized Cross-Layer Design for Scalable Video Transmission Over the IEEE 802.11e Networks
A cross-layer design for optimizing 3-D wavelet scalable video transmission over the IEEE 802.11e networks is proposed. A thorough study on the behavior of the IEEE 802.11e protocol is conducted. Based on our findings, all timescales rate control is developed featuring a unique property of soft capacity support for multimedia delivery. The design consists of a macro timescale and a micro timescale rate control schemes residing at the application layer and the network sublayer respectively. The macro rate control uses bandwidth estimation to achieve optimal bit allocation with minimum distortion. The micro rate control employs an adaptive mapping of packets from video classifications to appropriate network priorities which preemptively drops less important video packets to maximize the transmission protection to the important video packets. The performance is investigated by simulations highlighting advantages of our cross-layer design.
43457446
Synthesis of facial expressions using a 3D anatomical model
In this paper we propose an individualized 3D facial model constructed from the anatomical perspective for realistic facial expression synthesis. Our model incorporates a physically-based approximation to facial skin tissue, a set of anatomically-motivated facial muscle actuators and underlying skull structure. The skin is modeled as a multi-layer mass-spring lattice by taking into account the nonlinear stress-strain relationship of the real skin. The 3D face model incorporates a skull structure which extends the scope of facial motion and facilitates facial muscle definition. The automatic facial muscle construction is achieved by using an efficient muscle mapping approach that ensures different muscles to be located at the anatomically correct positions between the skin and skull layers. For computational efficiency, we devise a semi-implicit integration method to numerically solve the governing dynamics. The dynamic facial animation algorithm runs at an interactive rate with realistic facial expressions to be synthesized.
45254253
A physically-based model for real-time facial expression animation
In this paper we propose a physically-based 3D dynamic facial model based on anatomical knowledge for facial expression animation. The facial model incorporates a physically-based approximation to facial skin and a set of anatomically-motivated facial muscles. The skin model is established through the use of a mass-spring system with nonlinear springs which simulate the elastic dynamics of a real facial skin. Facial muscle models are developed to emulate facial muscle contraction. Lagrangian mechanics governs the dynamics, dictating the deformation of facial surface in response to muscle forces. The dynamic facial modeling algorithm runs at interactive rate with continuous 3D display on a graphics workstation. Using our system, we can effectively synthesize realistic facial expressions and analyze tile relationship between facial surface deformation and the activation of underlying facial muscles.
31519303
Data-Driven Facial Feature Morphing for 3D Face Synthesis
59703933
Anatomy-based 3D facial modeling for expression animation
In this paper we propose a new hierarchical 3D facial model that conforms to the human facial anatomy for realistic facial expression animation. The facial model has a hierarchical biomechanical structure, incorporating a physically-based approximation to facial skin tissue, a set of anatomically-motivated facial muscle actuators and underlying skull structure. The deformable skin model has multi-layer structure to approximate different types of soft tissue. It takes into account the nonlinear stress-strain relationship of the skin and the fact that soft tissue is almost incompressible. Different kinds of muscle models have been developed to simulate the distribution of the muscle force on the skin due to muscle contraction. By the presence of the skull model, our facial model takes advantage of both more accurate facial deformation and the consideration of facial anatomy during the interactive definition of facial muscles. Under the muscular force, the deformation of the facial skin is evaluated by solving the governing dynamic equation numerically. To improve computational efficiency, we use a localized, semi-implicit integration method which allows a larger time step to be taken in the simulation while retaining stability. The dynamic facial animation algorithm runs at an interactive rate with flexible and realistic facial expressions to be generated.
39711298
Data-Driven Feature Control Models for Creating Virtual Faces
This paper presents a novel data-driven method for creating realistic face models based on estimated high-level feature control models. Our method takes as examples 3D face scans. By bringing scanned models into full correspondence with a model fitting approach, we apply principal component analysis (PCA) to the exemplar shapes of each facial feature to build a shape space. We compute a set of face anthropometric measurements to parameterize example feature shapes in the measurement spaces. Using the PCA coefficients as a compact shape representation, we approach the shape synthesis problem by forming scattered data interpolation functions that are devoted to the generation of desired shape by taking the anthropometric parameters as input. The correspondence among all exemplar textures is obtained by parameterizing a 3D generic mesh over a 2D image domain. The new feature texture with desired attributes is synthesized by interpolating the example textures.
5397904
Modeling and Throughput Analysis for Wireless Ad Hoc Networks
This paper presents a novel analytical model for wireless ad hoc networks. Based on the strong points in the literature, an accurate performance model for IEEE 802.11 MAC protocol is proposed. Moreover, by introducing the properties of spatial reuse, we extend the proposed model to support the throughput analysis of wireless ad hoc networks with directional antenna. An extensive set of simulations and numerical calculations validate our model by showing high accurate results.
2930673
Adaptive Security Dialogs for Improved Security Behavior of Users
Despite the increasing awareness of the importance of security for daily computer users, we see that many users still fail to behave securely when confronted with a security-related decision. In this paper, we introduce a new approach to security-related dialogs called Adaptive Security Dialogs (ASD). This approach is a combination of a new architecture and a new way of interacting with users to provide them with appropriate and effective security dialogs. ASD realizes this goal by matching the complexity and intrusiveness of security-related dialogs to the risk associated with the decision the user is making. This results in an architecture in which users can focus on their tasks, get (immediate) feedback on their decisions, and interact with dialogs with an appropriate complexity and appearance for the decision's associated risk. This paper makes the following three contributions. First, we introduce a general architecture for handling security-related decisions. Second, through an empirical user study using a web-based e-mail client, we show significant improvement in the care exercised by our participants without sacrificing usability. Third, we describe how the different pieces of existing research fit into the bigger picture of improving users' behavior.
36214906
New routing algorithms in trustworthy Internet
Since the lack of source IP address checking in today's Internet makes it easy for the attackers to spoof the source address, the mechanism of Source Address Validation Architecture (SAVA) is proposed for building effective source-address validation to ensure that packets forwarded hold authentic source addresses. In this paper, we study the routing selection in partial deployment of SAVA nodes in the trustworthy Internet. We propose and compare three routing algorithms, i.e., Shortest-Path Algorithm (SPA), SAVA based Shortest-Path Algorithm (SSPA), and SAVA based Shortest-Path Algorithm with Load Balancing (SSPALB). Beside analytical results, we run simulations which met our expectations.
1039556
Indexing Noncrashing Failures: A Dynamic Program Slicing-Based Approach
Recent software systems usually feature an automated failure reporting component, with which a huge number of failures are collected from software end-users. With a proper support of failure indexing, which identifies failures due to the same fault, the collected failure data can help developers prioritize failure diagnosis, among other utilities of the failure data. Since crashing failures can be effectively indexed by program crashing venues, current practice has seen great success in prioritizing crashing failures. A recent study of bug characteristics indicates that as excellent memory checking tools are widely adopted, semantic bugs and the resulting noncrashing failures have become dominant. Unfortunately, the problem of how to index non-crashing failures has not been seriously studied before. In previous study, two techniques have been proposed to index noncrashing failures, and they are T-Proximity and R-Proximity. However, as T-Proximity indexes failures by the profile of the entire execution, it is generally not effective because most information in the profile is fault-irrelevant. On the other hand, although R-Proximity is more effective than T-Proximity, it relies on a sufficient number of correct executions that may not be available in practice. In this paper, we propose a dynamic slicing-based approach, which does not require any correct executions, and is comparably effective as R-Proximity. A detailed case study with gzip is reported, which clearly strates the advantages of the proposed approach.
41646301
A Comparison of Broadcast Strategy in MIMO Relay Networks
In this paper, the sum rate issue of a multiple-input multiple-output (MIMO) relay broadcast channel is studied, where the fixed relay station is used to support multiuser transmission in a downlink channel. With appropriate design, the sum rate can be expressed as a function of the processing units at the base station (BS) and relay, and the power allocation can be converted to a standard convex problem. We compared the sum rate of MIMO relay broadcast channel (BC) using time division multiple access (TDMA) to the strongest user, dirty paper coding (DPC) and beamforming (BF) when multiple antennas are deployed at each terminal in the system and separate power constraints at the BS and relay. Then, the sum rate bounds for each strategy and the sum capacity (achieved by DPC) gain over TDMA and BF are given, correspondingly. Finally, numerical results are presented to prove our discussions. With these results, we can easily obtain how far away TDMA and BF are from being optimal in terms of sum rate, and direct the practical system design.