Location:
Search - discrete log
Search list
Description: MFCC (Mel Frequent Cepstral Coefficient) in M-File.
epresentation of the short-term power spectrum of a sound, based on a linear cosine transform of a log power spectrum on a nonlinear mel scale of frequency.
MFCCs derived as follows:
1. Take the Fourier transform of (a windowed excerpt of) a signal.
2. Map the powers of the spectrum obtained above onto the mel scale, using triangular overlapping windows.
3. Take the logs of the powers at each of the mel frequencies.
4. Take the discrete cosine transform of the list of mel log powers, as if it were a signal.
5. The MFCCs are the amplitudes of the resulting spectrum.
Platform: |
Size: 1024 |
Author: Mitha |
Hits:
Description: discrete log problem... implemented in java -discrete log problem... implemented in java
Platform: |
Size: 1024 |
Author: yothesh |
Hits:
Description: 对数字图像处理中的离散傅里叶变换(DFT),离散余弦变换（DCT）进行了详细的分析。其中DFT包括log视觉处理，中心点移动等。DCT包括分块处理，和保留较少系数，并比较结果。-Digital image processing of the discrete Fourier transform (DFT), discrete cosine transform (DCT) for a detailed analysis. DFT which include the log of visual processing, the center of movement. Including sub-block DCT processing, and retention of small coefficients, and compare the results.
Platform: |
Size: 390144 |
Author: pxjy |
Hits:
Description: 语音识别系统，包括预处理，汉明窗，梅尔频率倒谱率，离散余弦变换，前置滤波器组，对数能量，滤波器组，基本的滤波器组，dtw-speech recognition system，including Pretreatment, Hamming window, Mel frequency cepstrum rate, discrete cosine transform, pre-filter, log energy, filter, basic filter，dtw
Platform: |
Size: 6144 |
Author: 刘文龙 |
Hits:
Description: 文件中包含各种图像处理源代码，包括二值化处理的源代码，对图像进行直方图均衡处理的源代码，对图像进行中值滤波处理（图像复原）的源代码，对图像进行均值滤波处理（图像复原）的源代码对图像进行对角镜像处理（几何变换）的源代码，对图像进行离散余弦变换处理（图像变换）的源代码，对图像进行傅立叶变换处理（图像变换）的源代码，对图像进行高斯模糊处理（图像复原）的源代码，在图像中加入随机噪声的源代码，对图像进行水平镜像处理（几何变换）的源代码，利用LoG边缘算子法对图像进行边缘提取的源代码，利用Prewitte边缘算子法对图像进行边缘提取的源代码，利用Roberts边缘算子法对图像进行边缘提取的源代码，利用Sobel边缘算子法对图像进行边缘提取的源代码，对图像进行沃尔什变换处理（图像变换）的源代码， 对图像进行垂直镜像处理（几何变换）的源代码等各种图像处理程序代码。-File contains a variety of image processing source code, including the binarization processing of the source code, the source code of the image histogram equalization processing median filter processing (image restored), the image of the source code, the image mean filterprocessing (image restoration) of the source code to perform diagonal mirror treatment (geometric transformation) of the source code of the image, the image of the source code of the discrete cosine transform processing (image conversion), the image source of the Fourier transform processing (image conversion)code,the image the Gaussian blur processing (image restoration) source code, source code, by adding random noise in the image, the image horizontally mirrored (geometric transformation) source code, LoG edge operator method to the edge of the imageextracted source code, operator method using Prewitte edges on the image edge extracted source code, Roberts edge operator method for image edge extracted source code, u
Platform: |
Size: 18432 |
Author: nimizi |
Hits:
Description: The FFT is based on decomposition and breaking the transform into smaller transforms and combining them to get the total transform. FFT reduces the computation time required to compute a discrete Fourier transform and improves the performance by a factor of 100 or more over direct evaluation of the DFT.
A DFT decomposes a sequence of values into components of different frequencies. This operation is useful in many fields but computing it directly from the definition is often too slow to be practical. An FFT is a way to compute the same result more quickly: computing a DFT of N points in the obvious way, using the definition, takes O( N2 ) arithmetical operations, while an FFT can compute the same result in only O(N log N) operations.
Platform: |
Size: 10240 |
Author: Quoc Viet Ta |
Hits:
Description: The FFT is based on decomposition and breaking the transform into smaller transforms and combining them to get the total transform. FFT reduces the computation time required to compute a discrete Fourier transform and improves the performance by a factor of 100 or more over direct evaluation of the DFT.
A DFT decomposes a sequence of values into components of different frequencies. This operation is useful in many fields but computing it directly from the definition is often too slow to be practical. An FFT is a way to compute the same result more quickly: computing a DFT of N points in the obvious way, using the definition, takes O( N2 ) arithmetical operations, while an FFT can compute the same result in only O(N log N) operations.
Platform: |
Size: 166912 |
Author: Quoc Viet Ta |
Hits:
Description: The FFT is based on decomposition and breaking the transform into smaller transforms and combining them to get the total transform. FFT reduces the computation time required to compute a discrete Fourier transform and improves the performance by a factor of 100 or more over direct evaluation of the DFT.
A DFT decomposes a sequence of values into components of different frequencies. This operation is useful in many fields but computing it directly from the definition is often too slow to be practical. An FFT is a way to compute the same result more quickly: computing a DFT of N points in the obvious way, using the definition, takes O( N2 ) arithmetical operations, while an FFT can compute the same result in only O(N log N) operations.
Platform: |
Size: 659456 |
Author: Quoc Viet Ta |
Hits:
Description: 实用数字图像处理与分析 陈兵旗 课本源码
1.图像读写；
2.几何变换：竖直镜像、水平镜像、对角镜像；
3.空间变换：傅里叶变换、沃尔什变换、离散余弦变换；
4.图像复原：均值滤波、中值滤波、高斯滤波；5.图像增强：二值化、灰度化、直方图均衡化、伪彩色；
6.特征检测：LOG、Robert、Sobel、Prewitte等边缘检测算子；-Practical digital image processing and analysis Bing flag textbook source 1.IMAGE literacy 2. Geometric transformations: vertical mirroring, Horizontal Mirror, mirror on the corner 3. Spatial transformation: Fourier transform, Walsh transform, discrete cosine transform 4 Image restoration: mean filtering, median filtering, Gaussian filtering 5 Image Enhancement: binary, gray, histogram equalization, pseudo-color 6. feature detection: LOG, Robert, Sobel, Prewitte etc. edge detection operator
Platform: |
Size: 9250816 |
Author: 王国 |
Hits:
Description: the discrete wavelet transform (DWT)
performs on the input images and then decompose the LL subband into low-, middle-,
and high-intensity layers using the log-average luminance
Platform: |
Size: 115712 |
Author: kumar |
Hits:
Description: Solve descrete log problem using meet in the middle attack.
More formally, write a program to compute discrete log modulo a prime p. Let g
be some element in Z
p and suppose you are given h in Z p such that h = gx where
1 ≤ x ≤ 240. Your goal is to find x. More precisely, the input to your program is p,g,h
and the output is x.
Platform: |
Size: 1024 |
Author: jitender grover |
Hits: