39158542
A New Algorithm of Gray Watermark Embedding
The problems of the digital information transmission safety, its’ copyright protection etc. are seriously increase. Digital watermark is one of the good solutions for many problems mentioned above. Generally the watermark information is a one-dimension random signal. Two-dimension gray watermark is difficult to guarantee the robustness of the information embedding. Put a new kind of discrete wavelet transform (DWT) and the singular value decompose (SVD) on two-dimension gray watermark, the watermark becomes very strong robust to the compression, noise, low pass filter, high pass filter and median filter. It is useful for the safety of digital information transmission and its copyright protection.
7524507
Video retargeting: automating pan and scan
When a video is displayed on a smaller display than originally intended, some of the information in the video is necessarily lost. In this paper, we introduce Video Retargeting that adapts video to better suit the target display, minimizing the important information lost. We define a framework that measures the preservation of the source material, and methods for estimating the important information in the video. Video retargeting crops each frame and scales it to fit the target display. An optimization process minimizes information loss by balancing the loss of detail due to scaling with the loss of content and composition due to cropping. The cropping window can be moved during a shot to introduce virtual pans and cuts, subject to constraints that ensure cinematic plausibility. We demonstrate results of adapting a variety of source videos to small display sizes.
111120849
Generic Carrier-Based Core Model for Four-Terminal Double-Gate MOSFET Valid for Symmetric, Asymmetric, SOI, and Independent Gate Operation Modes
A generic carrier-based core model for undoped four-terminal double-gate (DG) MOSFET valid for symmetric, asymmetric, SOI, and independent gate operation modes is presented in this paper. Based on the exact solution of the 1-D Poisson's equation of a general DG-MOSFET configure, a generic drain current model is derived from Pao-Sah's double integral in terms of the carrier concentration. The model is verified by extensive comparisons with 2-D numerical simulations under different bias conditions to all four terminals. The concise mathematic formulation allows the unification various double-gate models into a carrier-based core model for compact DG-MOSFET model development.
28965353
Multiple animated characters motion fusion
One of the major problems of the motion capture-based computer animation technique is the relatively high cost of equipment and low reuse rate of data. To overcome this problem, many motion-editing methods have been developed. However, most of them can only handle one character whose motions are preset, and hence cannot interact with its environment automatically. In this paper, we construct a new architecture of multiple animated character motion fusion, which not only enables the characters to perceive and respond to the virtual environment, but also allows them to interact with each other. We will also discuss in detail the key issues, such as motion planning, coordination of multiple animated characters and generation of vivid continuous motions. Our experimental results will further testify to the effectiveness of the new methodology. Copyright # 2002 John Wiley & Sons, Ltd.
10172928
Texture-Consistent Shadow Removal
This paper presents an approach to shadow removal that preserves texture consistency between the original shadow and lit area. Illumination reduction in the shadow area not only darkens that area, but also changes the texture characteristics there. We achieve texture-consistent shadow removal by constructing a shadow-free and texture-consistent gradient field. First, we estimate an illumination change surface which causes the shadow and remove the gradients it induces. We approximate the illumination change surface with illumination change splines across the shadow boundary. We formulate estimating these splines as an optimization problem which balances the smoothness between the neighboring splines and their fitness to the image data. Second, we sample the shadow effect on the texture characteristics in the umbra and lit area near the shadow boundary, and remove it by transforming the gradients inside the shadow area to be compatible with the lit area. Experiments on photos from Flickr demonstrate the effectiveness of our method.
29221183
Intelligent Crowd Simulation
Crowd simulation is a continuous challenge in computer animation. In this paper, we present an intelligent crowd simulation technique based on multiple autonomous agents. Each animated character (AC) is modeled as an autonomous agent, consisting of the perception, behavior planning and motion generation system. AC perceives the environment information, generates intentions and plans behaviors autonomously. To execute behaviors, appropriate motions are selected from the fundamental motion library (FML) and edited to create required motions. And the crowd behavior can be regarded as a combination of the individual behavior of each AC. The experiment shows the feasibility of this technique.
14466555
Network Optimization based on Genetic Algorithm and Estimation of Distribution Algorithm
Genetic algorithm (GA) is a kind of algorithm that simulates the process and the mechanism of the evolution. Because of its unique biologic feature and its suitability to any function, it becomes very popular and has been used in many problems in many fields. Estimation of distribution algorithm (EDA) is an algorithm that is generated from the GAs. Comparing with GAs, the EDAs replace the crossover and the mutation operations in GAs with learning and sampling the probability distribution of the best individuals of the population at each iteration of the algorithm. Because of its superior, it becomes a hot topic recently. Based on the former researches, this paper mainly focuses on solving the problem of one primary network model named all-terminal network model using the strategies of the evolutionary algorithms.
159232383
Paradoxes review
I came across one of the Smarandache divine paradoxes and felt very strongly that it is really our Buddhist's obligation to help understand the underlying truth. There seem a lot of toughest points in the cultural difference, and it will be the most difficult job to reach the mutual point as neutrality. What I can do is to try our best and find cooperation. Limited to the time, I just put a few as my first review.
27479532
Subspace-Based Blind Detection of Space-Time Coding
Space-time coding (STC) schemes for communication systems employing multiple transmit and receive antennas have received considerable interest recently. On space-time coding, some algorithms with perfect channel state information (CSI) have been proposed. In certain fast varying situation, however, it may be difficult to estimate the channel accurately and it is natural to study the blind detection algorithm without CSI. In this paper, based on subspace, a new blind detection algorithm without CSI is proposed. Using singular value decomposition (SVD) on output signal, noise subspace and signal subspace, which keep orthogonal to each other, are obtained. By searching the intersection of the signal subspace and the limited symbol vector set, symbol detection is achieved. The simulations illustrate that the proposed algorithm significantly improves system performance by receiving more output signals relative to transmit symbols. Furthermore, the presented algorithm is robust to the fading channel that changes between two successive blocks.
15977207
Exploiting hierarchical CP-nets to increase the reliability of Web services workflow
Individual Web services can be composed together to form value-added composite Web services represented as business process workflow. However, the value of such composite Web services is directly influenced by the reliability of the composite services. Composing Web services is not an easy task and is error-prone, so there is a growing interest for the verification techniques which enable designers to find and repair design errors even before actual running of the service, or allow designers to detect erroneous properties such as deadlocks or livelocks and formally verify whether the service process design does have certain desired properties (such as consistency with the conversation protocols of partner service). In this paper, we present to analyze and verify Web services composition by using some kind of colored Petri nets (CP-nets) called hierarchical CP-nets, which combine the strengths of Petri nets with the expressive power of high-level programming and have sound mathematical semantics. Services composition proposals can be transformed by transformation rules into CP-nets, which can be simulated to analyze the performance and verified to investigate behavioral properties by exploiting existing CP-nets specialized tools
21928964
Energy-aware optimal workload allocation among the battery-powered devices to maximize the co-operation life time
Traditional low power design minimizes the total power consumption. However for systems that want to maximize co-operation life time among the battery-powered devices, the total power minimization strategy may not be the best. The workload allocation among these devices has a dramatic impact on the co-operation life time. In this paper, we address this problem by formulating it as a linear programming (LP) problem. A simplified energy-aware algorithm is proposed to provide the optimal solution according to the energy capacity ratio of the devices. This algorithm is simple enough to be embedded into real-time system and we illustrate this by an example using a configurable transmitter-receiver pair. Experimental results show that the proposed algorithm significantly outperforms the other workload allocation strategies by 400.66% in the randomly-generated systems and 23.20% in a point-to-point (P2P) communication system, respectively