logloopy.cpp

The package includes 3 Matlab-interfaces to the c-code: 1. inference.m An interface to the full

#include "LogLoopy.h"
#include "MathFunctions.h"
#include <math.h>
#include <iostream>
#include <limits>
#include "mex.h"

using namespace std;

double**** LogLoopy::calcPairBeliefs() {

  if (l_trwRho != 0) {
    return calcPairBeliefsTRBP();
  }
  
  double**** new_pairBeliefs = new double***[ia_mrf->N];

  for (int i=0; i<ia_mrf->N; i++) {
    new_pairBeliefs[i] = new double**[ia_mrf->neighbNum(i)];
    for (int n=0; n<ia_mrf->neighbNum(i); n++) {
      new_pairBeliefs[i][n] = 0;
      int j = ia_mrf->adjMat[i][n];
      if (i<j) {
	new_pairBeliefs[i][n] = new double*[ia_mrf->V[i]];
	double min_beliefs_ij = numeric_limits<double>::infinity();
	for (int xi=0; xi<ia_mrf->V[i]; xi++) {
	  new_pairBeliefs[i][n][xi] = new double[ia_mrf->V[j]];
	  for (int xj=0; xj<ia_mrf->V[j]; xj++) {
	    new_pairBeliefs[i][n][xi][xj] = (ia_mrf->localMat[i][xi] +
					     ia_mrf->localMat[j][xj] +
					     ia_mrf->pairEnergy(i,n,xi,xj));
	    for (int ni=0; ni<ia_mrf->neighbNum(i); ni++) {
	      int k = ia_mrf->adjMat[i][ni];
	      if (k!=j) {
		int nk = 0;
		while (ia_mrf->adjMat[k][nk] != i) {
		  nk++;
		}
		new_pairBeliefs[i][n][xi][xj] += l_messages[k][nk][xi];
	      }
	    }
	    for (int nj=0; nj<ia_mrf->neighbNum(j); nj++) {
	      int k = ia_mrf->adjMat[j][nj];
	      if (k!=i) {
		int nk = 0;
		while (ia_mrf->adjMat[k][nk] != j) {
		  nk++;
		}
		new_pairBeliefs[i][n][xi][xj] += l_messages[k][nk][xj];
	      }
	    }

	    if (new_pairBeliefs[i][n][xi][xj] < min_beliefs_ij) {
	      min_beliefs_ij = new_pairBeliefs[i][n][xi][xj];
	    }
	  }
	}

	// normalize the ij-beliefs
	if (ll_logBels) {
	  for (int xi=0; xi<ia_mrf->V[i]; xi++) {
	    for (int xj=0; xj<ia_mrf->V[j]; xj++) {
	      new_pairBeliefs[i][n][xi][xj] -= min_beliefs_ij;
	    }
	  }
	}
	else {
	  double sum_beliefs_ij = 0.0;
	  for (int xi=0; xi<ia_mrf->V[i]; xi++) {
	    for (int xj=0; xj<ia_mrf->V[j]; xj++) {
	      new_pairBeliefs[i][n][xi][xj] -= min_beliefs_ij;
	      new_pairBeliefs[i][n][xi][xj] = exp(- new_pairBeliefs[i][n][xi][xj] / ia_mrf->getTemperature());
	      sum_beliefs_ij += new_pairBeliefs[i][n][xi][xj];
	    }
	  }
	  if (sum_beliefs_ij > 0.0) {
	    for (int xi=0; xi<ia_mrf->V[i]; xi++) {
	      for (int xj=0; xj<ia_mrf->V[j]; xj++) {
		new_pairBeliefs[i][n][xi][xj] /= sum_beliefs_ij;
	      }
	    }
	  }
	}
      }
    }
  }
  freePairBeliefs();
  l_pairBeliefs = new_pairBeliefs;
  new_pairBeliefs = 0;

  return l_pairBeliefs;
}

