Distances between fuzzy sets

Given two fuzzy subsets @m and @n of a metric space S (e.g., the Euclidean plane), we define the 'shortest distance' between @m and @n as a density function on the non-negative reals; our definition is applicable both when @m and @n are discrete-valued and when they are 'smooth' (i.e., differentiable), and it generalizes the definition of shortest distance for crisp sets in a natural way. We also define the mean distance between @m and @n, and show how it relates to the shortest distance. the relationship to earlier definitions of distance between fuzzy sets [1,3] is also discussed.

[1]  Azriel Rosenfeld,et al.  A Note on the Use of Local MIN and MAX Operations in Digital Picture Processing , 1977 .

[2]  Azriel Rosenfeld,et al.  The fuzzy geometry of image subsets , 1984, Pattern Recognit. Lett..

[3]  Azriel Rosenfeld,et al.  A Min-Max Medial Axis Transformation , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Didier Dubois,et al.  Fuzzy sets and systems ' . Theory and applications , 2007 .

[5]  James C. Bezdek,et al.  Pattern Recognition with Fuzzy Objective Function Algorithms , 1981, Advanced Applications in Pattern Recognition.