Belief Functions: Theory and Algorithms
File | Description | Size | Format | |
---|---|---|---|---|
00103727-1.pdf | 3.71 MB | Adobe PDF | View/Open |
Other Titles: | Belief-Funktionen: Theorie und Algorithmen | Authors: | Reineking, Thomas | Supervisor: | Schill, Kerstin | 1. Expert: | Schill, Kerstin | Experts: | Palm, Günther | Abstract: | The subject of this thesis is belief function theory and its application in different contexts. Belief function theory can be interpreted as a generalization of Bayesian probability theory and makes it possible to distinguish between different types of uncertainty. In this thesis, applications of belief function theory are explored both on a theoretical and on an algorithmic level. The problem of exponential complexity associated with belief function inference is addressed in this thesis by showing how efficient algorithms can be developed based on Monte-Carlo approximations and exploitation of independence. The effectiveness of these algorithms is demonstrated in applications to particle filtering, simultaneous localization and mapping, and active classification. |
Keywords: | belief function theory; Dempster-Shafer theory; particle filtering; SLAM; classification; information gain | Issue Date: | 24-Mar-2014 | Type: | Dissertation | Secondary publication: | no | URN: | urn:nbn:de:gbv:46-00103727-16 | Institution: | Universität Bremen | Faculty: | Fachbereich 03: Mathematik/Informatik (FB 03) |
Appears in Collections: | Dissertationen |
Page view(s)
707
checked on Nov 18, 2024
Download(s)
263
checked on Nov 18, 2024
Google ScholarTM
Check
Items in Media are protected by copyright, with all rights reserved, unless otherwise indicated.