Event-based recursive distributed filtering over wireless sensor networks

In this technical note, the distributed filtering problem is investigated for a class of discrete time-varying systems with an event-based communication mechanism. Each intelligent sensor node transmits the data to its neighbors only when the local innovation violates a predetermined Send-on-Delta (SoD) data transmission condition. The aim of the proposed problem is to construct a distributed filter for each sensor node subject to sporadic communications over wireless networks. In terms of an event indicator variable, the triggering information is utilized so as to reduce the conservatism in the filter analysis. An upper bound for the filtering error covariance is obtained in form of Riccati-like difference equations by utilizing the inductive method. Subsequently, such an upper bound is minimized by appropriately designing the filter parameters iteratively, where a novel matrix simplification technique is developed to handle the challenges resulting from the sparseness of the sensor network topology and filter structure preserving issues. The effectiveness of the proposed strategy is illustrated by a numerical simulation.This work is supported by National Basic Research Program of China (973 Program) under Grant 2010CB731800, National Natural Science Foundation of China under Grants 61210012, 61290324, 61473163 and 61273156, and Jiangsu Provincial Key Laboratory of E-business at Nanjing University of Jiangsu and Economics of China under Grant JSEB201301

Comparison of constraint-handling techniques for metaheuristic optimization

Many design problems in engineering have highly nonlinear constraints and the proper handling of such constraints can be important to ensure solution quality. There are many different ways of handling constraints and different algorithms for optimization problems, which makes it difficult to choose for users. This paper compares six different constraint-handling techniques such as penalty methods, barrier functions, epsilon-constrained method, feasibility criteria and stochastic ranking. The pressure vessel design problem is solved by the flower pollination algorithm, and results show that stochastic ranking and epsilon-constrained method are most effective for this type of design optimization

Coil combination using linear deconvolution in k-space for phase imaging

Background: The combination of multi-channel data is a critical step for the imaging of phase and susceptibility contrast in magnetic resonance imaging (MRI). Magnitude-weighted phase combination methods often produce noise and aliasing artifacts in the magnitude images at accelerated imaging sceneries. To address this issue, an optimal coil combination method through deconvolution in k-space is proposed in this paper. Methods: The proposed method firstly employs the sum-of-squares and phase aligning method to yield a complex reference coil image which is then used to calculate the coil sensitivity and its Fourier transform. Then, the coil k-space combining weights is computed, taking into account the truncated frequency data of coil sensitivity and the acquired k-space data. Finally, combining the coil k-space data with the acquired weights generates the k-space data of proton distribution, with which both phase and magnitude information can be obtained straightforwardly. Both phantom and in vivo imaging experiments were conducted to evaluate the performance of the proposed method. Results: Compared with magnitude-weighted method and MCPC-C, the proposed method can alleviate the phase cancellation in coil combination, resulting in a less wrapped phase. Conclusions: The proposed method provides an effective and efficient approach to combine multiple coil image in parallel MRI reconstruction, and has potential to benefit routine clinical practice in the future

Dense feature correspondence for video-based endoscope three-dimensional motion tracking

This paper presents an improved video-based endoscope tracking approach on the basis of dense feature correspondence. Currently video-based methods often fail to track the endoscope motion due to low-quality endoscopic video images. To address such failure, we use image texture information to boost the tracking performance. A local image descriptor - DAISY is introduced to efficiently detect dense texture or feature information from endoscopic images. After these dense feature correspondence, we compute relative motion parameters between the previous and current endoscopic images in terms of epipolar geometric analysis. By initializing with the relative motion information, we perform 2-D/3-D or video-volume registration and determine the current endoscope pose information with six degrees of freedom (6DoF) position and orientation parameters. We evaluate our method on clinical datasets. Experimental results demonstrate that our proposed method outperforms state-of-the-art approaches. The tracking error was significantly reduced from 7.77 mm to 4.78 mm. © 2014 IEEE

ECCH: A novel color coocurrence histogram

In this paper, a novel color cooccurrence histogram method, named eCCH which stands for color cooccurrence histogram at edge points, is proposed to describe the spatial-color joint distribution of images. Unlike all existing ideas, we only investigate the color distribution of pixels located at the two sides of edge points on gradient direction lines. When measuring the similarity of two eCCHs, the Gaussian weighted histogram intersection method is adopted, where both identical and similar color pairs are considered to compensate color variations. Comparative experimental results demonstrate the performance of the proposed eCCH in terms of robustness to color variance and small computational complexity. ©2010 IEEE

A triple-diagonal gradient-based edge detection

Gradient-based edge detection is a straightforward method to identity the edge points in the original grey-level image. It is consistent with the intuition that in the human vision system the edge points always appear where the change of grey-level is greatest within their neighbourhood. In this paper, triple-diagonal gradient-based edge detection is introduced. It is based on the features of Spiral Architecture and computes the gradients in three diagonal directions instead of approximating the gradient in one direction only as the traditional methods do. Essentially, it improves the accuracy for locating edge points. As a result, it does not need any supplementary processing to enhance the edge map

Excitation of nonlinear ion acoustic waves in CH plasmas

Excitation of nonlinear ion acoustic wave (IAW) by an external electric field is demonstrated by Vlasov simulation. The frequency calculated by the dispersion relation with no damping is verified much closer to the resonance frequency of the small-amplitude nonlinear IAW than that calculated by the linear dispersion relation. When the wave number $k\lambda_{De}$ increases, the linear Landau damping of the fast mode (its phase velocity is greater than any ion's thermal velocity) increases obviously in the region of $T_i/T_e < 0.2$ in which the fast mode is weakly damped mode. As a result, the deviation between the frequency calculated by the linear dispersion relation and that by the dispersion relation with no damping becomes larger with $k\lambda_{De}$ increasing. When $k\lambda_{De}$ is not large, such as $k\lambda_{De}=0.1, 0.3, 0.5$, the nonlinear IAW can be excited by the driver with the linear frequency of the modes. However, when $k\lambda_{De}$ is large, such as $k\lambda_{De}=0.7$, the linear frequency can not be applied to exciting the nonlinear IAW, while the frequency calculated by the dispersion relation with no damping can be applied to exciting the nonlinear IAW.Comment: 10 pages, 9 figures, Accepted by POP, Publication in August 1