A moving object segmentation algorithm for static camera via active contours and GMM

Moving object segmentation is one of the most challenging issues in computer vision. In this paper, we propose a new algorithm for static camera foreground segmentation. It combines Gaussian mixture model (GMM) and active contours method, and produces much better results than conventional background subtraction methods. It formulates foreground segmentation as an energy minimization problem and minimizes the energy function using curve evolution method. Our algorithm integrates the GMM background model, shadow elimination term and curve evolution edge stopping term into energy function. It achieves more accurate segmentation than existing methods of the same type. Promising results on real images demonstrate the potential of the presented method. Supported by National Basic Research Program of China (Grant No. 2006CB303105), the Chinese Ministry of Education Innovation Team Fund Project (Grant No. IRT0707), the National Natural Science Foundation of China (Grant Nos. 60673109 and 60801053), Beijing Excellent Doctoral Thesis Program (Grant No. YB20081000401), Beijing Municipal Natural Science Foundation (Grant No. 4082025), and Doctoral Foundation of China (Grant No. 20070004037)     

Globally exponentially attractive sets of the family of Lorenz systems

In this paper, the concept of globally exponentially attractive set is proposed and used to consider the ultimate bounds of the family of Lorenz systems with varying parameters. Explicit estimations of the ultimate bounds are derived. The results presented in this paper contain all the existing results as special cases. In particular, the critical cases, b→ 1^＋ and a→0^＋, for which the previous methods failed, have been solved using a unified formula.     

Analysis and side peaks identification of Chinese DTTB signal ambiguity functions for passive radar

Passive radar is one of the current research focuses. The implementation of the Chinese standard digital television terrestrial broadcasting (DTTB) creates a new opportunity for passive radar. DTTB system contains single-carrier and multicarrier application modes. In this paper, ambiguity functions of the DTTB signals in the single-carrier and multicarrier application modes are analyzed. Ambiguity function of the DTTB signal contains one main peak and many side peaks. The relative positions and amplitudes of the side peaks are derived and the reasons for the occurrence of the side peaks are obtained. The side peaks identification (SPI) algorithm is proposed for avoiding the false alarms caused by the side peaks. Experimental results show that the SPI algorithm can indentify all the side peaks without the power loss. This research provides the foundation for designing the DTTB based passive radar. Supported by the National Natural Science Foundation of China (Grant No. 60232010), the Ministerial Foundation of China (Grant No. A2220060039) and the National Natural Science Foundation of China for Distinguished Young Scholars (Grant No. 60625104)     

Receding horizon estimation to networked control systems with multirate scheme

This paper investigates the problem of receding horizon state estimation for networked control systems (NCSs) with random network-induced delays less than one sample period, which are formulated as multirate control systems. Based on a batch of recent past slow rate measurements in a finite horizon window, the initial state estimation in this window is solved by minimizing a receding-horizon objective function, and then the fast rate state estimations are calculated by the prediction of dynamic equation to compensate for the network-induced time delays. Furthermore, convergence results and unbiasedness properties are analyzed. An upper bound of estimation error is presented under the assumption of bounded disturbances acting on the system and measurement equations. A simulation example shows the effectiveness of the proposed method. Supported by the National Natural Science Foundation of China (Grant Nos. 60774015, 60674018, 60825302), the National High-Tech Research & Development Program of China (Grant No. 2006AA04Z173), the Specialized Research Fund for the Doctoral Program of Higher Education of China (Grant No. 20060248001), and partly by Shanghai Natural Science Foundation (Grant No. 07JC14016)     

IETF softwire unicast and multicast framework for IPv6 transition

IPv6 protocol plays an important role in the next generation of Internet （NGI）. It is expected that the elegant coexistence of IPv4 and IPv6 is the key point of IPv6 transition. To solve the transition problem, we propose a mesh unicast framework and a multicast framework in this paper. We describe two reference models for the mesh unicast framework, and put forward two potential solutions for the multicast framework. A Linux-based prototype is implemented for IPv4 over IPv6 scenario and a test bed is deployed with 8 nodes on CERNET2. The deployment demon- strates the advantages of the framework.     

