MPF_Util.rar_mpf

#include <stdio.h> #include <stdlib.h> #include <string.h> extern short codelen; int classCount( short*, int, int*, int ); void randomOrder( int, int* ); int classTable( char*, int, char*, short* ); void insertTable( char*, char*, int, int ); int posInTable( char*, char*, int ); // 使每个类的向量成均匀分布 void MpfSort( int argc, char** argv ) { int n; if( argc<2 ) { printf( "Make the vectors of each class distribute uniformly\n" ); printf( "argv[1]: title of mpf file.\n" ); printf( "argv[2]: (optional) \"class\", \"sample\" (default), or \"random\".\n" ); exit( 0 ); } FILE *fpIn, *fpOut; char fname[100]; sprintf( fname, "%s.mpf", argv[1] ); fpIn = fopen( fname, "rb" ); if( fpIn==0 ) { printf( "Cannot open the file %s\n", fname ); exit( 1 ); } int randOrder = 1; // default: sample order 按样本排序？？ if( argc>2 ) { if( !strcmp(argv[2], "class") ) { printf( "Sort the samples in class order.\n" ); randOrder = 0; } if( !strcmp(argv[2], "random") ) // strcmp函数相等返回0 { printf( "Random ordering the samples of each class.\n" ); randOrder = 2; } } if( randOrder==1 ) sprintf( fname, "%s-s.mpf", argv[1] ); else if( randOrder==2 ) sprintf( fname, "%s-r.mpf", argv[1] ); else sprintf( fname, "%s-c.mpf", argv[1] ); fpOut = fopen( fname, "wb" ); // 以写的模式打开一个文件 int mpfhsize; char datatype[20]; int sampNum, ftrDim; fread( &mpfhsize, 4, 1, fpIn ); fseek( fpIn, mpfhsize-30, 0 ); fread( &codelen, 2, 1, fpIn ); fread( datatype, 20, 1, fpIn ); fread( &sampNum, 4, 1, fpIn ); fread( &ftrDim, 4, 1, fpIn ); printf( "%d samples, %d feature\n", sampNum, ftrDim );//输出样本数和特征维数 int dtypelen; long fpLen; fseek( fpIn, 0, 2 ); fpLen = ftell( fpIn ); dtypelen = (fpLen-mpfhsize-sampNum*codelen)/(sampNum*ftrDim); // Copy the mpf header to output file char* buff; buff = new char [mpfhsize]; fseek( fpIn, 0, 0 ); fread( buff, mpfhsize, 1, fpIn ); fwrite( buff, mpfhsize, 1, fpOut ); delete buff; char* labels; int samplen; samplen = codelen+ftrDim*dtypelen; labels = new char [sampNum*codelen]; int slen; for( n=0; n<sampNum; n++ ) { fseek( fpIn, mpfhsize+n*samplen, 0 ); fread( labels+n*codelen, codelen, 1, fpIn ); slen = strlen( labels+n*codelen ); if( slen<codelen ) memset( labels+n*codelen+slen, 0, codelen-slen ); } char* codetable; // class codes int classNum; short* truth; // class indes codetable = new char [20000*codelen]; // at most 20000 classes truth = new short [sampNum]; classNum = classTable( labels, sampNum, codetable, truth ); printf( "%d classes\n", classNum ); // 输出有多少个类 int* csnum; // class-specific sample numbers csnum = new int [classNum]; int maxNum; maxNum = classCount( truth, sampNum, csnum, classNum ); int ci, tn; int** sampOrder; int* torder; sampOrder = new int* [classNum]; for( ci=0; ci<classNum; ci++ ) { sampOrder[ci] = new int [ csnum[ci] ]; tn = 0; for( n=0; n<sampNum; n++ ) { if( truth[n]==ci ) sampOrder[ci][tn++] = n; // position in the whole set } if( randOrder==2 ) { torder = new int [ csnum[ci] ]; randomOrder( csnum[ci], torder ); for(int n=0; n<csnum[ci]; n++ ) torder[n] = sampOrder[ci][ torder[n] ]; memcpy( sampOrder[ci], torder, csnum[ci]*sizeof(int) ); delete torder; } } printf( "Output file: %s\n", fname ); if( randOrder==0 ) // class order { int si; for( ci=0; ci<classNum; ci++ ) { for( tn=0; tn<csnum[ci]; tn++ ) { si = sampOrder[ci][tn]; buff = new char [ samplen ]; fseek( fpIn, mpfhsize+si*samplen, 0 ); fread( buff, samplen, 1, fpIn ); fwrite( buff, samplen, 1, fpOut ); delete buff; } } goto CLOSE; } int* csi; // sample index of each class csi = new int [classNum]; memset( csi, 0, classNum*sizeof(int) ); int index, gsi; for( n=1; n<=maxNum; n++ ) { printf( "%d of %d\r", n, maxNum ); for( ci=0; ci<classNum; ci++ ) { index = (_int64)n*csnum[ci]/maxNum; if( index>csi[ci] ) // index<=csi[ci]+1 { gsi = sampOrder[ci][ csi[ci] ]; // position in the whole set buff = new char [ samplen ]; fseek( fpIn, mpfhsize+gsi*samplen, 0 ); fread( buff, samplen, 1, fpIn ); fwrite( buff, samplen, 1, fpOut ); delete buff; csi[ci] = index; } } } printf( "\n" ); delete csi; CLOSE: for( ci=0; ci<classNum; ci++ ) delete sampOrder[ci]; delete sampOrder; delete csnum; delete codetable; delete truth; delete labels; fclose( fpIn ); fclose( fpOut ); } void randomOrder( int num, int* index ) { char* mark; mark = new char [num]; memset( mark, 0, num ); int tn; int i, j; for( i=0; i<num; i++ ) { tn = rand()%(num-i); for( j=0; j<=tn; j++ ) { if( mark[j] ) tn ++; } index[i] = tn; mark[tn] = 1; } delete mark; } // Count the number of samples of each class 计算每个类的样本数 int classCount( short* truth, int sampNum, int* csnum, int classNum ) { int n; memset( csnum, 0, classNum*sizeof(int) ); for( n=0; n<sampNum; n++ ) csnum[ truth[n] ] ++; int maxNum = 0; for( n=0; n<classNum; n++ ) { if( classNum<=100 ) printf( "%d, ", csnum[n] ); if( csnum[n]>maxNum ) maxNum = csnum[n]; } if( classNum<=100 ) printf( "\n" ); return maxNum; } // Sort the class codes of ALL samples and assign index numbers int classTable( char* labels, int sampNum, char* table, short* truth ) { int cnum = 0; int pos; // position in code table int n; for( n=0; n<sampNum; n++ ) { pos = posInTable( labels+n*codelen, table, cnum ); if( pos==cnum ) { memcpy( table+cnum*codelen, labels+n*codelen, codelen ); cnum ++; } else if( memcmp(labels+n*codelen, table+pos*codelen, codelen) ) { insertTable( labels+n*codelen, table, cnum, pos ); cnum ++; } } for( n=0; n<sampNum; n++ ) truth[n] = posInTable( labels+n*codelen, table, cnum ); return cnum; } void insertTable( char* label, char* table, int cnum, int pos ) { memmove( table+(pos+1)*codelen, table+pos*codelen, (cnum-pos)*codelen ); memcpy( table+pos*codelen, label, codelen ); } // The codes are sorted in ascending order in the table int posInTable( char* label, char* table, int cnum ) { if( cnum==0 ) return 0; if( memcmp(label, table, codelen)<=0 ) return 0; else if( memcmp(label, table+(cnum-1)*codelen, codelen)>0 ) return cnum; int b1, b2, t; b1 = 0; b2 = cnum-1; while( b2-b1>1 ) { t = (b1+b2)/2; if( memcmp(label, table+t*codelen, codelen)>0 ) b1 = t; else b2 = t; } return b2; }