AssocGraph class provides a matrix representation of the association graph of two Graph objects. More...

#include <AssocGraph.h>

Public Types
shortcuts for list-iterators
typedef std::list< PointMap >::iterator	MapIterator

typedef std::list< PointMap >::const_iterator	constMapIterator

typedef std::list< IsomorphismMap >::iterator	IsoIterator

typedef std::list< IsomorphismMap >::const_iterator	constIsoIterator

Public Member Functions
calculation of Graph isomorphism
calculate association graph by concatenation of two distance matrices Interpretation: Indexes of _mTAG denote a point map 1->2. Hence elements of _mTAG characterize, weather to point maps fit together, i.e. if for 1->2 and 1'->2' the degree of association of (1 and 1') in tree #1 is equivalent to the degree of association of (2 and 2') with respect to tree #2
bool	calcAssocMatrix (const MatrixTemplate< double > &mDist1, const MatrixTemplate< double > &mDist2, double dSigma, double dScale)

bool	calcAssocMatrix (const CDoubleArray &AClass1, const CDoubleArray &AClass2, double dSigma, double dScale)
	calculate association graph by concatenation of classificator arrays of the to graphs

bool	calcMaxClique (double dAssocLevel)
	brute force calculation of maximal clique of the association graph

bool	calcAutoMaxClique (double *pdAssocLevel, double dStep=0.1)
	simple attempt to calculate the maximal clique with an automatic estimation of the 'optimal' AssociationLevel

bool	expandMap (int nIdx)
	expand given isomorphism

bool	expandMap (int nIdx, double dAssocLevel)
	expand given isomorphism

access to results and internal objects
std::string	printMapInformation ()
	print information of map to string

std::list< PointMap > *	getPointMap ()
	supply pointer to list defining the max Clique

std::list< IsomorphismMap > *	getIsoMap ()
	supply pointer to list of isomorphisms

Detailed Description

AssocGraph class provides a matrix representation of the association graph of two Graph objects.

Different methods to define the degree of association are implemented. In general a fuzzy like accumulation of first and second order point attributes is used to measure the affinity of points in both Graph. Based on the association graph the maximal clique of point maps and the point isomorphisms induced by this maximal clique are calculated. class AssocGraph

Definition at line 139 of file AssocGraph.h.

Member Typedef Documentation

◆ constIsoIterator

typedef std::list<IsomorphismMap>::const_iterator ml::AssocGraph::constIsoIterator

Definition at line 157 of file AssocGraph.h.

◆ constMapIterator

typedef std::list<PointMap>::const_iterator ml::AssocGraph::constMapIterator

Definition at line 155 of file AssocGraph.h.

◆ IsoIterator

typedef std::list<IsomorphismMap>::iterator ml::AssocGraph::IsoIterator

Definition at line 156 of file AssocGraph.h.

◆ MapIterator

typedef std::list<PointMap>::iterator ml::AssocGraph::MapIterator

Definition at line 154 of file AssocGraph.h.

Member Function Documentation

◆ calcAssocMatrix() [1/2]

bool ml::AssocGraph::calcAssocMatrix	(	const CDoubleArray &	AClass1,
		const CDoubleArray &	AClass2,
		double	dSigma,
		double	dScale )

calculate association graph by concatenation of classificator arrays of the to graphs

Interpretation: Indexes of _mTAG denote a point map 1->2. Hence elements of _mTAG characterize, weather to point maps fit together, i.e. if for 1->2 and 1'->2' the degree of association of (1 and 1') given by the classificators of tree#1 is equivalent to the degree of association of (2 and 2') with respect to the classificators of tree#2.

The supplied values are interpreted as proper fuzzy classificator. The are just joint using supplied relative weights.

Parameters

AClass1	node attributes according to Graph 1
AClass2	node attributes according to Graph 2
dSigma	parameter to valuate relative differences in length
dScale	relative length scale of Graph 1 to Graph 2

◆ calcAssocMatrix() [2/2]

bool ml::AssocGraph::calcAssocMatrix	(	const MatrixTemplate< double > &	mDist1,
		const MatrixTemplate< double > &	mDist2,
		double	dSigma,
		double	dScale )

Parameters

mDist1	distance matrix of Graph 1
mDist2	distance matrix of Graph 2
dSigma	parameter to valuate relative differences in length
dScale	relative length scale of Graph 1 to Graph 2

◆ calcAutoMaxClique()

bool ml::AssocGraph::calcAutoMaxClique	(	double *	pdAssocLevel,
		double	dStep = 0.1 )

simple attempt to calculate the maximal clique with an automatic estimation of the 'optimal' AssociationLevel

◆ calcMaxClique()

bool ml::AssocGraph::calcMaxClique ( double dAssocLevel )

brute force calculation of maximal clique of the association graph

◆ expandMap() [1/2]

bool ml::AssocGraph::expandMap ( int nIdx )

expand given isomorphism

◆ expandMap() [2/2]

bool ml::AssocGraph::expandMap	(	int	nIdx,
		double	dAssocLevel )

expand given isomorphism

◆ getIsoMap()

std::list< IsomorphismMap > * ml::AssocGraph::getIsoMap ( )

inline

supply pointer to list of isomorphisms

Definition at line 212 of file AssocGraph.h.

◆ getPointMap()

std::list< PointMap > * ml::AssocGraph::getPointMap ( )

inline

supply pointer to list defining the max Clique

Definition at line 211 of file AssocGraph.h.

◆ printMapInformation()

std::string ml::AssocGraph::printMapInformation ( )

print information of map to string

The documentation for this class was generated from the following file:

MeVisLab/Standard/Sources/Shared/MLVesselGraph/AssocGraph.h

Public Types

Public Member Functions