About: Measurement-to-track assignment methods in target tracking     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • Object tracking is a problem of obtaining usually positional and motional information about the object. The observation is usually in the form of a picture, radar or sonar image. A key element of the tracking problem is to estimate a (non-measurable) state of a stochastic system based on corrupted measurements. This problem is well treated in literature. If the objective is tracking multiple objects simultaneously or if a false detection appears due to a clutter, in addition it is necessary to solve the problem of measurement-to-track assignment. A usual procedure is to assign measurements to objects based on a prediction of their location. There are computationally cheap measurement-to-track assignment methods based on minimizing a statistical distance, which include the well-known strongest or nearest neighbor methods. On the other hand, there is the multiple hypothesis tracking method providing high quality of multiple target assignment. Unfortunately its computational costs are unbearable. The probabilistic data association method represents a compromise between quality and computational costs. The paper aims at introducing some measurement-to-track assignment methods. A special attention is paid to the measurement-to-track assignment methods of the nearest neighbor type. Its basic form based on minimizing the statistical distance with a single time step will be presented and also its variants considering multiple time steps simultaneously for the assignment will be introduced. The methods will be illustrated in a numerical example.
  • Object tracking is a problem of obtaining usually positional and motional information about the object. The observation is usually in the form of a picture, radar or sonar image. A key element of the tracking problem is to estimate a (non-measurable) state of a stochastic system based on corrupted measurements. This problem is well treated in literature. If the objective is tracking multiple objects simultaneously or if a false detection appears due to a clutter, in addition it is necessary to solve the problem of measurement-to-track assignment. A usual procedure is to assign measurements to objects based on a prediction of their location. There are computationally cheap measurement-to-track assignment methods based on minimizing a statistical distance, which include the well-known strongest or nearest neighbor methods. On the other hand, there is the multiple hypothesis tracking method providing high quality of multiple target assignment. Unfortunately its computational costs are unbearable. The probabilistic data association method represents a compromise between quality and computational costs. The paper aims at introducing some measurement-to-track assignment methods. A special attention is paid to the measurement-to-track assignment methods of the nearest neighbor type. Its basic form based on minimizing the statistical distance with a single time step will be presented and also its variants considering multiple time steps simultaneously for the assignment will be introduced. The methods will be illustrated in a numerical example. (en)
Title
  • Measurement-to-track assignment methods in target tracking
  • Measurement-to-track assignment methods in target tracking (en)
skos:prefLabel
  • Measurement-to-track assignment methods in target tracking
  • Measurement-to-track assignment methods in target tracking (en)
skos:notation
  • RIV/49777513:23520/11:43898206!RIV14-MSM-23520___
http://linked.open...avai/predkladatel
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(1M0572), P(GAP103/11/1353), S
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 211191
http://linked.open...ai/riv/idVysledku
  • RIV/49777513:23520/11:43898206
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Stochastic systems, State estimation, Tracking, Measurement-to-Track assignment, Recursive estimation (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [FCF3DBB4207C]
http://linked.open...v/mistoKonaniAkce
  • Velké Karlovice
http://linked.open...i/riv/mistoVydani
  • New York
http://linked.open...i/riv/nazevZdroje
  • Proceedings of 12th International Carpathian Control Conference
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Straka, Ondřej
  • Šimandl, Miroslav
  • Bouček, Václav
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
number of pages
http://bibframe.org/vocab/doi
  • 10.1109/CarpathianCC.2011.5945810
http://purl.org/ne...btex#hasPublisher
  • IEEE
https://schema.org/isbn
  • 978-1-61284-359-9
http://localhost/t...ganizacniJednotka
  • 23520
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software