code+transform

См. также в других словарях:

• Code-excited linear prediction — (CELP) is a speech coding algorithm originally proposed by M.R. Schroeder and B.S. Atal in 1985. At the time, it provided significantly better quality than existing low bit rate algorithms, such as residual excited linear prediction and linear… …   Wikipedia

• Code (cryptography) — For other uses, see Code (disambiguation). In cryptography, a code is a method used to transform a message into an obscured form, preventing those who do not possess special information, or key, required to apply the transform from understanding… …   Wikipedia

• Cyclic code — In coding theory, cyclic codes are linear block error correcting codes that have convenient algebraic structures for efficient error detection and correction. Contents 1 Definition 2 Algebraic structure 3 Examples …   Wikipedia

• Schwartzian 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

• Discrete wavelet transform — An example of the 2D discrete wavelet transform that is used in JPEG2000. The original image is high pass filtered, yielding the three large images, each describing local changes in brightness (details) in the original image. It is then low pass… …   Wikipedia

• Extract, transform, load — Extract, transform and load (ETL) is a process in database usage and especially in data warehousing that involves: Extracting data from outside sources Transforming it to fit operational needs (which can include quality levels) Loading it into… …   Wikipedia

• Discrete cosine transform — A discrete cosine transform (DCT) expresses a sequence of finitely many data points in terms of a sum of cosine functions oscillating at different frequencies. DCTs are important to numerous applications in science and engineering, from lossy… …   Wikipedia

• Fast Fourier transform — A fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. There are many distinct FFT algorithms involving a wide range of mathematics, from simple complex number arithmetic to group …   Wikipedia

• Move-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

• Multi-carrier code division multiple access — (MC CDMA) is a multiple access scheme used in OFDM based telecommunication systems, allowing the system to support multiple users at the same time. MC CDMA spreads each user symbol in the frequency domain. That is, each user symbol is carried… …   Wikipedia

• Hough transform — The Hough transform (pronEng|ˈhʌf, rhymes with tough ) is a feature extraction technique used in image analysis, computer vision, and digital image processing. [Shapiro, Linda and Stockman, George. “Computer Vision,” Prentice Hall, Inc. 2001] The …   Wikipedia