Bial::HierarchicalGraph< GRAPH_ADJACENCY > Class Template Reference

#include <HierarchicalGraph.hpp>

Inheritance diagram for Bial::HierarchicalGraph< GRAPH_ADJACENCY >:

Collaboration diagram for Bial::HierarchicalGraph< GRAPH_ADJACENCY >:

Public Member Functions
template<class D >
void	Initialize (const Feature< D > &feature, float scl_min, float scl_max)
	Initializes the object. More...
Vector< int > &	MergeLabel ()
	Returns a reference to merge_label. More...
const Vector< int > &	MergeLabel () const
	Returns a reference to merge_label. More...
Vector< int > &	SplitLabel ()
	Returns a reference to split_label. More...
const Vector< int > &	SplitLabel () const
	Returns a reference to split_label. More...
Vector< double > &	MergeCut ()
	Returns a reference to merge_cut. More...
const Vector< double > &	MergeCut () const
	Returns a reference to merge_cut. More...
Vector< double > &	SplitCut ()
	Returns a reference to split_cut. More...
const Vector< double > &	SplitCut () const
	Returns a reference to split_cut. More...
size_t	Clustering (size_t scl)
	Computes cluster labels for spectral domain. More...
size_t	MergeClusters (size_t scl)
	Devides clusters if a better cut is find for each of them. More...
size_t	SplitClusters (size_t scl)
	Devides clusters if a better cut is find for each of them. More...
Public Member Functions inherited from Bial::Graph< GRAPH_ADJACENCY >
size_t	MaxSamples () const
	Returns the maximum number of samples of the derived class. More...
template<class D >
void	Initialize (const Feature< D > &feature, float scl_min, float scl_max)
	Initializes the object. More...
size_t	Scales () const
	Returns the number of different scales. More...
size_t	Samples () const
	Returns the number of nodes. More...
Vector< int > &	Label ()
	Returns a reference to label. More...
const Vector< int > &	Label () const
	Returns a reference to label. More...
double	PDF (size_t scl)
	Computes PDF for spectral domain. More...
size_t	Clustering (size_t scl)
	Computes cluster labels for spectral domain. More...
double	NormalizedCut (size_t spl) const
	Computes the normalized cut of the graph labeled with chosen scale. More...
Vector< double >	SampleNormalizedCut (const Vector< int > &label, size_t scl) const
	Computes the normalized cut of each example of the graph labeled with given scale. More...
void	SetCut (size_t scl)
	Computes the normalized cut of each example of the graph labeled with chosen scale and assigns to the initial cut. More...
template<class D >
void	PropagateLabel (Feature< D > &feature, size_t scl) const
	Propagates labels from subsample to samples. Just an interface to call multi-thread, GPU based or other more specialized methods. More...
template<class D >
void	PropagateLabelThread (Feature< D > &feature, size_t scl, size_t thread, size_t total_threads) const
	Propagates labels from subsample to samples. More...
template<class D >
void	GnuPlot2DScatter (const std::string &basename, const Feature< D > &feat, size_t scale, size_t x=0, size_t y=1)
	Plots 2D scatter from x and y features from given graph. Colors are labels and size are densities. More...

Protected Attributes
Vector< int >	merge_label
Vector< int >	split_label
Vector< double >	merge_cut
Vector< double >	split_cut
Protected Attributes inherited from Bial::Graph< GRAPH_ADJACENCY >
Sample	sample
Vector< double >	density
Vector< double >	cut
Vector< size_t >	ordered
Vector< int >	label
GRAPH_ADJACENCY	adjacency

Detailed Description

template<class GRAPH_ADJACENCY>
class Bial::HierarchicalGraph< GRAPH_ADJACENCY >

Definition at line 26 of file HierarchicalGraph.hpp.

Member Function Documentation

template<class GRAPH_ADJACENCY >

size_t Bial::HierarchicalGraph< GRAPH_ADJACENCY >::Clustering

(

size_t

scl

)

Computes cluster labels for spectral domain.

Date

2014/Nov/14

Parameters

scl	Number of scale element.

Returns

The number of clusters.

Warning

none.

template<class GRAPH_ADJACENCY >

template<class D >

void Bial::HierarchicalGraph< GRAPH_ADJACENCY >::Initialize	(	const Feature< D > &	feature,
		float	scl_min,
		float	scl_max
	)

