
Linear‐time JPDAF based on many‐2‐many approximation of marginal association probabilities
Author(s) -
Baum M.
Publication year - 2015
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
ISSN - 1350-911X
DOI - 10.1049/el.2015.1411
Subject(s) - linear approximation , approximation algorithm , association (psychology) , key (lock) , computer science , approximation theory , mathematics , mathematical optimization , algorithm , nonlinear system , physics , mathematical analysis , philosophy , computer security , epistemology , quantum mechanics
A novel linear‐time approximation for the marginal association probabilities in the JPDAF is proposed. The key idea is to combine two existing approximations that are based on (computationally cheap) many‐2‐1 and 1‐2‐many association models. Simulations demonstrate the benefits of the novel approximation, called many‐2‐many approximation, in comparison with existing linear‐time approaches.