Power Watersheds: A Unifying Graph Based Optimization Framework

Abstract : In this work, we extend a common framework for graph-based image segmentation that includes the graph cuts, random walker, and shortest path optimization algorithms. Viewing an image as a weighted graph, these algorithms can be expressed by means of a common energy function with differing choices of a parameter q acting as an exponent on the differences between neighboring nodes. Introducing a new parameter p that fixes a power for the edge weights allows us to also include the optimal spanning forest algorithm for watershed in this same framework. We then propose a new family of segmentation algorithms that fixes p to produce an optimal spanning forest but varies the power q beyond the usual watershed algorithm, which we term power watershed. In particular when q = 2, the power watershed leads to a multilabel, scale and contrast invariant, unique global optimum obtained in practice in quasi-linear time. Placing the watershed algorithm in this energy minimization framework also opens new possibilities for using unary terms in traditional watershed segmentation and using watershed to optimize more general models of use in applications beyond image segmentation.
Type de document :
Article dans une revue
IEEE Transactions on Pattern Analysis and Machine Intelligence, Institute of Electrical and Electronics Engineers, 2011, 33 (7), pp.1384-1399. <10.1109/TPAMI.2010.200>
Liste complète des métadonnées


https://hal-upec-upem.archives-ouvertes.fr/hal-00622510
Contributeur : Laurent Najman <>
Soumis le : jeudi 6 septembre 2012 - 13:11:10
Dernière modification le : jeudi 6 septembre 2012 - 14:16:33
Document(s) archivé(s) le : vendredi 7 décembre 2012 - 02:35:09

Fichier

couprie2011power.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Camille Couprie, Leo Grady, Laurent Najman, Hugues Talbot. Power Watersheds: A Unifying Graph Based Optimization Framework. IEEE Transactions on Pattern Analysis and Machine Intelligence, Institute of Electrical and Electronics Engineers, 2011, 33 (7), pp.1384-1399. <10.1109/TPAMI.2010.200>. <hal-00622510>

Partager

Métriques

Consultations de
la notice

343

Téléchargements du document

569