Abstract
Fuzzy projection is a mathematical operator inspired by the inverse fuzzy transform that is used to approximate functions. The fuzzy projection is designed such that the coefficients of the linear combination of the basis functions (fuzzy sets in a fuzzy partition) are optimized to obtain the best approximation of the functions from a global perspective, as opposed to the fuzzy transform, where the approximation focuses on fitting functions locally. The aim of this paper is to extend the fuzzy projection to a higher degree, similarly to the fuzzy transform, where the coefficients of the linear combination of the basis functions are expressed by polynomials. In this way, we can significantly improve the quality of the approximation by combining the settings of the fuzzy partition and the degree of polynomnials. In this paper, we show that a higher-order fuzzy projection can be computed using matrix calculus, leading to an easy algorithmization of the method. We also give its approximation properties and its applicability to discrete functions. The usefulness of higher-order fuzzy projection is demonstrated on two tasks, namely continuous function approximation and audio signal compression and decompression, where the results are compared with other relevant methods.
Similar content being viewed by others
Data Availability
Not applicable.
Notes
Note that here we consider the F-transform designed for discrete functions that is used in data processing.
We use \(\lceil x \rceil\) to denote the ceiling function, e.g., \(\lceil 4.6\rceil =5\).
\(H^{m}(a,b)\) is a Hilbert space of functions that are m-times weakly differentiable on (a, b) endowed with the inner product
$$\begin{aligned} \langle f,g\rangle _{H^m}=\sum _{k=0}^{m}\langle \partial ^kf,\partial ^kg\rangle _{L^2},\quad f,g\in H^m(a,b), \end{aligned}$$where \(\partial ^kf\) and \(\partial ^kg\) are the k-times weak derivative of f and g, respectively.
This condition ensures that the nodes \(x_k\in \{0,1,\ldots ,n\}\) and the bandwidth h is a natural number.
Compression ratio means the ratio between the size of the compressed signal and the size of the original signal.
References
Perfilieva, I.: Fuzzy transforms: theory and applications. Fuzzy Sets Syst. 157, 993–1023 (2006)
Mamdani, E.H., Assilian, S.: An experiment in linguistic synthesis with a fuzzy logic controller. Int. J. Man-mach. Stud. 7(1), 1–13 (1975)
Takagi, T., Sugeno, M.: Fuzzy identification of systems and its application to modeling and control. IEEE Trans. Syst., Man, Cybern.: Syst. 15(1), 116–132 (1985)
Ghobadi, M., Matinfar, M., Allahviranloo, T.: Numerical solution of second order ivp by fuzzy transform method. Int. J. Nonlinear Anal. Appl. 12(1), 143–156 (2021)
Hurtik, P., Tomasiello, S.: A review on the application of fuzzy transform in data and image compression. Soft Comput. 23, 1–13 (2019)
Alibabaie, N., Latif, A.: Adaptive periodic noise reduction in digital images using fuzzy transform. J. Math. Imaging Vis. 63(4), 503–527 (2021)
Nguyen, L., Novák, V.: Forecasting seasonal time series based on fuzzy techniques. Fuzzy Sets Syst. 361, 114–129 (2019)
Lee, W.-J., Jung, H.-Y., Yoon, J.H., Choi, S.H.: A novel forecasting method based on f-transform and fuzzy time series. Int. J. Fuzzy Syst. 19(6), 1793–1802 (2017)
Holčapek, M., Nguyen, L., Tichý, T.: Polynomial alias higher degree fuzzy transform of complex-valued functions. Fuzzy Sets Syst. 342, 1–31 (2018)
Perfilieva, I., Daňková, M., Bede, B.: Towards a higher degree F-transform. Fuzzy Sets Syst. 180, 3–19 (2011)
Di Martino, F., Sessa, S., Perfilieva, I.: First order fuzzy transform for images compression. J. Signal Inform. Process. 8(03), 178 (2017)
Crouzet, J.-F.: Fuzzy projection versus inverse fuzzy transform as sampling/interpolation schemes. Fuzzy Sets Syst. 193, 108–121 (2012)
Patanè, G.: Fuzzy transform and least-squares approximation: analogies, differences, and generalizations. Fuzzy Sets Syst. 180(1), 41–54 (2011)
Min, H.-J., Shim, J.-W., Han, H.-J., Park, C.-H., Jung, H.-Y.: Fuzzy transform and least-squares fuzzy transform: comparison and application. Int. J. Fuzzy Syst. 24, 1–13 (2022)
Holčapek, M., Perfilieva, I., Novák, V., Kreinovich, V.: Necessary and sufficient conditions for generalized uniform fuzzy partitions. Fuzzy Sets syst. 277, 97–121 (2015)
Debnath, L., Mikusinski, P.: Introduction to Hilbert Spaces with Applications. Academic press, San Diego, California (2005)
Nguyen, L., Holčapek, M., Novák, V.: Multivariate fuzzy transform of complex-valued functions determined by monomial basis. Soft Comput. 21, 3641–3658 (2017)
Levine, W.S.: The Control Handbook (Three Volume Set). CRC Press, Florida (2018)
Loia, V., Tomasiello, S., Vaccaro, A.: Fuzzy transform based compression of electric signal waveforms for smart grids. IEEE Trans. Syst., Man, Cybern.: Syst. 47(1), 121–132 (2016)
Walczak, B., Massart, D.: Noise suppression and signal compression using the wavelet packet transform. Chemom. Intell. Lab. Syst. 36(2), 81–94 (1997)
Stein, E.M.: Singular Integrals and Differentiability Properties of Functions, vol. 2. Princeton University Press, New Jersey (1970)
Ciarlet, P.G.: The finite element method for elliptic problems. Studies in mathematics and its applications 4, North-Holland (1978)
Acknowledgements
This work has been partially supported by the Czech Science Foundation through the project No. 23-06280 S.
Funding
Not applicable.
Author information
Authors and Affiliations
Contributions
Not applicable.
Corresponding author
Ethics declarations
Conflict of interest
Not applicable
Ethics approval
Not applicable
Consent to participate
Not applicable.
Consent for publication
Not applicable.
Appendices
Appendix A Lemma 6
Proof
For any \(\phi _{k,i}\in \mathcal {B}^m_{\mathcal {A}}\), \(k\in \mathcal {M}\), \(i=0,\ldots ,m\), we have
If \(k<\frac{1}{\alpha }\), then \(\text{Supp}A_k=[a,x_k+h]\), where \(x_k\) is the k-th node of the fuzzy partition. It follows that
Putting \(u=\frac{x-a}{h}-k\alpha\), we obtain
The two remaining cases, i.e., \(k>N-\frac{1}{\alpha }\) and \(\frac{1}{\alpha }\le k\le N-\frac{1}{\alpha }\), can be proved by similar arguments.□
Appendix B Lemma 8
Proof
Assume that \(k\ge \ell\). For any \(i,j=0,\ldots ,m\), we have
For \(k-\ell \ge \frac{2}{\alpha }\), we simply find that \(\text{Supp}A_k\cap \text{Supp}A_\ell =\emptyset\). Therefore, \(\langle \phi _{k,i},\phi _{\ell ,j}\rangle _{L^2}=0\). Further, let us consider that \(k-\ell <\frac{2}{\alpha }\), i.e., \(\text{Supp}A_k\cap \text{Supp}A_\ell \not =\emptyset\). Here, we can distinguish three following cases: \(\text{Supp}A_k\cap \text{Supp}A_\ell =[a,x_\ell +h]\), if \(k<\frac{1}{\alpha }\), \(\text{Supp}A_k\cap \text{Supp}A_\ell =[x_k-h,b]\), if \(\ell >N-\frac{1}{\alpha }\), and \(\text{Supp}A_k\cap \text{Supp}A_\ell =[x_k-h,x_\ell +h]\), otherwise, where \(x_k\) and \(x_\ell\) are the k-th and \(\ell\)-th nodes, respectively. Since all cases can be verified by analogy, we prove here only the last case, i.e., \(\text{Supp}A_k\cap \text{Supp}A_\ell =[x_k-h,x_\ell +h]\). For this case, we have
Put \(u=\frac{x-a}{h}-\ell \alpha\). Then, we obtain that
and the proof is finished.□
Appendix C Theorem 15
Proof
Let \(x_k\), \(k\in \mathcal {M}\), be the k-th node of the fuzzy partition \(\mathcal {A}\). Since \(f\in H^{m+1}(a,b)\), we obtain from Theorem 5 in Chapter VI of [21] that f can be extended to a function \(f^*\) defined on the interval \(I=(x_{-M_\alpha }-h,\ldots ,x_{N+M_\alpha }+h)\) such that \(f^*\in H^{m+1}(I)\) and \(\Vert f^*\Vert _{H^{m+1}(I)}\le B\cdot \Vert f\Vert _{H^{m+1}(a,b)}\), where B is a positive constant. Let \(F^m_k[f^*]\), \(k\in \mathcal {M}\), be the k-th component of the direct F\(^m\)-transform of \(f^*\) with respect to \(\mathcal {A}\), whose basic functions are extended to I. Since the direct F\(^m\)-transform preserves polynomials of degree up to m, we obtain from Theorem 3.1.4 in [22] that there exists a constant \(C_0>0\) independent of h such that
where \(I_k=(x_k-h,x_k+h)\). Denote \(\Omega _k=I_k\cap (a,b)\). Since \(\Vert \partial ^{m+1}f^*\Vert _{L^2(I_k)}\le \Vert f^*\Vert _{H^{m+1}(I)}\) and \(\Vert f^*-F^m_k[f^*]\Vert _{L^2(\Omega _k)}\le \Vert f^*-F^m_k[f^*]\Vert _{L^2(I_k)}\), we find that
Since \(h=\frac{b-a}{\alpha N}\), there exists a constant \(C_1>0\) independent of N such that
for any \(k\in \mathcal {M}\). Let \(\xi\) be defined as follows:
We see that \(\xi \in G^m_{\mathcal {A}}\). Moreover, for any \(x\in (a,b)\), the sum in (C2) has at most \(2(M_\alpha +1)\) non-zero summands. Therefore, we obtain that
where the inequality follows from the Bunyakovsky-Cauchy-Schwarz inequality. Hence, we obtain that
By substituting (C1) into this inequality, we get
Therefore, there exists a constant \(C>0\) independent of N such that \(\Vert f^*-\xi \Vert _{L^2(a,b)}\le C\cdot N^{-m-\frac{1}{2}}.\) Putting \(L^2=L^2(a,b)\) and considering that f and \(f^*\) coincide on (a, b), we obtain that \(\Vert f-\xi \Vert _{L^2}\le C\cdot N^{-m-\frac{1}{2}}.\) It follows from (16) that
and the proof is finished.□
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Nguyen, L., Holčapek, M. Towards Higher-Degree Fuzzy Projection. Int. J. Fuzzy Syst. 25, 2234–2249 (2023). https://doi.org/10.1007/s40815-023-01506-0
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40815-023-01506-0