Transform

  • 101Hadamard transform — The Hadamard transform (also known as the Walsh Hadamard transform, Hadamard Rademacher Walsh transform, Walsh transform, or Walsh Fourier transform) is an example of a generalized class of Fourier transforms. It is named for the French… …

    Wikipedia

  • 102Schwartzian transform — In computer science, the Schwartzian transform is a Perl programming idiom used to improve the efficiency of sorting a list of items. This idiom is appropriate for comparison based sorting when the ordering is actually based on the ordering of a… …

    Wikipedia

  • 103A derivation of the discrete Fourier transform — In mathematics, computer science, and electrical engineering, the discrete Fourier transform (DFT), occasionally called the finite Fourier transform, is a transform for Fourier analysis of finite domain discrete time signals. As with most Fourier …

    Wikipedia

  • 104Star transform — The star transform, or starred transform is a discrete time variation of the Laplace transform that represents an ideal sampler with period of time T. The star transform is similar to the Z transform with a simple change of variables, but the… …

    Wikipedia

  • 105Wavelet transform — An example of the 2D discrete wavelet transform that is used in JPEG2000. In mathematics, a wavelet series is a representation of a square integrable (real or complex valued) function by a certain orthonormal series generated by a wavelet …

    Wikipedia

  • 106Discrete sine transform — In mathematics, the discrete sine transform (DST) is a Fourier related transform similar to the discrete Fourier transform (DFT), but using a purely real matrix. It is equivalent to the imaginary parts of a DFT of roughly twice the length,… …

    Wikipedia

  • 107Laplace–Stieltjes transform — The Laplace–Stieltjes transform, named for Pierre Simon Laplace and Thomas Joannes Stieltjes, is a transform similar to the Laplace transform. It is useful in a number of areas of mathematics, including functional analysis, and certain areas of… …

    Wikipedia

  • 108Move-to-front transform — The move to front transform (or MTF) is an encoding of data (typically a stream of bytes) designed to improve the performance of entropy encoding techniques of compression. When efficiently implemented, it is fast enough that its benefits usually …

    Wikipedia

  • 109Funk transform — In the mathematical field of integral geometry, the Funk transform (also called Minkowski–Funk transform) is an integral transform defined by integrating a function on great circles of the sphere. It was introduced by Paul Funk in 1916, based on… …

    Wikipedia

  • 110Stationary wavelet transform — Haar Stationary Wavelet Transform of Lena The Stationary wavelet transform (SWT)[1] is a wavelet transform algorithm designed to overcome the lack of translation invariance of the discrete wavelet transform (DWT). Translation invariance is… …

    Wikipedia