Highly maneuvering target tracking using multi-parameter fusion Singer model

An algorithm of highly maneuvering target tracking is proposed to solve the problem of large tracking error caused by strong maneuver. In this algorithm, a new estimator, named as multi-parameter fusion Singer (MF-Singer) model is derived based on the Singer model and the fuzzy reasoning method by using radial acceleration and velocity of the target, and applied to the problem of maneuvering target tracking in strong maneuvering environment and operating environment. The tracking performance of the MF-Singer model is evaluated and compared with other manuevering tracking models. It is shown that the MF-Singer model outperforms these algorithms in several examples.

Adaptive detection of range-spread targets in homogeneous and partially homogeneous clutter plus subspace interference

Adaptive detection of range-spread targets is considered in the presence of subspace interference plus Gaussian clutter with unknown covariance matrix.The target signal and interference are supposed to lie in two linearly independent subspaces with deterministic but unknown coordinates.Relying on the two-step criteria,two adaptive detectors based on Gradient tests are proposed,in homogeneous and partially homogeneous clutter plus subspace interference,respectively.Both of the proposed detectors exhibit theoretically constant false alarm rate property against unknown clutter covariance matrix as well as the power level.Numerical results show that,the proposed detectors have better performance than their existing counterparts,especially for mismatches in the signal steering vectors.

High resolution radar target adaptive detector and performance assessment

The high resolution radar target detection is addressed in the non-Gaussian clutter. An adaptive detector is derived for range-spread target based on a novel covariance matrix estimator. It is proved that the new detector is constant false alarm rate （CFAR） to both of the clutter covariance matrix structure and power level theoretically for match cases. The simulation results show that the new detector is almost CFAR for mismatch cases, and it outperforms the existing adaptive detector based on the sample covariance matrix. It also shows that the detection performance improves, as the number of pulses, the number of secondary data or the clutter spike increases. In addition, the derived detector is robust to different subsets, estimated clutter group sizes and correlations of clutter. Importantly, the number of iterations for practical application is just one.

Robust detector for range-spread targets in non-Gaussian background

Based on the target scatterer density, the range-spread target detection of high-resolution radar is addressed in additive non-Gaussian clutter, which is modeled as a spherically invariant random vector. Firstly, for sparse scatterer density, the detection of target scatterer in each range cell is derived, and then an M/K detector is proposed to detect the whole range-spread target. Se- condly, an integrating detector is devised to detect a range-spread target with dense scatterer density. Finally, to make the best of the advantages of M/K detector and integrating detector, a robust detector based on scatterer density （DBSD） is designed, which can reduce the probable collapsing loss or quantization error ef- fectively. Moreover, the density decision factor of DBSD is also determined. The formula of the false alarm probability is derived for DBSD. It is proved that the DBSD ensures a constant false alarm rate property. Furthermore, the computational results indi- cate that the DBSD is robust to different clutter one-lag correlations and target scatterer densities. It is also shown that the DBSD out- performs the existing scatterer-density-dependent detector.

Solving the AKNS Hierarchy by Its Bilinear Form: Generalized Double Wronskian Solutions

Through the Wronskian technique, a simple and direct proof is presented that the AKNS hierarchy in the bilinear form has generalized double Wronskian solutions. Moreover, by using a unified way, soliton solutions, rational solutions, Matveev solutions and complexitons in double Wronskian form for it are constructed.

New conflict representation model in generalized power space

The study on alternative combination rules in Dempster- Shafer theory （DST） when evidences are in conflict has emerged again recently as an interesting topic, especially in data/information fusion applications. The earlier researches have mainly focused on investigating the alternative which would be appropriate for the conflicting situation, under the assumption that a conflict is identified. However, the current research shows that not only the combination rule but also the classical conflict coefficient in DST are not correct to determine the conflict degree between two pieces of evidences. Most existing methods of measuring conflict do not consider the open world situation, whose frame of discernment is incomplete. To solve this problem, a new conflict representa- tion model to determine the conflict degree between evidences is proposed in the generalized power space, which contains two parameters： the conflict distance and the conflict coefficient of inconsistent evidences. This paper argues that only when the con- flict measure value in the new representation model is high, it is safe to say the evidences are in conflict. Experiments illustrate the efficiency of the proposed conflict representation model.

Maneuvering Target Tracking Algorithm Based on Muti-paramter Sequential Extended Kalman Filter

Based on the information theory,the performance of maneuvering target tracking can be improved by increasing the input information( observation vector).In this paper,the estimations of radial acceleration and radial velocity obtained in the signal processing are introduced into the measurement vector by coordinate transformation.In order to solve the problem of high nonlinearity of the radial acceleration,radial velocity and the state vector,a new algorithm of multi-parameter sequential extended Kalman filter( MSEKF) is proposed.The tracking performance of this algorithm is tested and compared with the other tracking algorithms.It is shown that the proposed algorithm outperforms these algorithms in strong and weak maneuvering environments.

New probabilistic transformation of imprecise belief structure

