F-boxes for filtering

Olivier Strauss (1) , Sébastien Destercke (2)

1 ICAR - Image & Interaction
2 Heudiasyc - Heuristique et Diagnostic des Systèmes Complexes [Compiègne]

Selecting a particular summative kernel (i.e., formally equivalent to a probability distribution) when filtering a digital signal can be a difficult task. An obvious solution to this problem is to filter with multiple kernels rather than with a single one, but the computing cost of such a solution can quickly become prohibitive (especially in real-time applications). Another alternative, the one studied in this paper, is to consider kernels modeled by imprecise probabilistic representations. Considering such representations makes the use of numerical tools coming from imprecise probability theory possible, such as the Choquet integral, and allows one to work with multiple kernels without multiplying too much the number of required computations. In this paper, we propose to use the well-known p-box representation to filter a digital signal. We show that the use p-boxes allows making more precise inferences than those obtained with possibility distributions and clouds. We then discuss the practical aspect of computing a filtered signal with p-boxes, and finish by some experiments.

Mots clés: Possibility measures; maxitive kernels; pboxes; clouds; signal filtering

Domaines: Traitement du signal et de l'image [eess.SP]; Traitement du signal et de l'image [eess.SP]

Olivier Strauss, Sébastien Destercke. F-boxes for filtering. EUSFLAT-LFA, European Society for Fuzzy Logic and Technology, Jul 2011, Aix-les-Bains, France. pp.935-942, ⟨10.2991/eusflat.2011.108⟩. ⟨hal-00655596⟩