Loading…

Series Expansion Approximations of Brownian Motion for Non-Linear Kalman Filtering of Diffusion Processes

In this paper, we describe a novel application of sigma-point methods to continuous-discrete filtering. The nonlinear continuous-discrete filtering problem is often computationally intractable to solve. Assumed density filtering methods attempt to match statistics of the filtering distribution to so...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on signal processing 2014-03, Vol.62 (6), p.1514-1524
Main Authors: Lyons, Simon M. J., Sarkka, Simo, Storkey, Amos J.
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c354t-75260c0bc1491bb5b2282ef9219a8efb601b3ea1b9490f926121fd57ea0a2bd33
cites cdi_FETCH-LOGICAL-c354t-75260c0bc1491bb5b2282ef9219a8efb601b3ea1b9490f926121fd57ea0a2bd33
container_end_page 1524
container_issue 6
container_start_page 1514
container_title IEEE transactions on signal processing
container_volume 62
creator Lyons, Simon M. J.
Sarkka, Simo
Storkey, Amos J.
description In this paper, we describe a novel application of sigma-point methods to continuous-discrete filtering. The nonlinear continuous-discrete filtering problem is often computationally intractable to solve. Assumed density filtering methods attempt to match statistics of the filtering distribution to some set of more tractable probability distributions. Filters such as these are usually decompose the problem into two sub-problems. The first of these is a prediction step, in which one uses the known dynamics of the signal to predict its state at time tk+1 given observations up to time tk. In the second step, one updates the prediction upon arrival of the observation at time tk+1. The aim of this paper is to describe a novel method that improves the prediction step. We decompose the Brownian motion driving the signal in a generalised Fourier series, which is truncated after a number of terms. This approximation to Brownian motion can be described using a relatively small number of Fourier coefficients, and allows us to compute statistics of the filtering distribution with a single application of a sigma-point method. Assumed density filters that exist in the literature usually rely on discretisation of the signal dynamics followed by iterated application of a sigma point transform (or a limiting case thereof). Iterating the transform in this manner can lead to loss of information about the filtering distribution in highly non-linear settings. We demonstrate that our method is better equipped to cope with such problems.
doi_str_mv 10.1109/TSP.2014.2303430
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1520945335</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6728679</ieee_id><sourcerecordid>3268635231</sourcerecordid><originalsourceid>FETCH-LOGICAL-c354t-75260c0bc1491bb5b2282ef9219a8efb601b3ea1b9490f926121fd57ea0a2bd33</originalsourceid><addsrcrecordid>eNpdkMtLAzEQhxdRUKt3wcuCCF62Tp67OWp9Yn2ACt6W7DqRlG1Skxb1vzdrSw-eksx882PyZdkBgSEhoE5fnp-GFAgfUgaMM9jIdojipABeys10B8EKUZVv29lujBNIJFdyJ7PPGCzG_PJ7pl203uVns1nw33aq5-kVc2_y8-C_nNUuv_d9LTc-5A_eFWPrUIf8TnfT1Lyy3TxluY9-5MIas_iLewq-xRgx7mVbRncR91fnIHu9unwZ3RTjx-vb0dm4aJng86IUVEILTUu4Ik0jGkorikZRonSFppFAGoaaNIorSGVJKDHvokQNmjbvjA2yk2Vu-sbnAuO8ntrYYtdph34RayIoKC4YEwk9-odO_CK4tF2iCEsaSyoTBUuqDT7GgKaehaQn_NQE6t59ndzXvft65T6NHK-CdWx1Z4J2rY3rOVpxYLLsucMlZxFx3ZYlrWSp2C8yNYy-</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1513343726</pqid></control><display><type>article</type><title>Series Expansion Approximations of Brownian Motion for Non-Linear Kalman Filtering of Diffusion Processes</title><source>IEEE Electronic Library (IEL) Journals</source><creator>Lyons, Simon M. J. ; Sarkka, Simo ; Storkey, Amos J.</creator><creatorcontrib>Lyons, Simon M. J. ; Sarkka, Simo ; Storkey, Amos J.</creatorcontrib><description>In this paper, we describe a novel application of sigma-point methods to continuous-discrete filtering. The nonlinear continuous-discrete filtering problem is often computationally intractable to solve. Assumed density filtering methods attempt to match statistics of the filtering distribution to some set of more tractable probability distributions. Filters such as these are usually decompose the problem into two sub-problems. The first of these is a prediction step, in which one uses the known dynamics of the signal to predict its state at time tk+1 given observations up to time tk. In the second step, one updates the prediction upon arrival of the observation at time tk+1. The aim of this paper is to describe a novel method that improves the prediction step. We decompose the Brownian motion driving the signal in a generalised Fourier series, which is truncated after a number of terms. This approximation to Brownian motion can be described using a relatively small number of Fourier coefficients, and allows us to compute statistics of the filtering distribution with a single application of a sigma-point method. Assumed density filters that exist in the literature usually rely on discretisation of the signal dynamics followed by iterated application of a sigma point transform (or a limiting case thereof). Iterating the transform in this manner can lead to loss of information about the filtering distribution in highly non-linear settings. We demonstrate that our method is better equipped to cope with such problems.</description><identifier>ISSN: 1053-587X</identifier><identifier>EISSN: 1941-0476</identifier><identifier>DOI: 10.1109/TSP.2014.2303430</identifier><identifier>CODEN: ITPRED</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Applied sciences ; Approximation methods ; Brownian motion ; Decomposition ; Density ; Detection, estimation, filtering, equalization, prediction ; Differential equations ; Exact sciences and technology ; Filtering ; Filtration ; Information, signal and communications theory ; Kalman filters ; Markov processes ; Mathematical model ; multidimensional signal processing ; Noise ; nonlinear filters ; Nonlinearity ; Signal and communications theory ; Signal, noise ; Statistics ; Stochastic processes ; Telecommunications and information theory ; Transforms</subject><ispartof>IEEE transactions on signal processing, 2014-03, Vol.62 (6), p.1514-1524</ispartof><rights>2015 INIST-CNRS</rights><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2014</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c354t-75260c0bc1491bb5b2282ef9219a8efb601b3ea1b9490f926121fd57ea0a2bd33</citedby><cites>FETCH-LOGICAL-c354t-75260c0bc1491bb5b2282ef9219a8efb601b3ea1b9490f926121fd57ea0a2bd33</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6728679$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,27901,27902,54771</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=28403670$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Lyons, Simon M. J.</creatorcontrib><creatorcontrib>Sarkka, Simo</creatorcontrib><creatorcontrib>Storkey, Amos J.</creatorcontrib><title>Series Expansion Approximations of Brownian Motion for Non-Linear Kalman Filtering of Diffusion Processes</title><title>IEEE transactions on signal processing</title><addtitle>TSP</addtitle><description>In this paper, we describe a novel application of sigma-point methods to continuous-discrete filtering. The nonlinear continuous-discrete filtering problem is often computationally intractable to solve. Assumed density filtering methods attempt to match statistics of the filtering distribution to some set of more tractable probability distributions. Filters such as these are usually decompose the problem into two sub-problems. The first of these is a prediction step, in which one uses the known dynamics of the signal to predict its state at time tk+1 given observations up to time tk. In the second step, one updates the prediction upon arrival of the observation at time tk+1. The aim of this paper is to describe a novel method that improves the prediction step. We decompose the Brownian motion driving the signal in a generalised Fourier series, which is truncated after a number of terms. This approximation to Brownian motion can be described using a relatively small number of Fourier coefficients, and allows us to compute statistics of the filtering distribution with a single application of a sigma-point method. Assumed density filters that exist in the literature usually rely on discretisation of the signal dynamics followed by iterated application of a sigma point transform (or a limiting case thereof). Iterating the transform in this manner can lead to loss of information about the filtering distribution in highly non-linear settings. We demonstrate that our method is better equipped to cope with such problems.</description><subject>Applied sciences</subject><subject>Approximation methods</subject><subject>Brownian motion</subject><subject>Decomposition</subject><subject>Density</subject><subject>Detection, estimation, filtering, equalization, prediction</subject><subject>Differential equations</subject><subject>Exact sciences and technology</subject><subject>Filtering</subject><subject>Filtration</subject><subject>Information, signal and communications theory</subject><subject>Kalman filters</subject><subject>Markov processes</subject><subject>Mathematical model</subject><subject>multidimensional signal processing</subject><subject>Noise</subject><subject>nonlinear filters</subject><subject>Nonlinearity</subject><subject>Signal and communications theory</subject><subject>Signal, noise</subject><subject>Statistics</subject><subject>Stochastic processes</subject><subject>Telecommunications and information theory</subject><subject>Transforms</subject><issn>1053-587X</issn><issn>1941-0476</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><recordid>eNpdkMtLAzEQhxdRUKt3wcuCCF62Tp67OWp9Yn2ACt6W7DqRlG1Skxb1vzdrSw-eksx882PyZdkBgSEhoE5fnp-GFAgfUgaMM9jIdojipABeys10B8EKUZVv29lujBNIJFdyJ7PPGCzG_PJ7pl203uVns1nw33aq5-kVc2_y8-C_nNUuv_d9LTc-5A_eFWPrUIf8TnfT1Lyy3TxluY9-5MIas_iLewq-xRgx7mVbRncR91fnIHu9unwZ3RTjx-vb0dm4aJng86IUVEILTUu4Ik0jGkorikZRonSFppFAGoaaNIorSGVJKDHvokQNmjbvjA2yk2Vu-sbnAuO8ntrYYtdph34RayIoKC4YEwk9-odO_CK4tF2iCEsaSyoTBUuqDT7GgKaehaQn_NQE6t59ndzXvft65T6NHK-CdWx1Z4J2rY3rOVpxYLLsucMlZxFx3ZYlrWSp2C8yNYy-</recordid><startdate>20140315</startdate><enddate>20140315</enddate><creator>Lyons, Simon M. J.</creator><creator>Sarkka, Simo</creator><creator>Storkey, Amos J.</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20140315</creationdate><title>Series Expansion Approximations of Brownian Motion for Non-Linear Kalman Filtering of Diffusion Processes</title><author>Lyons, Simon M. J. ; Sarkka, Simo ; Storkey, Amos J.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c354t-75260c0bc1491bb5b2282ef9219a8efb601b3ea1b9490f926121fd57ea0a2bd33</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Applied sciences</topic><topic>Approximation methods</topic><topic>Brownian motion</topic><topic>Decomposition</topic><topic>Density</topic><topic>Detection, estimation, filtering, equalization, prediction</topic><topic>Differential equations</topic><topic>Exact sciences and technology</topic><topic>Filtering</topic><topic>Filtration</topic><topic>Information, signal and communications theory</topic><topic>Kalman filters</topic><topic>Markov processes</topic><topic>Mathematical model</topic><topic>multidimensional signal processing</topic><topic>Noise</topic><topic>nonlinear filters</topic><topic>Nonlinearity</topic><topic>Signal and communications theory</topic><topic>Signal, noise</topic><topic>Statistics</topic><topic>Stochastic processes</topic><topic>Telecommunications and information theory</topic><topic>Transforms</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Lyons, Simon M. J.</creatorcontrib><creatorcontrib>Sarkka, Simo</creatorcontrib><creatorcontrib>Storkey, Amos J.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998–Present</collection><collection>IEEE</collection><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ANTE: Abstracts in New Technology &amp; Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE transactions on signal processing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Lyons, Simon M. J.</au><au>Sarkka, Simo</au><au>Storkey, Amos J.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Series Expansion Approximations of Brownian Motion for Non-Linear Kalman Filtering of Diffusion Processes</atitle><jtitle>IEEE transactions on signal processing</jtitle><stitle>TSP</stitle><date>2014-03-15</date><risdate>2014</risdate><volume>62</volume><issue>6</issue><spage>1514</spage><epage>1524</epage><pages>1514-1524</pages><issn>1053-587X</issn><eissn>1941-0476</eissn><coden>ITPRED</coden><abstract>In this paper, we describe a novel application of sigma-point methods to continuous-discrete filtering. The nonlinear continuous-discrete filtering problem is often computationally intractable to solve. Assumed density filtering methods attempt to match statistics of the filtering distribution to some set of more tractable probability distributions. Filters such as these are usually decompose the problem into two sub-problems. The first of these is a prediction step, in which one uses the known dynamics of the signal to predict its state at time tk+1 given observations up to time tk. In the second step, one updates the prediction upon arrival of the observation at time tk+1. The aim of this paper is to describe a novel method that improves the prediction step. We decompose the Brownian motion driving the signal in a generalised Fourier series, which is truncated after a number of terms. This approximation to Brownian motion can be described using a relatively small number of Fourier coefficients, and allows us to compute statistics of the filtering distribution with a single application of a sigma-point method. Assumed density filters that exist in the literature usually rely on discretisation of the signal dynamics followed by iterated application of a sigma point transform (or a limiting case thereof). Iterating the transform in this manner can lead to loss of information about the filtering distribution in highly non-linear settings. We demonstrate that our method is better equipped to cope with such problems.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/TSP.2014.2303430</doi><tpages>11</tpages></addata></record>
fulltext fulltext
identifier ISSN: 1053-587X
ispartof IEEE transactions on signal processing, 2014-03, Vol.62 (6), p.1514-1524
issn 1053-587X
1941-0476
language eng
recordid cdi_proquest_miscellaneous_1520945335
source IEEE Electronic Library (IEL) Journals
subjects Applied sciences
Approximation methods
Brownian motion
Decomposition
Density
Detection, estimation, filtering, equalization, prediction
Differential equations
Exact sciences and technology
Filtering
Filtration
Information, signal and communications theory
Kalman filters
Markov processes
Mathematical model
multidimensional signal processing
Noise
nonlinear filters
Nonlinearity
Signal and communications theory
Signal, noise
Statistics
Stochastic processes
Telecommunications and information theory
Transforms
title Series Expansion Approximations of Brownian Motion for Non-Linear Kalman Filtering of Diffusion Processes
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-05T14%3A07%3A54IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Series%20Expansion%20Approximations%20of%20Brownian%20Motion%20for%20Non-Linear%20Kalman%20Filtering%20of%20Diffusion%20Processes&rft.jtitle=IEEE%20transactions%20on%20signal%20processing&rft.au=Lyons,%20Simon%20M.%20J.&rft.date=2014-03-15&rft.volume=62&rft.issue=6&rft.spage=1514&rft.epage=1524&rft.pages=1514-1524&rft.issn=1053-587X&rft.eissn=1941-0476&rft.coden=ITPRED&rft_id=info:doi/10.1109/TSP.2014.2303430&rft_dat=%3Cproquest_cross%3E3268635231%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c354t-75260c0bc1491bb5b2282ef9219a8efb601b3ea1b9490f926121fd57ea0a2bd33%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1513343726&rft_id=info:pmid/&rft_ieee_id=6728679&rfr_iscdi=true