The case when the source of information provides precise belief function/mass, within the generalized power space, has been studied by many people. However, in many decision situations, the precise belief structure is not always available. In this case, an interval-valued belief degree rather than a precise one may be provided. So, the probabilistic transformation of imprecise belief function/mass in the generalized power space including Dezert-Smarandache （DSm） model from scalar transformation to sub-unitary interval transformation and, more generally, to any set of sub-unitary interval transformation is provided. Different from the existing probabilistic transformation algorithms that redistribute an ignorance mass to the singletons involved in that ignorance pro- portionally with respect to the precise belief function or probability function of singleton, the new algorithm provides an optimization idea to transform any type of imprecise belief assignment which may be represented by the union of several sub-unitary （half-） open intervals, （half-） closed intervals and/or sets of points belonging to [0,1]. Numerical examples are provided to illustrate the detailed implementation process of the new probabilistic transformation approach as well as its validity and wide applicability.

Track-to-Track Association Technique in Radar Network in the Presence of Systematic Errors

The presence of systematic measuring errors complicates track-to-track association, spatially separates the tracks that correspond to the same true target, and seriously decline the performances of traditional track-to-track association algorithms. Consequently, the influence of radar systematic errors on tracks from different radars, which is described as some rotation and translation, has been analyzed theoretically in this paper. In addition, a novel approach named alignment-correlation method is developed to estimate and reduce this effect, align and correlate tracks accurately without prior registration using phase correlation technique and statistic binary track correlation algorithm. Monte-Carlo simulation results illustrate that the proposed algorithm has good performance in solving the track-to-track association problem with systematic errors in radar network and could provide effective and reliable associated tracks for the next step of registration.

Optimal predication of double-star position/SINS based on discrete integration

Aiming at Double-Star positioning system's shortcomings of delayed position information and easy exposition of the user as well as the error increase of the SINS with the accumulation of time, the integration of Double-Star positioning system and the SINS is one of the developing directions for an integrated navigation system. This paper puts forward an optimal predication method of Double-Star/SINS integrated system based on discrete integration, which can make use of the delayed position information of Double-Star positioning system to optimally predicate the integrated system, and then corrects the SINS. The experimental results show that this method can increase the user's concealment under the condition of assuring the system's accuracy.

Systematic error real-time registration based onmodified input estimation

In order to estimate the systematic error in the processof maneuvering target adaptive tracking, a new method is proposed.The proposed method is a linear tracking scheme basedon a modified input estimation approach. A special augmentationin the state space model is considered, in which both the systematicerror and the unknown input vector are attached to thestate vector. Then, an augmented state model and a measurementmodel are established in the case of systematic error, andthe corresponding filter formulas are also given. In the proposedscheme, the original state, the acceleration and the systematicerror vector can be estimated simultaneously. This method can notonly solve the maneuvering target adaptive tracking problem in thecase of systematic error, but also give the system error value inreal time. Simulation results show that the proposed tracking algorithmoperates in both the non-maneuvering and the maneuveringmodes, and the original state, the acceleration and the systematicerror vector can be estimated simultaneously.

A novel SMC-PHD filter based on particle compensation

As a typical implementation of the probability hypothesis density(PHD) filter, sequential Monte Carlo PHD(SMC-PHD) is widely employed in highly nonlinear systems. However, the particle impoverishment problem introduced by the resampling step, together with the high computational burden problem, may lead to performance degradation and restrain the use of SMC-PHD filter in practical applications. In this work, a novel SMC-PHD filter based on particle compensation is proposed to solve above problems. Firstly, according to a comprehensive analysis on the particle impoverishment problem, a new particle generating mechanism is developed to compensate the particles. Then, all the particles are integrated into the SMC-PHD filter framework. Simulation results demonstrate that, in comparison with the SMC-PHD filter, proposed PC-SMC-PHD filter is capable of overcoming the particle impoverishment problem, as well as improving the processing rate for a certain tracking accuracy in different scenarios.

Mission-driven autonomous perception and fusion based on UAV swarm

Distributed autonomous situational awareness is one of the most important foundation for Unmanned Aerial Vehicle(UAV)swarm to implement various missions.Considering the application environment being usually characterized by strong confrontation,high dynamics,and deep uncertainty,the distributed situational awareness system based on UAV swarm needs to be driven by the mission requirements,while each node in the network can autonomously avoid collisions and perform detection mission through limited resource sharing as well as complementarity of respective advantages.By efficiently solving the problems of self-avoidance,autonomous flocking and splitting,joint estimation and control,etc.,perception data from multi-platform multi-source should be extracted and fused reasonably,to generate refined,tailored target information and provide reliable support for decision-making.

Fast Algorithm for Maneuvering Target Detection in SAR Imagery Based on Gridding and Fusion of Texture Features

