hmm.h

matlab 例程

//文件：hmm.h
//功能：提供HMM的数据结构和定义

#include <stdlib.h>
#include <stdio.h>
#include <math.h>
#define MAX(x,y)  ((x)>(y)?(x):(y))
#define MIN(x,y)  ((x)<(y)?(x):(y))

struct HMM{
	int N;  /*状态的个数；*/
    int M;  /*观察值的个数；*/
	double **A; /*状态转移概率A[1..N][1..N]*/
	double **B; /*B[1..N][1..M],b[j][k]是在状态j观察到观察值k的概率*/
	double *pi; /*pi[1..N]pi[i]是进入Markov链的状态分布*/
	double *u;
	double *sigma;
};

/*关于序列的存取，状态的计算等*/


//前向后向算法,BaumWelch算法
void Forward(struct HMM *phmm,int T,int **O,double **alpha,double *pprob,int k);
void ForwardWithScale(struct HMM *phmm,int T,int **O,double **alpha,double *scale,double *pprob,int k);
void Backward(struct HMM *phmm,int T,int **O,double **beta,double *pprob,int k);
void BackwardWithScale(struct HMM *phmm,int T,int **O,double **beta,double *scale,double *pprob,int k);
void BaumWelch(struct HMM *phmm,int T,int **O,double **alpha,double **beta,
			   double **gamma,int *pniter,double *plogprobinit,double *plogprobfinal,int x,int y);
void BaumWelch0(struct HMM *phmm,int T,int **O,double **alpha,double **beta,
			   double **gamma,int *pniter,double *plogprobinit,double *plogprobfinal,int x,int y);
//Viterbi算法
double ***AllocXi(int T,int N);
void FreeXi(double ***xi,int T,int N);
void ComputeGamma(struct HMM *phmm,int T,double **alpha,double **beta,double **gamma);
void ComputeXi(struct HMM *phmm,int T,int **O,double **alpha,double **beta,
			   double ***xi,int k);
void Viterbi(struct HMM *phmm,int T,int **O,double **beta,int **psi,int *q,double *pprob,int k);
void ViterbiLog(struct HMM *phmm,int T,int **O,double **beta,int **psi,int **q,double *pprob,int k);

//随机相关函数
int hmmgetseed(void);
void hmmsetseed(int seed);
double hmmgetrand(void);