Find file History
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
..
Failed to load latest commit information.
CMakeLists.txt
COPYING
README
geodesic.cpp
grady_test.cpp
graph.cpp
graph.h
graph_alg.h
graphseg.cpp
graphseg.h
graphseg_config.cpp
graphseg_config.h
graphseg_shell.cpp
graphseg_shell.h
graphseg_task.h
random_walker.cpp
sorting.cpp
sorting.h
spanning_forest.cpp

README

The Power Watershed Algorithm, C/C++ Code, September 24, 2009

Camille Couprie, Leo Grady, Laurent Najman and Hugues Talbot , "Power
Watersheds: A New Image Segmentation Framework Extending Graph Cuts, Random
Walker and Optimal Spanning Forest", ICCV'09, 2009
	 
Description: This software provides implementation of three algorithms for 2D
and 3D image segmentation. The algorithms implemented are Prim, and Kruskal's
algorithms for Maximum Spanning Forest computation, and the PowerWatershed
algorithm (q=2) described in the above article.

This version of the code was modified by Johannes Jordan in 2010-2012.