Designing detection algorithms with high efficiency for Synthetic Aperture Radar(SAR) imagery is essential for the operator SAR Automatic Target Recognition(ATR) system.This work abandons the detection strategy of visiting every pixel in SAR imagery as done in many traditional detection algorithms,and introduces the gridding and fusion idea of different texture fea-tures to realize fast target detection.It first grids the original SAR imagery,yielding a set of grids to be classified into clutter grids and target grids,and then calculates the texture features in each grid.By fusing the calculation results,the target grids containing potential maneuvering targets are determined.The dual threshold segmentation technique is imposed on target grids to obtain the regions of interest.The fused texture features,including local statistics features and Gray-Level Co-occurrence Matrix(GLCM),are investigated.The efficiency and superiority of our proposed algorithm were tested and verified by comparing with existing fast de-tection algorithms using real SAR data.The results obtained from the experiments indicate the promising practical application val-ue of our study.

Measuring Conflict Functions in Generalized Power Space

One of the most important open issues is that the classical conflict coefficient in D-S evidence theory （DST） cannot correctly determine the conflict degree between two pieces of evidence. This drawback greatly limits the use of DST in real application systems. Early researches mainly focused on the improvement of Dempster’s rule of combination （DRC）. However, the current research shows it is very important to define new conflict coefficients to determine the conflict degree between two or more pieces of evidence. The evidential sources of information are considered in this work and the definition of a conflict measure function （CMF） is proposed for selecting some useful CMFs in the next fusion work when sources are available at each instant. Firstly, the definition and theorems of CMF are put forward. Secondly, some typical CMFs are extended and then new CMFs are put forward. Finally, experiments illustrate that the CMF based on Jousselme and its similar ones are the best suited ones.

A New Probabilistic Transformation in Generalized Power Space

The mapping from the belief to the probability domain is a controversial issue, whose original purpose is to make （hard） decision, but for contrariwise to erroneous widespread idea/claim, this is not the only interest for using such mappings nowadays. Actually the probabilistic transformations of belief mass assignments are very useful in modern multitarget multisensor tracking systems where one deals with soft decisions, especially when precise belief structures are not always available due to the existence of uncertainty in human being’s subjective judgments. Therefore, a new probabilistic transformation of interval-valued belief structure is put forward in the generalized power space, in order to build a subjective probability measure from any basic belief assignment defined on any model of the frame of discernment. Several examples are given to show how the new transformation works and we compare it to the main existing transformations proposed in the literature so far. Results are provided to illustrate the rationality and efficiency of this new proposed method making the decision problem simpler.

Distributed interacted multisensor joint probabilistic data association algorithm based on D-S theory

In order to resolve the multisensor multiplied maneuvering target tracking problem, this paper presents a distributed interacted multiple model multisensor joint probabilistic data association algorithm （DIMM-MSJPDA）. First of all, the interacted multiple model joint probabilistic data association algorithm is applied to each sensor, and then the state estimation, estimation covariance, model probability, combined innovation, innovation covariance are delivered to the fusion center. Then, the tracks from each sensor are correlated and the D-S evidence theory is used to gain the model probability of an identical target. Finally, the ultimate state estimation of each target is calculated according to the new model probability, and the state estimation is transmitted to each sensor. Simulations are designed to test the tracking performance of DIMM-MSJPDA algorithm. The results show that the use of DIMM-MSJPDA algorithm enables the distributed multisensor system to track multiplied maneuvering targets and its tracking performance is much better than that of IMMJPDA algorithm.

New optimal algorithm of data association for multi-passive-sensor location system

In dense target and false detection scenario of four time difference of arrival （TDOA） for multi-passive-sensor location system, the global optimal data association algorithm has to be adopted. In view of the heavy calculation burden of the traditional optimal assignment algorithm, this paper proposes a new global optimal assignment algorithm and a 2-stage association algorithm based on a statistic test. Compared with the traditional optimal algorithm, the new optimal algorithm avoids the complicated operations for finding the target position before we calculate association cost; hence, much of the procedure time is saved. In the 2-stage association algorithm, a large number of false location points are eliminated from candidate associations in advance. Therefore, the operation is further decreased, and the correct data association probability is improved in varying degrees. Both the complexity analyses and simulation results can verify the effectiveness of the new algorithms.

Bayesian edge detector for SAR imagery using discontinuity-adaptive Markov random feld modeling

Synthetic aperture radar（SAR）image is severely affected by multiplicative speckle noise,which greatly complicates the edge detection.In this paper,by incorporating the discontinuityadaptive Markov random feld（DAMRF）and maximum a posteriori（MAP）estimation criterion into edge detection,a Bayesian edge detector for SAR imagery is accordingly developed.In the proposed detector,the DAMRF is used as the a priori distribution of the local mean reflectivity,and a maximum a posteriori estimation of it is thus obtained by maximizing the posteriori energy using gradient-descent method.Four normalized ratios constructed in different directions are computed,based on which two edge strength maps（ESMs）are formed.The fnal edge detection result is achieved by fusing the results of two thresholded ESMs.The experimental results with synthetic and real SAR images show that the proposed detector could effciently detect edges in SAR images,and achieve better performance than two popular detectors in terms of Pratt＇s fgure of merit and visual evaluation in most cases.