PowerWatershed : 2D and 3D image segmentation

This software was developed (or is under development) within the higher education and research community. Its stability can vary (see fields below) and its working state is not guaranteed.
Higher Edu - Research dev card
  • Creation or important update: 30/03/10
  • Minor correction: 30/03/10
  • Index card author: Teresa Gomez-Diaz (LIGM)
  • Theme leader: VĂ©ronique Baudin (LAAS)
General software features

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 article [Couprie, Grady, Najman and Talbot, ICCV'09].

Context in which the software is used

We use the PowerWatershed algorithm as a fast, useful algorithm in the optimisation step on problems related to image processing and visualization.

Publications related to software

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