Complexity analysis of the marginalized particle filter
Year: 2005
Type: article
Abstract: In this paper, the computational complexity of the marginalized particle filter is analyzed and a general method to perform this analysis is given. The key is the introduction of the equivalent flop measure. In an extensive Monte Carlo simulation, different computational aspects are studied and compared with the derived theoretical results.
Authors: R. Karlsson, T. Schon, F. Gustafsson
Institution: Linköping University
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W284394152