Implementation of low-swing differential interface circuits for high-speed on-chip asynchronous interconnection

A novel low-swing interface circuit for high-speed on-chip asynchronous interconnection is proposed in this paper. It takes a differential level-triggered latch to recover digital signal with ultra low-swing voltage less than 50 mV, and the driver part of the interface circuit is optimized for low power using the driver-array method, With a capacity to work up to 500 MHz, the proposed circuit, which is simulated and fabricated using SMIC 0.18-pm 1.8-V digital CMOS technology, consumes less power than previously reported designs.     

Perfect forward secure identity-based authenticated key agreement protocol in the escrow mode

The majority of existing escrowable identity-based key agreement protocols only provide partial forward secrecy. Such protocols are, arguably, not suitable for many real-word applications, as the latter tends to require a stronger sense of forward secrecy—perfect forward secrecy. In this paper, we propose an efficient perfect forward-secure identity-based key agreement protocol in the escrow mode. We prove the security of our protocol in the random oracle model, assuming the intractability of the Gap Biline...     

Min-max model predictive control for constrained nonlinear systems via multiple LPV embeddings

A min-max model predictive control strategy is proposed for a class of constrained nonlinear system whose trajectories can be embedded within those of a bank of linear parameter varying (LPV) models. The embedding LPV models can yield much better approximation of the nonlinear system dynamics than a single LTV model. For each LPV model, a parameter-dependent Lyapunov function is introduced to obtain poly-quadratically stable control law and to guarantee the feasibility and stability of the original nonlinear system. This approach can greatly reduce computational burden in traditional nonlinear predictive control strategy. Finally a simulation example illustrating the strategy is presented. Supported by the National Natural Science Foundation of China (Grant Nos. 60774015, 60825302, 60674018), the National High-Tech Research & Development Program of China (Grant No. 2007AA041403), the Specialized Research Fund for the Doctoral Program of Higher Education of China (Grant No. 20060248001), and partly by Shanghai Natural Science Foundation (Grant No. 07JC14016)     

SKY: efficient peer-to-peer networks based on distributed Kautz graphs

Many proposed P2P networks are based on traditional interconnection topologies. Given a static topology, the maintenance mechanism for node join/departure is critical to designing an efficient P2P network. Kautz graphs have many good properties such as constant degree, low congestion and optimal diameter. Due to the complexity in topology maintenance, however, to date there have been no effective P2P networks that are proposed based on Kautz graphs with base > 2. To address this problem, this paper presents the “distributed Kautz (D-Kautz) graphs”, which adapt Kautz graphs to the characteristics of P2P networks. Using the D-Kautz graphs we further propose SKY, the first effective P2P network based on Kautz graphs with arbitrary base. The effectiveness of SKY is demonstrated through analysis and simulations. Supported partially by the National Natural Science Foundation of China (Grant Nos. 60673167 and 60703072), the Hunan Provincial Natural Science Foundation of China (Grant No. 08JJ3125), and the National Basic Research Program of China (973) (Grant No. 2005CB321801)     

On the linear span of the p -ary cascaded GMW sequences

In this paper, a recursion is derived to compute the linear span of the p-ary cascaded GMW sequences. It is the first time to determine the linear span of the p-ary cascaded GMW sequence without any restriction on the parameters completely. Whereas, the known result on the p-ary cascaded GMW sequence with the specific parameters in the literature could be viewed as a special case of the new result. Supported by the National Natural Science Foundation of China (Grant No. 60302015), the Foundation for the Author of National Excellent Doctoral Dissertation of China (Grant No. 200341), and Sichuan Youth Science Foundation (Grant No. 04ZQ026-048)     

Cooperative multiple access channels: Achievable rates and optimal resource allocation

