Powered by OpenAIRE graph
Found an issue? Give us feedback
addClaim

Combining belief functions and fuzzy membership functions

Authors: Mihai C. Florea; Anne-Laure Jousselme; Dominic Grenier; Eloi Bosse;

Combining belief functions and fuzzy membership functions

Abstract

In several practical applications of data fusion and more precisely in object identification problems, we need to combine imperfect information coming from different sources (sensors, humans, etc.), the resulting uncertainty being naturally of different kinds. In particular, one information could naturally been expressed by a membership function while the other could best be represented by a belief function. Usually, information modeled in the fuzzy sets formalism (by a membership function) concerns attributes like speed, length, or Radar Cross Section whose domains of definition are continuous. However, the object identification problem refers to a discrete and finite framework (the number of objects in the data base is finite and known). This implies thus a natural but unavoidable change of domain. To be able to respect the intrinsic characteristic of uncertainty arising from the different sources and fuse it in order to identify an object among a list of possible ones in the data base, we need (1) to use a unified framework where both fuzzy sets and belief functions can be expressed, (2) to respect the natural discretization of the membership function through the change of domain (from attribute domain to frame of discernment). In this paper, we propose to represent both fuzzy sets and belief function by random sets. While the link between belief functions and random sets is direct, transforming fuzzy sets into random sets involves the use of α-cuts for the construction of the focal elements. This transformation usually generates a large number of focal elements often unmanageable in a fusion process. We propose a way to reduce the number of focal elements based on some parameters like the desired number of focal elements, the acceptable distance from the approximated random set to the original discrete one, or the acceptable loss of information.

Related Organizations
  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    4
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Top 10%
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
4
Average
Top 10%
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!