fft.h

fft傅立叶快速变换在图象处理方面的应用

#ifndef __FFT_H__
#define __FFT_H__


const double PI		= 3.14159265;		// 常数PI定义 


//初始化 FFT 的相关参数
bool WINAPI fftInit(int point,int order,int divide,bool cover,int scale);

// 释放 FFT 资源
BOOL WINAPI fftEnd();


//fftTransform() FFT 变换处理
BOOL	WINAPI	fftTransform(VOID *inBuf,VOID *outBuf,int windows,int scale,int nProbe,int nWork);

//包络点的求取
int		WINAPI	fftGetEnvelopPoint(void *pSrcData, void *pDstpData);

//FFT核心算法 by Jim Fang
void	WINAPI	Jim_FFT(double* pr,double* pi,int n,int k,int l,int il);

void	WINAPI	Jim_Pharev(void *pIvalue,void *pQvalue,void *pRev);

//FFT运算结果归一化(压缩)处理(根据PRF值处理掉奇异点)
void	WINAPI	Jim_Unitary(void *pSrcData,BYTE *pDstData,int nScale,int nWork);

//修正(变形)第一类整数阶贝塞尔函数算法 by Jim Fang
double	WINAPI	Jim_Bessel0_R(int n,double x);

//五点三次平滑
void	WINAPI	Jim_Smooth(int n,unsigned char *y,double *yy);

//最小二乘曲线拟合
void	WINAPI	Jim_Least(double *x,double *y,int n,double *a,int m,double *dt);

//膨胀算法
void	WINAPI	Jim_Swell(int src,int dst,int *data,int no);

//点包络的计算
WORD	WINAPI	Jim_Cover(void *pSrcData,int base,int offset);

int		WINAPI	Jim_Mean(int *pTemp,int no);

void	WINAPI	Jim_Boost(void *pSrcData,void *pDstData,int coverP,int coverN,int base,int splus,int image,double dnr,int method);

//趋势包络算法
int		WINAPI	Jim_TrendCover(int src,int dst,double scale,int nTrend);

//计算参数
void	WINAPI	Jim_CaculateParam(int *data,int *result,int point,int nParam);

//void	WINAPI	Jim_Window(double *w,int n,int iwindow,int ierror);

int		WINAPI	Jim_FirFilter(int l,int iband,double fl,double fh,double fs,int iwindow,float *b);
#endif	// #ifndef __FFT_H__