نتایج جستجو برای: direct f transform
تعداد نتایج: 821784 فیلتر نتایج به سال:
Let G be a finite group, f: G --+ C a function, and p an ir-reducible representation of G. The Fourier transform is defined as j(p) =E SEG f(s)p(s) . Direct computation for all irreducible representations involvesorder IGI2 operations. We derive fast algorithms and develop them for thesymmetric groupSn. There, (n!)2 is reduced to n(n!)a/2, where a is theconstant for matr...
A new approach has been proposed to design of an automatic infant cry recognition system based on the fuzzy transform (F-transform) that classifies two different kinds of cries, which come from physiological status and medical disease. Feature extraction and development of classification algorithms play an important role in the area of automatic analysis of infant cry signals. F-transform is th...
We propose to modify image inpainting technique based on F-transform for application dedicated to cartoon images. The images have typical features which are taken into consideration. These features make original algorithm ineffective, because of its isotropic nature. Proposed modification changes it to an anisotropic.
In this paper, we describe a new algorithm based on the discrete wavelet transform (DWT) which uses a multithreshold decision model (MTD model) to detect acoustic and phonetic classes (based on 10ms speech signal segments). The best thresholds of the model are found by using experimental pattern classification. Then a unit level interpolation technique is combined with the MTD model to classify...
IIn this research work, we have shown that it is possible to use fuzzy transform method (FTM) for the estimate solution of fractional system differential equations (FSDEs). In numerical methods, in order to estimate a function on a particular interval, only a restricted number of points are employed. However, what makes the F-transform preferable to other methods is that it makes use of all poi...
In 2006, Saito and Remy presented a new algorithm called polyharmonic local sine transform (PHLST) in image processing as follows. Let f be a twice continuously differentiable function on a domain Ω. First we approximate f by a polyharmonic function u such that the residual component v = f −u vanishes in the boundary of Ω. Next, we do the odd extension for v, and then do the periodic extension,...
The Cauchy transform of a measure has been used to study the analytic capacity and uniform rectifiability of subsets in C: Recently, Lund et al. (Experiment. Math. 7 (1998) 177) have initiated the study of such transform F of self-similar measure. In this and the forecoming papers (Starlikeness and the Cauchy transform of some self-similar measures, in preparation; The Cauchy transform on the S...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید