This paper presents a user identification method at H.264 streaming using watermarking with fingerprints. The watermark can efficiently reduce the potential danger of forgery or alteration. Especially a biometric watermark has convenient, economical advantages. The fingerprint watermark can also improve reliability of verification using automated fingerprint identification systems. These algorithms, however, are not robust against common video compression. To overcome this problem, we analyze H.264 compression pattern and extract watermark after restoring damaged watermark using various filters. The proposed algorithm consists of enhancement of a fingerprint image, watermark insertion using discrete wavelet transform and extraction after restoring. The proposed algorithm can achieve robust watermark extraction against H.264 compressed videos.

A fingerprint verification system based on a set of invariant moment features and a nonlinear Back Propagation Neural Network(BPNN) verifier is proposed. An image-based method with invariant moment features for fingerprint verification is used to overcome the demerits of traditional minutiae-based methods and other image-based methods. The proposed system contains two stages: an off-line stage for template processing and an on-line stage for testing with input fingerprints. The system preprocesses fingerprints and reliably detects a unique reference point to determine a Region-of-Interest(ROI). A total of four sets of seven invariant moment features are extracted from four partitioned sub-images of an ROI. Matching between the feature vectors of a test fingerprint and those of a template fingerprint in the database is evaluated by a nonlinear BPNN and its performance is compared with other methods in terms of absolute distance as a similarity measure. The experimental results show that the proposed method with BPNN matching has a higher matching accuracy, while the method with absolute distance has a faster matching speed. Comparison results with other famous methods also show that the proposed method outperforms them in verification accuracy.

Program plagiarism is widespread due to intelligent software and the global Internet environment. Consequently the detection of plagiarized source code and software is becoming important especially in academic field. Though numerous studies have been reported for detecting plagiarized pairs of codes, we cannot find any profound work on understanding the underlying mechanisms of plagiarism. In this paper, we study the evolutionary process of source codes regarding that the plagiarism procedure can be considered as evolutionary steps of source codes. The final goal of our paper is to reconstruct a tree depicting the evolution process in the source code. To this end, we extend the well-known bioinformatics approach, a local alignment approach, to detect a region of similar code with an adaptive scoring matrix. The asymmetric code similarity based on the local alignment can be considered as one of the main contribution of this paper. The phylogenetic tree or evolution tree of source codes can be reconstructed using this asymmetric measure. To show the effectiveness and efficiency of the phylogeny construction algorithm, we conducted experiments with more than 100 real source codes which were obtained from East-Asia ICPC(International Collegiate Programming Contest). Our experiments showed that the proposed algorithm is quite successful in reconstructing the evolutionary direction, which enables us to identify plagiarized codes more accurately and reliably. Also, the phylogeny construction algorithm is successfully implemented on top of the plagiarism detection system of an automatic program evaluation system.

In this paper, we propose a new noise estimation and reduction algorithm for stationary and nonstationary noisy environments. This approach uses an algorithm that classifies the speech and noise signal contributions in time-frequency bins. It relies on the ratio of the normalized standard deviation of the noisy power spectrum in time-frequency bins to its average. If the ratio is greater than an adaptive estimator, speech is considered to be present. The propose method uses an auto control parameter for an adaptive estimator to work well in highly nonstationary noisy environments. The auto control parameter is controlled by a linear function using a posteriori signal to noise ratio(SNR) according to the increase or the decrease of the noise level. The estimated clean speech power spectrum is obtained by a modified gain function and the updated noisy power spectrum of the time-frequency bin. This new algorithm has the advantages of much more simplicity and light computational load for estimating the stationary and nonstationary noise environments. The proposed algorithm is superior to conventional methods. To evaluate the algorithm's performance, we test it using the NOIZEUS database, and use the segment signal-to-noise ratio(SNR) and ITU-T P.835 as evaluation criteria.

We present a novel method for eye location by means of a two-level classifier scheme. Locating the eye by machine-inspection of an image or video is an important problem for Computer Vision and is of particular value to applications in biomedical imaging. Our method aims to overcome the significant challenge of an eye-location that is able to maintain high accuracy by disregarding highly variable changes in the environment. A first level of computational analysis processes this image context. This is followed by object detection by means of a two-class discrimination classifier(second algorithmic level).We have tested our eye location system using FERET and BioID database. We compare the performance of two-level classifier with that of non-level classifier, and found it's better performance.

