z-logo
open-access-imgOpen Access
Some links between min cuts, optimal spanning forests and watersheds
Author(s) -
Cédric Allène,
Jean-Yves Audibert,
Michel Couprie,
Jean Cousty,
Renaud Keriven
Publication year - 2007
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - watershed , shortest path problem , spanning tree , path (computing) , computer science , minimum spanning tree , image segmentation , segmentation , basis (linear algebra) , mathematical optimization , mathematics , artificial intelligence , algorithm , computer vision , combinatorics , theoretical computer science , geometry , computer network , graph

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom