### Abstract

In this paper, we discuss a data association problem arising from multitarget tracking. We formulate the problem as a multi-dimensional assignment problem and propose a polynomial time 1.8-approximation algorithm for simple case. We also propose a 3.7-approximation algorithm for general cases.

Original language | English |
---|---|

Title of host publication | Theory of Computing 2011 - Proceedings of the 17th Computing |

Subtitle of host publication | The Australasian Theory Symposium, CATS 2011 |

Pages | 137-143 |

Number of pages | 7 |

Publication status | Published - Dec 1 2011 |

Event | Theory of Computing 2011 - 17th Computing: The Australasian Theory Symposium, CATS 2011 - Perth, WA, Australia Duration: Jan 17 2011 → Jan 20 2011 |

### Publication series

Name | Conferences in Research and Practice in Information Technology Series |
---|---|

Volume | 119 |

ISSN (Print) | 1445-1336 |

### Other

Other | Theory of Computing 2011 - 17th Computing: The Australasian Theory Symposium, CATS 2011 |
---|---|

Country | Australia |

City | Perth, WA |

Period | 1/17/11 → 1/20/11 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Computer Networks and Communications
- Computer Science Applications
- Hardware and Architecture
- Information Systems
- Software

### Cite this

*Theory of Computing 2011 - Proceedings of the 17th Computing: The Australasian Theory Symposium, CATS 2011*(pp. 137-143). (Conferences in Research and Practice in Information Technology Series; Vol. 119).

**Approximation algorithms for data association problem arising from multitarget tracking.** / Kamiyama, Naoyuki; Matsui, Tomomi.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Theory of Computing 2011 - Proceedings of the 17th Computing: The Australasian Theory Symposium, CATS 2011.*Conferences in Research and Practice in Information Technology Series, vol. 119, pp. 137-143, Theory of Computing 2011 - 17th Computing: The Australasian Theory Symposium, CATS 2011, Perth, WA, Australia, 1/17/11.

}

TY - GEN

T1 - Approximation algorithms for data association problem arising from multitarget tracking

AU - Kamiyama, Naoyuki

AU - Matsui, Tomomi

PY - 2011/12/1

Y1 - 2011/12/1

N2 - In this paper, we discuss a data association problem arising from multitarget tracking. We formulate the problem as a multi-dimensional assignment problem and propose a polynomial time 1.8-approximation algorithm for simple case. We also propose a 3.7-approximation algorithm for general cases.

AB - In this paper, we discuss a data association problem arising from multitarget tracking. We formulate the problem as a multi-dimensional assignment problem and propose a polynomial time 1.8-approximation algorithm for simple case. We also propose a 3.7-approximation algorithm for general cases.

UR - http://www.scopus.com/inward/record.url?scp=84864581043&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84864581043&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84864581043

SN - 9781920682989

T3 - Conferences in Research and Practice in Information Technology Series

SP - 137

EP - 143

BT - Theory of Computing 2011 - Proceedings of the 17th Computing

ER -