double**** LogLoopy::calcPairBeliefsTRBP() {

  double**** new_pairBeliefs = new double***[ia_mrf->N];

  for (int i=0; i<ia_mrf->N; i++) {
    new_pairBeliefs[i] = new double**[ia_mrf->neighbNum(i)];
    for (int n=0; n<ia_mrf->neighbNum(i); n++) {
      new_pairBeliefs[i][n] = 0;
      int j = ia_mrf->adjMat[i][n];
      if (i<j) {
	int nei_ij = 0;
	while (ia_mrf->adjMat[j][nei_ij] != i) {
	  nei_ij++;
	}
	new_pairBeliefs[i][n] = new double*[ia_mrf->V[i]];
	double min_beliefs_ij = numeric_limits<double>::infinity();
	for (int xi=0; xi<ia_mrf->V[i]; xi++) {
	  new_pairBeliefs[i][n][xi] = new double[ia_mrf->V[j]];
	  for (int xj=0; xj<ia_mrf->V[j]; xj++) {
	    new_pairBeliefs[i][n][xi][xj] = (ia_mrf->localMat[i][xi] +
					     ia_mrf->localMat[j][xj] +
					     (ia_mrf->pairEnergy(i,n,xi,xj) / l_trwRho[i][n]));

	    for (int ni=0; ni<ia_mrf->neighbNum(i); ni++) {
	      int k = ia_mrf->adjMat[i][ni];
	      int nk = 0;
	      while (ia_mrf->adjMat[k][nk] != i) {
		nk++;
	      }
	      new_pairBeliefs[i][n][xi][xj] += (l_messages[k][nk][xi] * l_trwRho[i][ni]);
	    }
	    new_pairBeliefs[i][n][xi][xj] -= l_messages[j][nei_ij][xi];

	    for (int nj=0; nj<ia_mrf->neighbNum(j); nj++) {
	      int k = ia_mrf->adjMat[j][nj];
	      int nk = 0;
	      while (ia_mrf->adjMat[k][nk] != j) {
		nk++;
	      }
	      new_pairBeliefs[i][n][xi][xj] += (l_messages[k][nk][xj] * l_trwRho[j][nj]);
	    }
	    new_pairBeliefs[i][n][xi][xj] -= l_messages[i][n][xj];

	    if (new_pairBeliefs[i][n][xi][xj] < min_beliefs_ij) {
	      min_beliefs_ij = new_pairBeliefs[i][n][xi][xj];
	    }
	  }
	}

	// normalize the ij-beliefs
	if (ll_logBels) {
	  for (int xi=0; xi<ia_mrf->V[i]; xi++) {
	    for (int xj=0; xj<ia_mrf->V[j]; xj++) {
	      new_pairBeliefs[i][n][xi][xj] -= min_beliefs_ij;
	    }
	  }
	}
	else {
	  double sum_beliefs_ij = 0.0;
	  for (int xi=0; xi<ia_mrf->V[i]; xi++) {
	    for (int xj=0; xj<ia_mrf->V[j]; xj++) {
	      new_pairBeliefs[i][n][xi][xj] -= min_beliefs_ij;
	      new_pairBeliefs[i][n][xi][xj] = exp(- new_pairBeliefs[i][n][xi][xj] / ia_mrf->getTemperature());
	      sum_beliefs_ij += new_pairBeliefs[i][n][xi][xj];
	    }
	  }
	  if (sum_beliefs_ij > 0.0) {
	    for (int xi=0; xi<ia_mrf->V[i]; xi++) {
	      for (int xj=0; xj<ia_mrf->V[j]; xj++) {
		new_pairBeliefs[i][n][xi][xj] /= sum_beliefs_ij;
	      }
	    }
	  }
	}
      }
    }
  }
  freePairBeliefs();
  l_pairBeliefs = new_pairBeliefs;
  new_pairBeliefs = 0;

  return l_pairBeliefs;
}

double** LogLoopy::inference(int* converged) {

  if (l_trwRho != 0) {
    return inferenceTRBP(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];
	}
      }
      
      // 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) + 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++) {
	  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];
	  }
	}