When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Fourier transform - Wikipedia

    en.wikipedia.org/wiki/Fourier_transform

    14.4 Two-dimensional functions. ... The functions and ^ are referred to as a Fourier transform pair. [6] A common notation for designating transform ...

  3. Multidimensional transform - Wikipedia

    en.wikipedia.org/wiki/Multidimensional_transform

    The 2D Z-transform, similar to the Z-transform, is used in multidimensional signal processing to relate a two-dimensional discrete-time signal to the complex frequency domain in which the 2D surface in 4D space that the Fourier transform lies on is known as the unit surface or unit bicircle.

  4. Discrete Fourier transform - Wikipedia

    en.wikipedia.org/wiki/Discrete_Fourier_transform

    In mathematics, the discrete Fourier transform (DFT) converts a finite sequence of equally-spaced samples of a function into a same-length sequence of equally-spaced samples of the discrete-time Fourier transform (DTFT), which is a complex-valued function of frequency. The interval at which the DTFT is sampled is the reciprocal of the duration ...

  5. List of Fourier-related transforms - Wikipedia

    en.wikipedia.org/wiki/List_of_Fourier-related...

    Fourier transform, with special cases: Fourier series. When the input function/waveform is periodic, the Fourier transform output is a Dirac comb function, modulated by a discrete sequence of finite-valued coefficients that are complex-valued in general. These are called Fourier series coefficients. The term Fourier series actually refers to ...

  6. Projection-slice theorem - Wikipedia

    en.wikipedia.org/wiki/Projection-slice_theorem

    Take a two-dimensional function f(r), project (e.g. using the Radon transform) it onto a (one-dimensional) line, and do a Fourier transform of that projection. Take that same function, but do a two-dimensional Fourier transform first, and then slice it through its origin, which is parallel to the projection line. In operator terms, if

  7. DFT matrix - Wikipedia

    en.wikipedia.org/wiki/DFT_matrix

    In this case, if we make a very large matrix with complex exponentials in the rows (i.e., cosine real parts and sine imaginary parts), and increase the resolution without bound, we approach the kernel of the Fredholm integral equation of the 2nd kind, namely the Fourier operator that defines the continuous Fourier transform. A rectangular ...

  8. Optical transfer function - Wikipedia

    en.wikipedia.org/wiki/Optical_transfer_function

    The two-dimensional Fourier transform of a line through the origin, is a line orthogonal to it and through the origin. The divisor is thus zero for all but a single dimension, by consequence, the optical transfer function can only be determined for a single dimension using a single line-spread function (LSF). If necessary, the two-dimensional ...

  9. Multidimensional discrete convolution - Wikipedia

    en.wikipedia.org/wiki/Multidimensional_discrete...

    This ensures that a two-dimensional convolution will be able to be performed by a one-dimensional convolution operator as the 2D filter has been unwound to a 1D filter with gaps of zeroes separating the filter coefficients. One-Dimensional Filtering Strip after being Unwound. Assuming that some-low pass two-dimensional filter was used, such as: