The article summarizes current approaches to image fusion problem using fuzzy transformation (F-transform) with their weak points and proposes improved version of the algorithm which suppress them. The first part of this contribution brings brief theoretical introduction into problem domain. Next part analyses weak points of current implementations. Last part introduces improved algorithm and c...

In this article, by using a partial on locally compact semi-direct product groups, we present a compatible extension of the Fourier transform. As a consequence, we extend the fundamental theorems of Abelian Fourier transform to non-Abelian case.

This article proposes a new interval-valued fuzzy transform. Its construction is based on a possibilistic interpretation of the partition on which the fuzzy transform is built. The main advantage of this approach is that it provides specific interval valued functions whose interpretation is straightforward. This interpretation relates to a traditional sampling/reconstruction framework where lit...

We present a quantum algorithm for the f -conditioned phase transform which does not require any initialization of ancillary register. We also develop a quantum algorithm that can solve the generalized Deutsch-Jozsa problem by a single evaluation of a function.

Abstract The fuzzy transform setting (F-transform) is proposed as a tool for representation and approximation of type-1 and type-2 fuzzy numbers; the inverse F-transform on appropriate fuzzy partition of the membership interval [0,1] is used to characterize spaces of fuzzy numbers in such a way that arithmetic operations are de…ned and expressed in terms of the F-transform of the results. A typ...

The classical method of numerically computing the Fourier transform of digitizedfunctions in one or in ddimensions is the so-called discrete Fourier transform ( D F T ) , efficiently implemented as Fast Fourier Transform ( F F T ) algorithms. In m n y cases the D F T is not an adequate appmximation of the continuous Fourier transform. The method presented in this contribution provides accurate ...

The fuzzy transform (F-transform) is ubiquitous in different research fields and applications, such as image data compression, mining, knowledge discovery, the analysis of linguistic expressions. As a generalization F-transform, this article, we introduce continuous F-transform its inverse, an integral operator induced by kernel function. Through relation between membership functions kernels, s...

and the inverse Fourier transform is f (x) = 1 2π ∫ ∞ −∞ F(ω)e dω Recall that i = √−1 and eiθ = cos θ+ i sin θ. Think of it as a transformation into a different set of basis functions. The Fourier transform uses complex exponentials (sinusoids) of various frequencies as its basis functions. (Other transforms, such as Z, Laplace, Cosine, Wavelet, and Hartley, use different basis functions). A Fo...

Singularities of the Radon transform of a piecewise smooth function f(x), x e R" , n > 2, are calculated. If the singularities of the Radon transform are known, then the equations of the surfaces of discontinuity of f(x) are calculated by applying the Legendre transform to the functions, which appear in the equations of the discontinuity surfaces of the Radon transform of f(x) ; examples are gi...