⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 logloopy.cpp

📁 The package includes 3 Matlab-interfaces to the c-code: 1. inference.m An interface to the full
💻 CPP
📖 第 1 页 / 共 2 页
字号:
      }    }    // update beliefs and check for convergence//     dBel = 0.0;    dBel = -HUGE_VAL;        double** new_beliefs = new double*[ia_mrf->N];        for (int i=0; i<ia_mrf->N; i++) {      new_beliefs[i] = new double[ia_mrf->V[i]];//       double min_beliefs_i = numeric_limits<double>::infinity();      double min_beliefs_i = HUGE_VAL;      for (int xi=0; xi<ia_mrf->V[i]; xi++) {	new_beliefs[i][xi] = ia_mrf->localMat[i][xi];	for (int n=0; n<ia_mrf->neighbNum(i); n++) {	  int j = ia_mrf->adjMat[i][n];	  int nj = 0;	  while (ia_mrf->adjMat[j][nj] != i) {	    nj++;	  }	  new_beliefs[i][xi] += l_messages[j][nj][xi];	}	if (new_beliefs[i][xi] < min_beliefs_i) {	  min_beliefs_i = new_beliefs[i][xi];	}      }      double norm_dBel_i = -HUGE_VAL;      for (int xi=0; xi<ia_mrf->V[i]; xi++) {	new_beliefs[i][xi] -= min_beliefs_i;	norm_dBel_i = AddLog(norm_dBel_i, 2*AbsSubLog(-new_beliefs[i][xi], -ia_beliefs[i][xi])); // + log |e^thisVal - e^otherVal|^2      }      norm_dBel_i = 0.5*norm_dBel_i;      dBel = AddLog(dBel, norm_dBel_i);    }    freeBeliefs();    ia_beliefs = new_beliefs;    new_beliefs = 0;//     mexPrintf("*** %d. dBel = %f\n", nIter, dBel);  }  if (l_strategy == PARALLEL) {    for (int i=0; i<ia_mrf->N; i++) {      for (int n=0; n<ia_mrf->neighbNum(i); n++) {	delete[] new_messages[i][n];      }      delete[] new_messages[i];    }    delete[] new_messages;    new_messages = 0;  }   if (nIter > l_maxIter) {    (*converged) = -1;    mexPrintf("c-Loopy: messages decreased to zero, iterating stopped\n");  }  else {    if (dBel<=l_th) {      (*converged) = nIter;      mexPrintf("c-Loopy: converged in %d iterations\n",nIter);    }    else {      (*converged) = -1;      mexPrintf("c-Loopy: did not converge after %d iterations\n",nIter);    }  }  if (!ll_logBels) {    for (int i=0; i<ia_mrf->N; i++) {      double sum_beliefs_i = 0.0;      for (int xi=0; xi<ia_mrf->V[i]; xi++) {	ia_beliefs[i][xi] = exp(- ia_beliefs[i][xi] / ia_mrf->getTemperature());	sum_beliefs_i += ia_beliefs[i][xi];      }      for (int xi=0; xi<ia_mrf->V[i]; xi++) {	if (sum_beliefs_i > 0.0) {	  ia_beliefs[i][xi] /= sum_beliefs_i;	}      }    }  }  return ia_beliefs;  }double** LogLoopy::inferenceTRBP(int* converged) {  double dBel = l_th+1.0;  int nIter = 0;    double*** new_messages = 0;  if (l_strategy == PARALLEL) {    new_messages = new double**[ia_mrf->N];    for (int i=0; i<ia_mrf->N; i++) {      new_messages[i] = new double*[ia_mrf->neighbNum(i)];      for (int n=0; n<ia_mrf->neighbNum(i); n++) {	int j = ia_mrf->adjMat[i][n];	new_messages[i][n] = new double[ia_mrf->V[j]];	for (int xj=0; xj<ia_mrf->V[j]; xj++) {	  new_messages[i][n][xj] = l_messages[i][n][xj];	}      }    }  }  while (dBel>l_th && nIter<l_maxIter) {    nIter++;    for (int i=0; i<ia_mrf->N; i++) {      // init the incoming messages to 1      double* incoming = new double[ia_mrf->V[i]];      for (int xi=0; xi<ia_mrf->V[i]; xi++) {	incoming[xi] = 0.0;      }      // get incoming messages      for (int n=0; n<ia_mrf->neighbNum(i); n++) {	int j = ia_mrf->adjMat[i][n];	int nj = 0;	while (ia_mrf->adjMat[j][nj] != i) {	  nj++;	}	for (int xi=0; xi<ia_mrf->V[i]; xi++) {	  incoming[xi] += (l_messages[j][nj][xi] * l_trwRho[i][n]);	}      }            // calculate outgoing messages      for (int n=0; n<ia_mrf->neighbNum(i); n++) {	int j = ia_mrf->adjMat[i][n];	int nj = 0;	while (ia_mrf->adjMat[j][nj] != i) {	  nj++;	}	double norm_msg = HUGE_VAL;	double* outgoing = new double[ia_mrf->V[j]];		for (int xj=0; xj<ia_mrf->V[j]; xj++) {	  	  switch (l_sumOrMax) {	    case SUM:	      outgoing[xj] = -HUGE_VAL;	      break;	    case MAX:	      outgoing[xj] = numeric_limits<double>::infinity();	      break;	    default:	      break;	  }	    	  for (int xi=0; xi<ia_mrf->V[i]; xi++) {	    double outM = (ia_mrf->pairEnergy(i,n,xi,xj) / l_trwRho[i][n]) + ia_mrf->localMat[i][xi] +	      incoming[xi] - l_messages[j][nj][xi];	    switch (l_sumOrMax) {	      case SUM:    		outgoing[xj] = AddLogFactor(outgoing[xj],outM,-ia_mrf->getTemperature());//    		outgoing[xj] = AddLog(outgoing[xj],outM);		break;	      case MAX:		if (outM < outgoing[xj]) {		  outgoing[xj] = outM;		}		break;	      default:		break;	    }	  }	  if (outgoing[xj] < norm_msg) {	    norm_msg = outgoing[xj];	  }	}	for (int xj=0; xj<ia_mrf->V[j]; xj++) {	  if (norm_msg != -HUGE_VAL) {	    outgoing[xj] -= norm_msg;	  }	    	  if (outgoing[xj] != outgoing[xj]) { 	    nIter = l_maxIter + 1; 	    break;	  }	  	  switch (l_strategy) {	    case SEQUENTIAL:	      l_messages[i][n][xj] = outgoing[xj];	      break;	    case PARALLEL:	      new_messages[i][n][xj] = outgoing[xj];	      break;	    default:	      break;	  }	}	delete[] outgoing;	outgoing = 0;      }      delete[] incoming;      incoming = 0;    }    if (l_strategy == PARALLEL) {      for (int i=0; i<ia_mrf->N; i++) {	for (int n=0; n<ia_mrf->neighbNum(i); n++) {	  int j = ia_mrf->adjMat[i][n];	  for (int xj=0; xj<ia_mrf->V[j]; xj++) {	    l_messages[i][n][xj] = new_messages[i][n][xj];	  }	}      }    }    // update beliefs and check for convergence    //     dBel = 0.0;     dBel = -HUGE_VAL;        double** new_beliefs = new double*[ia_mrf->N];        for (int i=0; i<ia_mrf->N; i++) {      new_beliefs[i] = new double[ia_mrf->V[i]];//       double min_beliefs_i = numeric_limits<double>::infinity();      double min_beliefs_i = HUGE_VAL;      for (int xi=0; xi<ia_mrf->V[i]; xi++) {	new_beliefs[i][xi] = ia_mrf->localMat[i][xi];	for (int n=0; n<ia_mrf->neighbNum(i); n++) {	  int j = ia_mrf->adjMat[i][n];	  int nj = 0;	  while (ia_mrf->adjMat[j][nj] != i) {	    nj++;	  }	  new_beliefs[i][xi] += (l_messages[j][nj][xi] * l_trwRho[i][n]);	}	if (new_beliefs[i][xi] < min_beliefs_i) {	  min_beliefs_i = new_beliefs[i][xi];	}      }//       double norm_dBel_i = 0.0;      double norm_dBel_i = -HUGE_VAL;      for (int xi=0; xi<ia_mrf->V[i]; xi++) { 	new_beliefs[i][xi] -= min_beliefs_i;	norm_dBel_i = AddLog(norm_dBel_i, 2*AbsSubLog(-new_beliefs[i][xi], -ia_beliefs[i][xi])); // + log |e^thisVal - e^otherVal|^2// 	norm_dBel_i += pow((new_beliefs[i][xi] - ia_beliefs[i][xi]), 2.0);      }//       norm_dBel_i = pow(norm_dBel_i, 0.5);      norm_dBel_i = 0.5*norm_dBel_i;//       dBel += norm_dBel_i;      dBel = AddLog(dBel, norm_dBel_i);    }    freeBeliefs();    ia_beliefs = new_beliefs;    new_beliefs = 0;//     mexPrintf("*** %d. dBel = %f\n", nIter, dBel);  }  if (l_strategy == PARALLEL) {    for (int i=0; i<ia_mrf->N; i++) {      for (int n=0; n<ia_mrf->neighbNum(i); n++) {	delete[] new_messages[i][n];      }      delete[] new_messages[i];    }    delete[] new_messages;    new_messages = 0;  }  if (nIter > l_maxIter) {    (*converged) = -1;    mexPrintf("c-Loopy: messages decreased to zero, iterating stopped\n");  }  else {    if (dBel<=l_th) {      (*converged) = nIter;      mexPrintf("c-Loopy: converged in %d iterations\n",nIter);    }    else {      (*converged) = -1;      mexPrintf("c-Loopy: did not converge after %d iterations\n",nIter);    }  }  if (!ll_logBels) {    for (int i=0; i<ia_mrf->N; i++) {      double sum_beliefs_i = 0.0;      for (int xi=0; xi<ia_mrf->V[i]; xi++) {	ia_beliefs[i][xi] = exp(- ia_beliefs[i][xi] / ia_mrf->getTemperature());	sum_beliefs_i += ia_beliefs[i][xi];      }      if (sum_beliefs_i > 0.0) {	for (int xi=0; xi<ia_mrf->V[i]; xi++) {	  ia_beliefs[i][xi] /= sum_beliefs_i;	}      }    }  }  return ia_beliefs;    }

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -