Improved assignment with ant colony optimization for multi-target tracking

Detecting and tracking ground targets is crucial in military intelligence in battlefield surveillance. Once targets have been detected, the system used can proceed to track them where tracking can be done using Ground Moving Target Indicator (GMTI) type indicators that can observe objects moving in the area of interest. However, when targets move close to each other in formation as a convoy, then the problem of assigning measurements to targets has to be addressed first, as it is an important step in target tracking. With the increasing computational power, it became possible to use more complex association logic in tracking algorithms. Although its optimal solution can be proved to be an NP hard problem, the multidimensional assignment enjoyed a renewed interest mostly due to Lagrangian relaxation approaches to its solution. Recently, it has been reported that randomized heuristic approaches surpassed the performance of Lagrangian relaxation algorithm especially in dense problems. In this paper, impelled from the success of randomized heuristic methods, we investigate a different stochastic approach, namely, the biologically inspired ant colony optimization to solve the NP hard multidimensional assignment problem for tracking multiple ground targets.     

Feedback tuning of bifurcations

The present paper studies a feedback regulation problem that arises in at least two different biological applications. The feedback regulation problem under consideration may be interpreted as an adaptive control problem for tuning bifurcation parameters, and it has not been studied in the control literature. The goal of the paper is to formulate this problem and to present some preliminary results.     

Prediction of suspended sediment concentration from water quality variables

This study investigates use of water quality (WQ) variables, namely total chromium concentration, total iron concentration, and turbidity for predicting suspended sediment concentration (SSC). For this purpose, the artificial neural networks (ANNs) and regression analysis (RA) models are employed. Seven different RA models are constructed, considering the functional relation between measured WQ variables and SSC. The WQ and SSC data are fortnightly obtained from six monitoring stations, located on the stream Harsit, Eastern Black Sea Basin, Turkey. A total of 132 water samples are collected from April 2009 to February 2010. Model prediction results reveal that ANN is able to predict SSC from WQ data, with mean absolute error (MAE) of 10.30 mg/L and root mean square error (RMSE) of 13.06 mg/L. Among seven RA models, the best one, which has the form including all independent parameters, produces results comparable to those of ANN, with MAE = 14.28 mg/L and RMSE = 15.35 mg/L. The sensitivity analysis results reveal that the most effective parameter on the SSC is total chromium concentration. These results have time- and cost-saving implications.     

Tracker-aware adaptive detection: An efficient closed-form solution for the Neyman–Pearson case

A promising line of research for radar systems attempts to optimize the detector thresholds so as to maximize the overall performance of a radar detector–tracker pair. In the present work, we attempt to move in a direction to fulfill this promise by considering a particular dynamic optimization scheme which relies on a non-simulation performance prediction (NSPP) methodology for the probabilistic data association filter (PDAF), namely, the modified Riccati equation (MRE). By using a suitable functional approximation, we propose a closed-form solution for the special case of a Neyman–Pearson (NP) detector. The proposed solution replaces previously proposed iterative solution formulations and results in dramatic improvement in computational complexity without sacrificed system performance. Moreover, it provides a theoretical lower bound on the detection signal-to-noise ratio (SNR) concerning when the whole tracking system should be switched to the track before detect (TBD) mode.     

Convergence of an implicit algorithm for two families of nonexpansive mappings

In this paper, we study an implicit iterative algorithm for two nonexpansive mappings and two finite families of nonexpansive mappings in Banach spaces. We prove some weak and strong convergence theorems for these iterative algorithms. Our results extend some existing results.     

复杂度直方图及其在图像检索中的应用

该文提出了一种新的描述图像纹理信息的复杂度直方图特征,实验结果表明该特征用于图像检索可以取得较好的检索效果。文章同时将该特征与图像色彩直方图组合特征用于图像检索,实验结果证实使用组合特征可以得到更高的检索效率。