Developer Documentation
Centre for Vision, Speech & Signal Processing
USER IN NAMESPACE AMMA TREE ROOT AMMA SEARCH AMMA HOME
 

  PUBLIC
ClusterRAGC::AddNode(int)
ClusterRAGC::AddNode(NodeT)
ClusterRAGC::GetNodes(int,GraphNodeIterC &,int,GraphNodeIterC &,int,GraphNodeIterC &)
ClusterRAGC::Connect(GraphNodeIterC &,GraphNodeIterC &)
ClusterRAGC::AddEdgel(GraphEdgeIterC &,PixelC,CrackCodeT)
ClusterRAGC::ClusterRAGC(IntT)
ClusterRAGC::ConstructGraph(const ImgT &,ImageC)
ClusterRAGC::ConstructGraph(const DListC &,const ImgT &)
ClusterRAGC::MergeNodes(GraphNodeIterC &,GraphNodeIterC &)
ClusterRAGC::Merge(MergeCritT &)
ClusterRAGC::Base(void)
ClusterRAGC::GetNode(int)
ClusterRAGC::DebugPrint(ostream &) const
ClusterRAGC::DebugNodes(void) const
ClusterRAGC<class NodeT,class EdgeT,class ImgT>
 
include "amma/visualdb/ClusterRAG.hh"
User Level:Default
Library:VisualDb
Example:exIndex.cc
Section:default.Author's Name
In Scope:std

Variables:

GraphTC rag;
indIndex of types of intererest.

IntT _dimen;
Dimensionality of vectors in feature image
indIndex of types of intererest.

Methods:
GraphNodeIterC<NodeT,EdgeT> AddNode(int cur_id)
indIndex of types of intererest.

GraphNodeIterC<NodeT,EdgeT> AddNode(NodeT node)
indIndex of types of intererest.

int GetNodes(int cur_id,GraphNodeIterC<NodeT,EdgeT> & cur_nod,int top_id,GraphNodeIterC<NodeT,EdgeT> & top_nod,int left_id,GraphNodeIterC<NodeT,EdgeT> & left_nod)
find the nodes of the current top and left pixels
indIndex of types of intererest.

GraphEdgeIterC<NodeT,EdgeT> Connect(GraphNodeIterC<NodeT,EdgeT> & fst_nod,GraphNodeIterC<NodeT,EdgeT> & sec_nod)
indIndex of types of intererest.

void AddEdgel(GraphEdgeIterC<NodeT,EdgeT> & cur_edg,PixelC pixel,CrackCodeT dir)
indIndex of types of intererest.

ClusterRAGC(IntT dimen)
Default constructor.
indIndex of types of intererest.

void ConstructGraph(const ImgT & in,ImageC<VectorC> FeatureImage)
Build the region adjacency graph
indIndex of types of intererest.

void ConstructGraph(const DListC<NodeT> & nodes,const ImgT & in)
Build the region adjacency graph from existing nodes and adjacency map
indIndex of types of intererest.

void MergeNodes(GraphNodeIterC<NodeT,EdgeT> & fst_nod,GraphNodeIterC<NodeT,EdgeT> & sec_nod)
not implemented yet
indIndex of types of intererest.

DListC<PairC<NodeT>> Merge(MergeCritT & mrg_crit)
Merge some nodes
indIndex of types of intererest.

GraphTC<NodeT,EdgeT> & Base()
indIndex of types of intererest.

GraphNodeIterC<NodeT,EdgeT> GetNode(int id)
Returns a pointer to the node id
indIndex of types of intererest.

void DebugPrint(ostream & os) const
Print the graph
indIndex of types of intererest.

void DebugNodes() const
Print the graph
indIndex of types of intererest.


Programmer:Kieron Messer, Documentation by CxxDoc: Tue Mar 20 10:49:27 2001