Image graph class. More...

Public Member Functions
	ImageGraph (int size)
	Brief construct ananymous image graph without filenames. More...

	ImageGraph (const std::vector< std::string > &image_filenames, const std::vector< std::string > &sift_filenames)
	Brief construct a image graph with filenames. More...

void	addNode ()

void	addNode (const vot::ImageNode &n)

void	addEdge (int src, int dst, double score=0.0)
	Brief add one-way edge. More...

void	addEdge (const vot::LinkEdge &n)

void	addEdgeu (int src, int dst, double score=0.0)
	Brief add undirected edge. More...

void	addEdgeu (const vot::LinkEdge &n)

int	numConnectedComponents (int threshold=0)
	Brief compute the number of connected components in a undirected graph (edge (i,j) and edge (j,i) are both in the graph) More...

bool	kargerCut (std::vector< std::vector< int > > &global_min_cut)

bool	consolidate (int k)
	Brief Remove the singleton node from the graph. More...

bool	queryExpansion (Edge2dArray &expansion_lists, int level, int inlier_threshold=150)
	Brief Query expansion and its sub-routine. More...

bool	queryExpansionSub (int src, int tgt, double score, Edge2dArray &expansion_lists, bool **visit_mat, int level, int inlier_threshold)

bool	graphvizu (std::string gv_filename, std::string graph_name)
	Brief output the undirected visualization code for graphviz. More...

void	showInfo ()
	Brief output the information. More...

int	adjListSize (int idx)

int	nodeNum ()

Detailed Description

Image graph class.

Constructor & Destructor Documentation

vot::ImageGraph::ImageGraph ( int size )

Brief construct ananymous image graph without filenames.

Brief construct a image graph with filenames.

Brief add one-way edge.

void vot::ImageGraph::addEdge ( const vot::LinkEdge & n )

void vot::ImageGraph::addEdgeu	(	int	src,
		int	dst,
		double	score = `0.0`
	)

Brief add undirected edge.

void vot::ImageGraph::addEdgeu ( const vot::LinkEdge & n )

void vot::ImageGraph::addNode ( )

void vot::ImageGraph::addNode ( const vot::ImageNode & n )

int vot::ImageGraph::adjListSize ( int idx )

bool vot::ImageGraph::consolidate ( int k )

Brief Remove the singleton node from the graph.

bool vot::ImageGraph::graphvizu	(	std::string	gv_filename,
		std::string	graph_name
	)

Brief output the undirected visualization code for graphviz.

bool vot::ImageGraph::kargerCut ( std::vector< std::vector< int > > & global_min_cut )

int vot::ImageGraph::nodeNum ( )

int vot::ImageGraph::numConnectedComponents ( int threshold = 0 )

Brief compute the number of connected components in a undirected graph (edge (i,j) and edge (j,i) are both in the graph)

bool vot::ImageGraph::queryExpansion	(	Edge2dArray &	expansion_lists,
		int	level,
		int	inlier_threshold = `150`
	)

Brief Query expansion and its sub-routine.

bool vot::ImageGraph::queryExpansionSub	(	int	src,
		int	tgt,
		double	score,
		Edge2dArray &	expansion_lists,
		bool **	visit_mat,
		int	level,
		int	inlier_threshold
	)

void vot::ImageGraph::showInfo ( )

Brief output the information.

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