We investigate the multiple access channels (MAC) where sources can cooperate via half-duplex relaying and refer to it as cooperative MAC channels (CMAC). Assuming perfect channel state information (CSI) at the transmitters and the receivers, we determine the bounds on the achievable rate region of a Gaussian CMAC channel and an inner bound on the outage capacity region of a fading CMAC channel. Based on superposition modulation, a half-duplex cooperative relay scheme with optimal resource allocation is proposed to achieve the bounds of capacity region. Analytical results and simulation results show that the achievable rate region of a Gaussian CMAC channel is larger than that of a Gaussian MAC channel with direct transmission (DT) schemes. But they have the same achievable sum rate. Moreover, the proposed scheme can provide higher outage capacity region than DT schemes in a fading MAC channel due to the fact that sources can share the resources with each other to reduce outages. Supported partially by the National Natural Science Foundation of China (Grant No. 60672079), the Natural Science Foundation of Jiangsu Province (Grant No. BK2006701), and the Natinoal High-Tech Research & Development Program of China (Grant No. 2007AA01Z267)     

A pure quasi-human algorithm for solving the cuboid packing problem

We excavate the wisdom from an old Chinese proverb “gold corner, silver side and strawy void”, and further improve it into “maximum value in diamond cave” for solving the NP-hard cuboid packing problem. We extract, integrate and formalize the idea by west modern mathematical tools, and propose a pure quasi-human algorithm. The performance of the algorithm is evaluated on two sets of public benchmarks. For 100 strongly heterogeneous difficult benchmarks, experiments show an average packing utilization of 87.31%, which surpasses current best record reported in the literature by 1.83%. For 47 difficult benchmarks without orientation constraint, experiments show an average volume utilization of 92.05%, which improves current best record reported in the literature by 1.05%. Supported by the National Natural Science Foundation of China (Grant No. 60773194), the National Basic Research Program of China (Grant No. 2004CB318000), and Postdoctoral Science Foundation of China (Grant No. 20070420174)     

A 485ps 64-Bit Parallel Adder in 0.18$\mu$m CMOS

This paper presents an optimized 64-bit parallel adder. Sparse-tree architecture enables low carry-merge fan-outs and inter-stage wiring complexity. Single-rail and semi-dynamic circuit improves operation speed. Simulation results show that the proposed adder can operate at 485ps with power of 25.6mW in 0.18μm CMOS process. It achieves the goal of higher speed and lower power.     

SNR estimation algorithm based on the preamble for wireless OFDM systems

Based on the analysis of the performance of Boumard＇s SNR method for wireless orthogonal frequency division multiplexing （OFDM） systems, a new estimation algorithm of the noise variance is proposed by only using the data samples of the two training symbols in the preamble, and the second order moment of these data samples is employed to estimate the signal power. The average SNR and the SNRs on the subchannels can all be estimated by the proposed algorithm, and its performance is independent of the channel＇s frequency selectivity. Simulation results show that the performance of the proposed method is highly improved and much better than that of Boumard＇s method.     

Observer-based optimal output tracking for discrete-time systems with multiple state and input delays

The optimal output tracking control (OOTC) problem for a class of discrete-time systems with state and input delays is addressed. An augmented system is constructed such that the OOTC problem can be transformed into a two-point boundary value (TPBV) problem with both advance and delay terms from the necessary optimality conditions. The successive approximating method recently developed is extended to obtain an approximate solution of the TPBV problem, which is then used to obtain a feedforward and feedback tracking controller. An observer is designed for the uncertain reference input such that the feedforward controller is physically realizable. Simulations show the results are effective even with long time-delays. Recommended by Editorial Board member Poo Gyeon Park under the direction of Editor Young Il Lee. This research was supported by the National Natural Science Foundation of China (Grant No. 40776051), the Key Natural Science Foundation of Shandong Province (Grant No. Z2005G01), the Natural Science Foundation of Qingdao City (Grant No. 05-1-JC-94) and the research funds of QingDao University of Science and Technology. Hai-Hong Wang received the Ph.D. degree in Computer Science in July 2007 from Ocean University of China. She presently works in QingDao University of Science and Technology, Qingdao, P.R. China. Her current research interests include analysis and control for time-delay systems and nonlinear systems. Gong-You Tang received the Ph.D. degree in Control Theory and Applications from the South China University of Technology, P. R. China in 1991. He is a Professor at the College of Information Science and Engineering at the Ocean University of China, Qingdao, P. R. China. He is the Editor of the Journal of the Ocean University of China and Control and the Instruments in Chemical Industry. His research interests are in the areas of nonlinear systems, delay systems, large-scale systems, and networked control systems, with emphasis in optimal control, robust control, fault diagnosis and stability analysis.     