This paper presents an approach to order reduction of linear parameter varying controller for polytopic model. Feasible solutions which satisfy relevant linear matrix inequalities for constructing full-order parameter varying controller evaluated at each polytopic vertices are first found. Next, sufficient conditions are derived for the existence of a right coprime factorization of parameter varying controller. Furthermore, a singular perturbation approximation for time invariant systems is generalized to reduce full-order parameter varying controller via parameter varying right coprime factorization. This generalization is based on solutions of the parameter varying Lyapunov inequalities. The closed loop performance caused by using the reduced order controller is developed. To examine the performance of the reduced-order parameter varying controller, the proposed method is applied to reduce vibration of flexible structures having the transverse-torsional coupled vibration modes.

In this paper, we consider a terminal, linear control system with delay, subject to unknown but bounded disturbances. For this system, we consider the problem of constructing a worst-case optimal feedback control policy, which can be corrected at fixed, intermediate time instants. The policy should guarantee that for all admissible uncertainties the system states are in prescribed neighborhoods of predefined system states, at all fixed, intermediate time instants, and in the neighborhood of a given state at a terminal time instant, and the value of the cost function is the best guaranteed value. Simple explicit rules(which can be easily implemented on-line) for constructing the optimal control policy in the original control problem are derived.

In this paper, the problem of partial asymptotic stabilization of nonlinear control cascaded systems with integrators is considered. Unfortunately, many controllable control systems present an anomaly, which is the non complete stabilization via continuous pure-state feedback. This is due to Brockett necessary condition. In order to cope with this difficulty we propose in this work the partial asymptotic stabilization. For a given motion of a dynamical system, say x(t,$x_0,t_0$)=(y(t,$y_0,t_0$),z(t,$z_0,t_0$)), the partial stabilization is the qualitative behavior of the y-component of the motion(i.e., the asymptotic stabilization of the motion with respect to y) and the z-component converges, relative to the initial vector x($t_0$)=$x_0$=($y_0,z_0$). In this work we present new results for the adding integrators for partial asymptotic stabilization. Two applications are given to illustrate our theoretical result. The first problem treated is the partial attitude control of the rigid spacecraft with two controls. The second problem treated is the partial orientation of the underactuated ship.

This paper presents a parametric study on the controller design scheme for a gyro-accelerometer to have robust performance under some parameter variations. In particular, an integral and derivative based controller design method is suggested to achieve the desired performances of stability margin, bandwidth, and uniformity of scale for both gyroscopes and accelerometers with uncertainties of quality factor and resonant frequency. The simulation result shows that the control loop based on the suggested method gives satisfactory performance robustness under parameter variations, demonstrating the usefulness of the proposed design scheme.

This paper analyzes, through simulations, GNSS interference mitigation performance against wideband and narrowband interferences by using spatial-temporal adaptive processing(STAP). The mathematical analysis results demonstrate that the array configuration has a considerable effect on the spatial-temporal correlation function. Based on the results, different array configurations are presented to evaluate and observe the effect on interference mitigation. The analysis results are further assessed through simulations.

In this paper, we present an artificial muscle actuator producing rectilinear motion, called the Tube-Spring-Actuator(TSA). The TSA is supposed to be a prospective substitute in areas requiring macro forces such as robotics. It is simply configured from a synthetic elastomer tube with an inserted spring. The design of the TSA is described in detail and its analysis is conducted to investigate the characteristics of the actuator based on the derived model. In addition, the performance of the proposed actuator is tested via experiments.

An action-selection-mechanism(ASM) has been proposed to work as a fully connected finite state machine to deal with sequential behaviors as well as to allow a state in the task program to migrate to any state in the task, in which a primitive node in association with a state and its transitional conditions can be easily inserted/deleted. Also, such a primitive node can be learned by a shortest path-finding-based reinforcement learning technique. Specifically, we define a behavioral motivation as having state-dependent value as a primitive node for action selection, and then sequentially construct a network of behavioral motivations in such a way that the value of a parent node is allowed to flow into a child node by a releasing mechanism. A vertical path in a network represents a behavioral sequence. Here, such a tree for our proposed ASM can be newly generated and/or updated whenever a new behavior sequence is learned. To show the validity of our proposed ASM, experimental results of a mobile robot performing the task of pushing- a- box-in to- a-goal(PBIG) will be illustrated.

