48 research outputs found

    A Novel Approach of Rough Conditional Entropy-Based Attribute Selection for Incomplete Decision System

    Get PDF
    Pawlak's classical rough set theory has been applied in analyzing ordinary information systems and decision systems. However, few studies have been carried out on the attribute selection problem in incomplete decision systems because of its complexity. It is therefore necessary to investigate effective algorithms to deal with this issue. In this paper, a new rough conditional entropy-based uncertainty measure is introduced to evaluate the significance of subsets of attributes in incomplete decision systems. Furthermore, some important properties of rough conditional entropy are derived and three attribute selection approaches are constructed, including an exhaustive search strategy approach, a heuristic search strategy approach, and a probabilistic search strategy approach for incomplete decision systems. Moreover, several experiments on real-life incomplete data sets are conducted to assess the efficiency of the proposed approaches. The final experimental results indicate that two of these approaches can give satisfying performances in the process of attribute selection in incomplete decision systems

    Parameter Estimation of Weibull Distribution Based on Second-Kind Statistics

    Get PDF
    The log-cumulant estimator is proposed to estimate the parameters of Weibull distribution based on second-kind statistics. With the explicit closed form expressions, the log-cumulant estimator is computationally efficient. Parameterestimation results from Monte Carlo simulation and real synthetic aperture radar (SAR) image demonstrate that the log-cumulant estimator leads to better performance when compared to the moment estimator

    Models and Algorithms for Tracking Target with Coordinated Turn Motion

    Get PDF
    Tracking target with coordinated turn (CT) motion is highly dependent on the models and algorithms. First, the widely used models are compared in this paper—coordinated turn (CT) model with known turn rate, augmented coordinated turn (ACT) model with Cartesian velocity, ACT model with polar velocity, CT model using a kinematic constraint, and maneuver centered circular motion model. Then, in the single model tracking framework, the tracking algorithms for the last four models are compared and the suggestions on the choice of models for different practical target tracking problems are given. Finally, in the multiple models (MM) framework, the algorithm based on expectation maximization (EM) algorithm is derived, including both the batch form and the recursive form. Compared with the widely used interacting multiple model (IMM) algorithm, the EM algorithm shows its effectiveness

    Unknown Clutter Estimation by FMM Approach in Multitarget Tracking Algorithm

    Get PDF
    Finite mixture model (FMM) approach is a research focus in multitarget tracking field. The clutter was treated as uniform distribution previously. Aiming at severe bias caused by unknown and complex clutter, a multitarget tracking algorithm based on clutter model estimation is put forward in this paper. Multitarget likelihood function is established with FMM. In this frame, the algorithms of expectation maximum (EM) and Markov Chain Monte Carlo (MCMC) are both consulted in FMM parameters estimation. Furthermore, target number and multitarget states can be estimated precisely after the clutter model fitted. Association between target and measurement can be avoided. Simulation proved that the proposed algorithm has a good performance in dealing with unknown and complex clutter

    Convergence Analysis for the SMC-MeMBer and SMC-CBMeMBer Filters

    Get PDF
    The convergence for the sequential Monte Carlo (SMC) implementations of the multitarget multi-Bernoulli (MeMBer) filter and cardinality-balanced MeMBer (CBMeMBer) filters is studied here. This paper proves that the SMC-MeMBer and SMC-CBMeMBer filters, respectively, converge to the true MeMBer and CBMeMBer filters in the mean-square sense and the corresponding bounds for the mean-square errors are given. The significance of this paper is in theory to present the convergence results of the SMC-MeMBer and SMC-CBMeMBer filters and the conditions under which the two filters satisfy mean-square convergence

    A Novel Method for Tracking Complex Maneuvering Star Convex Extended Targets Using Transformer Network

    Get PDF
    To address the challenges in tracking complex maneuvering extended targets, an effective maneuvering extended target tracking method was proposed for irregularly shaped star-convex using a Transformer network. Initially, the alpha-shape algorithm was used to model the variations in the star-convex shape. In addition, a recursive approach was proposed to estimate the irregular shape of an extended target by detailed derivation in the Bayesian filtering framework. This approach accurately estimated the shape of a static star convex extended target. Moreover, through the structural redesign of the target state transition matrix and the real-time estimation of the maneuvering extended target’s state transition matrix using a transformer network, the accurate tracking of complex maneuvering targets was achieved. Furthermore, the real-time tracking of star convex maneuvering extended targets was achieved by fusing the estimated shape contours with motion states. This study focused on constructing certain complex maneuvering extended target tracking scenarios to assess the performance of the proposed method and the comprehensive estimation capabilities of the algorithm considering both shapes and motion states using multiple performance indicators

    A Novel Coherence Reduction Method in Compressed Sensing for DOA Estimation

    Get PDF
    A novel method named as coherent column replacement method is proposed to reduce the coherence of a partially deterministic sensing matrix, which is comprised of highly coherent columns and random Gaussian columns. The proposed method is to replace the highly coherent columns with random Gaussian columns to obtain a new sensing matrix. The measurement vector is changed accordingly. It is proved that the original sparse signal could be reconstructed well from the newly changed measurement vector based on the new sensing matrix with large probability. This method is then extended to a more practical condition when highly coherent columns and incoherent columns are considered, for example, the direction of arrival (DOA) estimation problem in phased array radar system using compressed sensing. Numerical simulations show that the proposed method succeeds in identifying multiple targets in a sparse radar scene, where the compressed sensing method based on the original sensing matrix fails. The proposed method also obtains more precise estimation of DOA using one snapshot compared with the traditional estimation methods such as Capon, APES, and GLRT, based on hundreds of snapshots

    A Bayesian Approach to Track Multiple Extended Targets Using Particle Filter for Nonlinear System

    Full text link
    To track multiple extended targets for the nonlinear system, this paper employs the idea of the particle filter to track kinematic states and shape formation of extended targets. First, the Bayesian framework is proposed for multiple extended targets to jointly estimate multiple extended target state and association hypothesis. Furthermore, a joint proposal distribution is defined for the multiple extended target state and association hypothesis. Then, the Bayesian framework of multiple extended target tracking is implemented by the particle filtering which could release the high computational burden caused by the increase in the number of extended targets and measurements. Simulation results show that the proposed multiple extended target particle filter has superior performance in shape estimation and improves the performance of the position estimation in the situation that there are spatially closed extended targets

    Two Measurement Set Partitioning Algorithms for the Extended Target Probability Hypothesis Density Filter

    Full text link
    The extended target probability hypothesis density (ET-PHD) filter cannot work well if the density of measurements varies from target to target, which is based on the measurement set partitioning algorithms employing the Mahalanobis distance between measurements. To tackle the problem, two measurement set partitioning approaches, the shared nearest neighbors similarity partitioning (SNNSP) and SNN density partitioning (SNNDP), are proposed in this paper. In SNNSP, the shared nearest neighbors (SNN) similarity, which incorporates the neighboring measurement information, is introduced to DP instead of the Mahalanobis distance between measurements. Furthermore, the SNNDP is developed by combining the DBSCAN algorithm with the SNN similarity together to enhance the reliability of partitions. Simulation results show that the ET-PHD filters based on the two proposed partitioning algorithms can achieve better tracking performance with less computation than the compared algorithms

    Maintaining Track Continuity for Extended Targets Using Gaussian-Mixture Probability Hypothesis Density Filter

    Full text link
    A multiextended-target tracker based on the extended target Gaussian-mixture probability hypothesis density (ET-GMPHD) filter, which can provide the tracks of the extended targets, is proposed to maintain the track continuity for the extended targets. To identify the extended targets, each individual Gaussian term of the mixture representing the posterior intensity function will be assigned a label, which is evolved through time. Then a track management scheme, including track initiation, track confirmation, track propagation, and termination, is developed to form the tracks for the extended targets. Furthermore, to improve the performance of the extended target tracker we also propose a mixture partitioning algorithm for resolving the identities of the extended targets in close proximity. The simulation results show that our proposed tracker achieves the less error of the position estimates and decreases the probability of incorrect label assignments from 0.6 to 0.25
    corecore