Journal ArticleDOI
A generalized S-D assignment algorithm for multisensor-multitarget state estimation
TLDR
An efficient and recursive generalized S-D assignment algorithm (S/spl ges/3) employing a successive Lagrangian relaxation technique is presented, with application to the localization of an unknown number of emitters using multiple high frequency direction finder sensors.Abstract:
We develop a new algorithm to associate measurements from multiple sensors to identify the real targets in a surveillance region, and to estimate their states at any given time. The central problem in a multisensor-multitarget state estimation problem is that of data association-the problem of determining from which target, if any, a particular measurement originated. The data association problem is formulated as a generalized S-dimensional (S-D) assignment problem, which is NP-hard for S/spl ges/3 sensor scans (i.e., measurement lists). We present an efficient and recursive generalized S-D assignment algorithm (S/spl ges/3) employing a successive Lagrangian relaxation technique, with application to the localization of an unknown number of emitters using multiple high frequency direction finder sensors (S=3, 5, and 7).read more
Citations
More filters
Journal ArticleDOI
Multiple hypothesis tracking for multiple target tracking
TL;DR: The manner in which the multiple data association hypotheses formed by MHT can be combined with multiple filter models, such as used by the interacting multiple model (IMM) method is discussed.
Journal ArticleDOI
Resolving motion correspondence for densely moving points
TL;DR: This work studies the motion correspondence problem for which a diversity of qualitative and statistical solutions exist, and presents a tracking algorithm that satisfies these-possibly constrained-models in a greedy matching sense, including an effective way to handle detection errors and occlusion.
Journal ArticleDOI
Ground target tracking with variable structure IMM estimator
TL;DR: The design of a Variable Structure Interacting Multiple Model (VS-IMM) estimator for tracking groups of ground targets on constrained paths using Moving Target Indicator reports obtained from an airborne sensor is presented, significantly improving performance and reducing computational load.
Journal ArticleDOI
A noniterative greedy algorithm for multiframe point correspondence
Khurram Shafique,Mubarak Shah +1 more
TL;DR: This work presents a framework for finding point correspondences in monocular image sequences over multiple frames by using a polynomial time algorithm for a restriction of the general problem of multiframe point correspondence, which is NP-hard for three or more frames.
Journal ArticleDOI
Overview of Environment Perception for Intelligent Vehicles
TL;DR: The state-of-the-art algorithms and modeling methods for intelligent vehicles are given, with a summary of their pros and cons.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Journal ArticleDOI
Combinatorial optimization: algorithms and complexity
TL;DR: This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NPcomplete problems, more.
Book
Numerical methods for unconstrained optimization and nonlinear equations
TL;DR: Newton's Method for Nonlinear Equations and Unconstrained Minimization and methods for solving nonlinear least-squares problems with Special Structure.
Book
Linear and nonlinear programming
David G. Luenberger,Yinyu Ye +1 more
TL;DR: Strodiot and Zentralblatt as discussed by the authors introduced the concept of unconstrained optimization, which is a generalization of linear programming, and showed that it is possible to obtain convergence properties for both standard and accelerated steepest descent methods.