59 static float minCut(
DynMatrix<float> &adjacencyMatrix, std::vector<int> &subset1, std::vector<int> &subset2);
66 static std::vector<std::vector<int> > thresholdCut(
DynMatrix<float> &adjacencyMatrix,
float threshold);
73 static std::vector<std::vector<int> > thresholdCut(
DynMatrix<bool> &adjacencyMatrix,
float threshold);
79 static std::vector<CutNode> hierarchicalCut(
DynMatrix<float> &adjacencyMatrix);
85 static std::vector<CutNode> hierarchicalCut(
DynMatrix<bool> &adjacencyMatrix);
97 static std::vector<std::vector<int> > findUnconnectedSubgraphs(
DynMatrix<float> &adjacencyMatrix);
120 static std::vector<float> capforest(std::vector<utils::Point> &edgeList, std::vector<float> &edgeCosts,
int subsetsSize);
122 static float initialLambda(
DynMatrix<float> &adjacencyMatrix,
int &lambda_id);
124 static void createEdgeList(
DynMatrix<float> &adjacencyMatrix, std::vector<utils::Point> &edgeList, std::vector<float> &edgeCosts);
126 static std::vector<std::vector<int> > createInitialNodes(
DynMatrix<float> &adjacencyMatrix);
128 static float merge(std::vector<utils::Point> &edgeList, std::vector<float> &edgeCosts, std::vector<float> &q,
129 std::vector<std::vector<int> > &subsets,
float lambda_score,
int j,
int &lambda_id);
undocument this line if you encounter any issues!
Definition: Any.h:37
#define ICLMath_API
Definition: CompatMacros.h:173
Definition: GraphCutter.h:46
int parent
Definition: GraphCutter.h:48
float cost
Definition: GraphCutter.h:50
std::vector< int > subset
Definition: GraphCutter.h:47
std::vector< int > children
Definition: GraphCutter.h:49
class for graph cut algorithms on undirected graphs (a graph is represented by an adjacency matrix).
Definition: GraphCutter.h:42