Initializes the object.

Date

2014/Nov/25

Parameters

feature	feature vector containing only the subsamples.
scl_min,scl_max	minimum and maximum scale fractions utilized for clustering. (0.0 - 1.0)

Returns

none.

Warning

none.

template<class GRAPH_ADJACENCY >

size_t Bial::HierarchicalGraph< GRAPH_ADJACENCY >::MergeClusters

(

size_t

scl

)

Devides clusters if a better cut is find for each of them.

Date

2014/Nov/20

Parameters

scl	Number of scale element.

Returns

The number of clusters.

Warning

none.

template<class GRAPH_ADJACENCY >

Vector< double >& Bial::HierarchicalGraph< GRAPH_ADJACENCY >::MergeCut

(

)

Returns a reference to merge_cut.

Date

2014/Nov/25

Parameters

none.

Returns

A reference to merge_cut.

Warning

none.

template<class GRAPH_ADJACENCY >

const Vector< double >& Bial::HierarchicalGraph< GRAPH_ADJACENCY >::MergeCut

(

)

const

Returns a reference to merge_cut.

Date

2014/Nov/25

Parameters

none.

Returns

A reference to merge_cut.

Warning

none.

template<class GRAPH_ADJACENCY >

Vector< int >& Bial::HierarchicalGraph< GRAPH_ADJACENCY >::MergeLabel

(

)

Returns a reference to merge_label.

Date

2014/Nov/25

Parameters

none.

Returns

A reference to merge_label.

Warning

none.

template<class GRAPH_ADJACENCY >

const Vector< int >& Bial::HierarchicalGraph< GRAPH_ADJACENCY >::MergeLabel

(

)

const

Returns a reference to merge_label.

Date

2014/Nov/25

Parameters

none.

Returns

A reference to merge_label.

Warning

none.

template<class GRAPH_ADJACENCY >

size_t Bial::HierarchicalGraph< GRAPH_ADJACENCY >::SplitClusters

(

size_t

scl

)

Devides clusters if a better cut is find for each of them.

Date

2014/Nov/14

Parameters

scl	Number of scale element.

Returns

The number of clusters.

Warning

none.

template<class GRAPH_ADJACENCY >

Vector< double >& Bial::HierarchicalGraph< GRAPH_ADJACENCY >::SplitCut

(

)

Returns a reference to split_cut.

Date

2014/Nov/14

Parameters

none.

Returns

A reference to split_cut.

Warning

none.

template<class GRAPH_ADJACENCY >

const Vector< double >& Bial::HierarchicalGraph< GRAPH_ADJACENCY >::SplitCut

(

)

const

Returns a reference to split_cut.

Date

2014/Nov/14

Parameters

none.

Returns

A reference to split_cut.

Warning

none.

template<class GRAPH_ADJACENCY >

Vector< int >& Bial::HierarchicalGraph< GRAPH_ADJACENCY >::SplitLabel

(

)

Returns a reference to split_label.

Date

2014/Nov/14

Parameters

none.

Returns

A reference to split_label.

Warning

none.

template<class GRAPH_ADJACENCY >

const Vector< int >& Bial::HierarchicalGraph< GRAPH_ADJACENCY >::SplitLabel

(

)

const

Returns a reference to split_label.

Date

2014/Nov/14

Parameters

none.

Returns

A reference to split_label.

Warning

none.

Member Data Documentation

template<class GRAPH_ADJACENCY >

Vector< double > Bial::HierarchicalGraph< GRAPH_ADJACENCY >::merge_cut

protected

Definition at line 32 of file HierarchicalGraph.hpp.

template<class GRAPH_ADJACENCY >

Vector< int > Bial::HierarchicalGraph< GRAPH_ADJACENCY >::merge_label

protected

Definition at line 30 of file HierarchicalGraph.hpp.

template<class GRAPH_ADJACENCY >

Vector< double > Bial::HierarchicalGraph< GRAPH_ADJACENCY >::split_cut

protected

Definition at line 33 of file HierarchicalGraph.hpp.

template<class GRAPH_ADJACENCY >

Vector< int > Bial::HierarchicalGraph< GRAPH_ADJACENCY >::split_label

protected

Definition at line 31 of file HierarchicalGraph.hpp.

---

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

• bial/inc/HierarchicalGraph.hpp