The multiple-parameter fractional Fourier transform

The fractional Fourier transform （FRFT） has multiplicity, which is intrinsic in fractional operator. A new source for the multiplicity of the weight-type fractional Fourier transform （WFRFT） is proposed, which can generalize the weight coefficients of WFRFT to contain two vector parameters m,n ∈ Z^M . Therefore a generalized fractional Fourier transform can be defined, which is denoted by the multiple-parameter fractional Fourier transform （MPFRFT）. It enlarges the multiplicity of the FRFT, which not only includes the conventional FRFT and general multi-fractional Fourier transform as special cases, but also introduces new fractional Fourier transforms. It provides a unified framework for the FRFT, and the method is also available for fractionalizing other linear operators. In addition, numerical simulations of the MPFRFT on the Hermite-Gaussian and rectangular functions have been performed as a simple application of MPFRFT to signal processing.     

Ways to sparse representation: An overview

Many algorithms have been proposed to find sparse representations over redundant dictionaries or transforms. This paper gives an overview of these algorithms by classifying them into three categories: greedy pursuit algorithms, l _p norm regularization based algorithms, and iterative shrinkage algorithms. We summarize their pros and cons as well as their connections. Based on recent evidence, we conclude that the algorithms of the three categories share the same root: l _p norm regularized inverse problem. Finally, several topics that deserve further investigation are also discussed. Supported by the Joint Research Fund for Overseas Chinese Young Scholars of the National Natural Science Foundation of China (Grant No. 60528004) and the Key Project of the National Natural Science Foundation of China (Grant No. 60528004)     

A formal method to real-time protocol interoperability testing

Interoperability testing is an important technique to ensure the quality of implementations of network communication protocol. In the next generation Internet protocol, real-time applications should be supported effectively. However, time constraints were not considered in the related studies of protocol interoperability testing, so existing interoperability testing methods are difficult to be applied in real-time protocol interoperability testing. In this paper, a formal method to real-time protocol interoperability testing is proposed. Firstly, a formal model CMpTIOA （communicating multi-port timed input output automata） is defined to specify the system under test （SUT） in real-time protocol interoperability testing; based on this model, timed interoperability relation is then defined. In order to check this relation, a test generation method is presented to generate a parameterized test behavior tree from SUT model; a mechanism of executability pre-determination is also integrated in the test generation method to alleviate state space explosion problem to some extent. The proposed theory and method are then applied in interoperability testing of IPv6 neighbor discovery protocol to show the feasibility of this method.     

Removing local irregularities of triangular meshes with highlight line models

The highlight line model is a powerful tool in assessing the quality of a surface. It increases the flexibility of an interactive design environment. In this paper, a method to generate a highlight line model on an arbitrary triangular mesh is presented. Based on the highlight line model, a technique to remove local shape irregularities of a triangular mesh is then presented. The shape modification is done by solving a minimization problem and performing an iterative procedure. The new technique improves not only the shape quality of the mesh surface, but also the shape of the highlight line model. It provides an intuitive and yet suitable method for locally optimizing the shape of a triangular mesh. Supported by National Science Foundation of China (Grant Nos. 60533070, 60625202), National Basic Research Program of China (Grant No. 2004CB719400), National High-Tech Research & Development Program of China (Grant No. 2007AA040401), Fok Ying Tung Education Foundation (Grant No. 111070), National Science Foundation of USA (Grant Nos. DMI-0422126, DMS-0310645), and Kentucky Science & Technology Corporation (Grant No. COMM-Fund-712)