A new video watermarking algorithm based on shot segmentation and block classification

In this paper, we propose a new video watermarking algorithm based on shot segmentation and block classification to enhance the robustness, imperceptibility and real-time performance based on the H.264/AVC codec. A method of selecting host frames is proposed based on shot segmentation to avoid embedding watermark frame by frame, so as to improve the robustness and the real-time performance. The watermark signal is cropped into small watermarks according to the number of shots in the host video, and small watermarks are respectively embedded into different shots. The watermarking capacity and the perceptual quality are greatly improved by this way. A method of selecting host coefficients is proposed based on block classification in the Discrete Cosine Transformation (DCT) compressed domain. The texture characteristics of host blocks are considered in the classification and the places of host coefficients can change adaptively according to the content of the video. The imperceptibility of the watermarked video is greatly improved by this way. The simplified quantization index modulation (QIM) is applied to embed watermark. It brings fewer artifacts to the host signal than the current main watermarking method, such as spread spectrum (SS), differential energy watermarking (DEW) and so on. The experiment results show that the proposed scheme has a good performance in maintaining real-time performance and resisting Gaussian noising, frame swapping, MPEG compression, etc.     

Accelerating a Recurrent Neural Network to Finite-Time Convergence for Solving Time-Varying Sylvester Equation by Using a Sign-Bi-power Activation Function

Bartels–Stewart algorithm is an effective and widely used method with an O(n ³) time complexity for solving a static Sylvester equation. When applied to time-varying Sylvester equation, the computation burden increases intensively with the decrease of sampling period and cannot satisfy continuous realtime calculation requirements. Gradient-based recurrent neural network are able to solve the time-varying Sylvester equation in real time but there always exists an estimation error. In contrast, the recently proposed Zhang neural network has been proven to converge to the solution of the Sylvester equation ideally when time goes to infinity. However, this neural network with the suggested activation functions never converges to the desired value in finite time, which may limit its applications in realtime processing. To tackle this problem, a sign-bi-power activation function is proposed in this paper to accelerate Zhang neural network to finite-time convergence. The global convergence and finite-time convergence property are proven in theory. The upper bound of the convergence time is derived analytically. Simulations are performed to evaluate the performance of the neural network with the proposed activation function. In addition, the proposed strategy is applied to online calculating the pseudo-inverse of a matrix and nonlinear control of an inverted pendulum system. Both theoretical analysis and numerical simulations validate the effectiveness of proposed activation function.     

Wii remote–based low-cost motion capture for automated assembly simulation

This paper describes the development of a Wii remote (Wiimote)–based low-cost motion capture system and demonstrates its application for automated assembly simulation. Multiple Wiimotes are used to form a vision system to perform motion capture in 3D space. A hybrid algorithm for calibrating a multi-camera stereo vision system has been developed based on Zhang’s and Svoboda’s calibration algorithms. This hybrid algorithm has been evaluated and shown accuracy improvement over Svoboda’s algorithm for motion capture with multiple cameras. The captured motion data are used to automatically generate an assembly simulation of objects represented by CAD models in real time. The Wiimote-based motion capture system is practically attractive because it is inexpensive, wireless, and easily portable. Application examples have been developed for a single vision system with two Wiimotes to track the assembly of a microsatellite prototype frame and for an integrated vision system with four Wiimotes to track the assembly of a bookshelf.     

ELCA evaluation for keyword search on probabilistic XML data

As probabilistic data management is becoming one of the main research focuses and keyword search is turning into a more popular query means, it is natural to think how to support keyword queries on probabilistic XML data. With regards to keyword query on deterministic XML documents, ELCA (Exclusive Lowest Common Ancestor) semantics allows more relevant fragments rooted at the ELCAs to appear as results and is more popular compared with other keyword query result semantics (such as SLCAs). In this paper, we investigate how to evaluate ELCA results for keyword queries on probabilistic XML documents. After defining probabilistic ELCA semantics in terms of possible world semantics, we propose an approach to compute ELCA probabilities without generating possible worlds. Then we develop an efficient stack-based algorithm that can find all probabilistic ELCA results and their ELCA probabilities for a given keyword query on a probabilistic XML document. Finally, we experimentally evaluate the proposed ELCA algorithm and compare it with its SLCA counterpart in aspects of result probability, time and space efficiency, and scalability.     

