Matrix permanent inequalities for approximating joint assignment matrices in tracking systems

DOI10.1016/j.jfranklin.2004.07.003zbMath1065.93033OpenAlexW2076277016MaRDI QIDQ1771051

Jeffrey K. Uhlmann

Publication date: 7 April 2005

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jfranklin.2004.07.003

zbMATH Keywords

target trackingassignment problemdata associationassociation matrixcalculation of permanentscorrelation applicationsJoint Assignment Matrixmultiple-hypothesis tracking

Mathematics Subject Classification ID

Parametric hypothesis testing (62F03) Estimation and detection in stochastic control theory (93E10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of computing the permanent
• Tracking and data association
• A method and two algorithms on the theory of partitions
• Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking
• Modeling a dynamic environment using a Bayesian multiple hypothesis approach
• A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries
• Matrix factorizations of determinants and permanents

This page was built for publication: Matrix permanent inequalities for approximating joint assignment matrices in tracking systems