Sign in
Author
|
Conference
|
Journal
|
Organization
|
Year
|
DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(13)
bayesian filtering
bayesian method
Conditional Probability
Covariance Matrix Estimator
Discrete Fourier Transform
Mathematical Model
Non-linear Filtering
Numerical Algorithm
Particle Filter
Performance Optimization
State Space Model
Fast Fourier Transform
kalman filter
Subscribe
Academic
Publications
Non-linear Bayesian filtering by convolution method using fast Fourier transform
Non-linear Bayesian filtering by convolution method using fast Fourier transform,Huilong Zhang
Edit
Non-linear Bayesian filtering by convolution method using fast Fourier transform
(
Citations: 1
)
BibTex
|
RIS
|
RefWorks
Download
Huilong Zhang
Using Kalman techniques, it is possible to perform
optimal estimation
in linear Gaussian state-space models. When the Gaussian assumptions are inadequate, the Kalman-type filters fail to be optimal. Classical filtering methods, such as the
particle filter
or Zakai filter can still be optimal as they provide not only the mean and
covariance matrix
estimations but also the
conditional probability
density of the state, given the observations. In this article, we propose a new method to calculate the filtering distribution. Our method is grid-based, and uses the convolution method to calculate the prediction step. The novelty of our approach is that we apply a
fast Fourier transform
technique to obtain a competitive numerical algorithm. Our approach is compared to classical methods such as UKF, EKF and particle filters.
Published in 2011.
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
ieeexplore.ieee.org
)
(
ieeexplore.ieee.org
)
Citation Context
(1)
...The resulting grid is in the general case no longer Cartesian, however it can be easily transformed into a Cartesian grid by interpolation. See [
13
] for details...
Michele Pace
,
et al.
Grid based PHD filtering by Fast Fourier Transform
References
(11)
the fast fourier transform
(
Citations: 735
)
E. O. Brigham
Published in 1974.
PFLib: an object oriented MATLAB toolbox for particle filtering
(
Citations: 3
)
Lingji Chen
,
Chihoon Lee
,
Amarjit Budhiraja
,
Raman K. Mehra
Published in 2007.
An Algorithm for the Machine Calculation of Complex Fourier Series
(
Citations: 2576
)
James W. Cooley
,
John W. Tukey
Journal:
Mathematics of Computation - Math. Comput.
, vol. 19, no. 90, pp. 297-297, 1965
On sequential Monte Carlo sampling methods for Bayesian filtering
(
Citations: 1264
)
ARNAUD DOUCET
,
SIMON GODSILL
,
CHRISTOPHE ANDRIEU
Journal:
Statistics and Computing
, 2000
FFTW: an adaptive software architecture for the FFT
(
Citations: 594
)
Matteo Frigo
,
Steven G. Johnson
Conference:
International Conference on Acoustics, Speech, and Signal Processing - ICASSP
, vol. 3, pp. 1381-1384 vol.3, 1998
Sort by:
Citations
(1)
Grid based PHD filtering by Fast Fourier Transform
(
Citations: 1
)
Michele Pace
,
Huilong Zhang
Published in 2011.