Darwin
1.10(beta)
|
Implements asynchronous max-product (min-sum) inference. More...
Public Member Functions | |
drwnAsyncMaxProdInference (const drwnFactorGraph &graph) | |
![]() | |
drwnMessagePassingMAPInference (const drwnFactorGraph &graph) | |
void | clear () |
Clear internally cached data (e.g., computation graph) | |
std::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) | |
Protected Member Functions | |
void | buildComputationGraph () |
void | decodeBeliefs (drwnFullAssignment &mapAssignment) |
![]() | |
virtual void | initializeMessages () |
Additional Inherited Members | |
![]() | |
static unsigned | MAX_ITERATIONS = 1000 |
maximum number of iterations | |
static double | DAMPING_FACTOR = 0.0 |
damping factor for updating messages | |
![]() | |
std::vector< drwnTableFactor * > | _forwardMessages |
std::vector< drwnTableFactor * > | _backwardMessages |
std::vector< drwnTableFactor * > | _oldForwardMessages |
std::vector< drwnTableFactor * > | _oldBackwardMessages |
std::vector< drwnTableFactor * > | _intermediateFactors |
std::vector < drwnFactorOperation * > | _computations |
std::vector < drwnTableFactorStorage * > | _sharedStorage |
![]() | |
const drwnFactorGraph & | _graph |
reference to initial clique potentials | |
Implements asynchronous max-product (min-sum) inference.
|
protectedvirtual |
Reimplemented from drwnMessagePassingMAPInference.