This article investigates the application of swarm and evolutionary algorithms, namely SOMA, DE, GA, for optimizing F-transform-based image compression. To do this, we introduce cost function, evaluating approximation decompressed to original image, concerning parameters that control quality F-transform. function is then minimized by selected algorithms find optimal settings compression decompr...

In this contribution we provide an application of the technique of F–transform. We demonstrate that by using a simple density-based preprocessing, the applicability of F–transform in data analysis can be significantly improved. Despite of the fact that our procedure is demonstrated by a well-known DBSCAN algorithm and the technique of F–transform, the ideas are general enough to be applied for ...

Radiological images are gradually more being used in healthcare and medical research. There is, accordingly, widespread interest in accurately relating information in the different images for diagnosis, treatment and basic science. In this paper we formulate feature registration problems by using F-transform (Fuzzy-Transform) to extract the salient edges and extracted control points (CP) of med...

This paper continues the development of the innovative method for time series analysis and forecasting using special soft-computing techniques: fuzzy (F-) transform and Fuzzy Natural Logic. We will demonstrate that the F-transform is a proper technique for extraction of the trend-cycle of time series. Furthermore, we will elaborate in more detail automatic generation of linguistic evaluation of...

For functions defined on Cn or Rn+ we construct a dequantization transform f 7→ f̂ ; this transform is closely related to the Maslov dequantization. If f is a polynomial, then the subdifferential ∂f̂ of f̂ coincides with the Newton polytope of f . For the semiring of polynomials with nonnegative coefficients, the dequantization transform is a homomorphism of this semiring to the idempotent semirin...

For functions defined on C or R+ we construct a dequantization transform f 7→ f̂ ; this transform is closely related to the Maslov dequantization. If f is a polynomial, then the subdifferential ∂f̂ of f̂ at the origin coincides with the Newton polytope of f . For the semiring of polynomials with nonnegative coefficients, the dequantization transform is a homomorphism of this semiring to the idempo...

The recent emergence of the discrete fractional Fourier transform has spurred research activity aiming at generating Hermite-Gaussian-like (HGL) orthonormal eigenvectors of the discrete Fourier transform (DFT) matrix F. By exploiting the unitarity of matrix F – resulting in the orthogonality of its eigenspaces pertaining to the distinct eigenvalues – the problem decouples into finding orthonorm...

the main goal of this paper is the study of the generalized hyers-ulam stability of the following functionalequation f (2x  y)  f (2x  y)  (n 1)(n  2)(n  3) f ( y)  2n2 f (x  y)  f (x  y)  6 f (x) where n  1,2,3,4 , in non–archimedean spaces, by using direct and fixed point methods.