Results 171 to 180 of about 720 (219)
<i>FIAT LUX</i>: The Mullein's (<i>Verbascum</i> sp.) Image and Its Symbology Through History Within the Euro-Mediterranean Culture. [PDF]
Plants (Basel)Soldovieri N +4 more
europepmc +1 more source
Multipliers for the Mellin Transformation
Canadian Mathematical Bulletin, 1978 AbstractIn this paper we generalize the Mellin multiplier theorem we proved earlier [8] to spaces with quite general weights, satisfying an Ap-type condition. Applications are made to the Hilbert transformation.
P G Rooney
exaly +3 more sources
Mellin Distributions and the Mellin Transformation
, 1992 The Fourier transform Fσ of a function σ ∈ S\(\left( {{{\mathbb{R}}^{n}}} \right)\) is defined by $$\mathcal{F}\sigma \left( \xi \right) = {{\left( {2\pi } \right)}^{{ - \tfrac{n}{2}}}}\int_{{{{\mathbb{R}}^{n}}}} {{{e}^{{ - ix\xi }}}\sigma \left( x \right)dx{\text{ for }}\xi \in {{\mathbb{R}}^{n}}}$$ . The transformation F is an isomorphism of S
Zofia Szmydt, Bogdan Ziemian
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Eine schnelle Mellin-Transformation
Computing (Vienna/New York), 1984A numerical method is developed which handles the Mellin transform (1) \(M_{\epsilon}(y;f)=\int^{\infty}_{0}x^{-iy-\epsilon}f(x)dx,y\in [0,\infty),\epsilon \geq 0,i=\sqrt{\quad -1}\) of a Fourier-bandlimited function f(x). Denoting \(F(z)(F(z)=0\) for \(z\geq Z_ 0)\) the Fourier transform of the even continuation of f(x), then instead of (1) one can ...
exaly +3 more sources
A Geometric Invariant Shape Descriptor Based on the Radon, Fourier, and Mellin Transforms
, 2010 ISSN: 1051-4651 Print ISBN: 978-1-4244-7542-1International audienceA new shape descriptor invariant to geometric transformation based on the Radon, Fourier, and Mellin transforms is proposed.
Salvatore Tabbone
exaly +2 more sources
2018 IEEE 16th International Symposium on Intelligent Systems and Informatics (SISY), 2018
© 2018 IEEE. One generalization of the Mellin integral transform in terms of pseudo-analysis is presented in the paper. Basic properties of this type of integral transform and one example are given. Both the g- Mellin convolution and the inverse g- Mellin transform are defined.
Duraković, Nataša +4 more
openaire +1 more source
© 2018 IEEE. One generalization of the Mellin integral transform in terms of pseudo-analysis is presented in the paper. Basic properties of this type of integral transform and one example are given. Both the g- Mellin convolution and the inverse g- Mellin transform are defined.
Duraković, Nataša +4 more
openaire +1 more source
On the Mellin transform of products of Bessel and generalized hypergeometric functions
Journal of Computational and Applied Mathematics, 1997 We deduce in an elementary way representations for the Mellin transform of a product of Bessel functions 0F1[−a2x2] and generalized hypergeometric functions pFp+1[−b2x2] for a,b>0.
Allen R Miller
exaly +2 more sources
1995 International Conference on Acoustics, Speech, and Signal Processing, 2002
Most machine speech analysis and processing is based on a warped spectral representation. The intent of the paper is to present a method by which proper warped representations can be computed efficiently. In the case of log-warping functions, the methods of the paper produce a wavelet-like transform as a linear convolution of a single log-warped ...
openaire +1 more source
Most machine speech analysis and processing is based on a warped spectral representation. The intent of the paper is to present a method by which proper warped representations can be computed efficiently. In the case of log-warping functions, the methods of the paper produce a wavelet-like transform as a linear convolution of a single log-warped ...
openaire +1 more source
J. Inf. Process. Cybern., 1984
A fast algorithm of the Mellin transform is proposed. Its process consists of two steps: (1) Discrete Fourier Transformation (DFT) based on sampling through a symmetric window, (2) Multiplication of DFT coefficients by pre-calculated Mellin transforms of the Fourier basis functions. The pre-calculation is related to the incomplete gamma function. Thus,
Michael Brill, Gerhard West
openaire +1 more source
A fast algorithm of the Mellin transform is proposed. Its process consists of two steps: (1) Discrete Fourier Transformation (DFT) based on sampling through a symmetric window, (2) Multiplication of DFT coefficients by pre-calculated Mellin transforms of the Fourier basis functions. The pre-calculation is related to the incomplete gamma function. Thus,
Michael Brill, Gerhard West
openaire +1 more source