This paper presents a new clustering algorithm named improved type-2 possibilistic fuzzy c-means (IT2PFCM) for fuzzy segmentation of magnetic resonance imaging, which combines the advantages of type 2 fuzzy set, the fuzzy c-means (FCM) and Possibilistic fuzzy c-means clustering (PFCM). First of all, the type 2 fuzzy is used to fuse the membership function of the two segmentation algorithms (FCM...

Determining if two images acquired at different times and under different viewing conditions contain the same scene is a difficult problem in computer vision. We demonstrate an approach that utilizes spatial relationships among the objects in the two scenes that ultimately produces a mapping of objects from one view to the other, and as a bonus, recovers the viewing transformation parameters. T...

In this paper, we investigate belief revision in possibilistic logic, which is a weighted logic proposed to deal with incomplete and uncertain information. Existing revision operators in possibilistic logic are restricted in the sense that the input information can only be a formula instead of a possibilistic knowledge base which is a set of weighted formulas. To break this restriction, we cons...

Qualitative possibilistic networks, also known as min-based possibilistic networks, are important tools for handling uncertain information in the possibility theory framework. Despite their importance, only the junction tree adaptation has been proposed for exact reasoning with such networks. This paper explores alternative algorithms using compilation techniques. We first propose possibilistic...

Possibilistic networks are useful tools for reasoning under uncertainty. Uncertain pieces of information can be described by different measures: possibility measures, necessity measures and more recently, guaranteed possibility measures, denoted by Δ. This paper first proposes the use of guaranteed possibility measures to define a so-called Δ-based possibilistic network. This graphical represen...

Naive Bayesian Classifiers, which rely on independence hypotheses, together with a normality assumption to estimate densities for numerical data, are known for their simplicity and their effectiveness. However, estimating densities, even under the normality assumption, may be problematic in case of poor data. In such a situation, possibility distributions may provide a more faithful representat...

Fuzzy clustering is well known as a robust and efficient way to reduce computation cost to obtain the better results. In the literature, many robust fuzzy clustering models have been presented such as Fuzzy C-Mean (FCM) and Possibilistic C-Mean (PCM), where these methods are Type-I Fuzzy clustering. Type-II Fuzzy sets, on the other hand, can provide better performance than Type-I Fuzzy sets, es...

This paper addresses the problem of merging uncertain information in the framework of possibilistic logic. It presents several syntactic combination rules to merge possibilistic knowledge bases, provided by different sources, into a new possibilistic knowledge base. These combination rules are first described at the meta-level outside the language of possibilistic logic. Next, an extension of p...

Manipulation of perceptions is a remarkable human capability in a wide variety of physical and mental tasks under fuzzy or uncertain surroundings. Possibilistic reasoning can be treated as a mechanism that mimics human inference mechanisms with uncertain information. Petri nets are a graphical and mathematical modeling tool with powerful modeling and analytical ability. The focus of this paper ...

A possibilistic fuzzy c-means (PFCM) algorithm is a reliable proposed to deal with the weaknesses associated handling noise sensitivity and coincidence clusters in (FCM) (PCM). However, PFCM only applicable complete data sets. Therefore, this research modified for clustering incomplete sets OCSPFCM NPSPFCM performance evaluated based on three aspects, 1) accuracy percentage, 2) number of iterat...