Distributed combination of belief functions - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Information Fusion Année : 2021

Distributed combination of belief functions

Résumé

We consider the problem of combining belief functions in a situation where pieces of evidence are held by agents at the node of a communication network, and each agent can only exchange information with its neighbors. Using the concept of weight of evidence, we propose distributed implementations of Dempster's rule and the cautious rule based, respectively, on average and maximum consensus algorithms. We also describe distributed procedures whereby the agents can agree on a frame of discernment and a list of supported hypotheses, thus reducing the amount of data to be exchanged in the network. Finally, we show the feasibility of a robust combination procedure based on a distributed implementation of the random sample consensus (RANSAC) algorithm.
Fichier principal
Vignette du fichier
distcomb_v2clean.pdf (540.13 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02944536 , version 1 (21-09-2020)

Identifiants

Citer

Thierry Denoeux. Distributed combination of belief functions. Information Fusion, 2021, 65, pp.179-191. ⟨10.1016/j.inffus.2020.09.001⟩. ⟨hal-02944536⟩
23 Consultations
166 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More