Transductive multi-distance learning for video search

Graph-based semi-supervised learning approaches have been proven effective and efficient in solving the problem of the inefficiency of labeled training data in many real-world application areas, such as video annotation. As a significant factor of these algorithms, however, pair-wise similarity metric of samples has not been fully investigated. Specifically, for existing approaches, the estimation of pair-wise similarity between two samples relies on the spatial property of video data. On the other hand, temporal property, an essential characteristic of video data, is not embedded into the pair-wise similarity measure. Accordingly, in this paper, a novel framework for video annotation, called Joint Spatio-Temporal Correlation Learning (JSTCL) is proposed. This framework is characterized by simultaneously taking into account both the spatial and temporal property of video data to improve the estimation of pair-wise similarity. We apply the proposed framework to video annotation and report superior performance compared to key existing approaches over the benchmark TRECVID data set.     

Pulse-order recursive method for inverse covariance matrix computation applied to space-time adaptive processing

The conventional space-time adaptive processing(STAP) method such as the typical sample matrix inversion(SMI)-based STAP method is difficult to implement for a practical system because intense computational complexity arises in calculating the inversion of a space-time covariance matrix directly.According to the block Hermitian matrix property of space-time covariance matrix,a new pulse-order recursive method is proposed in this paper to calculate the inverse covariance matrix for the STAP adaptive weight,which can reduce the computational complexity significantly.The proposed method requires initially calculating the inverse covariance matrix of the first pulse-order recursively based on the block Hermitian matrix property.In the following,the inversion of space-time covariance matrix is obtained recursively based on the previous pulse-order inverse covariance matrix.Next,the STAP adaptive weight is calculated based on the inversion space-time covariance matrix previously obtained.Compared with the conventional SMI-based STAP algorithms,the computational complexity of the proposed method is reduced to more than 50% for the same clutter suppression performance.This method can be applied to practical systems benefiting from small computational complexity and stable clutter suppression performance.     

Path planning in complex 3D environments using a probabilistic roadmap method

This paper presents a 3D path planning algorithm for an unmanned aerial vehicle （UAV） in complex environments. In this algorithm, the environments are divided into voxels by octree algorithm. In order to satisfy the safety requirement of the UAV, free space is represented by free voxels, which have enough space margin for the UAV to pass through. A bounding box array is created in the whole 3D space to evaluate the free voxel connectivity. The probabilistic roadmap method （PRM） is improved by random sampling in the bounding box array to ensure a more efficient distribution of roadmap nodes in 3D space. According to the connectivity evaluation, the roadmap is used to plan a feasible path by using A＊ algorithm. Experimental results indicate that the proposed algorithm is valid in complex 3D environments.     

Study on Robot Path Planning Based on an Improved Artificial Potential Field Method

The method of artificial potential field has obvious advantages among the robot path planning methods including simple structure, small amount of calculation and relatively mature in theory. This paper puts forward the ＂Integral method＂ focusing on solving the problem of local minimization. The method analyses the distribution of obstructions in a given environment and regards adjacent obstacles as a whole, By changing the parameters of the repulsive force field, robots can quickly get out of the minimum point and move to the target point. This paper uses the Simurosot platform to carry on the simulation experiment on the improved artificial potential field method, which projects a feasible path successfully and verifies this method.     

Research in the Development of Finite Element Software for Creep Damage Analysis

This paper reports the development of finite element software for creep damage analysis. Creep damage deformation and failure of high temperature structure is a serious problem for power generation and it is even more technically demanding under the current increasing demand of power and economic and sustainability pressure. This paper primarily consists of three parts： （1） the need and the justification of the development of in-house software; （2） the techniques in developing such software for creep damage analysis; （3） the validation of the finite element software conducted under plane stress, plane strain, axisymmetric, and 3 dimensional cases. This paper contributes to the computational creep damage mechanics in general.     

A Reconfiguration Trial on the Platform of Allied Information for Wireless Converged Networks

PAl （platform of allied information） promotes persistent innovation and application of the wireless technologies among different institutes, based on open, safe and controllable network architecture. The platform architecture, unified interface, security mechanism, and reconfiguration are designed to achieve the convergence of various wireless experimental resources. In this paper, the reconfiguration mechanism is designed and a reconfiguration trial is implemented based on the PAI, to verify the ability of integrating experimental resources in the related units.