Implements the sequential tree-reweighted message passing (TRW-S) algorithm described in "Convergent Tree-Reweighted Message Passing for Energy
Minimization," Kolmogorov, IEEE PAMI, 2006.
More...
|
| drwnTRWSInference (const drwnFactorGraph &graph) |
|
void | clear () |
| Clear internally cached data (e.g., computation graph)
|
|
pair< double, double > | inference (drwnFullAssignment &mapAssignment) |
| Run inference (or resume for iterative algorithms). Algorithms may initialize from mapAssignment if not empty. Returns an upper and lower bound (if available) of the minimum energy. The upper bound is the same as the energy of the best solution found (i.e., same as graph.getEnergy(mapAssignment) ).
|
|
| drwnMAPInference (const drwnFactorGraph &graph) |
|
| drwnMAPInference (const drwnMAPInference &inf) |
|
|
static int | CONVERGENCE_STEP = 10 |
| number of steps checked in determining convergence
|
|
static double | EPSILON = 1.0e-6 |
| Used to define the treshold for stopping condition.
|
|
static double | THETA_CONST = 0.0 |
| define the constant
|
|
Implements the sequential tree-reweighted message passing (TRW-S) algorithm described in "Convergent Tree-Reweighted Message Passing for Energy
Minimization," Kolmogorov, IEEE PAMI, 2006.
The documentation for this class was generated from the following files: