Class Hierarchy

Go to the graphical class hierarchy

This inheritance list is sorted roughly, but not completely, alphabetically:

[detail level 1234]

Copengm::Ad3ModelProxy< MODEL_TYPE >
Copengm::LPInferenceBase< LP_INFERENCE_TYPE >::AddAllViolatedLinearConstraintsFunctor	Functor used to access the method challenge() of the underlying linear constraint function of a graphical model factor and to add all violated constraints to the LP/MIP model
Copengm::LPInferenceBase< LP_INFERENCE_TYPE >::AddAllViolatedLinearConstraintsFunctor::AddAllViolatedLinearConstraintsFunctor_impl< FUNCTION_TYPE, IS_LINEAR_CONSTRAINT_FUNCTION >	Helper struct to distinguish between linear constraint functions and other function types. This is necessary as only linear constraint functions provide the method challenge()
Copengm::LPInferenceBase< LP_INFERENCE_TYPE >::AddAllViolatedLinearConstraintsFunctor::AddAllViolatedLinearConstraintsFunctor_impl< FUNCTION_TYPE, true >
Copengm::LPInferenceBase< LP_INFERENCE_TYPE >::AddAllViolatedLinearConstraintsRelaxedFunctor	Functor used to access the method challengeRelaxed() of the underlying linear constraint function of a graphical model factor and to add all violated constraints to the LP/MIP model
Copengm::LPInferenceBase< LP_INFERENCE_TYPE >::AddAllViolatedLinearConstraintsRelaxedFunctor::AddAllViolatedLinearConstraintsRelaxedFunctor_impl< FUNCTION_TYPE, IS_LINEAR_CONSTRAINT_FUNCTION >	Helper struct to distinguish between linear constraint functions and other function types. This is necessary as only linear constraint functions provide the method challengeRelaxed()
Copengm::LPInferenceBase< LP_INFERENCE_TYPE >::AddAllViolatedLinearConstraintsRelaxedFunctor::AddAllViolatedLinearConstraintsRelaxedFunctor_impl< FUNCTION_TYPE, true >
Copengm::Adder	Addition as a binary operation
Copengm::external::addMRFNode< GM, ENERGYTYPE >
Copengm::external::addMRFNode< GM, TypeGeneral >
Copengm::external::addMRFNode< GM, TypeTruncatedLinear >
Copengm::external::addMRFNode< GM, TypeTruncatedQuadratic >
Copengm::external::addMRFNode< GM, TypeView< GM > >
Copengm::AddViolatedLinearConstraintsFunctor< LP_INFERENCE_BASE_TYPE, HEURISTIC >	Functor used to access the method challenge() of the underlying linear constraint function of a graphical model factor and to add a limited number of violated constraints to the LP/MIP model
Copengm::AddViolatedLinearConstraintsFunctor< LP_INFERENCE_BASE_TYPE, HEURISTIC >::AddViolatedLinearConstraintsFunctor_impl< FUNCTION_TYPE, IS_LINEAR_CONSTRAINT_FUNCTION >	Helper struct to distinguish between linear constraint functions and other function types. This is necessary as only linear constraint functions provide the method challenge()
Copengm::AddViolatedLinearConstraintsFunctor< LP_INFERENCE_BASE_TYPE, HEURISTIC >::AddViolatedLinearConstraintsFunctor_impl< FUNCTION_TYPE, true >
Copengm::AddViolatedLinearConstraintsRelaxedFunctor< LP_INFERENCE_BASE_TYPE, HEURISTIC >	Functor used to access the method challengeRelaxed() of the underlying linear constraint function of a graphical model factor and to add a limited number of violated constraints to the LP/MIP model
Copengm::AddViolatedLinearConstraintsRelaxedFunctor< LP_INFERENCE_BASE_TYPE, HEURISTIC >::AddViolatedLinearConstraintsRelaxedFunctor_impl< FUNCTION_TYPE, IS_LINEAR_CONSTRAINT_FUNCTION >	Helper struct to distinguish between linear constraint functions and other function types. This is necessary as only linear constraint functions provide the method challengeRelaxed()
Copengm::AddViolatedLinearConstraintsRelaxedFunctor< LP_INFERENCE_BASE_TYPE, HEURISTIC >::AddViolatedLinearConstraintsRelaxedFunctor_impl< FUNCTION_TYPE, true >
Copengm::detail_properties::AllValuesInAnyOrderFunctionProperties< FUNCTION, ACCUMULATOR >
►Copengm::detail_properties::AllValuesInAnyOrderFunctionProperties< FUNCTION, Adder >
Copengm::ValueFunctionProperties< ValueProperties::Sum, FUNCTION >
►Copengm::detail_properties::AllValuesInAnyOrderFunctionProperties< FUNCTION, Multiplier >
Copengm::ValueFunctionProperties< ValueProperties::Product, FUNCTION >
Copengm::proposal_gen::AlphaBetaSwapGen< GM, ACC >
Copengm::proposals::AlphaExpansion< GM, ACC >
Copengm::proposal_gen::AlphaExpansionGen< GM, ACC >
Copengm::And	Conjunction as a binary operation
Copengm::detail_properties::AtLeastAllUniqueValuesFunctionProperties< FUNCTION, ACCUMULATOR >
►Copengm::detail_properties::AtLeastAllUniqueValuesFunctionProperties< FUNCTION, Maximizer >
Copengm::ValueFunctionProperties< ValueProperties::Maximum, FUNCTION >
►Copengm::detail_properties::AtLeastAllUniqueValuesFunctionProperties< FUNCTION, Minimizer >
Copengm::ValueFunctionProperties< ValueProperties::Minimum, FUNCTION >
Copengm::LpSolverGurobi::Parameter::Barrier
Copengm::BeliefPropagationUpdateRules< GM, ACC, BUFFER >	Update rules for the MessagePassing framework
►Cbinary_function
Copengm::trws_base::maximum< T >
Copengm::trws_base::minusminus< T >
Copengm::trws_base::mul2ndPlus< T >
Copengm::trws_base::plus2ndMul< T >
Copengm::trws_base::plusplusConst< T >
Copengm::BinaryFunctionProperties< PROPERTY_ID, FUNCTION >
Copengm::BinaryFunctionProperties< BinaryProperties::IsPotts, FUNCTION >
Copengm::BinaryProperties
Copengm::proposal_gen::BlurGen< GM, ACC >
CTransportSolver::List2D< T >::bufferElement
Copengm::BufferRandomAccessSet< T >
Copengm::CgcRedirectingVisitor< INFERENCE, INTERSECTION_BASED, INTERSECTION_BASED_VISITOR >
CCgcStateVisitor< CGC >
Copengm::ChangeablePriorityQueue< T, COMPARE >	Heap-based changable priority queue with a maximum number of elemements
Copengm::combilp_base::CombiLP_base< GM, ACC, LPREPARAMETRIZER >
Copengm::combilp_base::CombiLP_base< GM, ACC, ReparametrizerType >
►Copengm::combilp_base::CombiLP_base_Parameter
Copengm::CombiLP_Parameter< typename LPSOLVER::Parameter, typename ReparametrizerType::Parameter >
Copengm::CombiLP_Parameter< LPSOLVERPARAMETERS, REPARAMETRIZERPARAMETERS >
Copengm::LPInferenceBase< LP_INFERENCE_TYPE >::ConstraintStorage	Storage class for linear constraints representing the local polytope constraints. They are generated and stored for later use if LPInferenceBase::Parameter::LoosePolytope is selected as relaxation method
Copengm::LpSolverCplex::ConstraintType
Copengm::ConvertToExplicit< GM >	Convert any graphical model into an explicit graphical model
CTransportSolver::coordLess< E >
CTransportSolver::coordMore< E >
Copengm::external::createMRFEnergy< GM, ENERGYTYPE >
Copengm::external::createMRFEnergy< GM, TypeGeneral >
Copengm::external::createMRFEnergy< GM, TypeTruncatedLinear >
Copengm::external::createMRFEnergy< GM, TypeTruncatedQuadratic >
Copengm::external::createMRFEnergy< GM, TypeView< GM > >
►Copengm::trws_base::Decomposition< GM >
Copengm::trws_base::EdgeDecomposition< GM >
Copengm::trws_base::GridDecomposition< GM >
Copengm::trws_base::MonotoneChainsDecomposition< GM >
Copengm::trws_base::DecompositionStorage< GM >
Copengm::disjoint_set< T >
►Copengm::DualDecompositionBase< GM, DUALBLOCK >	A framework for inference algorithms based on Lagrangian decomposition
Copengm::DualDecompositionSubGradient< GM, INF, DUALBLOCK >	Dual-Decomposition-Subgradient Inference based on dual decomposition using sub-gradient descent Reference: Kappes, J. H. and Savchynskyy, B. and Schnoerr, C.: "A Bundle Approach To Efficient MAP-Inference by Lagrangian Relaxation". In CVPR 2012, 2012
►Copengm::DualDecompositionBaseParameter
Copengm::DualDecompositionSubGradient< GM, INF, DUALBLOCK >::Parameter
Copengm::DualDecompositionEmptyVisitor< DD >	Visitor
Copengm::DualDecompositionVisitor< DD >	Visitor
Copengm::external::pmc::DualEdge
Copengm::external::pmc::DualNode
►Copengm::trws_base::DynamicProgramming< GM, ACC, InputIterator >
►Copengm::trws_base::MaxSumSolver< GM, ACC, InputIterator >
Copengm::trws_base::TrivializationSolver< GM, ACC, InputIterator >
Copengm::trws_base::SumProdSolver< GM, ACC, InputIterator >
►Copengm::trws_base::DynamicProgramming< GM, ACC, std::vector< GM::ValueType >::const_iterator >
Copengm::trws_base::MaxSumSolver< GM, ACC, std::vector< GM::ValueType >::const_iterator >
Copengm::trws_base::SumProdSolver< GM, ACC, std::vector< GM::ValueType >::const_iterator >
Copengm::DynamicSingleSiteFunction< T >	Single site function with dynamic size
Copengm::proposal_gen::DynamincGen< GM, ACC >
Copengm::external::planargraph::Edge
Copengm::external::pmc::Edge
CTypeView< GM >::EdgeData
Copengm::disjoint_set< T >::elem
Copengm::visitors::EmptyVisitor< INFERENCE >
Copengm::proposal_gen::EnergyBlurGen< GM, ACC >
Copengm::python::ETLGen< V, I >
►Cstd::exception	STL class
►Cstd::runtime_error	STL class
Copengm::RuntimeError	OpenGM runtime error
Copengm::visitors::ExplicitEmptyVisitor< INFERENCE >
Copengm::ExplicitStorage< GM >	ExplicitStorage (continous storage) of a graphical model function data
Copengm::visitors::ExplicitTimingVisitor< INFERENCE >
Copengm::visitors::ExplicitVerboseVisitor< INFERENCE >
Copengm::visitors::ExplicitVisitorWrapper< VISITOR, INFERENCE_TYPE >
Copengm::external::planargraph::Face
Copengm::external::pmc::Face
Copengm::Factor< GRAPHICAL_MODEL >	Abstraction (wrapper class) of factors, independent of the function used to implement the factor
►Copengm::FactorGraph< S, I >	Interface that makes an object of type S (the template parameter) look like a (non-editable) factor graph
Copengm::GraphicalModel< ValueType, Adder, PfType, typename GM::SpaceType >
Copengm::GraphicalModel< ValueType, typename GM::OperatorType, MFunctionTypeList, MSpaceType >
►Copengm::FactorGraph< GraphicalModel< T, OPERATOR, FUNCTION_TYPE_LIST, SPACE >, SPACE::IndexType >
Copengm::GraphicalModel< T, OPERATOR, FUNCTION_TYPE_LIST, SPACE >	GraphicalModel
Copengm::trws_base::PreviousFactorTable< GM >::FactorVarID
Copengm::trws_base::FactorWrapper< FACTOR >
Copengm::FastSequence< T, MAX_STACK >	Vector that stores values on the stack if size is smaller than MAX_STACK
Copengm::FastSequence< const FactorType * >
Copengm::FiFoQueue< T >
Copengm::python::FTLGen< V, I >
Copengm::FunctionBase< FUNCTION, VALUE, INDEX, LABEL >	Fallback implementation of member functions of OpenGM functions
►Copengm::FunctionBase< AbsoluteDifferenceFunction< T, I, L >, T, I, L >
Copengm::AbsoluteDifferenceFunction< T, I, L >	Absolute difference between two labels
►Copengm::FunctionBase< AccumulatedViewFunction< GM >, GM::ValueType, GM::IndexType, GM::LabelType >
Copengm::AccumulatedViewFunction< GM >
►Copengm::FunctionBase< ConstantFunction< T, I, L >, T, I, L >
Copengm::ConstantFunction< T, I, L >	Constant function
►Copengm::FunctionBase< ExplicitFunction< T, I, L >, T, I, L >
Copengm::ExplicitFunction< T, I, L >	Function encoded as a dense multi-dimensional array, marray::Marray
►Copengm::FunctionBase< ExplicitFunction< ValueType, IndexType, LabelType >, ValueType, IndexType, LabelType >
Copengm::ExplicitFunction< ValueType, IndexType, LabelType >
►Copengm::FunctionBase< FoEFunction< T, I, L >, T, size_t, size_t >
Copengm::FoEFunction< T, I, L >	Field of Expert function
►Copengm::FunctionBase< FuseViewFixFunction< GM >, GM::ValueType, GM::IndexType, GM::LabelType >
Copengm::FuseViewFixFunction< GM >
►Copengm::FunctionBase< FuseViewFunction< GM >, GM::ValueType, GM::IndexType, GM::LabelType >
Copengm::FuseViewFunction< GM >
►Copengm::FunctionBase< LabelCostFunction< VALUE_TYPE, INDEX_TYPE, LABEL_TYPE >, VALUE_TYPE, INDEX_TYPE, LABEL_TYPE >
Copengm::LabelCostFunction< VALUE_TYPE, INDEX_TYPE, LABEL_TYPE >	A label cost function class penalizing the usage of labels
►Copengm::FunctionBase< LabelOrderFunction< VALUE_TYPE, INDEX_TYPE, LABEL_TYPE >, LinearConstraintFunctionTraits< LabelOrderFunction< VALUE_TYPE, INDEX_TYPE, LABEL_TYPE > >::ValueType, LinearConstraintFunctionTraits< LabelOrderFunction< VALUE_TYPE, INDEX_TYPE, LABEL_TYPE > >::IndexType, LinearConstraintFunctionTraits< LabelOrderFunction< VALUE_TYPE, INDEX_TYPE, LABEL_TYPE > >::LabelType >
►Copengm::LinearConstraintFunctionBase< LabelOrderFunction< VALUE_TYPE, INDEX_TYPE, LABEL_TYPE > >
Copengm::LabelOrderFunction< VALUE_TYPE, INDEX_TYPE, LABEL_TYPE >	A linear constraint function class ensuring the correct label order for two variables
►Copengm::FunctionBase< LINEAR_CONSTRAINT_FUNCTION_TYPE, LinearConstraintFunctionTraits< LINEAR_CONSTRAINT_FUNCTION_TYPE >::ValueType, LinearConstraintFunctionTraits< LINEAR_CONSTRAINT_FUNCTION_TYPE >::IndexType, LinearConstraintFunctionTraits< LINEAR_CONSTRAINT_FUNCTION_TYPE >::LabelType >
Copengm::LinearConstraintFunctionBase< LINEAR_CONSTRAINT_FUNCTION_TYPE >	Base class for linear constraint functions
►Copengm::FunctionBase< LinearConstraintFunction< VALUE_TYPE, INDEX_TYPE, LABEL_TYPE >, LinearConstraintFunctionTraits< LinearConstraintFunction< VALUE_TYPE, INDEX_TYPE, LABEL_TYPE > >::ValueType, LinearConstraintFunctionTraits< LinearConstraintFunction< VALUE_TYPE, INDEX_TYPE, LABEL_TYPE > >::IndexType, LinearConstraintFunctionTraits< LinearConstraintFunction< VALUE_TYPE, INDEX_TYPE, LABEL_TYPE > >::LabelType >
►Copengm::LinearConstraintFunctionBase< LinearConstraintFunction< VALUE_TYPE, INDEX_TYPE, LABEL_TYPE > >
Copengm::LinearConstraintFunction< VALUE_TYPE, INDEX_TYPE, LABEL_TYPE >	Default implementation of a linear constraint function class
►Copengm::FunctionBase< LPottsFunction< T, I, L >, T, I, L >
Copengm::LPottsFunction< T, I, L >	Potts function for two variables
►Copengm::FunctionBase< ModelViewFunction< GM, MARRAY >, GM::ValueType, GM::IndexType, GM::LabelType >
Copengm::ModelViewFunction< GM, MARRAY >	Function that refers to a factor of another GraphicalModel
►Copengm::FunctionBase< NumLabelsLimitationFunction< VALUE_TYPE, INDEX_TYPE, LABEL_TYPE >, LinearConstraintFunctionTraits< NumLabelsLimitationFunction< VALUE_TYPE, INDEX_TYPE, LABEL_TYPE > >::ValueType, LinearConstraintFunctionTraits< NumLabelsLimitationFunction< VALUE_TYPE, INDEX_TYPE, LABEL_TYPE > >::IndexType, LinearConstraintFunctionTraits< NumLabelsLimitationFunction< VALUE_TYPE, INDEX_TYPE, LABEL_TYPE > >::LabelType >
►Copengm::LinearConstraintFunctionBase< NumLabelsLimitationFunction< VALUE_TYPE, INDEX_TYPE, LABEL_TYPE > >
Copengm::NumLabelsLimitationFunction< VALUE_TYPE, INDEX_TYPE, LABEL_TYPE >	A linear constraint function class for limiting the number of used labels
►Copengm::FunctionBase< PottsFunction< T, I, L >, T, size_t, size_t >
Copengm::PottsFunction< T, I, L >	Potts function for two variables
►Copengm::FunctionBase< PottsGFunction< T, I, L >, T, I, L >
Copengm::PottsGFunction< T, I, L >	Generalized Potts Function
►Copengm::FunctionBase< PottsNFunction< T, I, L >, T, I, L >
Copengm::PottsNFunction< T, I, L >	Potts function in N variables
►Copengm::FunctionBase< PythonFunction< T, I, L >, T, I, L >
Copengm::python::PythonFunction< T, I, L >
►Copengm::FunctionBase< ReparametrizationView< GM, REPASTORAGE >, GM::ValueType, GM::IndexType, GM::LabelType >
Copengm::ReparametrizationView< GM, REPASTORAGE >
►Copengm::FunctionBase< ScaledViewFunction< GM >, GM::ValueType, GM::IndexType, GM::LabelType >
Copengm::ScaledViewFunction< GM >	Function that scales a factor of another graphical model
►Copengm::FunctionBase< SparseFunction< T, I, L, CONTAINER >, T, I, L >
Copengm::SparseFunction< T, I, L, CONTAINER >
►Copengm::FunctionBase< SquaredDifferenceFunction< T, I, L >, T, I, L >
Copengm::SquaredDifferenceFunction< T, I, L >	Squared difference of the labels of two variables
►Copengm::FunctionBase< StaticSingleSiteFunction< T, SIZE, STORAGE >, T, size_t, size_t >
Copengm::StaticSingleSiteFunction< T, SIZE, STORAGE >	Single site function whose size is fixed at compile time
►Copengm::FunctionBase< SumConstraintFunction< VALUE_TYPE, INDEX_TYPE, LABEL_TYPE >, VALUE_TYPE, INDEX_TYPE, LABEL_TYPE >
Copengm::SumConstraintFunction< VALUE_TYPE, INDEX_TYPE, LABEL_TYPE >	A sum constraint function class penalizing the violation of a given linear equality constraint
►Copengm::FunctionBase< TruncatedAbsoluteDifferenceFunction< T, I, L >, T, I, L >
Copengm::TruncatedAbsoluteDifferenceFunction< T, I, L >	Truncated absolute differents between the labels of 2 variables
►Copengm::FunctionBase< TruncatedSquaredDifferenceFunction< T, I, L >, T, I, L >
Copengm::TruncatedSquaredDifferenceFunction< T, I, L >	Truncated squared difference of the labels of two variables
►Copengm::FunctionBase< ViewConvertFunction< GM, ACC, VALUE_TYPE >, GM::ValueType, GM::IndexType, GM::LabelType >
Copengm::ViewConvertFunction< GM, ACC, VALUE_TYPE >	ViewConvertFunction convert semi-ring in a lazy fashion
►Copengm::FunctionBase< ViewFixVariablesFunction< GM >, GM::ValueType, GM::IndexType, GM::LabelType >
Copengm::ViewFixVariablesFunction< GM >	Funcion that refers to a factor of another GraphicalModel in which some variables are fixed
►Copengm::FunctionBase< ViewFunction< GM >, GM::ValueType, GM::IndexType, GM::LabelType >
Copengm::ViewFunction< GM >	Reference to a Factor of a GraphicalModel
Copengm::FunctionIdentification< FUNCTION_INDEX_TYPE, FUNCTION_TYPE_INDEX_TYPE >
Copengm::FunctionIteratation< I, D, END >
Copengm::FunctionIteratation< IX, DX, false >
Copengm::FunctionIteratation< IX, DX, true >
Copengm::trws_base::FunctionParameters< GM >
Copengm::FunctionRegistration< FUNCTION_TYPE >	FunctionRegistration
Copengm::FunctionRegistration< LPottsFunction< T, I, L > >
Copengm::FunctionSerialization< T >	FunctionSerialization
Copengm::FunctionSerialization< python::PythonFunction< T, I, L > >
Copengm::FusionMover< GM, ACC >
Copengm::FusionMover< GraphicalModelType, AccumulationType >
Copengm::FusionVisitor< INF, SELF_FUSION, SELF_FUSION_VISITOR >
Copengm::LPFunctionTransfer< VALUE_TYPE, INDEX_TYPE, LABEL_TYPE >::GetIndicatorVariablesFunctor	Functor to call LPFunctionTransfer::getIndicatorVariables() for a factor of the graphical model
Copengm::LPInferenceBase< LP_INFERENCE_TYPE >::GetIndicatorVariablesOrderBeginFunctor	Functor used to access the method indicatorVariablesOrderBegin() of the underlying linear constraint function of a graphical model factor
Copengm::LPInferenceBase< LP_INFERENCE_TYPE >::GetIndicatorVariablesOrderBeginFunctor::GetIndicatorVariablesOrderBeginFunctor_impl< FUNCTION_TYPE, IS_LINEAR_CONSTRAINT_FUNCTION >	Helper struct to distinguish between linear constraint functions and other function types. This is necessary as only linear constraint functions provide the method indicatorVariablesOrderBegin()
Copengm::LPInferenceBase< LP_INFERENCE_TYPE >::GetIndicatorVariablesOrderBeginFunctor::GetIndicatorVariablesOrderBeginFunctor_impl< FUNCTION_TYPE, true >
Copengm::LPInferenceBase< LP_INFERENCE_TYPE >::GetIndicatorVariablesOrderEndFunctor	Functor used to access the method indicatorVariablesOrderEnd() of the underlying linear constraint function of a graphical model factor
Copengm::LPInferenceBase< LP_INFERENCE_TYPE >::GetIndicatorVariablesOrderEndFunctor::GetIndicatorVariablesOrderEndFunctor_impl< FUNCTION_TYPE, IS_LINEAR_CONSTRAINT_FUNCTION >	Helper struct to distinguish between linear constraint functions and other function types. This is necessary as only linear constraint functions provide the method indicatorVariablesOrderEnd()
Copengm::LPInferenceBase< LP_INFERENCE_TYPE >::GetIndicatorVariablesOrderEndFunctor::GetIndicatorVariablesOrderEndFunctor_impl< FUNCTION_TYPE, true >
Copengm::LPInferenceBase< LP_INFERENCE_TYPE >::GetLinearConstraintsBeginFunctor	Functor used to access the method linearConstraintsBegin() of the underlying linear constraint function of a graphical model factor
Copengm::LPInferenceBase< LP_INFERENCE_TYPE >::GetLinearConstraintsBeginFunctor::GetLinearConstraintsBeginFunctor_impl< FUNCTION_TYPE, IS_LINEAR_CONSTRAINT_FUNCTION >	Helper struct to distinguish between linear constraint functions and other function types. This is necessary as only linear constraint functions provide the method linearConstraintsBegin()
Copengm::LPInferenceBase< LP_INFERENCE_TYPE >::GetLinearConstraintsBeginFunctor::GetLinearConstraintsBeginFunctor_impl< FUNCTION_TYPE, true >
Copengm::LPInferenceBase< LP_INFERENCE_TYPE >::GetLinearConstraintsEndFunctor	Functor used to access the method linearConstraintsEnd() of the underlying linear constraint function of a graphical model factor
Copengm::LPInferenceBase< LP_INFERENCE_TYPE >::GetLinearConstraintsEndFunctor::GetLinearConstraintsEndFunctor_impl< FUNCTION_TYPE, IS_LINEAR_CONSTRAINT_FUNCTION >	Helper struct to distinguish between linear constraint functions and other function types. This is necessary as only linear constraint functions provide the method linearConstraintsEnd()
Copengm::LPInferenceBase< LP_INFERENCE_TYPE >::GetLinearConstraintsEndFunctor::GetLinearConstraintsEndFunctor_impl< FUNCTION_TYPE, true >
Copengm::LPFunctionTransfer< VALUE_TYPE, INDEX_TYPE, LABEL_TYPE >::GetLinearConstraintsFunctor	Functor to call LPFunctionTransfer::getLinearConstraints() for a factor of the graphical model
Copengm::LPFunctionTransfer< VALUE_TYPE, INDEX_TYPE, LABEL_TYPE >::GetSlackVariablesObjectiveCoefficientsFunctor	Functor to call LPFunctionTransfer::getSlackVariablesObjectiveCoefficients() for a factor of the graphical model
Copengm::LPFunctionTransfer< VALUE_TYPE, INDEX_TYPE, LABEL_TYPE >::GetSlackVariablesOrderFunctor	Functor to call LPFunctionTransfer::getSlackVariablesOrder() for a factor of the graphical model
Copengm::GibbsMarginalVisitor< GIBBS >	Visitor for the Gibbs sampler to compute arbitrary marginal probabilities
CTypeView< GM >::GlobalSize
Copengm::python::GmGen< V, I, O, F >
Copengm::external::pmc::Graph
Copengm::GraphicalModelManipulator< GM >	GraphicalModelManipulator
Copengm::HlFusionMover< GM, ACC >
Copengm::IndependentFactor< T, I, L >	Factor (with corresponding function and variable indices), independent of a GraphicalModel
Copengm::IndicatorVariable< INDEX_TYPE, LABEL_TYPE >	Combine a group of variables to a new variable
►Copengm::Inference< GM, ACC >	Inference algorithm interface
Copengm::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
Copengm::AStar< GM, ACC >	A star search algorithm
Copengm::Bruteforce< GM, ACC >	Brute force inference algorithm
Copengm::CGC< GM, ACC >	Experimental Multicut
Copengm::CombiLP< GM, ACC, LPSOLVER >	CombiLP Savchynskyy, B. and Kappes, J. H. and Swoboda, P. and Schnoerr, C.: "Global MAP-Optimality by Shrinking the Combinatorial Search Area with Convex Relaxation". In NIPS, 2013
Copengm::DynamicProgramming< GM, ACC >	DynamicProgramming
Copengm::external::AD3Inf< GM, ACC >	AD3
Copengm::external::libdai::LoopCorrectedBp< GM, ACC, CAVITY_INFERENCE >
Copengm::external::libdai::MeanField< GM, ACC >	Mean Field : [?]
Copengm::external::libdai::TreeExpectationPropagation< GM, ACC >	Tree Expectation Propagation : [?]
Copengm::external::libdai::TreeReweightedBp< GM, ACC >	Tree reweighted belief propagation : [?]
Copengm::Gibbs< GM, ACC >	Gibbs sampling
Copengm::GraphCut< GM, ACC, MINSTCUT >	A framework for min st-cut algorithms
Copengm::GreedyGremlin< GM, ACC >	GREEDY GREMLIN
Copengm::ICM< GM, ACC >	Iterated Conditional Modes Algorithm J. E. Besag, "On the Statistical Analysis of Dirty Pictures", Journal of the Royal Statistical Society, Series B 48(3):259-302, 1986
Copengm::InfAndFlip< GM, ACC, INF >	Inference and Flip
Copengm::LazyFlipper< GM, ACC >	A generalization of ICM B. Andres, J. H. Kappes, U. Koethe and Hamprecht F. A., The Lazy Flipper: MAP Inference in Higher-Order Graphical Models by Depth-limited Exhaustive Search, Technical Report, 2010, http://arxiv.org/abs/1009.4102
Copengm::LOC< GM, ACC >	LOC Algorithm K. Jung, P. Kohli and D. Shah, "Local Rules for Global MAP: When Do They Work?", NIPS 2009
Copengm::LPCplex< GM, ACC >	Optimization by Linear Programming (LP) or Integer LP using IBM ILOG CPLEX http://www.ilog.com/products/cplex/
Copengm::LPGurobi< GM, ACC >	Optimization by Linear Programming (LP) or Integer LP using Guroi http://www.gurobi.com
Copengm::LSA_TR< GM, ACC >
Copengm::MessagePassing< GM, ACC, UPDATE_RULES, DIST >	A framework for message passing algorithms Cf. F. R. Kschischang, B. J. Frey and H.-A. Loeliger, "Factor Graphs and the Sum-Product Algorithm", IEEE Transactions on Information Theory 47:498-519, 2001
Copengm::MQPBO< GM, ACC >	[class mqpbo] Multilabel QPBO (MQPBO) Implements the algorithms described in i) Ivan Kovtun: Partial Optimal Labeling Search for a NP-Hard Subclass of (max, +) Problems. DAGM-Symposium 2003 (part. opt. for potts) ii) P. Kohli, A. Shekhovtsov, C. Rother, V. Kolmogorov, and P. Torr: On partial optimality in multi-label MRFs, ICML 2008 (MQPBO) iii) P. Swoboda, B. Savchynskyy, J.H. Kappes, and C. Schnörr : Partial Optimality via Iterative Pruning for the Potts Model, SSVM 2013 (MQPBO with permutation sampling)
Copengm::Multicut< GM, ACC >
Copengm::PartitionMove< GM, ACC >	Partition Move Currently Partition Move only implements the Kernighan-Lin-Algorithm
Copengm::ReducedInference< GM, ACC, INF >	[class reducedinference] Reduced Inference Implementation of the reduction techniques proposed in J.H. Kappes, M. Speth, G. Reinelt, and C. Schnörr: Towards Efficient and Exact MAP-Inference for Large Scale Discrete Computer Vision Problems via Combinatorial Optimization, CVPR 2013
Copengm::SwendsenWang< GM, ACC >	Generalized Swendsen-Wang sampling A. Barbu, S. Zhu, "Generalizing swendsen-wang to sampling arbitrary posterior probabilities", PAMI 27:1239-1253, 2005
►Copengm::trws_base::SmoothingBasedInference< GM, ACC >
Copengm::ADSal< GM, ACC >	[class adsal] ADSal - adaptive diminishing smoothing algorithm Based on the paper: B. Savchynskyy, S. Schmidt, J. H. Kappes, C. Schnörr Efficient MRF Energy Minimization via Adaptive Diminishing Smoothing, In UAI, 2012, pp. 746-755
Copengm::NesterovAcceleratedGradient< GM, ACC >
Copengm::TRWSi< GM, ACC >	[class trwsi] TRWSi - tree-reweighted sequential message passing Based on the paper: V. Kolmogorov Convergent tree-reweighted message passing for energy minimization. IEEE Trans. on PAMI, 28(10):1568–1583, 2006
►Copengm::Inference< GM, INF::AccumulationType >
Copengm::AlphaBetaSwap< GM, INF >	Alpha-Beta-Swap Algorithm
Copengm::AlphaExpansion< GM, INF >	Alpha-Expansion Algorithm
Copengm::DMC< GM, INF >
Copengm::DualDecompositionSubGradient< GM, INF, DUALBLOCK >	Dual-Decomposition-Subgradient Inference based on dual decomposition using sub-gradient descent Reference: Kappes, J. H. and Savchynskyy, B. and Schnoerr, C.: "A Bundle Approach To Efficient MAP-Inference by Lagrangian Relaxation". In CVPR 2012, 2012
►Copengm::Inference< GM, opengm::Minimizer >
Copengm::external::DAOOPT< GM >	DAOOPT DAOOPT inference algorithm class
Copengm::external::FastPD< GM >	FastPD FastPD inference algorithm class
Copengm::external::GCOLIB< GM >	GCOLIB GCOLIB inference algorithm class
Copengm::external::GRANTE< GM >	GRANTE GRANTE inference algorithm class
Copengm::external::MPLP< GM >	MPLP MPLP inference algorithm class
Copengm::external::MRFLIB< GM >	MRFLIB MRFLIB inference algorithm class
Copengm::external::QPBO< GM >	QPBO Algorithm
Copengm::external::SRMP< GM >
Copengm::external::TRWS< GM >	Message passing (BPS, TRWS): [?]
Copengm::HQPBO< GM, ACC >	HQPBO Algorithm
Copengm::QPBO< GM, MIN_ST_CUT >	QPBO Algorithm C. Rother, V. Kolmogorov, V. Lempitsky, and M. Szummer, "Optimizing binary MRFs via extended roof duality", CVPR 2007
►Copengm::Inference< GM, opengm::Or >
Copengm::SAT< GM >	2-SAT solver
►Copengm::Inference< GM, PROPOSAL_GEN::AccumulationType >
Copengm::FusionBasedInf< GM, PROPOSAL_GEN >
Copengm::IntersectionBasedInf< GM, PROPOSAL_GEN >
►Copengm::Inference< INFERENCE::GraphicalModelType, INFERENCE::AccumulationType >
Copengm::SelfFusion< INFERENCE >
►Copengm::Inference< LPInferenceTraits< LP_INFERENCE_TYPE >::GraphicalModelType, LPInferenceTraits< LP_INFERENCE_TYPE >::AccumulationType >
Copengm::LPInferenceBase< LP_INFERENCE_TYPE >	Base class for Linear Programming based inference
►Copengm::Inference< LPInferenceTraits< LPCplex2< GM_TYPE, ACC_TYPE > >::GraphicalModelType, LPInferenceTraits< LPCplex2< GM_TYPE, ACC_TYPE > >::AccumulationType >
►Copengm::LPInferenceBase< LPCplex2< GM_TYPE, ACC_TYPE > >
Copengm::LPCplex2< GM_TYPE, ACC_TYPE >	LP inference with CPLEX
►Copengm::Inference< LPInferenceTraits< LPGurobi2< GM_TYPE, ACC_TYPE > >::GraphicalModelType, LPInferenceTraits< LPGurobi2< GM_TYPE, ACC_TYPE > >::AccumulationType >
►Copengm::LPInferenceBase< LPGurobi2< GM_TYPE, ACC_TYPE > >
Copengm::LPGurobi2< GM_TYPE, ACC_TYPE >	LP inference with Gurobi
►Copengm::Inference< SUB_INFERENCE::GraphicalModelType, SUB_INFERENCE::AccumulationType >
Copengm::external::libdai::DecMap< SUB_INFERENCE >
Copengm::SubmodelOptimizer< GM, ACC >::InfResult
Cmarray::InitializationSkipping	Flag to indicate initialization skipping
Copengm::external::GRANTE< GM >::InsertFunctor< T, OBJECT >
CIntegralUnorderedMaxSizeSet< INDEX_TYPE >
Copengm::Integrator	Integration (addition) as a unary accumulation
Copengm::LPFunctionTransfer< VALUE_TYPE, INDEX_TYPE, LABEL_TYPE >::IsTransferableFunctor	Functor to call LPFunctionTransfer::isTransferable() for a factor of the graphical model
Cmarray::Iterator< T, isConst, A >	STL-compliant random access iterator for View and Marray
►Citerator
Copengm::IloNumArrayIterator	Iterator to iterate over an array of type IloNumArray
Copengm::SubsequenceIterator< SEQUENCE_ITERATOR_TYPE, SUBSEQUENCE_INDICES_ITERATOR_TYPE >	Defines the const iterator type to iterate over the subset of a sequence
Copengm::SubsequenceIterator< SolverSolutionIteratorType, typename std::vector< size_t >::const_iterator >
Copengm::SubsequenceIterator< typename std::vector< LabelType >::const_iterator, typename std::vector< size_t >::const_iterator >
Copengm::proposals::LabelHistory< GM, ACC >
►CLibDaiInference
Copengm::external::libdai::DecMap< SUB_INFERENCE >
Copengm::external::libdai::LoopCorrectedBp< GM, ACC, CAVITY_INFERENCE >
Copengm::external::libdai::MeanField< GM, ACC >	Mean Field : [?]
Copengm::external::libdai::TreeExpectationPropagation< GM, ACC >	Tree Expectation Propagation : [?]
Copengm::external::libdai::TreeReweightedBp< GM, ACC >	Tree reweighted belief propagation : [?]
Copengm::LinearConstraint< VALUE_TYPE, INDEX_TYPE, LABEL_TYPE >	Define a linear constraint for a set of indicatorVariables
Copengm::LinearConstraintFunctionTraits< LINEAR_CONSTRAINT_FUNCTION_TYPE >	Traits class for linear constraint functions
Copengm::LinearConstraintFunctionTraits< LabelOrderFunction< VALUE_TYPE, INDEX_TYPE, LABEL_TYPE > >
Copengm::LinearConstraintFunctionTraits< LinearConstraintFunction< VALUE_TYPE, INDEX_TYPE, LABEL_TYPE > >
Copengm::LinearConstraintFunctionTraits< NumLabelsLimitationFunction< VALUE_TYPE, INDEX_TYPE, LABEL_TYPE > >
Copengm::LinearConstraintTraits::LinearConstraintOperator	This struct is used to create an own scope for the LinearConstraintTraits::LinearConstraintOperator::ValueType enum as this is not done in C++ by default
Copengm::LinearConstraintTraits	Traits class for LinearConstraint to provide template independent enum for ConstraintOperatorType
CTransportSolver::List2D< T >
CTransportSolver::List2D< floatType >
CTransportSolver::List2D< T >::listElement
CTypeView< GM >::LocalSize
►Copengm::LPDef
Copengm::LPCplex< GM, ACC >	Optimization by Linear Programming (LP) or Integer LP using IBM ILOG CPLEX http://www.ilog.com/products/cplex/
Copengm::LPGurobi< GM, ACC >	Optimization by Linear Programming (LP) or Integer LP using Guroi http://www.gurobi.com
Copengm::LPFunctionTransfer< VALUE_TYPE, INDEX_TYPE, LABEL_TYPE >	Provides transformations for some function types when they are used in inference algorithms which use linear programming
Copengm::LPFunctionTransfer_impl< FUNCTION_TYPE, VALUE_TYPE, INDEX_TYPE, LABEL_TYPE >	Default implementation for class opengm::LPFunctionTransfer
Copengm::LPFunctionTransfer_impl< LabelCostFunction< VALUE_TYPE, INDEX_TYPE, LABEL_TYPE >, VALUE_TYPE, INDEX_TYPE, LABEL_TYPE >
Copengm::LPFunctionTransfer_impl< SumConstraintFunction< VALUE_TYPE, INDEX_TYPE, LABEL_TYPE >, VALUE_TYPE, INDEX_TYPE, LABEL_TYPE >
Copengm::LPInferenceTraits< LP_INFERENCE_TYPE >	Traits class for lp inference classes
Copengm::LPInferenceTraits< LPCplex2< GM_TYPE, ACC_TYPE > >
Copengm::LPInferenceTraits< LPGurobi2< GM_TYPE, ACC_TYPE > >
Copengm::LPReparametrisationStorage< GM >
Copengm::LPReparametrisationStorage< Storage::GraphicalModelType >
Copengm::LPReparametrizer< GM, ACC >
►Copengm::LPReparametrizer< Storage::GraphicalModelType, ACC >
Copengm::TRWS_Reparametrizer< Storage, ACC >
Copengm::LPReparametrizer_Parameter
Copengm::LPSolverInterface< LP_SOLVER_TYPE, VALUE_TYPE, INDEX_TYPE, SOLUTION_ITERATOR_TYPE, SOLVER_TIMING_TYPE >	Interface definition for wrapper of LP Solvers like CPLEX and Gurobi
►Copengm::LpSolverInterface
Copengm::LpSolverCplex
Copengm::LpSolverGurobi
►Copengm::LPSolverInterface< LPSolverCplex, IloNum, IloInt, IloNumArrayIterator, IloNum >
►Copengm::LPSolverCplex	Wrapper class for the IBM ILOG CPLEX optimizer
Copengm::LPCplex2< GM_TYPE, ACC_TYPE >	LP inference with CPLEX
►Copengm::LPSolverInterface< LPSolverGurobi, double, int, std::vector< double >::const_iterator, double >
►Copengm::LPSolverGurobi	Wrapper class for the Gurobi optimizer
Copengm::LPGurobi2< GM_TYPE, ACC_TYPE >	LP inference with Gurobi
Copengm::LSA_TR_HELPER< LabelType >
Copengm::LSA_TR_WeightedEdge	Local Submodular Approximation with Trust Region regularization
CTransportSolver::MatrixWrapper< T >
CTransportSolver::MatrixWrapper< floatType >
Copengm::MaxDistance	MaxDistance
Copengm::Maximizer	Maximization as a unary accumulation
CMaybeSetValue< T >
Copengm::McClusterOp< GM, ACC >
Csys::MemoryInfo
Copengm::Minimizer	Minimization as a unary accumulation
Copengm::MinSTCutBoost< NType, VType, mfalg >	Boost solvers for the min st-cut framework GraphCut
Copengm::external::MinSTCutIBFS< NType, VType >	IBFS solver for the min st-cut framework GraphCut
Copengm::LpSolverGurobi::Parameter::MIP
Copengm::LpSolverGurobi::Parameter::MIPCuts
Copengm::modelTrees< GM >
Copengm::Movemaker< GM >	A fremework for move making algorithms
Copengm::Movemaker< GraphicalModelType >
CMRFEnergy< T >
CMRFEnergy< TypeGeneral >
CMRFEnergy< TypeTruncatedLinear >
CMRFEnergy< TypeTruncatedQuadratic >
CMRFEnergy< TypeView< GM > >
Copengm::Multiplier	Multiplication as a binary operation
Copengm::NativeModelProxy< MODEL_TYPE >
Copengm::external::planargraph::Node
Copengm::external::pmc::Node
CTypeView< GM >::NodeData
Copengm::external::libdai::None
Copengm::proposal_gen::NonUniformRandomGen< GM, ACC >
Copengm::Normalization	Normalization w.r.t. a binary operation (e.g. Multiplier) and a unary accumulation (e.g. Integrator)
Copengm::python::NumpyView< V, DIM >
Copengm::python::NumpyViewType_from_python_numpyarray< VALUE_TYPE, DIM >
Copengm::python::NumpyViewType_to_python_numpyarray< VALUE_TYPE, DIM >
Copengm::LPFunctionTransfer< VALUE_TYPE, INDEX_TYPE, LABEL_TYPE >::NumSlackVariablesFunctor	Functor to call LPFunctionTransfer::numSlackVariables() for a graphical model factor
►COptions
Copengm::external::SRMP< GM >::Parameter
Copengm::Or	Disjunction as a binary operation
Copengm::LpSolverGurobi::Parameter::Others
Copengm::LpSolverGurobi::Parameter
Copengm::external::GRANTE< GM >::Parameter	Parameter
Copengm::proposals::AlphaExpansion< GM, ACC >::Parameter
Copengm::LPSolverInterface< LP_SOLVER_TYPE, VALUE_TYPE, INDEX_TYPE, SOLUTION_ITERATOR_TYPE, SOLVER_TIMING_TYPE >::Parameter	Parameter class provides options to modify LP Solver behavior
Copengm::Bruteforce< GM, ACC >::Parameter
Copengm::proposal_gen::NonUniformRandomGen< GM, ACC >::Parameter
Copengm::CGC< GM, ACC >::Parameter
Copengm::DMC< GM, INF >::Parameter
Copengm::DynamicProgramming< GM, ACC >::Parameter
Copengm::external::AD3Inf< GM, ACC >::Parameter
Copengm::external::GCOLIB< GM >::Parameter	Parameter
Copengm::external::FastPD< GM >::Parameter	Parameter
Copengm::external::libdai::TreeExpectationPropagation< GM, ACC >::Parameter
Copengm::external::libdai::DecMap< SUB_INFERENCE >::Parameter
Copengm::external::libdai::MeanField< GM, ACC >::Parameter
Copengm::Gibbs< GM, ACC >::Parameter
Copengm::external::libdai::TreeReweightedBp< GM, ACC >::Parameter
Copengm::external::MPLP< GM >::Parameter
Copengm::external::MRFLIB< GM >::Parameter	Parameter
Copengm::external::QPBO< GM >::Parameter	Parameter for opengm::external::QPBO
Copengm::external::TRWS< GM >::Parameter	Parameter
Copengm::proposal_gen::AlphaBetaSwapGen< GM, ACC >::Parameter
Copengm::proposal_gen::AlphaExpansionGen< GM, ACC >::Parameter
Copengm::proposal_gen::UpDownGen< GM, ACC >::Parameter
Copengm::proposal_gen::RandomGen< GM, ACC >::Parameter
Copengm::proposal_gen::Random2Gen< GM, ACC >::Parameter
Copengm::proposal_gen::RandomLFGen< GM, ACC >::Parameter
Copengm::proposal_gen::BlurGen< GM, ACC >::Parameter
Copengm::proposal_gen::EnergyBlurGen< GM, ACC >::Parameter
Copengm::proposal_gen::DynamincGen< GM, ACC >::Parameter
Copengm::FusionBasedInf< GM, PROPOSAL_GEN >::Parameter
Copengm::GraphCut< GM, ACC, MINSTCUT >::Parameter
Copengm::GreedyGremlin< GM, ACC >::Parameter
Copengm::HQPBO< GM, ACC >::Parameter
Copengm::ICM< GM, ACC >::Parameter
Copengm::InfAndFlip< GM, ACC, INF >::Parameter
Copengm::LpSolverCplex::Parameter
Copengm::proposal_gen::WeightRandomization< VALUE_TYPE >::Parameter
►Copengm::proposal_gen::RandMcClusterOp< GM, ACC >::Parameter
Copengm::proposal_gen::RandomizedHierarchicalClustering< GM, ACC >::Parameter
Copengm::proposal_gen::RandomizedWatershed< GM, ACC >::Parameter
Copengm::IntersectionBasedInf< GM, PROPOSAL_GEN >::Parameter
Copengm::LazyFlipper< GM, ACC >::Parameter
Copengm::LOC< GM, ACC >::Parameter
Copengm::AlphaBetaSwap< GM, INF >::Parameter
Copengm::AlphaExpansion< GM, INF >::Parameter
Copengm::AlphaExpansionFusion< GM, ACC >::Parameter
Copengm::AStar< GM, ACC >::Parameter
Copengm::LPCplex< GM, ACC >::Parameter
Copengm::LPGurobi< GM, ACC >::Parameter
Copengm::LSA_TR< GM, ACC >::Parameter
Copengm::HlFusionMover< GM, ACC >::Parameter
Copengm::MessagePassing< GM, ACC, UPDATE_RULES, DIST >::Parameter
Copengm::MQPBO< GM, ACC >::Parameter
Copengm::McClusterOp< GM, ACC >::Parameter
Copengm::PermutableLabelFusionMove< GM, ACC >::Parameter
Copengm::PartitionMove< GM, ACC >::Parameter
Copengm::QPBO< GM, MIN_ST_CUT >::Parameter
Copengm::ReducedInference< GM, ACC, INF >::Parameter
Copengm::SAT< GM >::Parameter
Copengm::SelfFusion< INFERENCE >::Parameter
Copengm::SwendsenWang< GM, ACC >::Parameter
Copengm::external::libdai::LoopCorrectedBp< GM, ACC, CAVITY_INFERENCE >::Parameter
Copengm::Parameters< T, I >
Copengm::Parameters< ValueType, IndexType >
►Copengm::ParamHeper	Multicut Algorithm [1] J. Kappes, M. Speth, B. Andres, G. Reinelt and C. Schnoerr, "Globally Optimal Image Partitioning by Multicuts", EMMCVPR 2011 [2] J. Kappes, M. Speth, G. Reinelt and C. Schnoerr, "Higher-order Segmentation via Multicuts", Technical Report (http://ipa.iwr.uni-heidelberg.de/ipabib/Papers/kappes-2013-multicut.pdf)
Copengm::Multicut< GM, ACC >::Parameter
►CParent
CTransportSolver::List2D< T >::iterator_template< Parent, typeT >
Copengm::Partition< T >	Disjoint set data structure with path compression
Copengm::Partitions< I, L >	Enumaration of partitions of a set of N nodes
Copengm::Partitions< size_t, LabelType >
Copengm::Partitions< size_t, size_t >
Copengm::PermutableLabelFusionMove< GM, ACC >
Copengm::external::planargraph::PlanarGraph
Copengm::trws_base::PreviousFactorTable< GM >
Copengm::PrimalLPBound< GM, ACC >	[class primallpbound] PrimalLPBound - estimating primal local polytope bound and feasible primal solution for the local polytope relaxation of the MRF energy minimization problem Based on the paper: B. Savchynskyy, S. Schmidt Getting Feasible Variable Estimates From Infeasible Ones: MRF Local Polytope Study. arXiv:1210.4081 Submitted Oct. 2012
Copengm::PrimalLPBound_Parameter< ValueType >
►CProgramOptions
Copengm::external::DAOOPT< GM >::Parameter	Parameter inherits from daoopt ProgramOptions
Copengm::trws_base::Pseudo2DArray< T >
Copengm::trws_base::Pseudo2DArray< ValueType >
Copengm::QpboModelProxy< MODEL_TYPE >
Copengm::proposal_gen::RandMcClusterOp< GM, ACC >
Copengm::proposal_gen::Random2Gen< GM, ACC >
Copengm::RandomAccessSet< Key, Compare, Alloc >	Set with O(n) insert and O(1) access
Copengm::RandomAccessSet< IndexType >
Copengm::RandomAccessSet< size_t >
Copengm::proposal_gen::RandomGen< GM, ACC >
Copengm::proposal_gen::RandomizedHierarchicalClustering< GM, ACC >
Copengm::proposal_gen::RandomizedWatershed< GM, ACC >
Copengm::proposal_gen::RandomLFGen< GM, ACC >
Copengm::Multicut< GM, ACC >::rebind< GM_, ACC_ >
Copengm::ReducedInferenceHelper< GM >
Copengm::hdf5::SaveAndLoadFunctions< class, size_t, size_t, bool >
Copengm::trws_base::SequenceStorage< GM >
Copengm::LpSolverGurobi::Parameter::Simplex
►Copengm::trws_base::SmoothingBasedInference_Parameter_Base< GM >
►Copengm::trws_base::SmoothingBasedInference_Parameter< GM >
Copengm::ADSal_Parameter< GM >
Copengm::Nesterov_Parameter< GM >
Copengm::trws_base::SmoothingParameters< VALUETYPE >
Copengm::trws_base::SmoothingParameters< ValueType >
►Copengm::trws_base::SmoothingStrategy< GM, ACC >
Copengm::trws_base::AdaptiveDiminishingSmoothing< GM, ACC >
Copengm::trws_base::AdaptivePrecisionOrientedSmoothing< GM, ACC >
Copengm::trws_base::FixedSmoothing< GM, ACC >
Copengm::trws_base::WorstCaseDiminishingSmoothing< GM, ACC >
Copengm::trws_base::WorstCasePrecisionOrientedSmoothing< GM, ACC >
►CSolverParameterType
Copengm::LPInferenceBase< LP_INFERENCE_TYPE >::Parameter	Parameter class for opengm::LPInferenceBase
Copengm::SpaceBase< SPACE, I, L >	Interface of label spaces
►Copengm::SpaceBase< DiscreteSpace< I, L >, I, L >
Copengm::DiscreteSpace< I, L >	Discrete space in which variables can have differently many labels
►Copengm::SpaceBase< SimpleDiscreteSpace< I, L >, I, L >
Copengm::SimpleDiscreteSpace< I, L >	Discrete space in which all variables have the same number of labels
►Copengm::SpaceBase< StaticSimpleDiscreteSpace< LABELS, I, L >, I, L >
Copengm::StaticSimpleDiscreteSpace< LABELS, I, L >	Discrete space in which all variables have the same number of labels
Copengm::trws_base::srcIterator< T >
►CSTORAGE
Copengm::StaticSingleSiteFunction< T, SIZE, STORAGE >	Single site function whose size is fixed at compile time
CSubmodelCGC< GM >
CSubmodelCGC< GraphicalModel< ValueType, Adder, PfType, typename GM::SpaceType > >
Copengm::SubmodelOptimizer< GM, ACC >::SubmodelInfo
Copengm::SubmodelOptimizer< GM, ACC >
Copengm::SwendsenWangEmptyVisitor< SW >	Visitor
Copengm::SwendsenWangMarginalVisitor< SW >	Visitor
Copengm::SwendsenWangVerboseVisitor< SW >	Visitor
Copengm::LpSolverGurobi::Parameter::Termination
Copengm::Timer	Platform-independent runtime measurements
Copengm::Timing< FUNCTOR >	Platform-independent runtime measurements of functors
Copengm::visitors::TimingVisitor< INFERENCE >
Copengm::LpSolverGurobi::Parameter::Tolerances
CTransportSolver::TransportationSolver< OPTIMIZER, DenseMatrix >
CTransportSolver::TransportationSolver< ACC, FactorWrapper< typename GM::FactorType > >
Copengm::TrbpUpdateRules< GM, ACC, BUFFER >	Update rules for the MessagePassing framework
Copengm::Tribool	Variable with three values (true=1, false=0, maybe=-1)
Copengm::TRWS_Reparametrizer_Parameters< ValueType >
Copengm::trws_base::TRWSPrototype< SubSolver >
►Copengm::trws_base::TRWSPrototype< MaxSumSolver< GM, ACC, std::vector< GM::ValueType >::const_iterator > >
Copengm::trws_base::MaxSumTRWS< GM, ACC >
►Copengm::trws_base::TRWSPrototype< SumProdSolver< GM, ACC, std::vector< GM::ValueType >::const_iterator > >
Copengm::trws_base::SumProdTRWS< GM, ACC >
►Copengm::trws_base::TRWSPrototype_Parameters< ValueType >
Copengm::trws_base::MaxSumTRWS_Parameters< ValueType >
Copengm::trws_base::SumProdTRWS_Parameters< ValueType >
►Copengm::trws_base::TRWSPrototype_Parameters< GM::ValueType >
►Copengm::trws_base::MaxSumTRWS_Parameters< GM::ValueType >
Copengm::TRWSi_Parameter< GM >
►Ctype
Copengm::CanonicalView< GM, CLONE >	Canonical view of an arbitrary GraphicalModel
CTypeView< GM >
►Cunary_function
Copengm::trws_base::compToValue< T, ACC >
Copengm::trws_base::make0ifless< T >
Copengm::trws_base::mulAndExp< T >
Copengm::trws_base::thresholdMulAndExp< T, ACC >
Copengm::proposal_gen::UpDownGen< GM, ACC >
Copengm::ValueFunctionProperties< PROPERTY_ID, FUNCTION >
Copengm::ValueProperties
Copengm::trws_base::VariableToFactorMapping< GM >
Copengm::VectorView< VECTOR, INDEX_TYPE >
Copengm::VectorView< std::vector< IndexType >, IndexType >
Copengm::proposal_gen::VectorViewEdgeMap< G, VEC >
Copengm::proposal_gen::VectorViewNodeMap< G, VEC >
Copengm::visitors::VerboseVisitor< INFERENCE >
Cmarray::ViewExpression< E, T >
►Cmarray::ViewExpression< View< IndexType, isConst, A >, IndexType >
►Cmarray::View< IndexType, false, A >
Cmarray::Marray< IndexType >
►Cmarray::ViewExpression< View< size_t, isConst, A >, size_t >
►Cmarray::View< size_t, false, A >
►Cmarray::Marray< size_t, A >
Cmarray::Matrix< size_t >
►Cmarray::ViewExpression< View< SolverIndexType, isConst, A >, SolverIndexType >
►Cmarray::View< SolverIndexType, false, A >
Cmarray::Marray< SolverIndexType >
►Cmarray::ViewExpression< View< T, isConst, A >, T >
Cmarray::View< T, isConst, A >	Array-Interface to an interval of memory
►Cmarray::View< T, false, A >
►Cmarray::Marray< T, A >	Runtime-flexible multi-dimensional array
Cmarray::Matrix< T, A >	Two-dimensional Marray
Cmarray::Vector< T, A >	One-dimensional Marray
►Cmarray::Marray< T >
Copengm::ExplicitFunction< T, I, L >	Function encoded as a dense multi-dimensional array, marray::Marray
►Cmarray::ViewExpression< View< V, isConst, A >, V >
Cmarray::View< V, false >
►Cmarray::ViewExpression< View< ValueType, isConst, A >, ValueType >
►Cmarray::View< ValueType, false, A >
►Cmarray::Marray< ValueType >
Copengm::ExplicitFunction< ValueType, IndexType, LabelType >
Copengm::ViFunctor< FACTOR, FUNCTOR >
►CVisitorBase
Cdaoopt::OpengmVisitor< V, I >
Copengm::visitors::VisitorReturnFlag
Copengm::visitors::VisitorWrapper< VISITOR, INFERENCE_TYPE >
Copengm::proposal_gen::WeightRandomization< VALUE_TYPE >
Copengm::proposal_gen::WeightRandomization< ValueType >
Cbool
CConstraintStorage
CGraphicalModelType &
CLabelType
Csize_t
CSolverIndexType
Ctype
CVarIdMapType
Cvector< ValueType >
CVecUnaryFactors