Networked control systems(NCSs) have gained increasing attention in recent years due to their advantages and potential applications. The network Quality-of-Service(QoS) in NCSs always fluctuates due to changes of the traffic load and available network resources. To handle the network QoS variations problem, this paper presents an intelligent scheduling control method for NCSs, where the sampling period and the control parameters are simultaneously scheduled to compensate the effect of QoS variation on NCSs performance. For NCSs with network-induced delays and packet dropouts, a discrete-time switch model is proposed. By defining a sampling-period-dependent Lyapunov function and a common quadratic Lyapunov function, the stability conditions are derived for NCSs in terms of linear matrix inequalities(LMIs). Based on the obtained stability conditions, the corresponding controller design problem is solved and the performance optimization problem is also investigated. Simulation results are given to demonstrate the effectiveness of the proposed approaches.

This study presents an approach for approximation an unknown function from a numerical data set based on the synthesis of a neuro-fuzzy model. An adaptive input data space parting method, which is used for building hyperbox-shaped clusters in the input data space, is proposed. Each data cluster is implemented here as a fuzzy set using a membership function MF with a hyperbox core that is constructed from a min vertex and a max vertex. The focus of interest in proposed approach is to increase degree of fit between characteristics of the given numerical data set and the established fuzzy sets used to approximate it. A new cutting procedure, named NCP, is proposed. The NCP is an adaptive cutting procedure using a pure function $\Psi$ and a penalty function $\tau$ for direction the input data space parting process. New algorithms named CSHL, HLM1 and HLM2 are presented. The first new algorithm, CSHL, built based on the cutting procedure NCP, is used to create hyperbox-shaped data clusters. The second and the third algorithm are used to establish adaptive neuro- fuzzy inference systems. A series of numerical experiments are performed to assess the efficiency of the proposed approach.

The paper proposes a new formulation of the output feedback pole assignment problem. In this formulation, a unified approach is presented for solving the pole assignment problem with various additional objectives. These objectives include optimizing a variety of performance indices, and imposing constraints on the output feedback matrix structure, e.g. decentralized structure. Conditions for the existence of the output feedback are discussed. However, the thrust of the paper is on the development of a convergent pole assignment algorithm. It is shown that when exact pole assignment is not possible, the method can be used to place the poles close to the desired locations. Examples are provided to illustrate the method.

In high dynamic situations, the GPS carrier tracking loop requires a wide bandwidth to track a carrier signal because the Doppler frequency changes more rapidly with time. However, a wide bandwidth allows noises within the bandwidth of the tracking loop to pass through the loop filter. As these noises are used in the numerical controlled oscillator(NCO), the carrier tracking loop of a GPS receiver shows a degraded performance in high dynamic situations. To solve this problem, an adaptive two-stage Kalman filter, which offers the NCO a less noisy phase error, can be used. This filter is based on a carrier phase dynamic model and can adapt to an incomplete dynamic model and a quickly changed Doppler frequency. The performance of the proposed tracking loop is verified by several simulations.

This paper is concerned with the reliable $H_{\infty}$ controller design problem for uncertain linear systems against actuator failures. In the design, the $H_{\infty}$ performance of the closed-loop system is optimized during normal operation(without failures) while the system satisfies a prescribed $H_{\infty}$ performance level in the case of actuator failures. Single and parameter-dependent Lyapunov function approaches are applied in designing suboptimal reliable $H_{\infty}$ controllers. Simulation studies are presented to demonstrate the effectiveness of the proposed design procedures.

This paper shows that design of a robustly stable repetitive control system is equivalent to that of a feedback control system for an uncertain linear time-invariant system satisfying the well-known robust performance condition. Once a feedback controller is designed to satisfy the robust performance condition, the feedback controller and the repetitive controller using the performance weighting function robustly stabilizes the repetitive control system. It is also shown that we can obtain a steady-state tracking error described in a simple form without time-delay element if the robust stability condition is satisfied for the repetitive control system. Moreover, using this result, a sufficient condition is provided, which ensures that the least upper bound of the steady-state tracking error generated by the repetitive control system is less than or equal to the least upper bound of the steady-state tracking error only by the feedback system.