All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

A Scalable Algorithm for Tracking an Unknown Number of Targets Using Multiple Sensors

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26220%2F17%3APU140251" target="_blank" >RIV/00216305:26220/17:PU140251 - isvavai.cz</a>

  • Result on the web

    <a href="https://ieeexplore.ieee.org/document/7889057" target="_blank" >https://ieeexplore.ieee.org/document/7889057</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/TSP.2017.2688966" target="_blank" >10.1109/TSP.2017.2688966</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    A Scalable Algorithm for Tracking an Unknown Number of Targets Using Multiple Sensors

  • Original language description

    We propose an algorithm for tracking an unknown number of targets based on measurements provided by multiple sensors. Our algorithm achieves lowcomputational complexity and excellent scalability by running belief propagation on a suitably devised factor graph. A redundant formulation of data association uncertainty and the use of "augmented target states" including binary target indicators make it possible to exploit statistical independencies for a drastic reduction of complexity. An increase in the number of targets, sensors, or measurements leads to additional variable nodes in the factor graph but not to higher dimensions of the messages. As a consequence, the complexity of our method scales only quadratically in the number of targets, linearly in the number of sensors, and linearly in the number of measurements per sensor. The performance of the method compares well with that of previously proposed methods, including methods with a less favorable scaling behavior. In particular, our method can outperform multisensor versions of the probability hypothesis density (PHD) filter, the cardinalized PHD filter, and the multi-Bernoulli filter.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    20203 - Telecommunications

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2017

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    IEEE TRANSACTIONS ON SIGNAL PROCESSING

  • ISSN

    1053-587X

  • e-ISSN

    1941-0476

  • Volume of the periodical

    65

  • Issue of the periodical within the volume

    13

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    16

  • Pages from-to

    3478-3493

  • UT code for WoS article

    000401090900012

  • EID of the result in the Scopus database