Alpha-Expansion-Fusion Algorithm uses the code of Alexander Fix to reduce the higer order moves to binary pairwise problems which are solved by QPBO as described in Alexander Fix, Artinan Gruber, Endre Boros, Ramin Zabih: A Graph Cut Algorithm for Higher Order Markov Random Fields, ICCV 2011. More...

#include <alphaexpansionfusion.hxx>

Inheritance diagram for opengm::AlphaExpansionFusion< GM, ACC >:

Collaboration diagram for opengm::AlphaExpansionFusion< GM, ACC >:

Classes
struct	Parameter

struct	RebindGm

struct	RebindGmAndAcc

Public Types
typedef GM	GraphicalModelType

typedef ACC	AccumulationType

typedef visitors::VerboseVisitor< AlphaExpansionFusion< GM, ACC > >	VerboseVisitorType

typedef visitors::EmptyVisitor< AlphaExpansionFusion< GM, ACC > >	EmptyVisitorType

typedef visitors::TimingVisitor< AlphaExpansionFusion< GM, ACC > >	TimingVisitorType

Public Types inherited from opengm::Inference< GM, ACC >
typedef GM	GraphicalModelType

typedef ACC	AccumulationType

typedef GraphicalModelType::LabelType	LabelType

typedef GraphicalModelType::IndexType	IndexType

typedef GraphicalModelType::ValueType	ValueType

typedef GraphicalModelType::OperatorType	OperatorType

typedef GraphicalModelType::FactorType	FactorType

typedef GraphicalModelType::IndependentFactorType	IndependentFactorType

typedef GraphicalModelType::FunctionIdentifier	FunctionIdentifier

Public Member Functions
	AlphaExpansionFusion (const GraphicalModelType &, Parameter para=Parameter())

std::string	name () const

const GraphicalModelType &	graphicalModel () const

template<class StateIterator >
void	setState (StateIterator, StateIterator)

InferenceTermination	infer ()

void	reset ()

template<class Visitor >
InferenceTermination	infer (Visitor &visitor)

void	setStartingPoint (typename std::vector< LabelType >::const_iterator)
	set initial labeling More...

InferenceTermination	arg (std::vector< LabelType > &, const size_t=1) const
	output a solution More...

Public Member Functions inherited from opengm::Inference< GM, ACC >
virtual	~Inference ()

virtual InferenceTermination	args (std::vector< std::vector< LabelType > > &) const

virtual InferenceTermination	marginal (const size_t, IndependentFactorType &) const
	output a solution for a marginal for a specific variable More...

virtual InferenceTermination	factorMarginal (const size_t, IndependentFactorType &) const
	output a solution for a marginal for all variables connected to a factor More...

virtual ValueType	bound () const
	return a bound on the solution More...

virtual ValueType	value () const
	return the solution (value) More...

InferenceTermination	constrainedOptimum (std::vector< IndexType > &, std::vector< LabelType > &, std::vector< LabelType > &) const

InferenceTermination	modeFromMarginal (std::vector< LabelType > &) const

InferenceTermination	modeFromFactorMarginal (std::vector< LabelType > &) const

Public Attributes
	OPENGM_GM_TYPE_TYPEDEFS

Detailed Description

template<class GM, class ACC>
class opengm::AlphaExpansionFusion< GM, ACC >

Alpha-Expansion-Fusion Algorithm uses the code of Alexander Fix to reduce the higer order moves to binary pairwise problems which are solved by QPBO as described in Alexander Fix, Artinan Gruber, Endre Boros, Ramin Zabih: A Graph Cut Algorithm for Higher Order Markov Random Fields, ICCV 2011.

Corresponding author: Joerg Hendrik Kappes

Definition at line 20 of file alphaexpansionfusion.hxx.