📄 def_logcosh.cpp
字号:
#include <malloc.h>
#include <stdio.h>
#include <math.h>
void mat_transpose (float *, int , int , float *);
void mat_mult (float *, int , int , float *, int , int , float *);
/* Def_logcosh-负熵最大化估计子程序
*该子程序实现对分离矩阵的循环迭代,迭代式为W=E{Xg(w'x)}-E{g'(w'x)}w, g=tanh
*/
void Def_logcosh (float *w_init, int e, float *data, int f, int p, float *w_final)
{
/* Function that carries out Deflation ICA using an logcosh approximation to the neg. entropy function */
float *mat1, *mat2, *mat3, *mat4;
int i, j;
float mean;
if (e != f) {
printf ("error in Def_logcosh_JM, dims dont match");
}
else {
mat1 = (float*)malloc(1 * p* sizeof(float));
mat2 = (float*)malloc(e * p* sizeof(float));
mat3 = (float*)malloc(1 * e* sizeof(float));
mat4 = (float*)malloc(1 * e* sizeof(float));
mat_mult (w_init, 1, e, data, e, p, mat1);
for (i = 0; i < p; i++) {
mat1[i] = (float)tanh (mat1[i]);
}
mat_transpose (data, e, p, mat2);
/*对行取均值,做E{}运算*/
for (i = 0; i < e; i++) {
for (j = 0; j < p; j++) {
mat2[i * p + j] = (mat2[i * p + j]) / p;
}
}
mat_mult (mat1, 1, p, mat2, p, e, mat3);
for (i = 0; i < p; i++) {
mat1[i] = ( (1 - (mat1[i]) * (mat1[i])));
}
mean = 0;
for (j = 0; j < p; j++) {
mean += ((mat1[j]) / p);
}
for (i = 0; i < e; i++) {
mat4[i] = (w_init[i]) * mean;
}
for (i = 0; i < e; i++) {
w_final[i] = (mat3[i] - mat4[i]);
}
}
}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -