An adaptive discrete-time ILC strategy using fuzzy systems for iteration-varying reference trajectory tracking

In this article, a novel fuzzy systems based on adaptive Iterative Learning Control (ILC) strategy is presented to deal with a class of non-parametric nonlinear discrete-time systems which perform iteration-varying reference trajectory tracking. Using the technique of fuzzy systems to compensate for the non-parametric uncertainty of the discrete-time system dynamics, the proposed adaptive ILC scheme can well track the iteration-varying reference trajectory beyond the initial time points. The convergence of the fuzzy systems based adaptive ILC algorithm is guaranteed by theoretical analysis, and a numerical example is given to illustrate the effectiveness of the adaptive ILC scheme.

     

An update-based step-wise optimal cache replacement for wireless data access

Many network applications requires access to most up-to-date information. An update event makes the corresponding cached data item obsolete, and cache hits due to obsolete data items become simply useless to those applications. Frequently accessed but infrequently updated data items should get higher preference while caching, and infrequently accessed but frequently updated items should have lower preference. Such items may not be cached at all or should be evicted from the cache to accommodate items with higher preference. In wireless networks, remote data access is typically more expensive than in wired networks. Hence, an efficient caching scheme considers both data access and update patterns can better reduce data transmissions in wireless networks. In this paper, we propose a step-wise optimal update-based replacement policy, called the Update-based Step-wise Optimal (USO) policy, for wireless data networks to optimize transmission cost by increasing effective hit ratio. Our cache replacement policy is based on the idea of giving preference to frequently accessed but infrequently updated data, and is supported by an analytical model with quantitative analysis. We also present results from our extensive simulations. We demonstrate that (1) the analytical model is validated by the simulation results and (2) the proposed scheme outperforms the Least Frequently Used (LFU) scheme in terms of effective hit ratio and communication cost.     

Fast and effective color-based object tracking by boosted color distribution

In this paper, we propose a novel tracking algorithm, boosted color distribution (BCD), for tracking color objects. There exist three contributions in this paper. First, we propose a novel online gentle boost (OGB) algorithm for online learning. The essential idea of OGB is composed of two aspects: online updating candidate weak classifiers, and then choosing and combining them in a boosting way. Second, we design a novel weak classifier, log color feature distribution ratio, which focuses on the difference of color distributions rather than individual samples and provides a simple yet effective manner of mining color features for object tracking. Third, by combining our OGB algorithm and our log color features, we develop a fast yet effective color-based object tracking algorithm. Numerous experiments demonstrate that our tracking algorithm is better than or not worse than some state-of-the-art tracking algorithms on some public sequences.Overall, this paper presents a novel BCD algorithm for color object tracking that achieves good results at a fast speed.     

Poisson image fusion based on Markov random field fusion model

In this paper, we present a gradient domain image fusion framework based on the Markov Random Field (MRF) fusion model. In this framework, the salient structures of the input images are fused in the gradient domain, then the final fused image is reconstructed by solving a Poisson equation which forces the gradients of the fused image to be close to the fused gradients. To fuse the structures in the gradient domain, an effective MRF-based fusion model is designed based on both the per-pixel fusion rule defined by the local saliency and also the smoothness constraints over the fusion weights, which is optimized by graph cut algorithm. This MRF-based fusion model enables the accurate estimation of region-based fusion weights for the salient objects or structures. We apply this method to the applications of multi-sensor image fusion, including infrared and visible image fusion, multi-focus image fusion and medical image fusion. Extensive experiments and comparisons show that the proposed fusion model is able to better fuse the multi-sensor images and produces high-quality fusion results compared with the other state-of-the-art methods.     

A new image fusion performance metric based on visual information fidelity

Because subjective evaluation is not adequate for assessing work in an automatic system, using an objective image fusion performance metric is a common approach to evaluate the quality of different fusion schemes. In this paper, a multi-resolution image fusion metric using visual information fidelity (VIF) is presented to assess fusion performance objectively. This method has four stages: (1) Source and fused images are filtered and divided into blocks. (2) Visual information is evaluated with and without distortion information in each block. (3) The visual information fidelity for fusion (VIFF) of each sub-band is calculated. (4) The overall quality measure is determined by weighting the VIFF of each sub-band. In our experiment, the proposed fusion assessment method is compared with several existing fusion metrics using the subjective test dataset provided by Petrovic. We found that VIFF performs better in terms of both human perception matching and computational complexity.     

Multiconsensus of second order multiagent systems with directed topologies

A novel multiconsensus problem is introduced in multiagent systems. The states of multiple agents in each subnetwork asymptotically converge to a consistent value with information exchanges among subnetworks. The multiconsensus problem of second order multiagent systems with directed topologies is studied. Three linear protocols are proposed to solve the multiconsensus problem. Necessary and sufficient conditions are derived based on matrix theory. Simulations are provided to demonstrate the effectiveness of the theoretical results.     

Statistically uniform intra-block refresh algorithm for very low delay video communication

This paper focuses on the mechanism underlying the overall delay of a real-time video communication system from the time of capture at the encoder to the time of display at the decoder. A detailed analysis is presented to illustrate the delay problem. We then describe a statistically uniform intra-block refresh scheme for very low delay video communication. By scattering intra-blocks uniformly into continuous frames, the overall delay is significantly decreased, and object changes in the scene could be presented to the end user instantly. For comparison, the overall delay and the peak signal-to-noise ratio (PSNR) performance are tested. The experiment results show that an average of approximately 0.1 dB PSNR gain on average is obtained relative to random intra-macroblock refresh algorithm in H.264 JM, and the end-to-end delay performance is significantly improved.     

缩短BCH编码应用于无线传感网络的能效分析

基于能效分析了具有不同纠错能力的缩短BCH码在典型的无线传感器网络模型中的优劣.仿真结果表明,在典型应用中,缩短汉明码可以取得整体上最优的效果,并可通过对信息码长的调节取得最大能效,在对网络可靠性要求非常严格的情况下,可考虑使用纠错能力为2位或3位的缩短BCH码.     

网络数据库安全及加密技术

互联网的发展,给网络数据库数据的保密性、完整性和可用性带来了很大的威胁.本文总结了近些年数据库安全技术的发展过程,重点介绍了数据库加密技术的特点及新型的数据加密模式.