Elsevier

Fuzzy Sets and Systems

Volume 180, Issue 1, 1 October 2011, Pages 41-54
Fuzzy Sets and Systems

Fuzzy transform and least-squares approximation: Analogies, differences, and generalizations

https://doi.org/10.1016/j.fss.2010.10.011Get rights and content

Abstract

Investigating the relations between the least-squares approximation techniques and the Fuzzy Transform, in this paper we show that the Discrete Fuzzy Transform is invariant with respect to the interpolating and least-squares approximation. Additionally, the Fuzzy Transform is evaluated at any point by simply resampling the continuous approximation underlying the input data. Using numerical linear algebra, we also derive new properties (e.g., stability to noise, additivity with respect to the input data) and characterizations (e.g., radial and dual membership maps) of the Discrete Fuzzy Transform. Finally, we define the geometry- and confidence-driven Discrete Fuzzy Transforms, which take into account the intrinsic geometry and the confidence weights associated to the data.

References (26)

  • L. Zhang et al.

    Association-rule knowledge discovery by using a fuzzy mining approach

    International Journal of Business Intelligence and Data Mining

    (2006)
  • U.M. Fayyad et al.

    From data mining to knowledge discovery in databases

    Artificial Intelligence Magazine

    (1996)
  • G. Piatetsky-Shapiro

    Knowledge discovery in databases: ten years after

    SIGKDD Explorations

    (2000)
  • Cited by (34)

    • A novel method of multimodal medical image fusion using fuzzy transform

      2016, Journal of Visual Communication and Image Representation
      Citation Excerpt :

      Since FTR deals with vectors and matrices, it has low computational complexity and is faster to implement than other traditional transforms. FTR is invariant with respect to interpolating and least square approximation [33] of input data. It possess noise removing abilities as well as smoothing abilities and is also successful in preserving true image edges, hence is successful in image processing applications.

    • Cubic B-spline fuzzy transforms for an efficient and secure compression in wireless sensor networks

      2016, Information Sciences
      Citation Excerpt :

      F–transform was proposed by Perfilieva [13] as a fuzzy approximation technique. It substantially expresses a functional dependency as a linear combination of basic functions and it can be used for the solution of direct and inverse problems or least–squares approximations [14]. The major applications of the F–transform are in image processing, e.g. [15–21].

    • A new reconstruction from the F-transform components

      2016, Fuzzy Sets and Systems
      Citation Excerpt :

      If we additionally demand that the inverse F-transform should be the best approximation of an original function in the space of all linear combinations of basic functions, then an intermediate transformation should be applied to the sequence of the F-transform components and converted to a sequence of coefficients in the best approximation. It is essential that this intermediate transformation can be expressed in terms of the underlying fuzzy partition (see details in [2,15]). By similar reasoning, if we demand the inverse F-transform to be coincident with the original function, we shall change its main parameter – the fuzzy partition.

    View all citing articles on Scopus
    View full text