About: Adaptive Importance Sampling in Particle Filtering     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
  • Computational efficiency of the particle filter, as a method based on importance sampling, depends on the choice of the proposal density. Various default schemes, such as the bootstrap proposal, can be very inefficient in demanding applications. Adaptive particle filtering is a general class of algorithms that adapt the proposal function using the observed data. Adaptive importance sampling is a technique based on parametrization of the proposal and recursive estimation of the parameters. In this paper, we investigate the use of the adaptive importance sampling in the context of particle filtering. Specifically, we propose and test several options of parameter initialization and particle association. The technique is applied in a demanding scenario of tracking an atmospheric release of radiation. In this scenario, the likelihood of the observations is rather sharp and its evaluation is computationally expensive. Hence, the overhead of the adaptation procedure is negligible and the proposed adaptive technique clearly improves over non-adaptive methods.
  • Computational efficiency of the particle filter, as a method based on importance sampling, depends on the choice of the proposal density. Various default schemes, such as the bootstrap proposal, can be very inefficient in demanding applications. Adaptive particle filtering is a general class of algorithms that adapt the proposal function using the observed data. Adaptive importance sampling is a technique based on parametrization of the proposal and recursive estimation of the parameters. In this paper, we investigate the use of the adaptive importance sampling in the context of particle filtering. Specifically, we propose and test several options of parameter initialization and particle association. The technique is applied in a demanding scenario of tracking an atmospheric release of radiation. In this scenario, the likelihood of the observations is rather sharp and its evaluation is computationally expensive. Hence, the overhead of the adaptation procedure is negligible and the proposed adaptive technique clearly improves over non-adaptive methods. (en)
Title
  • Adaptive Importance Sampling in Particle Filtering
  • Adaptive Importance Sampling in Particle Filtering (en)
skos:prefLabel
  • Adaptive Importance Sampling in Particle Filtering
  • Adaptive Importance Sampling in Particle Filtering (en)
skos:notation
  • RIV/67985556:_____/13:00394050!RIV14-MV0-67985556
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GAP102/11/0437), P(VG20102013018)
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
  • 59487
http://linked.open...ai/riv/idVysledku
  • RIV/67985556:_____/13:00394050
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • importance sampling; sequential monte carlo; sufficient statistics (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [7051BB6C38F2]
http://linked.open...v/mistoKonaniAkce
  • Istanbul
http://linked.open...i/riv/mistoVydani
  • Istanbul
http://linked.open...i/riv/nazevZdroje
  • Proceeding of the 16th International Conference on Information Fusion
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
  • Hofman, Radek
  • Šmídl, Václav
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
number of pages
http://purl.org/ne...btex#hasPublisher
  • ISIF
https://schema.org/isbn
  • 978-605-86311-1-3
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, 107 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software