• Corpus ID: 15350725

Data association and target identi cation using range pro le

  title={Data association and target identi cation using range pro le},
  author={Jae-Chern Yoo and Young-Soo Kim},
We present a new data association algorithm using range-pro le, which has maneuver-following capability. In this approach, targets can be identi ed as a by-product of the data association, not requiring a separate step for target identi cation. Early data association cannot identify targets and thus requires a large amount of computation not to miss tracks when targets maneuver and cross each other. Our method using range pro le mitigates the complexity of data association. And once the classes… 
Passive Sensor Based Multiple Objects Tracking and Association Method in Wireless Sensor Networks
A method for dynamic data association in wireless sensor networks and addresses the issue of multiple objects tracking by incorporating RFID reader and an acoustic sensor so that two different signals are cooperating for tracking and associating multiple objects.


A class of near optimal JPDA algorithms
A new class of near optimal JPDA algorithms is introduced which run in polynomial time and bridges the gap in computational load and accuracy between the very fast simple approximations and the efficient optimal algorithms.
Using range profiles for data association in multiple-target tracking
A parameter, the matching score, is used to discuss the correlation property between range profiles of the same target or different targets and a data association algorithm based on comparing matching scores is proposed.
An interior point linear programming approach to two-scan data association
This work presents an efficient two-scan data association method based on an interior point linear programming (LP) approach that is not only far more efficient in terms of low computational complexity, but also considerably more accurate than the existing single-scan JPDA method.
Two-stage Kalman estimator for tracking maneuvering targets
A two-stage Kalman estimator was investigated to solve an estimation problem in the presence of random bias. Under an algebraic constraint, the optimal estimate of the system state can be obtained as
Development of Practical PDA Logic for Multitarget Tracking by Microprocessor
  • R. Fitzgerald
  • Computer Science
    1986 American Control Conference
  • 1986
A simplified form of probabilistic data association logic was developed for real-time multitarget tracking by a microprocessor associated with a radar track-while-scan system, but the weighted-average updating feature of the PDA approach was abandoned in favor of a "nearest-neighbor PDA" method.
Using range profiles as feature vectors to identify aerospace objects
The authors use range profiles as the feature vectors for data representation, and they establish a decision rule based on the matching scores to identify aerospace objects, and the results demonstrated can be used for comparison with other identification methods.
Track while scan monopulse-a technique for improving angular accuracy and resolution
Track while scan radar accuracy has been studied for targets of Swerling 1 and 2 types with angular widths and results indicate significant possible improvements in accuracy with targets exhibiting rapid fading and glint, as well as for jammed scenarios.
Mathematical Methods and Algorithms for Signal Processing
This book discusses vector spaces, signal processing, and the theory of Constrained Optimization, as well as basic concepts and methods of Iterative Algorithms and Dynamic Programming.
New Results in Linear Filtering and Prediction Theory
The Duality Principle relating stochastic estimation and deterministic control problems plays an important role in the proof of theoretical results and properties of the variance equation are of great interest in the theory of adaptive systems.
An extension of the Munkres algorithm for the assignment problem to rectangular matrices
The assignment problem, together with Munkres proposed algorithm for its solution in square matrices, is presented and an extension of this algorithm which permits a solution for rectangular matrices is developed.