Search results
Jump to navigation
Jump to search
Page title matches
- ...ter for the frequency and one parameter for the time. The {{mvar|N-point}} discrete paired transformation first was developed for orders {{mvar|N}} which are p The splitting of the signal is performed by the N-point discrete paired transformation χ'N whose basis functions χ'p,t(n) are defined by ...17 KB (2,668 words) - 23:03, 30 January 2025
Page text matches
- ...mmetric convolution can only be computed between a fixed set of compatible transforms. ==Mutually compatible transforms== ...4 KB (620 words) - 06:44, 31 January 2023
- *[[Fourier transform]] ([[List of Fourier-related transforms]]): ***[[Discrete-time Fourier transform]] (DTFT), the reverse of the Fourier series, a speci ...2 KB (293 words) - 12:51, 21 February 2023
- ...matics]], a '''discrete Chebyshev transform''' (DCT) is an analog of the [[discrete Fourier transform]] for a [[function (mathematics)|function]] of a [[real i ...yshev polynomials of the second kind <math> U_n (x) </math>. Both of these transforms result in coefficients of Chebyshev polynomials of the first kind. ...5 KB (787 words) - 20:01, 17 December 2024
- ...omputed Order Tracking (COT), Vold-Kalman Filter (VKF) and Order Tracking Transforms. == Order tracking transforms == ...5 KB (738 words) - 10:09, 30 August 2023
- ...].<ref>{{cite book | first=A.J. | last=Jerri | title=Integral and discrete transforms with applications and error analysis| location=New York | publisher=Marcel [[Category:Discrete transforms]] ...3 KB (402 words) - 15:30, 1 February 2025
- ...2014}}</ref><ref name=TAH>{{cite book|editor=Alexander D. Poularikas|title=Transforms and Applications Handbook|date=2010|publisher=CRC Press|isbn=978-1-4200-665 ==Discrete Zak transform: Definition== ...6 KB (1,079 words) - 17:33, 8 July 2023
- ...=Zhiyuan | title=On Algorithms and Complexities of Cyclotomic Fast Fourier Transforms Over Arbitrary Finite Fields| journal=IEEE Transactions on Signal Processin ...–Solomon codes]]. Generalized from the [[complex number|complex field]], a discrete Fourier transform of a sequence <math>\{f_i\}_{0}^{N-1}</math> over a finit ...6 KB (1,066 words) - 16:16, 29 December 2024
- ...n|year=1976}}.<ref>{{Citation | last1=Jørgensen | first1=Troels | title=On discrete groups of Möbius transformations | jstor=2373814 | mr=0427627 | year=1976 | The inequality states that if ''A'' and ''B'' generate a non-elementary discrete subgroup of the SL<sub>2</sub>('''C'''), then ...3 KB (374 words) - 11:22, 1 June 2024
- ...h>X</math> into inputs for <math>Y</math>, and the function <math>g</math> transforms outputs for <math>Y</math> into outputs for <math>X</math>.{{r|gss|cks}} ...ons must preserve the correctness of the output. That is, suppose that one transforms an input <math>x</math> for problem <math>X</math> to an input <math>y=f(x) ...6 KB (869 words) - 18:17, 12 February 2022
- ...between the [[closing (morphology)|closing]] and the input image. Top-hat transforms are used for various image processing tasks, such as [[feature extraction]] ...th> be a [[grayscale]] image, mapping points from a [[Euclidean space]] or discrete [[Lattice graph|grid]] ''E'' (such as <math>\mathbb{R}^2</math> or <math>\m ...6 KB (815 words) - 10:07, 16 May 2023
- ...categorized into '''[[Continuous function|continuous functions]]''' and '''discrete coefficients of continuous functions''': :Expression<ref>{{Cite journal |last=Farge |first=M. |title=Wavelet Transforms and Their Applications to Turbulence |journal=Annual Review of Fluid Mechan ...14 KB (2,028 words) - 02:23, 24 December 2024
- ...ter for the frequency and one parameter for the time. The {{mvar|N-point}} discrete paired transformation first was developed for orders {{mvar|N}} which are p The splitting of the signal is performed by the N-point discrete paired transformation χ'N whose basis functions χ'p,t(n) are defined by ...17 KB (2,668 words) - 23:03, 30 January 2025
- ...bridge University Press 2010</ref> of these input-output relationships and transforms is not necessarily the most efficient way to implement those. ...ts, such as the set of integers. An image is the simplest example of a 2-D discrete domain signal that is spatial in nature. ...12 KB (1,983 words) - 10:34, 22 February 2024
- ...on between the Poisson wavelet and the Poisson distribution let ''X'' be a discrete random variable having the Poisson distribution with parameter (mean) ''t'' ...n wavelet transforms using the formula for inverse continuous-time wavelet transforms. ...9 KB (1,399 words) - 06:53, 29 May 2024
- The zero bias transform may be applied to both discrete and continuous random variables. Consider a random variable ''T'' with mea If the random variable is discrete the integral becomes a sum from positive infinity to ''s''. ...4 KB (583 words) - 13:37, 17 December 2024
- ...omain]] representation of the signal. In the case of digital processing, a discrete Fourier Transform (DFT) is utilized to transform a sampled signal domain re where ''X'' stands for the multidimensional discrete Fourier transform, ''x'' stands for the sampled time/space domain signal, ' ...6 KB (862 words) - 20:51, 15 August 2020
- ...rier transform''' ('''HFFT''') uses existing FFT routines to compute the [[discrete Fourier transform]] (DFT) of images that have been captured with [[hexagona ===Hexagonal discrete Fourier transform=== ...8 KB (1,365 words) - 02:08, 27 November 2020
- ...Fessler|first1=J.A.|last2=Sutton|first2=B.P.|title=Nonuniform fast fourier transforms using min-max interpolation|journal=IEEE Transactions on Signal Processing| The ''nonuniform discrete Fourier transform'' transforms a sequence of <math>N</math> complex numbers <math>x_0, \ldots, x_{N-1}</ma ...14 KB (2,157 words) - 19:32, 29 August 2024
- ...ed in [[multidimensional signal processing]] to relate a two-dimensional [[discrete-time signal]] to the complex frequency domain in which the 2D surface in 4D ...the Region of convergence is simply the intersection between the four 2D Z-transforms in each quadrant. ...11 KB (1,955 words) - 06:44, 15 February 2025
- ...he time domain. Then, the time series are obtained by inverse fast Fourier transforms. ...nal form is a continuous function. However, computer programmes operate on discrete functions. Thus a modification to whatever type of spectrum, be it Kaimal, ...9 KB (1,477 words) - 15:32, 10 November 2024