Description: Eular法解分数阶微分方程,分数阶导数定义系数通过fourier法计算,阶数a变化-eular method of fractional differential equations, fractional derivative coefficient defined by fourier law, order a change Platform: |
Size: 956 |
Author:liangqin |
Hits:
Description: Eular法解分数阶微分方程,分数阶导数定义系数通过fourier法计算,阶数a变化-eular method of fractional differential equations, fractional derivative coefficient defined by fourier law, order a change Platform: |
Size: 1024 |
Author:liangqin |
Hits:
Description: 升余弦滚降的误码率和信噪比曲线，取样时间无偏差，但信道是多径信道，衰减系数0.5
傅立叶变换及反变换参见t2f-and-f2t-Raised cosine roll-off of the bit error rate and signal to noise ratio curve, sampling time deviation, but the channel is a multipath channel, the attenuation coefficient of 0.5 Fourier Transform and inverse transform see t2f-and-f2t Platform: |
Size: 1024 |
Author:刘临政 |
Hits:
Description: 数值计算算法，包括：
（1）Lagrange插值
（2）Newton 插值
（3）求f(x0)：秦九韶法
（4）求实系数多项式f(z0)。z0为复数（5）二分法求f(x)=0的根
（6）弦截法求f (x)=0的根
（7）求实系数多项式 方程的实根、复根
（8）解线性方程组：Gauss列主元素消去法( 9 )快速弗利叶变换（FFT）
-Numerical algorithms, including: (1) Lagrange interpolation (2) Newton interpolation (3) for f (x0): Qin Jiushao Law (4) realistic coefficient polynomial f (z0). z0 for the plural (5) dichotomy for f (x) = 0 root (6) cut-off method string f (x) = 0 root (7) realistic coefficient of the real roots of polynomial equations, complex root (8) Solution of linear equations: Gauss elimination method out the main elements (9) Fast Fourier transform forli (FFT) Platform: |
Size: 16384 |
Author:wang yucao |
Hits:
Description: 用于24点采样的傅立叶分解用的系数组,很适用的哦。这是我的一款电机保护中所采用的算法-24 points for the sample used in the Fourier decomposition coefficient group, it is applicable Oh. This is my a motor used in the protection algorithm Platform: |
Size: 1024 |
Author:邓杰 |
Hits:
Description: 这是我编的利用傅立叶系数法计算积分的代码。-This is for my use of the Fourier coefficient method to calculate the code points. Platform: |
Size: 1024 |
Author:陈一 |
Hits:
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: FTTC方法中的核心理论推导（系数矩阵的二维傅立叶变换部分）
这里的推导是根据FTTC方法的文章，整理出来的具体推导过程(系数矩阵的二维傅立叶变换部分)。
-FTTC approach the core of the theory is derived (coefficient matrix of the two-dimensional Fourier transform part) is derived here FTTC method is based on the article, sorting out the specific derivation process (coefficient matrix part of the two-dimensional Fourier transform). Platform: |
Size: 56320 |
Author:田隐衷 |
Hits:
Description: 应用VC实现离散付立叶级数的模拟，通过收集离散数据点，应用离散付立叶级数的原理和公式很好地模拟了已知数据，并求取了相应的付立叶系数。-VC Application of discrete Fourier series to achieve the simulation, through the collection of discrete data points, the application of discrete Fourier series of principles and formulas well known to simulate the data and obtain the corresponding Fourier coefficient. Platform: |
Size: 17408 |
Author:zhangwu |
Hits:
Description: 本实验要求编写课本上11.2.3节描述的傅立叶描绘方法。用实验09-02中的程序提取图12.18两幅图的边界，然后对每个边界选取256个描述点。选择的这256个点是在空间上尽可能均匀的点。获取每个图的傅立叶描绘子，确保每个图中的起始点是近似相同的点。分别用16，32，64和128个描绘系数逼近边界，并画出每一个结果。-Prepared at the request of the experimental section 11.2.3 textbook depicts Fourier method described. 09-02 with the experimental procedures in Figure 2 Extraction of Figure 12.18 the border, and then select the border of each description of 256 points. This choice is the 256 as far as possible in the space of the points evenly. Access to each of the Fourier descriptor map to ensure that each figure is the approximate starting point for the same point. 16,32,64, respectively, and coefficient of close to 128 described the border, and the results of each draw. Platform: |
Size: 95232 |
Author:jhm |
Hits:
Description: 本代码实现了对静态五种基本静态手势的识别，通过皮肤颜色模型分割人手，然后通过边界追踪得到手的轮廓，最后通过傅里叶系数识别手势-The static code of the five basic static gesture recognition, through the skin color model partition manually, and then get through the border to track the contours of the hands, and finally through the Fourier coefficient of gesture recognition Platform: |
Size: 4096 |
Author:魏志莲 |
Hits:
Description: 数字图象处理教程
INTRODUCTION 4
DIGITAL IMAGE DEFINITIONS 5
COMMON VALUES 6
CHARACTERISTICS OF IMAGE OPERATIONS 7
TYPES OF OPERATIONS 7
TYPES OF NEIGHBORHOODS 8
VIDEO PARAMETERS 9
TOOLS 9
CONVOLUTION 10
PROPERTIES OF CONVOLUTION 10
FOURIER TRANSFORMS 10
PROPERTIES OF FOURIER TRANSFORMS 11
IMPORTANCE OF PHASE AND MAGNITUDE 14
CIRCULARLY SYMMETRIC SIGNALS 15
EXAMPLES OF 2D SIGNALS AND TRANSFORMS 15
STATISTICS 16
PROBABILITY DISTRIBUTION FUNCTION OF THE BRIGHTNESSES 16
PROBABILITY DENSITY FUNCTION OF THE BRIGHTNESSES 16
AVERAGE 18
STANDARD DEVIATION 19
COEFFICIENT-OF-VARIATION 19
PERCENTILES 19-INTRODUCTION 4
DIGITAL IMAGE DEFINITIONS 5
COMMON VALUES 6
CHARACTERISTICS OF IMAGE OPERATIONS 7
TYPES OF OPERATIONS 7
TYPES OF NEIGHBORHOODS 8
VIDEO PARAMETERS 9
TOOLS 9
CONVOLUTION 10
PROPERTIES OF CONVOLUTION 10
FOURIER TRANSFORMS 10
PROPERTIES OF FOURIER TRANSFORMS 11
IMPORTANCE OF PHASE AND MAGNITUDE 14
CIRCULARLY SYMMETRIC SIGNALS 15
EXAMPLES OF 2D SIGNALS AND TRANSFORMS 15
STATISTICS 16
PROBABILITY DISTRIBUTION FUNCTION OF THE BRIGHTNESSES 16
PROBABILITY DENSITY FUNCTION OF THE BRIGHTNESSES 16
AVERAGE 18
STANDARD DEVIATION 19
COEFFICIENT-OF-VARIATION 19
PERCENTILES 19
MODE 20
SIGNALTONOISE RATIO 20
CONTOUR REPRESENTATIONS 21
CHAIN CODE 21
CHAIN CODE PROPERTIES 22
CRACK CODE 22
RUN CODES 23
PERCEPTION 23
BRIGHTNESS SENSITIVITY 23
WAVELENGTH SENSITIVITY 24
STIMULUS SENSITIVITY 24
SPATIAL FREQUENCY SENSITIVITY 25
COLOR SENSITIVITY 26
STANDARD OBSERVER 26
CIE CHROMATICITY COORDINATES 26
OPTICAL ILLUSIONS 28
IMAGE SAMPLING 30
SAMPLING DENSITY FO Platform: |
Size: 2639872 |
Author:sean |
Hits:
Description: 通过傅里叶扩展计算的微分和积分函数，十分有用。-Description
The n-th order derivative or integral of a function defined in a given
range [a,b] is calculated through Fourier series expansion, where n is
any real number and not necessarily integer. The necessary integrations
are performed with the Gauss-Legendre quadrature rule. Selection for the
number of desired Fourier coefficient pairs is made as well as for the
number of the Gauss-Legendre integration points.
Unlike many publicly available functions, the Gauss integration points k
can be calculated for k>=46. The algorithm does not rely on the build-in
Matlab routine roots to determine the roots of the Legendre polynomial,
but finds the roots by looking for the eigenvalues of an alternative
version of the companion matrix of the k th degree Legendre polynomial.
The companion matrix is constructed as a symmetrical matrix, guaranteeing
that all the eigenvalues (roots) will be real. On the contrary, the
roots function us Platform: |
Size: 240640 |
Author:111 |
Hits:
Search - fourier coefficient